In increasing order of difficulty... Option 1:
Extend your comparator to sort first on the key you're actually interested in, then if that key isn't different on the others more-or-less arbitrarily. Option 2: Keep the data unsorted in a hash-set. Sort when you need sorted data, e.g. for user presentation, by using a sort function that outputs a seq. (Inefficient if the sort will then be performed often for a given set.) Option 3: Implement your own sorted set type that handles sort-order collisions by having plain sets as equality buckets, using deftype, gen-class, or Java. Option 4: Convince Rich Hickey that having the built in sorted-set not deal with order collisions (ala Option 3, above) is as silly as if he'd had hash-set not deal with hash collisions. :) -- 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
