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

BitSet clj protocol

Protocol for efficiently dealing with bitsets

bitset? clj

(bitset? item)

contains-range? clj

(contains-range? item sidx eidx)

intersects-range? clj

(intersects-range? item sidx eidx)

max-set-value clj

(max-set-value item)

min-set-value clj

(min-set-value item)

ParallelReducer clj protocol

Parallel reducers are simple a single object that you can pass into preduce as opposed to 3 separate functions.

->merge-fn clj

(->merge-fn item)

Returns the merge function for a parallel reduction. This function takes two accumulators and returns a or modified accumulator.

ParallelReduction clj protocol

Protocol to define a parallel reduction in a collection-specific pathway. Specializations are in impl as that is where the parallelization routines are found.

preduce clj

(preduce coll init-val-fn rfn merge-fn options)

Container-specific parallelized reduction. Reductions must respect the pool passed in via the options.

Reducer clj protocol

Reducer is the basic reduction abstraction as a single object.

->init-val-fn clj

(->init-val-fn item)

Returns the initial values for a parallel reduction. This function takes no arguments and returns the initial accumulator.

->rfn clj

(->rfn item)

Returns the reduction function for a parallel reduction. This function takes two arguments, the accumulator and a value from the collection and returns a new or modified accumulator.

finalize clj

(finalize item v)

A finalize function called on the result of the reduction after it is reduced but before it is returned to the user. Returning v is a reasonable default.

Reduction clj protocol

Reduce a collection to an accumulator.

reduce clj

(reduce coll rfn acc)

reducible? clj

(reducible? coll)

SetOps clj protocol

Simple protocol for set operations to make them uniformly extensible to new objects.

cardinality clj

(cardinality item)

Some sets don't work with clojure's count function.

contains-fn clj

(contains-fn item)

Return an efficient function for deciding if this set contains a single item.

difference clj

(difference l r)

intersection clj

(intersection l r)

set? clj

(set? l)

union clj

(union l r)

xor clj

(xor l r)

ToCollection clj protocol

->collection clj

(->collection item)

convertible-to-collection? clj

(convertible-to-collection? item)

ToIterable clj protocol

->iterable clj

(->iterable item)

convertible-to-iterable? clj

(convertible-to-iterable? item)