On 12 June 2013 00:33, Andy Fingerhut <andy.finger...@gmail.com> wrote: > I haven't done anything but think about it during commute time yet, but I > had been wondering in how many situations it might be useful to have a > string type that was something like Relaxed Radix Binary trees, in that they > can be concatenated and substring'd in O(log n) worst case time, and yet > substrings would only hold onto references of the parts that they explicitly > refer to, and perhaps a little bit more (but not the entire original > string).
Just a minor note -- RRB trees never hold on to unneeded data (even just a little bit). Agreed that they should be useful in implementing a flexible string type. Cheers, Michał -- -- 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.
