Can someone please explain why an insert into a vector: (insert my_vec [:a :b :c] (range 10)) would be of linear time complexity based on the size of the second argument? I would have thought that this would boil down to something like adding a reference to the first element of the sequence returned by range to the end of the vector...which I would have thought could be achieved in constant time. Where's the flaw in my thinking there? Cheers Andreas
-- 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
