On Mon, May 27, 2013 at 5:44 AM, Biep <scheme@in.biep.org> wrote:
> If collisions are resolved by having binary trees in hash buckets

O(log n) binary trees require a total order on the putative
elements, which would need to come from somewhere.

_______________________________________________
Scheme-reports mailing list
Scheme-reports@scheme-reports.org
http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports