automaton-core.utils.map — org.clojars.hephaistox/automaton-core 1.1.1-la

Utility for map data structure

add-ids clj/s

(add-ids m)

Add the key to all map values (which are expected to be maps) Params:

• m map

apply-to-keys clj/s

(apply-to-keys maps f & ks)

Apply function f to each key in ks in the maps in maps Params:

• f fn with three arguments. First is k the key currently update (one of ks), second is m the current value of the m while it is updated, third is v the current value of key k in map m
• maps is a sequence of map
• ks keys in the map to apply f to

crush clj/s

(crush m)

Crush the map

deep-merge clj/s

(deep-merge & maps)

Deep merge nested maps. Last map has higher priority

This code comes from this gist

idx-of clj/s

(idx-of v value)

Return the index of the first found value in the sequence

idx-of-pred clj/s

(idx-of-pred v pred)

Same as idx-of but with a predicate

map-util-hashmappify-vals clj/s

(map-util-hashmappify-vals m modify-type-fn)

Converts an ordinary Clojure map into a Clojure map with nested map values recursively translated into what modify-type-fn is returning. Based on walk/stringify-keys. When key or value is nil, the pair is removed, as the hashmap doesn't allow null keys/values.

prefixify-children clj/s

(prefixify-children thing)

prefixify-map clj/s

(prefixify-map prefix thing)

prefixify-vec clj/s

(prefixify-vec prefix thing)

replace-keys clj/s

(replace-keys m1 m2)

Replace keys in m2 with keys from m1. Similiar to merge but non-existen keys in first map won't be added. e.g. (replace-keys {:a 3 :b 2} {:a 1}) -> {:a 3}

update-kw clj/s

(update-kw m kws f)

Update the keywords kws in map m with function f