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
That's a super cool idea, but my data have no similar size. Anyway, that's
both simple and always better than what I do.(At worst it has an expected
complexity of O(n) if all the mass is in one value and the n-1 are
zero-ish).
I think you can solve the holes on delete by permuting the removed
I think you can solve the holes on delete by permuting the removed element
with the last element and keeping a map from value to their index.
Good idea!
Thanks you very much for these suggestions.
You're welcome. The hashtrie is a much better idea for this situation, of
course.
Couldn't
project, a sketch of an implementation of PersistentHashMap
in clojure itself? (I would be happy to contribute, if it needs more work).
Or has anyone a better idea that mine to have drawable sets?
Thanks for your help,
Best regards,
Nicolas.
--
You received this message because you are subscribed
for the clojure in
clojure project, a sketch of an implementation of PersistentHashMap
in clojure itself? (I would be happy to contribute, if it needs more work).
Or has anyone a better idea that mine to have drawable sets?
Thanks for your help,
Best regards,
Nicolas.
--
You received
: does anyone has, for example for the clojure in
clojure project, a sketch of an implementation of PersistentHashMap
in clojure itself? (I would be happy to contribute, if it needs more
work).
Or has anyone a better idea that mine to have drawable sets?
Thanks for your help,
Best
, a sketch of an implementation of PersistentHashMap
in clojure itself? (I would be happy to contribute, if it needs more work).
Or has anyone a better idea that mine to have drawable sets?
Thanks for your help,
Best regards,
Nicolas.
--
You received this message because you are subscribed
work).
Or has anyone a better idea that mine to have drawable sets?
Thanks for your help,
Best regards,
Nicolas.
--
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
of an implementation of PersistentHashMap
in clojure itself? (I would be happy to contribute, if it needs more
work).
Or has anyone a better idea that mine to have drawable sets?
Thanks for your help,
Best regards,
Nicolas.
--
You received this message because you are subscribed to the Google
Groups
in log time.
So here is my question : does anyone has, for example for the clojure
in clojure project, a sketch of an implementation of PersistentHashMap
in clojure itself? (I would be happy to contribute, if it needs more
work).
Or has anyone a better idea that mine to have drawable sets?
Thanks
in
clojure project, a sketch of an implementation of PersistentHashMap
in clojure itself? (I would be happy to contribute, if it needs more
work).
Or has anyone a better idea that mine to have drawable sets?
Thanks for your help,
Best regards,
Nicolas.
--
You received
11 matches
Mail list logo