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-20 18:33:54 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!lnsnews.lns.cornell.edu!paradoxa.ogoense.net!sn-xit-04!sn-xit-02!supernews.com!cox.net!news2.east.cox.net.POSTED!53ab2750!not-for-mail Message-ID: <3CC21747.5000501@telepath.com> From: Ted Dennison User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.0; en-US; rv:0.9.7) Gecko/20011221 X-Accept-Language: en-us 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> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Date: Sun, 21 Apr 2002 01:33:52 GMT NNTP-Posting-Host: 68.12.51.201 X-Complaints-To: abuse@cox.net X-Trace: news2.east.cox.net 1019352832 68.12.51.201 (Sat, 20 Apr 2002 21:33:52 EDT) NNTP-Posting-Date: Sat, 20 Apr 2002 21:33:52 EDT Organization: Cox Communications Xref: archiver1.google.com comp.lang.ada:22846 Date: 2002-04-21T01:33:52+00:00 List-Id: Ted Dennison wrote: > Marin David Condic wrote: >> I don't think you need to have the full-blown project setup done in >> order to >> discuss an interface to Maps. What would you suggest as a means of >> getting >> that ball rolling? Would you like someone to take the Lists spec and >> turn it >> into a strawman for Maps? (I hear you're a little preoccupied at the >> moment... :-) > > > Yeah, that would be a good start. Right now in addtion to this I'm On second thought, we really ought to get some kind of consensus on requirements before rushing headlong into design. If nothing else, it will save a lot of arguments. Requirements I think ought to be included (using the usual should/shall language): Maps shall provide for key lookup in no worse than O(logn) average time and O(n) worst case (where n is the # of elements in the map). Maps shall provide for creation of a sorted list or array, or traversal in sorted order, in no worse than O(n) time. (In other words, the map is kept sorted as elements are added). Maps should provide an interface consistent with Lists, as far as is practicable. Comments?