io.randomseed.utils.map — io.randomseed/utils 1.1.6

Random utils, map utilities.

assoc-existing clj

(assoc-existing)

(assoc-existing coll)

(assoc-existing coll k val)

(assoc-existing coll k val & more)

Associates keys and values only if the keys exist in a map.

assoc-if clj macro

(assoc-if coll pred k val)

assoc-if-key clj macro

(assoc-if-key coll k pred val)

assoc-if-not clj macro

(assoc-if-not coll pred k val)

assoc-if-not-key clj macro

(assoc-if-not-key coll k pred val)

assoc-missing clj

(assoc-missing)

(assoc-missing coll)

(assoc-missing coll k val)

(assoc-missing coll k val & more)

Associates keys and values only if the keys do not yet exist in a map.

dissoc-if clj

(dissoc-if m k pred)

dissoc-in clj

(dissoc-in m [k & ks :as keys])

Like assoc-in but removes entries. Leaves empty maps.

duplicate-keys clj

(duplicate-keys map kmap)

Returns the map with the keys in kmap duplicated under new names according to the vals in kmap.

invert-in-sets clj

(invert-in-sets m)

(invert-in-sets m dst)

Like clojure.set/map-invert but preserves all possible values in sets.

lazy-get clj macro

(lazy-get m k exp)

Like get but the default value is an expression that is going to be evaluated only if the associative structure does not contain the given key.

map-keys clj

(map-keys f m)

(map-keys f m dst)

For each key and value of the given map m calls a function passed as the first argument (passing successive keys during calls to it) and generates a map with keys updated by results returned by the function. When the third argument is given then it should be a map on which operations are performed instead of using an empty map.

map-keys-and-vals clj

(map-keys-and-vals f m)

(map-keys-and-vals f m dst)

For each key and value of the given map m calls a function passed as the first argument (passing successive keys during calls to it) and generates a map with keys updated by results returned by the function and values also updated by results of the same function. The function should return a sequential collection of 2 elements: first containing a new value of a key and second containing a new value of a transformed value associated with that key. When the third argument is given then it should be a map on which operations are performed instead of using an empty map.

map-keys-by-v clj

(map-keys-by-v f m)

(map-keys-by-v f m dst)

For each key and value of the given map m calls a function passed as the first argument (passing successive values during calls to it) and generates a map with keys updated by results returned by the function. When the third argument is given then it should be a map on which operations are performed instead of using and empty map.

map-of-sets-invert clj

(map-of-sets-invert m)

Like clojure.set/map-invert but for map of sets (as values) to preserve all possible values (as keys of newly created map).

map-of-vectors-invert-flatten clj

(map-of-vectors-invert-flatten m)

Like clojure.set/map-invert but for map of vectors (as values). Duplicated keys are replaced.

map-vals clj

(map-vals f m)

(map-vals f m dst)

For each key and value of the given map m calls a function passed as the first argument (passing successive values during calls to it) and generates a map with values updated by results returned by the function. When the third argument is given it should be a map on which operations are performed instead of using the original map. This may be helpful when we want to avoid merging the results with another map.

map-vals-by-k clj

(map-vals-by-k f m)

(map-vals-by-k f m dst)

For each key and value of the given map m calls a function passed as the first argument (passing successive keys during calls to it) and generates a map with values updated by results returned by the function. When the third argument is given it should be a map on which operations are performed instead of using the original map. This may be helpful when we want to avoid merging the results with another map.

map-vals-by-kv clj

(map-vals-by-kv f m)

(map-vals-by-kv f m dst)

For each key and value of the given map m calls a function passed as the first argument (passing successive keys and values during calls to it) and generates a map with values updated by results returned by the function. When the third argument is given it should be a map on which operations are performed instead of using the original map. This may be helpful when we want to avoid merging the results with another map.

map-values clj

(map-values f coll)

Recursively transforms values of a map coll using function f. The function should take a value and return new value.

nil-existing-keys clj

(nil-existing-keys m keys)

nil-keys clj

(nil-keys m keys)

remove-empty-values clj

(remove-empty-values m)

remove-except clj

(remove-except m keyseq)

remove-if-value clj

(remove-if-value m pred)

remove-if-value-in clj

(remove-if-value-in m vals)

remove-if-value-not-in clj

(remove-if-value-not-in m vals)

update-bytes-to-strings clj

(update-bytes-to-strings coll k)

(update-bytes-to-strings coll k & keys)

update-existing clj

(update-existing coll k fun)

(update-existing coll k fun & more)

Updates the key k of the given collection coll by calling a function fun and passing optional arguments specified as additional arguments. Will not perform any update if the given key does not exist within the collection. Returns a collection.

update-if clj

(update-if coll k pred fun & more)

update-if-not clj

(update-if-not coll k pred fun & more)

update-missing clj

(update-missing coll k fun)

(update-missing coll k fun & more)

update-to-bytes clj

(update-to-bytes coll k)

(update-to-bytes coll k & keys)

update-values clj

(update-values map vmap)

(update-values map vmap create-keys?)

(update-values map vmap create-keys? remove-key-mark)

Returns the map with its values identified with keys from vmap updated with the associated functions from vmap.

update-values-or-seqs clj

(update-values-or-seqs map vmap)

(update-values-or-seqs map vmap create-keys?)

Returns the map with its values identified with keys from vmap updated with the associated functions from vmap.

update-values-or-seqs-recur clj

(update-values-or-seqs-recur map vmap)

(update-values-or-seqs-recur map vmap create-keys?)

Returns the map with its values identified with keys from vmap recursively updated with the associated functions from vmap. Shape is not reflected, second map (vmap) should be flat, searching for keys is recursive, including nested vectors.

update-values-recur clj

(update-values-recur map vmap)

(update-values-recur map vmap create-keys?)

Returns the map with its values identified with keys from vmap recursively updated with the associated functions from vmap. Shape is not reflected, second map (vmap) should be flat, searching for keys is recursive, including nested vectors.