The aatree project provides fully compatible alternatives to Clojure sorted-map, sorted-set and vector, with several extensions: - AAVector supports add/drop at any point using addn and dropn. - AAMap and AASet implement Reversible, Counted, Indexed and Sorted - CountedSequence implements Counted and do not use synchronized. - Lazy deserialization/reserialization provides ridiculously fast deserialize/update/reserialize processing typical of disk access. - Virtual Structures that can be larger than memory.
New in Release 0.6.1: - Calf and Yearling now use the db chan trait in place of the db agent trait by default. - Yearling now uses the lru db cache trait by default but also works with the null db cache trait. For more information about traits, see the AATree API <https://github.com/laforge49/aatree/wiki/API>. https://github.com/laforge49/aatree#readme On Clojars: https://clojars.org/aatree Please feel free to comment on this project. Your participation would be most welcome. -- 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/d/optout.
