This would be awesome. From his talk it sounds like it shouldn't replace PersistentVector at all, in fact you should be able to share structure with PersistentVector right?
David On Sun, Nov 13, 2011 at 10:02 AM, Krukow <[email protected]> wrote: > By the way, I don''t see it as a replacement for PersistentVector, but > rather as an additional data structure, that could perhaps be put > somewhere in contrib if it turns out well. > > /Karl > > On Nov 13, 9:54 am, Karl Krukow <[email protected]> wrote: > > Hi, > > Yes, Phil Bagwell presented that at the Conj. > > > > I'm really interested in this stuff, so as an exercise in Clojure, I've > started thinking about how to implement it. At first I'll try and do it > without looking at Scala - if I get stuck I might peek a bit :) > > > > If you're interested, I'll put it online once it is in a state that is > fairly reasonable. > > > > /Karl > > On 12/11/2011, at 21.18, bernardH wrote: > > > > > > > > > > > > > > > > > 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/ICFPAugust2009Stee... > > > > > -- > > > 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 > > -- > 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 > -- 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
