From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,94b44ecb42c031b9
X-Google-Attributes: gid103376,public
From: Matthias Teege <matthias@mteege.de>
Subject: Re: Searching for an object
Date: 2000/08/21
Message-ID: <87vgwu6a4r.fsf@moon.mteege.de>#1/1
X-Deja-AN: 660720319
Sender: matthias@moon.mteege.de
References: <87og2q9yyp.fsf@moon.mteege.de>
 <39A10328.6DD7B9F7@Physik.Uni-Magdeburg.de>
Organization: DVZ Datenverarbeitungszentrum Mecklenburg-Vorpommern GmbH
Content-Type: text/plain; charset=iso-8859-1
User-Agent: Gnus/5.0803 (Gnus v5.8.3) Emacs/20.5
Mime-Version: 1.0
Newsgroups: comp.lang.ada
Date: 2000-08-21T00:00:00+00:00
List-Id: <comp.lang.ada>

Gerald Kasner <Gerald.Kasner@Physik.Uni-Magdeburg.de> writes:

[...]

> My respose is no direct answer to your question, but I would 
> be more careful about the find procedure in general. If you have 
> a long table of customers you'll have to wait very long times. 
> Consult a textbook on data structures how to do this much faster.

Many thanks for your answer. The code from my example is
only for my Ada learning purposes and not for a real life
application. I'm aware of the problems. ;-)

> (In your case a tree may be very useful)

Maybe, I'll refresh my knowledge of data structures.

> A second remark: Ada is designed to reuse code. Why not using 
> already existing well tested libraries ? Abstract data types 
> seem to be appropriate. 

Yes of course. But I reinvent the wheel only to increase
my Ada experiences. So I'm ever very interested on the Ada "way".

Nevertheless many thanks for your answer. I thought my
newsreader was broken. :-)

Bis dann
Matthias

-- 
Matthias Teege -- matthias@mteege.de -- http://emugs.de
make world not war
PGP-Key auf Anfrage