[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Scheme-reports] Seeking review of sets and hash tables proposals
- To: Biep <scheme@x>
- Subject: Re: [Scheme-reports] Seeking review of sets and hash tables proposals
- From: Alexey Radul <axch@x>
- Date: Mon, 27 May 2013 12:47:48 -0400
- Cc: scheme-reports@x
- In-reply-to: <166242080.37186.1369647891086.JavaMail.sas1@172.29.251.236>
- References: <mailman.1.1369584001.23918.scheme-reports@scheme-reports.org> <166242080.37186.1369647891086.JavaMail.sas1@172.29.251.236>
On Mon, May 27, 2013 at 5:44 AM, Biep <scheme@x> 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@x
http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports