(->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.
(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.
(cardinality s)Return the cardinality (size) of a given set.
Return the cardinality (size) of a given set.
(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.
(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.
(intersection)(intersection l)(intersection l r)set intersection
set intersection
(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.
(java-concurrent-hashset)(java-concurrent-hashset data)Create a concurrent hashset.
Create a concurrent hashset.
(java-hashset)(java-hashset data)Return a java hashset
Return a java hashset
(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
(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.
(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.
(reduce-intersection)(reduce-intersection l)(reduce-intersection l & data)(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
(set? data)(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]].
(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.
(xor l r)set xor - difference of intersection from union
set xor - difference of intersection from union
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |