New version of finger trees is released at https://github.com/wagjo/data.cljs . It is much faster and uses transients internally, where appropriate.
Moreover, this release provides functions for all kinds of data structures. Notable functionalities include: - fast eager variants of map and map-indexed - fast variants of reduce and reduce-kv - reduce-reverse and reduce-kv-reverse This library is not very idiomatic though, as it provides more than a minimal set of functions and there may be redundancies The choice of naming stuff departs from the style used in clojure.core. However, I've tried to put some order into the naming things, as IMO clojure.core is becoming a bit messy with specialized functions for individual data structures (alength, subvec, ....) JW On Friday, April 20, 2012 12:17:31 PM UTC+2, Jozef Wagner wrote: > > I've ported finger trees from Chouser's > https://github.com/clojure/data.finger-tree to the Clojurescript > > You can find them at https://github.com/wagjo/ftree > > With finger tree, one can make a persistent collection with amortized > constant time access to elements and O(log n) append and split > (insert/remove). > > Jozef Wagner > -- -- 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
