Clojure's Map Implementation

From: andrew cooke <andrew@...>

Date: Thu, 3 May 2012 04:01:28 -0400

This describes (the ideas behind) Clojure's Map Implementation (it's not a
functional data structure, but it's clear how to make it one).  The basic idea
is to use successive groups of 5 bits from the hash as indices into a 32-entry
node.  Hence the O(log32).

http://lampwww.epfl.ch/papers/idealhashtrees.pdf

Andrew