[plt-scheme] hash table implementation?

That's correct for mutable hash tables. Immutable hash tables (with
functional updated) are implemented using a red--black tree.

Matthew

At Thu, 20 Nov 2008 16:19:49 +0000, "Noel Welsh" wrote:
> I just skimmed the source code and it seems like a standard hash table
> implemented using an array.  No evidence of fancy stuff in the code I
> looked at.
> 
> N.
> 
> On Thu, Nov 20, 2008 at 4:03 PM, Stephen De Gabrielle
> <spdegabrielle at gmail.com> wrote:
> > Hi,
> >
> > I'm looking a b-trees at the moment and wondered how hash tables are
> > implemented in PLT scheme?
> >
> > Cheers,
> >
> > Stephen
> _________________________________________________
>   For list-related administrative tasks:
>   http://list.cs.brown.edu/mailman/listinfo/plt-scheme