[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Scheme-reports] Seeking review of sets and hash tables proposals
- To: Alexey Radul <axch@x>
- Subject: Re: [Scheme-reports] Seeking review of sets and hash tables proposals
- From: Biep <scheme@x>
- Date: Tue, 28 May 2013 13:47:02 +0400
- Cc: scheme-reports@x
- In-reply-to: <CAPKQtS8h+XhJRM8LC26W8ggx9sL4p9HcnHae4xfx5HAkq=6y2A@mail.gmail.com>
- References: <mailman.1.1369584001.23918.scheme-reports@scheme-reports.org> <166242080.37186.1369647891086.JavaMail.sas1@172.29.251.236> <CAPKQtS8h+XhJRM8LC26W8ggx9sL4p9HcnHae4xfx5HAkq=6y2A@mail.gmail.com>
> O(log n) binary trees require a total order on the putative
> elements, which would need to come from somewhere.
Yes, I was sleeping (and dreaming of another situation than this one).
Sorry, and thanks for pointing it out.
_______________________________________________
Scheme-reports mailing list
Scheme-reports@x
http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports