Liking cljdoc? Tell your friends :D

conceptual.int-sets


+empty+clj


add-to-int-setclj

(add-to-int-set a b)

(binary-search key coll)
(binary-search key begin end coll)

Searches for a key in a sorted array.

Searches for a key in a sorted array.
raw docstring

binary-search-greaterclj

(binary-search-greater key coll)
(binary-search-greater key begin end coll)

Searches for a key in a sorted array, and returns an index to an element which is greater than or equal key. Returns end if nothing greater or equal was found, else an index satisfying the search criteria.

Searches for a key in a sorted array, and returns an index to an element
which is greater than or equal key. Returns end if nothing greater or equal
was found, else an index satisfying the search criteria.
raw docstring

binary-search-smallerclj

(binary-search-smaller key coll)
(binary-search-smaller key begin end coll)

Searches for a key in a sorted array, and returns an index to an element which is smaller than or equal key.

Searches for a key in a sorted array, and returns an index to an element
which is smaller than or equal key.
raw docstring

conjclj

(conj a b)

contains?clj

(contains? coll key)

Returns true if key is in coll

Returns `true` if `key` is in `coll`
raw docstring

decodeclj

(decode s)

Decodes an encoded integer array back into into an integer array.

Decodes an encoded integer array back into into an integer array.
raw docstring

differenceclj

(difference)
(difference a)
(difference a b)
(difference a b c)
(difference a b c d)
(difference a b c d e)
(difference a b c d e f)
(difference a b c d e f g)
(difference a b c d e f g h)
(difference a b c d e f g h & more)

Returns the integer difference of the given sorted int arrays. Everything is subtracted from the first sorted int array set.

Returns the integer difference of the given sorted int arrays. Everything is
subtracted from the first sorted int array set.
raw docstring

disjclj

(disj a b)

encodeclj

(encode s)

Encodes and integer array into a byte array.

Encodes and integer array into a byte array.
raw docstring

equalsclj

(equals a b)

Returns true if a and b are equal in contents.

Returns true if a and b are equal in contents.
raw docstring

index-ofclj

(index-of key coll)

Returns the index of a key in a sorted int array, -1 if not found.

Returns the index of a key in a sorted int array, -1 if not found.
raw docstring

intersectionclj

(intersection)
(intersection a)
(intersection a b)
(intersection a b c)
(intersection a b c d)
(intersection a b c d e)
(intersection a b c d e f)
(intersection a b c d e f g)
(intersection a b c d e f g h)
(intersection a b c d e f g h & more)

Returns the integer intersection of the given sorted int array sets.

Returns the integer intersection of the given sorted int array sets.
raw docstring

member?clj

(member? key coll)

Returns true if key is in coll

Returns `true` if `key` is in `coll`
raw docstring

unionclj

(union)
(union a)
(union a b)
(union a b c)
(union a b c d)
(union a b c d e)
(union a b c d e f)
(union a b c d e f g)
(union a b c d e f g h)
(union a b c d e f g h & more)

Returns the integer union of the given sorted int array sets.

Returns the integer union of the given sorted int array sets.
raw docstring

cljdoc is a website building & hosting documentation for Clojure/Script libraries

× close