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.9 required=5.0 tests=BAYES_00 autolearn=ham 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 12:11:54 PST Path: archiver1.google.com!news1.google.com!sn-xit-02!sn-post-01!supernews.com!corp.supernews.com!not-for-mail From: "Matthew Heaney" Newsgroups: comp.lang.ada Subject: Re: why not Date: Thu, 1 Nov 2001 15:15:08 -0500 Organization: Posted via Supernews, http://www.supernews.com Message-ID: References: <3BC5D730.DA950CC7@boeing.com> <9q4pa7$1ad$1@nh.pace.co.uk> <3BC6ACC8.23EF21BC@free.fr> <3BC71F54.1FFE78FA@boeing.com> <1KGx7.26476$ev2.35117@www.newsranger.com> <3BC7AD82.2A0CCCD4@acm.org> <9qhiqr$af0$1@nh.pace.co.uk> <1nDC7.180$6S7.92255364@newssvr11.news.prodigy.com> <9rjsak$bp3$1@nh.pace.co.uk> <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> <3BE03E54.57E0E6C8@san.rr.com> <3BE0F8AE.3B7E5C70@home.com> <9rroi6$9rs$1@nh.pace.co.uk> <9rrvvh$d16$1@nh.pace.co.uk> <3BE1A30D.23A6068A@san.rr.com> X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 5.50.4807.1700 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4807.1700 X-Complaints-To: newsabuse@supernews.com Xref: archiver1.google.com comp.lang.ada:15578 Date: 2001-11-01T15:15:08-05:00 List-Id: "Darren New" wrote in message news:3BE1A30D.23A6068A@san.rr.com... > Marin David Condic wrote: > > (((Single List/Double List) * (Sorted/Unsorted)) + Map) * > > (Bounded/Unbounded) * (Task Safe/Task Unsafe) > > Actually, a map wherein one can iterate over the map in the sort-order > of the keys is also very helpful. I.e., an "ISAM" file type semantics, > where you have random access by key, plus a "here's a key, what's the > next one" kind of operation. I wrote an Indexed_IO package and another Index_Sequential_IO package. Both are available on the adapower web site. > I also think that a linked list with an "insert into the right place" > and a "sort this whole list" would probably suffice to satisfy both > sorted and unsorted lists. I.e., you maintain a sorted list by keeping > it sorted as you change it, rather than by having a different kind of > list. More or less, yes.