clojure.data.int-map — org.clojure/data.int-map 1.2.1

An adaptation of Okasaki and Gill's "Fast Mergeable Integer Maps`", which can be found at http://ittc.ku.edu/~andygill/papers/IntMap98.pdf

dense-int-set clj

(dense-int-set)

(dense-int-set s)

Given a collection, creates an immutable set which can only store integral values. This should be used only if elements are densely clustered (each element has multiple elements within +/- 1000).

difference clj

(difference a b)

Returns the difference between two bitsets.

int-map clj

(int-map)

(int-map a b)

(int-map a b & rest)

Given alternating keys and values, creates an integer map that can only have integers as keys.

int-set clj

(int-set)

(int-set s)

Given a collection, creates an immutable set which can only store integral values. This should be used unless elements are densely clustered (each element has multiple elements within +/- 1000).

intersection clj

(intersection a b)

Returns the intersection of two bitsets.

merge clj

(merge)

(merge a b)

(merge a b & rest)

Merges together two int-maps, giving precedence to values from the right-most map.

merge-with clj

(merge-with f)

(merge-with f a b)

(merge-with f a b & rest)

Merges together two int-maps, using f to resolve value conflicts.

range clj

(range x min max)

Returns a map or set representing all elements within [min, max], inclusive.

union clj

(union a b)

Returns the union of two bitsets.

update clj

(update m k f)

(update m k f & args)

Updates the value associated with the given key. If no such key exists, f is invoked with nil.

update! clj

(update! m k f)

(update! m k f & args)

A transient variant of update.