What are your ideas? You can implement a balanced k-d tree on top a normal
vector, so that would be my first thought.
--
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 n
Hi everybody,
Thanks to Chouser's finger tree data structure, it makes it very simple to
keep some elements in a tree/sequence and efficiently maintain values by
some associative operation on all the elements of the collection .. I guess
chouser himself has given series of talks on that. However,
