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

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

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.

Protocol for efficiently dealing with bitsets

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

Datatype of contained datatype - may be nil if not a container

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

Returns the datatype :int8, :int16, etc -- if known -- else the type can be assumed to be an object type. The return value may not be a keyword but it must be comparable with identical?

Generic protocol for things that finalize results of reductions. Defaults to deref of instance of IDeref or identity.

Define a function to mutably add items to a collection. This function must return the collection -- it must be useable in a reduce as the rf.

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

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

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

Reducer is the basic reduction abstraction as a single object.

Faster check than satisfies? to see if something is reducible

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

Exactly :int64 :float64 :object or nil

Returns exactly :int64, :float64, or :object