clojure.core/sorted-set

View this page on ClojureDocs

Type: function Added: Clojure 1.0 Examples: 3 Runnable: 3

([& keys])

Returns a new sorted set with supplied keys. Any equal keys are handled as if by repeated uses of conj.

Examples

by gstamp on 2010-07-28 ▶

(sorted-set 3 2 1) #{1 2 3} (sorted-set 3 2 1 1) #{1 2 3} #{2 1 3} #{1 3 2} (apply sorted-set #{2 1 3}) #{1 2 3}

by ibercode on 2018-02-16 ▶

(sorted-set :a "A" 1) ;;Exception ;;unable to implement java.lang.String.compareTo ;; This exception occurs because the default comparator, a Clojure function ;; named `compare`, throws an exception when asked to compare two values of ;; very dissimilar tpyes, like a keyword and a string, or a keyword and a number. ;; If you really want a sorted set containing such dissimilar types, you will ;; need to create your own custom comparator and use sorted-set-by. ;; See this article for advice on creating custom comparators: ;; https://clojure.org/guides/comparators

by jafingerhut on 2019-01-27 ▶

;; (sorted-set ...) is equivalent in behavior to (sorted-set-by compare ...) ;; where compare is Clojure's default comparator function clojure.core/compare ;; See the documentation of compare for more details on its behavior. ;; For a set sorted by the order that elements were added, ;; see ordered-set: https://github.com/clj-commons/ordered ;; If you deal with many large sets of integers, and want a more memory-efficient ;; data structure for those, see int-set and dense-int-set: ;; https://github.com/clojure/data.int-map

See also

• clojure.core/sorted-set-by (2)
• clojure.core/subseq (0)
• clojure.core/rsubseq (0)
• clojure.core/sorted-map (5)
• clojure.core/into (9)
• clojure.core/hash-set (2)
• clojure.core/compare (3)

---

Content from the matching ClojureDocs page, with authors credited on each contribution.