[plt-scheme] Red black trees in PLT Scheme

From: Andrew Reilly (andrew-scheme at areilly.bpc-users.org)
Date: Fri Jul 24 09:42:29 EDT 2009

On Fri, Jul 24, 2009 at 03:44:44AM -0400, Carl Eastlund wrote:
> PLT stores eq hash codes in extra bits in the GC metadata (how many
> depends on your platform).  The codes are stable -- they don't change
> as GC happens, though they are not guaranteed unique.

That's good to know, thanks!

> PLT's immutable hash tables are, in fact, implemented as red-black
> trees over hash codes.

Coolness.  Thought they might be.  It was fun to build my own



Posted on the users mailing list.