That more or less what I had in mind, but I was wondering if someone has already an Open Sourced code for HashTries in Clojure.
But I can try your idea with binary tree first. It seems simpler. Thanks again, Nicolas On Sun, Jun 27, 2010 at 5:13 AM, Jules <julesjac...@gmail.com> wrote: > > You can use the same idea for hash tries, just maintain the total > weight in each node and draw with this algorithm. > -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
