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 <stch...@ccs.neu.edu> wrote: > 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 > <us...@plt-scheme.org> wrote: >> 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 group and stop receiving emails from it, send an >> email to racket-users+unsubscr...@googlegroups.com. >> For more options, visit https://groups.google.com/d/optout. > > -- > You received this message because you are subscribed to the Google Groups > "Racket Users" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to racket-users+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/d/optout. -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
