Nice! Thanks for this Zach! I also have an immutable bitset for integers based on BigInteger, should anyone need backwards compatibility with older jvms. However, you look to have put significantly more time into optimization than I did. My implementation does have a few extra functions (shifts and retrieving of the smallest and largest integers in a set). If anyone is interested I'm happy to formally package it.
https://www.refheap.com/17075 Alex On Tuesday, July 30, 2013 8:58:38 PM UTC-4, Zach Tellman wrote: > > https://github.com/ztellman/immutable-bitset > > There's not much to describe here, this provides an implementation of an > integer-only set which can take up three orders of magnitude less memory > under certain conditions. I needed this to implement a Bloom filter, but I > figured it had applications elsewhere. If anyone has questions, I'd be > happy to answer them. > > Zach > -- -- 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 --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
