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,a644fa9cd1a3869a X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-11-13 14:16:54 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!nntp-relay.ihug.net!ihug.co.nz!out.nntp.be!propagator-SanJose!in.nntp.be!newsranger.com!www.newsranger.com!not-for-mail Newsgroups: comp.lang.ada From: Ted Dennison References: <9sn4qm$13g29j$2@ID-25716.news.dfncis.de> <9sok8i$142am0$2@ID-25716.news.dfncis.de> <3BF004F4.F74AE461@boeing.com> <9sp5up$g5o$1@nh.pace.co.uk> <3BF0827A.DCF2213C@acm.org> <9sra40$b8p$1@nh.pace.co.uk> <5DaI7.23016$xS6.35866@www.newsranger.com> <3BF14752.B3F3FBC@boeing.com> <9srv70$k0k$1@nh.pace.co.uk> <9egI7.23469$xS6.37348@www.newsranger.com> <9ss3uv$m09$1@nh.pace.co.uk> Subject: Map container (was: List container: Insert and Delete) Message-ID: 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: Tue, 13 Nov 2001 17:16:50 EST Organization: http://www.newsranger.com Date: Tue, 13 Nov 2001 22:16:50 GMT Xref: archiver1.google.com comp.lang.ada:16467 Date: 2001-11-13T22:16:50+00:00 List-Id: In article <9ss3uv$m09$1@nh.pace.co.uk>, Marin David Condic says... > >If we both see a Map as being some flavor of an ISAM file in memory, then >I'm happy with whatever kind of underlying structure you want to implement >it out of. I'm presuming you aren't thinking of providing operations like >"Step to the left branch from the current node..." as visible to the user? >If we're just talking about storing and looking up based on an index element >and scanning over the Map in sorted order, I could see it being some kind of >tree, or some kind of static table, or and actual ISAM disk file, or.... To speed lookup on the map keys, it makes sense to me to use a binary search tree. That also implies that the sorted ordering (forward or back) would always be available, and would probably be gone through anyway when iterating. For this reason, I think putting a lot of special sorting capability into the List structure would be overkill. If you need it kept sorted on some key, just use a map instead. --- 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.