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.3.3: - AASet has been implemented for completeness. AASet's can be nested within AAMaps and AAVectors and still provide lazy deserialization / reserialization. Serialization of an AASet retains only a single copy of each value, not 2 copies (key and value). - Examples provided of basic AASet, lazy AASet and nesting lazy AASet in a lazy AAMap and lazy AAVector. 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.
