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-24 12:37:34 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!bloom-beacon.mit.edu!nycmny1-snh1.gtei.net!news.gtei.net!newsfeed.mathworks.com!btnet-peer0!btnet-feed5!btnet!easynet-melon!easynet.net!uio.no!193.216.69.35.MISMATCH!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>
 <a9n0tk$6fs$1@nh.pace.co.uk>
 <4519e058.0204190529.559a47ae@posting.google.com>
 <a9p98h$8hn$1@nh.pace.co.uk> <3CC1C6B3.6060306@telepath.com>
 <3CC21747.5000501@telepath.com> <3CC59ED2.1000803@home.com>
 <uadrunsuq.fsf@gsfc.nasa.gov> <3CC5B286.6FE61551@san.rr.com>
 <uznzumd1p.fsf@gsfc.nasa.gov> <3CC5B9EE.32F3060@san.rr.com>
 <uhem1m47l.fsf@gsfc.nasa.gov> <3CC6EABC.5E766F0D@san.rr.com>
From: Ole-Hjalmar Kristensen <oleh@vlinux.voxelvision.no>
Message-ID: <7vy9fcvqgb.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: Wed, 24 Apr 2002 19:36:53 GMT
NNTP-Posting-Host: 193.216.12.150
X-Complaints-To: abuse@tele2.no
X-Trace: juliett.dax.net 1019677013 193.216.12.150 (Wed,
 24 Apr 2002 21:36:53 MET DST)
NNTP-Posting-Date: Wed, 24 Apr 2002 21:36:53 MET DST
Organization: Tele2 Norway AS Public Access
Xref: archiver1.google.com comp.lang.ada:23077
Date: 2002-04-24T19:36:53+00:00
List-Id: <comp.lang.ada>

Darren New <dnew@san.rr.com> writes:

> Stephen Leake wrote:
> > 
> > Darren New <dnew@san.rr.com> writes:
> > 

<snip>

> 
> So yes, my guess is that hashes are O(N) with a really, really small
> multiplier, small enough to make O(lg N) operations not worthwhile.
>  
> > If I use a red-black tree, I _know_ it is O(log n).
> 
> O(N)/1000 < O(log N) for sufficiently small N. I think that's the trick.
> 

Yes. For time-critical operations I routinely size my hash link table
to be twice as big as the expected max number of entries...

> -- 
> 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%.