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=0.6 required=5.0 tests=BAYES_00,TO_NO_BRKTS_FROM_MSSP
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,7ee10ec601726fbf
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2001-11-01 07:23:04 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!cyclone.bc.net!sjcppf01.usenetserver.com!usenetserver.com!newsfeeder.randori.com!out.nntp.be!propagator-SanJose!in.nntp.be!newsranger.com!www.newsranger.com!not-for-mail
Newsgroups: comp.lang.ada
From: Ted Dennison<dennison@telepath.com>
References: <3BC5D730.DA950CC7@boeing.com> <9q4pa7$1ad$1@nh.pace.co.uk>
 <slrn9sdahp.k4.lutz@taranis.iks-jena.de> <3BC6ACC8.23EF21BC@free.fr>
 <QQCx7.26073$ev2.34583@www.newsranger.com> <3BC71F54.1FFE78FA@boeing.com>
 <1KGx7.26476$ev2.35117@www.newsranger.com> <3BC7AD82.2A0CCCD4@acm.org>
 <usncjtzix.fsf@gsfc.nasa.gov> <9qhiqr$af0$1@nh.pace.co.uk>
 <K1Zy7.12219$hT5.3979715684@newssvr30.news.prodigy.com>
 <1nDC7.180$6S7.92255364@newssvr11.news.prodigy.com>
 <9rjsak$bp3$1@nh.pace.co.uk> <jbfstt097fvrrqmrl0kuscmbl57neg8imf@4ax.com>
 <9rmhb9$o1b$1@nh.pace.co.uk> <3BDEF0FE.B55FED9E@san.rr.com>
 <9rmuqi$es$1@nh.pace.co.uk> <3BDF1F13.4B99361C@san.rr.com>
 <9rnbtv$5i4$1@nh.pace.co.uk> <3BDF8C59.5020108@mail.com>
 <tu014vtnua0j60@corp.supernews.com> <tu07apsr9hcp78@corp.supernews.com>
 <9rp9bk$6m9$1@nh.pace.co.uk> <tu0i54ndv2q94d@corp.supernews.com>
Subject: Re: why not
Message-ID: <PMdE7.8703$xS6.11455@www.newsranger.com>
X-Abuse-Info: When contacting newsranger.com regarding abuse please
X-Abuse-Info: forward the entire news article including headers or
X-Abuse-Info: else we will not be able to process your request
X-Complaints-To: abuse@newsranger.com
NNTP-Posting-Date: Thu, 01 Nov 2001 10:22:23 EST
Organization: http://www.newsranger.com
Date: Thu, 01 Nov 2001 15:22:23 GMT
Xref: archiver1.google.com comp.lang.ada:15539
Date: 2001-11-01T15:22:23+00:00
List-Id: <comp.lang.ada>

In article <tu0i54ndv2q94d@corp.supernews.com>, Matthew Heaney says...
>"Marin David Condic" <dont.bother.mcondic.auntie.spam@[acm.org> wrote in
>message news:9rp9bk$6m9$1@nh.pace.co.uk...
>> Perhaps you would agree with my proposal that a first cut at a standard
>> component library could start with some basic form of Lists and Maps?
>The container itself doesn't do sorting.  (I assume there would be a
>separate algorithms package, that operates on iterators.  That influences
>what iterator types look like.)

How can you make sorting separate, when you don't know (and don't have access
to) the internal structure of the collection? A Map might be implemented as a
linked list, or as some sort of binary tree. At the least, your collection will
need some kind of "swap" or "insert_in_the_middle" operation to support this.
Well...I supose if you use the right algorithm and representations, you could
progressively build a new sorted collection from an old unsorted one, then
replace the old one with the new one.

---
T.E.D.    homepage   - http://www.telepath.com/dennison/Ted/TED.html

No trees were killed in the sending of this message. 
However a large number of electrons were terribly inconvenienced.