On Tue, Aug 25, 2009 at 10:42 AM, Fogus <mefo...@gmail.com> wrote: > > A quick and dirty way would be to use a map as your intermediate > storage with your generated numbers as keys and some constant as their > assoc'd value. Once you've populated said map with the proper number > of entries (keeping track of clashes along the way) then get a > sequence using `(seq (.keySet myMap))`.
Why not just use a HashSet rather than a SortedSet to begin with? --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
