hi, I just stumbled upon a paper on en enhanced immutable data structure [0] that could be useful for Clojure implementation.
Could it enable batter parallel programming semantics as discussed by Guy Steel in this presentation [1] ? I'd have to look deeper into it, but I'd be very interested in what other Clojurian think of it. Best Regards, B. [0] http://infoscience.epfl.ch/record/169879/files/RMTrees.pdf Abstract. Immutable vectors are a convenient data structure for func- tional programming and part of the standard library of modern languages like Clojure and Scala. The common implementation is based on wide trees with a fixed number of children per node, which allows fast in- dexed lookup and update operations. In this paper we extend the vector data type with a new underlying data structure, Relaxed Radix Balanced Trees (RRB-Trees), and show how this structure allows immutable vector concatenation, insert-at and splits in O(logN ) time while maintaining the index, update and iteration speeds of the original vector data structure. [1] http://research.sun.com/projects/plrg/Publications/ICFPAugust2009Steele.pdf -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to [email protected] Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/clojure?hl=en
