common-clj.misc — lucasmafra/common-clj 1.4.0

camelcase->dash clj

(camelcase->dash m)

dash->underscore clj

(dash->underscore m)

Inverse of underscore->dash Example: => (dash->underscore {:foo-bar {:bar-foo 1}}) {:foo_bar {:bar_foo 1}}

for-map clj macro

(for-map seq-exprs key-expr val-expr)

(for-map m-sym seq-exprs key-expr val-expr)

Like 'for' for building maps. Same bindings except the body should have a key-expression and value-expression. If a key is repeated, the last value (according to "for" semantics) will be retained. (= (for-map [i (range 2) j (range 2)] [i j] (even? (+ i j))) {[0 0] true, [0 1] false, [1 0] false, [1 1] true}) An optional symbol can be passed as a first argument, which will be bound to the transient map containing the entries produced so far.

map-keys clj

(map-keys f m)

Build map k -> (f v) for [k v] in map, preserving the initial type

map-vals clj

(map-vals f m)

Build map k -> (f v) for [k v] in map, preserving the initial type

map-vals-with-key clj

(map-vals-with-key f m)

Build map k -> (f v) for [k v] in map, preserving the initial type

replace-char clj

(replace-char s from to exceptions)

Inputs: [s :- string-or-keyword from :- Character to :- Character exceptions :- #{s/Keyword}] Returns: s/Keyword

replace-char-gen clj

(replace-char-gen from to)

(replace-char-gen from to exceptions)

Inputs: ([from :- Character to :- Character] [from :- Character to :- Character exceptions :- #{s/Keyword}]) Returns: (s/pred fn?)

string-or-keyword clj

underscore->dash clj

(underscore->dash m)

Convert hash-map underscored keywords to dash. Example: => (underscore->dash {:foo_bar {:bar_foo 1}}) {:foo-bar {:bar-foo 1}}

vectorize clj

(vectorize x)

Recursively transforms all seq in m to vectors. Because maybe you want to use core.match with it.