clojure.core/distinct

View this page on ClojureDocs

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

([] [coll])

Returns a lazy sequence of the elements of coll with duplicates removed. Returns a stateful transducer when no collection is provided.

Examples

by zmila on 2010-07-28 ▶

(distinct [1 2 1 3 1 4 1 5]) (1 2 3 4 5)

by zmila on 2010-07-28 . May have evaluation errors. ▶

(def fractions (for [n (range 1 100) d (range (inc n) 100)] (let [gcd (clojure.contrib.math/gcd n d)] (/ (/ n gcd) (/ d gcd))))) ;; all irreducible fractions with denominator < 100 ;; (1/2 1/3 ... 1/99 2/3 1/2 2/5 1/3 ...) (count fractions) 4851 (count (distinct fractions)) 3003

by siddharthjain-in on 2020-12-05 ▶

(distinct [1/2 2/4]) (1/2) (distinct [1/2 0.5]) (1/2 0.5)

by clojer on 2022-06-11 ▶

(apply str (distinct "tattoo")) "tao"

Note by morphling

If you do not need the lazyness of distinct, set can be faster. Like: (count (set some-coll)).

Note by vshatsky

Use this function if you want to remove only consequtive duplicates

(defn distinct-consequtive [sequence] (map first (partition-by identity sequence)))

(distinct-consequtive [1 1 2 3 3 2 2 3])
;=> (1 2 3 2 3)

Note by bfontaine

Use dedupe if you want to remove consecutive duplicates, available since Clojure 1.7.

See also

• clojure.core/distinct? (2)
• clojure.core/dedupe (0)
• clojure.core/set (1)

---

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