ham-fisted.set — com.cnuernber/ham-fisted 1.000-beta-49

->integer-random-access clj

(->integer-random-access s)

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

bitset clj

(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.

bitset? clj

(bitset? s)

Return true if this is a bitset

cardinality clj

(cardinality s)

Return the cardinality (size) of a given set.

contains-fn clj

(contains-fn s)

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

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.

difference clj

(difference l r)

set difference

intersection clj

(intersection l r)

set intersection

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.

java-hashset clj

(java-hashset)

(java-hashset data)

Return a java hashset

map-invert clj

(map-invert m)

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

max-set-value clj

(max-set-value s)

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

min-set-value clj

(min-set-value s)

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

mut-set clj

(mut-set)

(mut-set data)

Return a mutable set.

set clj

(set)

(set data)

Return an immutable set

union clj

(union l r)

set union

xor clj

(xor l r)

set xor - difference of intersection from union