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

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

Return true if this is a bitset

Return the cardinality (size) of a given set.

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

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

set difference

set intersection

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

Create a concurrent hashset.

Return a java hashset

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

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

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

Return a mutable set.

Reduce a number of objects into one object via union

Return an immutable set

set union

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

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

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.

set xor - difference of intersection from union