provisdom.utility-belt.extensions

Liking cljdoc? Tell your friends :D

Mostly clj.
Exceptions indicated.

if-all-let^clj/s
interleave-all
reduce-kv-ext
reduce-kv-with-stop
reductions-kv
update-in-with-not-found
when-all-let^clj/s

if-all-let^clj/smacro

(if-all-let bindings then)

(if-all-let bindings then else)

interleave-all^clj

(interleave-all)

(interleave-all c1)

(interleave-all c1 c2)

(interleave-all c1 c2 & colls)

Returns a lazy seq of the first item in each coll, then the second etc. Difference from interleave is that all elements are consumed.

Returns a lazy seq of the first item in each coll, then the second etc.
Difference from interleave is that all elements are consumed.

raw docstring

reduce-kv-ext^clj

(reduce-kv-ext f init coll)

(reduce-kv-ext f init c1 c2)

(reduce-kv-ext f init c1 c2 c3)

Extension of clojure's 'reduce-kv'. First collection must be the shortest. Function f takes the result value, an index, and the item value(s).

Extension of clojure's 'reduce-kv'. First collection must be the shortest.
Function `f` takes the result value, an index, and the item value(s).

raw docstring

reduce-kv-with-stop^clj

(reduce-kv-with-stop f
                     init
                     coll
                     {:provisdom.utility-belt.extensions/keys
                        [stop-pred1 err-pred1 err-return-fn1]})

(reduce-kv-with-stop f
                     init
                     c1
                     c2
                     {:provisdom.utility-belt.extensions/keys
                        [stop-pred2 err-pred2 err-return-fn2]})

(reduce-kv-with-stop f
                     init
                     c1
                     c2
                     c3
                     {:provisdom.utility-belt.extensions/keys
                        [stop-pred3 err-pred3 err-return-fn3]})

Reduces a sequence using stopping predicates. Function f and predicates take the result value, an index, and the item value(s).

Reduces a sequence using stopping predicates. Function `f` and predicates
take the result value, an index, and the item value(s).

raw docstring

reductions-kv^clj

(reductions-kv f init coll)

(reductions-kv f init c1 c2)

(reductions-kv f init c1 c2 c3)

Returns a lazy seq of a reduction with indices. Function f takes the result value, an index, and the item value(s).

Returns a lazy seq of a reduction with indices. Function `f` takes the
result value, an index, and the item value(s).

raw docstring

update-in-with-not-found^clj

(update-in-with-not-found m [k & ks] f not-found & args)

Updates a value in a nested associative structure, where ks is a sequence of keys and f is a function that will take the old value and any supplied args and return the new value, and returns a new nested structure. If any key does not exist, not-found will be used as the old value. If any levels do not exist, hash-maps will be created.

Updates a value in a nested associative structure, where `ks` is a sequence
of keys and `f` is a function that will take the old value and any supplied
args and return the new value, and returns a new nested structure. If any key
does not exist, `not-found` will be used as the old value. If any levels do
not exist, hash-maps will be created.

raw docstring