set
- (set coll)
Returns a set of the distinct elements of coll.
© Rich Hickey. All rights reserved. Eclipse Public License 1.0
2 Examples
;; returns distinct elements user=> (set '(1 1 2 3 2 4 5 5)) #{1 2 3 4 5} ;; returns distinct elements (different nomenclature) user=> (set [1 1 2 3 2 4 5 5]) #{1 2 3 4 5} user=> (set [1 2 3 4 5]) #{1 2 3 4 5} user=> (set "abcd") #{\a \b \c \d} user=> (set '("a" "b" "c" "d")) #{"a" "b" "c" "d"} user=> (set {:one 1 :two 2 :three 3}) #{[:two 2] [:three 3] [:one 1]} user=> (set nil) #{}
(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
4 Notes
By 
, created 13.6 years ago
, created 13.6 years agoThe documentation doesn't mention the order, is it undefined?
{:a :b :c :d}
-> #{:d :a :b :c}
By 
, created 8.5 years ago
, created 8.5 years agoSets 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.
By 
, created 5.6 years ago
, created 5.6 years agoIs the order guaranteed to be consistent if so is it not ordered (just not asc/desc)?
By 
, created 5.4 years ago
, created 5.4 years agoSets are not ordered, so there’s not guarantee on their “order”.