all true. Also, if you look at the internal structure of PersistentVector (perhaps using me seqspert lib - announced this evening), you would see that PersistentVector is actually implemented as a tree. Recombination through several levels of supervec could simply be thought of as extending this tree up above the combined nodes, but with a smaller branching factor.
Jules On Friday, 21 February 2014 00:10:19 UTC, TheBusby wrote: > > On Fri, Feb 21, 2014 at 8:51 AM, <shlomi...@gmail.com <javascript:>> > wrote: > >> One note about your SuperVecs idea though, it seems that using that >> approach we could get a deeply nested tree to represent our a vector, and I >> think this is the exact thing vectors are trying to avoid.. > > > In general I think this is true for vectors, but in this covers one > particular use-case where I've often found generation time to be more > important that a faster lookup. > If you favor a faster lookup then a normal vector can be used instead of > course. > -- 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/groups/opt_out.
