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,ac39a12d5faf5b14 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-04-22 09:16:27 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed1.cidera.com!Cidera!cyclone.columbus.rr.com!cyclone3.kc.rr.com!news3.kc.rr.com!twister.socal.rr.com.POSTED!not-for-mail Message-ID: <3CC43768.CDE4DD06@san.rr.com> From: Darren New X-Mailer: Mozilla 4.77 [en] (Windows NT 5.0; U) X-Accept-Language: en MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Grace and Maps (was Re: Development process in the Ada community) 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> <4519e058.0204220534.2eb33730@posting.google.com> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Date: Mon, 22 Apr 2002 16:16:02 GMT NNTP-Posting-Host: 66.75.151.160 X-Complaints-To: abuse@rr.com X-Trace: twister.socal.rr.com 1019492162 66.75.151.160 (Mon, 22 Apr 2002 09:16:02 PDT) NNTP-Posting-Date: Mon, 22 Apr 2002 09:16:02 PDT Organization: RoadRunner - West Xref: archiver1.google.com comp.lang.ada:22919 Date: 2002-04-22T16:16:02+00:00 List-Id: Ted Dennison wrote: > Hmmm. This seems to be going back to the "naming" issue: Do we want > *.Maps.Bounded or *.Hashes? A hash and a map are two different levels. A hash is simply a particular way of implementing a map. (Assuming you mean "hashtable", but then a "hash" by itself makes no sense as a datastructure.) I.e., what keeps a bounded map from being implemented as a tree instead of a hash? Indeed, for many types, I'd think a tree would be a better implementation, as a hashtable requires you to be able to manipulate the key items in a non-opaque manner, while a tree requires only a ordering operator. -- Darren New San Diego, CA, USA (PST). Cryptokeys on demand. The 90/10 rule of toothpaste: the last 10% of the tube lasts as long as the first 90%.