Take a thing and return a bi-consumer. If already a bi-consumer return as is, else calls (bi-consumer x y (ifn x y))

Take a thing and return a bi-function. If already a bi-function return as is, else calls (bi-function x y (ifn x y))

Convert an ifn to a java.util.function.Function. If ifn is already a Function, return with no changes. Else calls (function x (ifn x))

Add a value to a set

Create a java.util.function.BiConsumer. karg will be the name of the first argument to the consumer, varg will be the name of the second. Code will be output inline into the consumer's accept function.

Create a java.util.function.BiFunction. karg will be the name of the first argument, varg will be the name of the second argument. code will be output inline into the function's apply function.

Compute a new value in-place. val-fn gets passed the key and existing value (if any). It is more efficient to pre-convert val-fn to a bi-function than to force this function to do it during execution.

Given a map and a function to call if the value is in the map, return a function that takes a k and returns the result of calling (.compute map k (->bi-function val-fn)). val-fn gets passed the key and existing value (if any).

Compute a new value in-place. val-fn gets passed the key. It is more efficient to pre-convert val-fn to a java.util.function.Function than to force this function to do it during its execution.

Given a map and a function to call if the value is not in the map, return a function that takes a k and returns the result of calling (.compute map k (->function val-fn)). val-fn gets passed the key when the value is not in the map.

Compute a new value in-place. val-fn gets passed the key and existing value. It is more efficient to pre-convert val-fn to a java.util.function.BiFunction than to force this function to do it during its execution.

Given a map and a function to call if the value is in the map, return a function that takes a k and returns the result of calling (.computeIfPresent map k (->bi-function val-fn)). val-fn gets passed the existing value and new value is in the map.

Return true if this is a concurrent hash map.

Create a concurrent-safe set. Wraps (.. (ConcurrentHashMap.) keySet)

Much faster version of contains? if you are dealing with java.util sets or maps.

Get the entries of the hashmap. Returns a randomly accessible list of data.

• xform is a function from k, v to object. Defaults to vector.

Given a java.util.Map$Entry, return the key

Given a java.util.Map$Entry, return the value

Perform an operation for each entry in a map. Returns the op. This method will by default be serial unless parallel? is true in which case if the item in question is a concurrent hash map then the parallel version of foreach is used.

Faster frequencies that returns either a hash map or concurrent hash map depending on if the sequence is iterable or if it can be converted to a reader.

For further use of this data see entries below.

Create a java.util.function.Function. karg will be the name of the argument, will be output inline into the function's apply method.

Get a value from a map with a potential default. Missing values will be nil otherwise.

Create a java.util.HashMap. Note the only optional argument is for the initial size of the underlying hashtable.

Init can be of several forms:

• number? - Used to initializes the hashtable size.
• instance? java.util.Map - Hash map is copied.
• sequential? - Used like 'into' without xform.

put a sequence of pairs into a jvm map.

Merge rhs into lhs using op to resolve conflicts. Op gets passed two arguments, lhs-val rhs-val. If both rhs and lhs are concurrent hash maps then the merge is performed in parallel.

Returns lhs.

Called from java. Ensure the keys of the map are keywords. Should be tested with (opt-map (object-array args)).

Put a value into a map returning the map.

Replace all the values in the map with new values computed with val-fn. val-fn gets passed the key and the existing value and must return a new value.