Guile Mailing List Archive

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: avl-trees vs. hashes

To: Per Bothner <bothner@cygnus.com>
Subject: Re: avl-trees vs. hashes
From: Jay Glascoe <jglascoe@jay.giss.nasa.gov>
Date: Mon, 26 Oct 1998 23:26:24 -0500 (EST)
cc: "Harvey J. Stein" <hjstein@bfr.co.il>, guile@cygnus.com
Content-Type: TEXT/PLAIN; charset=US-ASCII
In-Reply-To: <199810261643.IAA22024@cygnus.com>
Message-ID: <Pine.A32.3.96.981026232413.25396A-100000@jay.giss.nasa.gov>
Sender: owner-guile@cygnus.com

On Mon, 26 Oct 1998, Per Bothner wrote:

> As an aside, since it seems many people are unaware of this
> implementation option, let me also point out that you can
> implement hashtables so each bucket always has a single
> entry.

yes, Python's dictionaries are implemented in this way.  The basic lookup
procedure cleverly hops around the array searching for the key.

References:
- Re: avl-trees vs. hashes
  - From: Per Bothner <bothner@cygnus.com>

Prev by Date: Re: Scheme is too complicated
Next by Date: Re: Motif Port
Prev by thread: Re: avl-trees vs. hashes
Next by thread: Re: avl-trees vs. hashes
Index(es):
- Date
- Thread

Guile Home | Main Index | Thread Index