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.4 required=5.0 tests=AC_FROM_MANY_DOTS,BAYES_00 autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,ac39a12d5faf5b14 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-04-24 19:07:08 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news.tele.dk!small.news.tele.dk!212.74.64.35!colt.net!diablo.netcom.net.uk!netcom.net.uk!diablo.theplanet.net!diablo.theplanet.net!btnet-peer!btnet-peer0!btnet!psiuk-p2!psiuk-p3!uknet!psiuk-n!news.pace.co.uk!nh.pace.co.uk!not-for-mail From: "Marin David Condic" Newsgroups: comp.lang.ada Subject: Re: Grace and Maps (was Re: Development process in the Ada community) Date: Wed, 24 Apr 2002 11:05:51 -0400 Organization: Posted on a server owned by Pace Micro Technology plc Message-ID: References: <3CB46975.90408@snafu.de> <3CBAFFEE.2080708@snafu.de> <4519e058.0204171036.6f0a7394@posting.google.com> <3CBDD795.4060706@snafu.de> <4519e058.0204180800.44fac012@posting.google.com> <3CBF0341.8020406@mail.com> <4519e058.0204190529.559a47ae@posting.google.com> <3CC1C6B3.6060306@telepath.com> <3CC21747.5000501@telepath.com> <3CC59ED2.1000803@home.com> <3CC6BF2E.51BEC7E1@brighton.ac.uk> NNTP-Posting-Host: dhcp-200-133.miami.pace.co.uk X-Trace: nh.pace.co.uk 1019660752 14883 136.170.200.133 (24 Apr 2002 15:05:52 GMT) X-Complaints-To: newsmaster@news.cam.pace.co.uk NNTP-Posting-Date: 24 Apr 2002 15:05:52 GMT X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 5.50.4522.1200 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4522.1200 Xref: archiver1.google.com comp.lang.ada:23090 Date: 2002-04-24T15:05:52+00:00 List-Id: The important thing being that if you can store elements in a map based on a key for which you have an operation "<" that makes sense, you will in all likelihood want to scan that map such that you retrieve the elements in ascending or descending order. How you get there doesn't matter much to me, except that it should be relatively simple and obvious. I could convince myself that probably 90% of the uses for a map in practical programming will want to retrieve the data this way from time to time and designing a package that precludes (or makes difficult/expensive) this possibility would be A Bad Thing. I'd suggest that it should be designed to cover the most general case and leave a hash-table implementation as an alternate/separate structure. (Grace.Lists, Grace.Maps, Grace.Hash_Tables, ...?) MDC -- Marin David Condic Senior Software Engineer Pace Micro Technology Americas www.pacemicro.com Enabling the digital revolution e-Mail: marin.condic@pacemicro.com "John English" wrote in message news:3CC6BF2E.51BEC7E1@brighton.ac.uk... > > A common approach is to provide a way to get a list of keys, which > you can then sort as you wish before using it to extract elements, > rather than building all the same old sorting functionality into > yet another data structure. >