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 19:38:38 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!nntp-relay.ihug.net!ihug.co.nz!cox.net!news2.east.cox.net.POSTED!53ab2750!not-for-mail Message-ID: <3CC4C980.1090301@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> <3CC21747.5000501@telepath.com> <4519e058.0204220534.2eb33730@posting.go <3CC48F34.5A474E0F@boeing.com> <3CC49C50.485AE213@san.rr.com> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Date: Tue, 23 Apr 2002 02:38:37 GMT NNTP-Posting-Host: 68.12.51.201 X-Complaints-To: abuse@cox.net X-Trace: news2.east.cox.net 1019529517 68.12.51.201 (Mon, 22 Apr 2002 22:38:37 EDT) NNTP-Posting-Date: Mon, 22 Apr 2002 22:38:37 EDT Organization: Cox Communications Xref: archiver1.google.com comp.lang.ada:22953 Date: 2002-04-23T02:38:37+00:00 List-Id: Darren New wrote: > Jeffrey Carter wrote: > >>The trouble with a tree is that, if it is not balanced, operations can >>be O(N) in the worst case. If the tree is balanced, searching is O(log >>N), but insertion and deletion are slow, because the tree must be >>rebalanced after every modification. >> > > Well, that's why you use something a little more sophisticated, like a > red-black tree, or a B-tree if your memory I/O works in blocks (like a > disk). A red-black tree still requires balancing when nodes are added, doesn't it? Balancing on a bounded structure is likely going to involve moving data contents, which is undesirable. That's why I thought it might make sense to just include a Map, and another map-like structure that is naturally bounded. Hash tables came to mind.