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.
Release 0.4.0: - Functions have been added for file load/save using nio FileChannel, and for a 256-bit checksum. Examples have also been included showing how to use these functions in an application. - The API has been reworked to decouple application code from the choice of implementation for the data structures. (The old API has been deprecated.) https://github.com/laforge49/aatree#readme On Clojars: https://clojars.org/aatree -- 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.
