Lists are not comparable (i.e., you can't do something like (< '(1 2 3) '(4 5 6))). So you can't sort a collection of lists, but you can sort a collection of vectors (provided the vectors contain comparable things). This is always the case; there is no inconsistency.
The reason you are sometimes not getting an error is that when you randomly generate small collections of vectors, often the first element will be enough to sort the collection, so it never tries to compare the second elements, which in this case are lists. I'm not sure why lists don't implement comparable. Offhand I can't think of a reason why they wouldn't, but perhaps there is a reason. --~--~---------~--~----~------------~-------~--~----~ 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 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 -~----------~----~----~----~------~----~------~--~---
