Hi everybody, I have a situation where I know that the sequence I have at hand is sorted but does not implement the Sorted interface. How can I use subseq for example on a vector without actually creating a sorted-set out of it which I think may be wasteful.. Am I mis-informed about creation of sorted-set being wastefull? If I am right in assuming what I said above, how can efficiently make something like following work? can I like just implement Sorted for Vector in the namespace I am working in?
(subseq [1 2 3 4] < 3) thanks, Sunil. -- 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
