clojure.core/set

View this page on ClojureDocs

Type: function Added: Clojure 1.0 Examples: 2 Runnable: 1

([coll])

Returns a set of the distinct elements of coll.

Examples

by MrHus on 2010-07-18 ▶

;; returns distinct elements (set '(1 1 2 3 2 4 5 5)) #{1 2 3 4 5} ;; returns distinct elements (different nomenclature) (set [1 1 2 3 2 4 5 5]) #{1 2 3 4 5} (set [1 2 3 4 5]) #{1 2 3 4 5} (set "abcd") #{\a \b \c \d} (set '("a" "b" "c" "d")) #{"a" "b" "c" "d"} (set {:one 1 :two 2 :three 3}) #{[:two 2] [:three 3] [:one 1]} (set nil) #{}

by boxie on 2010-11-15 . May have evaluation errors. ▶

(set [1 2 3 2 1 2 3]) -> #{1 2 3} #{:a :b :c :d} -> #{:d :a :b :c} (hash-set :a :b :c :d) -> #{:d :a :b :c} (sorted-set :a :b :c :d) -> #{:a :b :c :d} ;------------------------------------------------ (def s #{:a :b :c :d}) (conj s :e) -> #{:d :a :b :e :c} (count s) -> 4 (seq s) -> (:d :a :b :c) (= (conj s :e) #{:a :b :c :d :e}) -> true (s :b) -> :b (s :k) -> nil

Note by icefox

The documentation doesn't mention the order, is it undefined?

{:a :b :c :d}

-> #{:d :a :b :c}

Note by venantius

Sets are a core data structure that by definition do not store elements in a sorted order. The actual order will ultimately be determined by the specific hashing function underpinning the data structure.

Note by dhbarnett

Is the order guaranteed to be consistent if so is it not ordered (just not asc/desc)?

Note by bfontaine

Sets are not ordered, so there’s not guarantee on their “order”.

See also

• clojure.core/hash-set (2)
• clojure.core/sorted-set (3)
• clojure.core/conj (9)
• clojure.set/join (0)
• clojure.set/select
• clojure.set/difference (0)
• clojure.set/intersection (0)
• clojure.set/union (0)
• clojure.set/index (0)
• clojure.set/project
• clojure.set/rename
• clojure.set/rename-keys (0)
• clojure.set/map-invert (0)
• clojure.core/disj (2)
• clojure.core/distinct (3)

---

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