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-23 00:37:41 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!bloom-beacon.mit.edu!howland.erols.net!news.net.uni-c.dk!sunsite.dk!newsfeed1.uni2.dk!dax.net!juliett.dax.net!not-for-mail 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 <3CC4E9DA.E02BE0DA@san.rr.com> From: Ole-Hjalmar Kristensen Message-ID: <7vvgaikgrf.fsf@vlinux.voxelvision.no> User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.1 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Tue, 23 Apr 2002 07:37:09 GMT NNTP-Posting-Host: 193.216.12.150 X-Complaints-To: abuse@tele2.no X-Trace: juliett.dax.net 1019547429 193.216.12.150 (Tue, 23 Apr 2002 09:37:09 MET DST) NNTP-Posting-Date: Tue, 23 Apr 2002 09:37:09 MET DST Organization: Tele2 Norway AS Public Access Xref: archiver1.google.com comp.lang.ada:22976 Date: 2002-04-23T07:37:09+00:00 List-Id: Simon Wright writes: > Darren New writes: > > > I'm not sure why a hashtable wouldn't have a worst-case time of O(N) > > (if all the elements hash to the same value) or how you'd guarantee > > any particular limit on execution time of inserting a value (for > > example, in the same case). In contrast, a red-black tree is *never* > > going to see O(N) time in any operation. > > I would have expected a hash table to have O(N) anyway, at least for > searching; it's just that the multiplier is reduced by the number of > hash buckets. > > This is certainly the case for the BCs, now you all come to mention > it! Insertion is constant time, though. > > Are red-black trees much better than AVL trees (which is what you get > in the BCs)? You size your hash link table so that the order is what you want. I usually aim for O(1).