Liking cljdoc? Tell your friends :D

ham-fisted.set


->integer-random-accessclj

(->integer-random-access s)

Given a set (or bitset), return a efficient, sorted random access structure. This assumes the set contains integers.

Given a set (or bitset), return a efficient, sorted random access structure.  This assumes
the set contains integers.
raw docstring

bitsetclj

(bitset)
(bitset data)
(bitset start end)

Create a java.util.Bitset. The two argument version assumes you are passing in the start, end of a monotonically incrementing range.

Create a java.util.Bitset.  The two argument version assumes you are passing in the
start, end of a monotonically incrementing range.
raw docstring

bitset?clj

(bitset? s)

Return true if this is a bitset

Return true if this is a bitset
raw docstring

cardinalityclj

(cardinality s)

Return the cardinality (size) of a given set.

Return the cardinality (size) of a given set.
raw docstring

contains-fnclj

(contains-fn s)

Return an IFn that returns efficiently returns true if the set contains a given element.

Return an IFn that returns efficiently returns true if the set contains
a given element.
raw docstring

contains-range?clj

(contains-range? s sidx eidx)

bitset-specific query that returns true if the set contains all the integers from sidx to eidx non-inclusive.

bitset-specific query that returns true if the set contains all the integers from
sidx to eidx non-inclusive.
raw docstring

differenceclj

(difference l r)

set difference

set difference
raw docstring

intersectionclj

(intersection)
(intersection l)
(intersection l r)

set intersection

set intersection
raw docstring

intersects-range?clj

(intersects-range? s sidx eidx)

bitset-specific query that returns true if the set contains any the integers from sidx to eidx non-inclusive.

bitset-specific query that returns true if the set contains any the integers from
sidx to eidx non-inclusive.
raw docstring

java-concurrent-hashsetclj

(java-concurrent-hashset)
(java-concurrent-hashset data)

Create a concurrent hashset.

Create a concurrent hashset.
raw docstring

java-hashsetclj

(java-hashset)
(java-hashset data)

Return a java hashset

Return a java hashset
raw docstring

map-invertclj

(map-invert m)

invert a map such that the keys are the vals and the vals are the keys

invert a map such that the keys are the vals and the vals are the keys
raw docstring

max-set-valueclj

(max-set-value s)

Given a bitset, return the maximum set value. Errors if the bitset is empty.

Given a bitset, return the maximum set value.  Errors if the bitset is empty.
raw docstring

min-set-valueclj

(min-set-value s)

Given a bitset, return the minimum set value. Errors if the bitset is empty.

Given a bitset, return the minimum set value.  Errors if the bitset is empty.
raw docstring

mut-setclj

(mut-set)
(mut-set data)

Return a mutable set.

Return a mutable set.
raw docstring

reduce-intersectionclj

(reduce-intersection)
(reduce-intersection l)
(reduce-intersection l & data)

reduce-unionclj

(reduce-union)
(reduce-union l)
(reduce-union l & data)

Reduce a number of objects into one object via union

Reduce a number of objects into one object via union
raw docstring

setclj

(set)
(set data)

Return an immutable set

Return an immutable set
raw docstring

set?clj

(set? data)

unionclj

(union l r)

set union

set union
raw docstring

uniqueclj

(unique data)
(unique options data)

Create a set of unique items. Parallelized and non-lazy.

See options for unique-reducer and [[ham-fisted.api/preduce-reducer]].

Create a set of unique items.  Parallelized and non-lazy.

See options for [[unique-reducer]] and [[ham-fisted.api/preduce-reducer]].
raw docstring

unique-reducerclj

(unique-reducer options)

Create a parallel reducer that creates a set.

Options:

  • :set-constructor construct something that implements [[ham-fisted.protocols/add-fn]] and [[ham-fisted.protocols/union]]
  • :add-fn Pass in user-defined add function as opposed to using protocol lookup to find it.
Create a parallel reducer that creates a set.

Options:

* `:set-constructor` construct something that implements [[ham-fisted.protocols/add-fn]]
and [[ham-fisted.protocols/union]]
* `:add-fn` Pass in user-defined add function as opposed to using protocol lookup to
  find it.
raw docstring

xorclj

(xor l r)

set xor - difference of intersection from union

set xor - difference of intersection from union
raw docstring

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

× close