Re: [racket-users] immutable hash table references?

I believe we used red-black trees. Matt Might has a nice writeup on functional red-black trees: http://matt.might.net/articles/red-black-delete/ Vincent On Wed, 24 May 2017 10:14:11 -0500, Robby Findler wrote: > > But it was a different balanced binary tree before. There are many > things

Re: [racket-users] immutable hash table references?

But it was a different balanced binary tree before. There are many things it could be that would behave similarly. Robby On Wed, May 24, 2017 at 10:05 AM, Stephen Chang wrote: > I believe Racket uses HAMTs [1] for immutable hash tables. > > [1]:

Re: [racket-users] immutable hash table references?

I believe Racket uses HAMTs [1] for immutable hash tables. [1]: http://lampwww.epfl.ch/papers/idealhashtrees.pdf On Wed, May 24, 2017 at 11:01 AM, 'John Clements' via users-redirect wrote: > I’m introducing hash tables to students in a first-year class. Is there a > handy

[racket-users] immutable hash table references?

I’m introducing hash tables to students in a first-year class. Is there a handy reference for the implementation of immutable hash tables? Is this in Okasaki? John -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this