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

Associates k with val (and optional further pairs) in coll only when pred is truthy. Returns coll unchanged otherwise.

Associates k with val in coll only when the current value at k satisfies predicate pred. Returns coll unchanged otherwise.

Associates k with val (and optional further pairs) in coll only when pred is falsy. Returns coll unchanged otherwise.

Associates k with val in coll only when the current value at k does NOT satisfy predicate pred. Returns coll unchanged otherwise.

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

Removes key k from map m when the value at k satisfies predicate pred. Returns m unchanged otherwise.

Like clojure.core/assoc-in but removes entries. Leaves empty maps.

Returns a map map with the keys present in kmap duplicated under new names according to the values in kmap.

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

Creates a lazy map from a literal map. All values are unrealized.

Like clojure.core/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.

Returns true if the given argument is a lazy map.

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.

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.

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 key names generated 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.

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

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

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.

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.

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.

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

Recursively transforms values of a map coll using function f. The function should take a value and a sequence of visited keys (stored in a vector), and return a new value.

Recursively transforms values of a map coll using function f. The function should take a value and a sequence of visited keys in reverse order (stored in a persistent list), and return a new value.

Merges two lazy maps.

Sets the values of given keys to nil in map m, but only for keys that already exist in the map. Returns nil when m is nil.

Sets the values of all given keys to nil in map m, adding keys that did not exist. Returns nil when m is nil.

Returns an empty map if the argument is nil. Otherwise returns its argument.

Faster version of assoc with some of the checks and conversions disabled. Associates key a with value b in mp. If mp is nil it creates a new map.

Macro that expands into a chain of .assoc calls on mp for the given key–value pairs kvs. Expects an even number of key–value arguments.

Similar to clojure.core/update, updates a value in an associative structure, where k is a key and f is a function which will take the old value and any supplied args and return the new value, and returns a new structure. Uses qassoc instead of clojure.core/assoc internally.

If the key does not exist, nil is passed as the old value.

Removes all entries from map m whose values are nil or empty (in the seq sense).

Returns a map containing only the keys from keyseq. Equivalent to select-keys.

Removes all entries from map m whose values satisfy predicate pred.

Removes all entries from map m whose values are contained in the collection vals.

Removes all entries from map m whose values are NOT contained in the collection vals. When vals is nil, returns an empty map.

Like clojure.core/select-keys but preserves unrealized values as they are.

Converts the given map to a lazy map.

Converts the value(s) at the given key(s) in coll from byte arrays to strings using bytes-to-string, skipping values that are not byte arrays.

Updates the given key k of 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 updated collection.

If fun is not a function it will be made one by using constantly.

Updates the value at key k in coll by applying fun (with optional extra args) only when the current value satisfies predicate pred. If k is absent or pred returns false, coll is returned unchanged.

Updates the value at key k in coll by applying fun (with optional extra args) only when the current value does NOT satisfy predicate pred. If k is absent or pred returns true, coll is returned unchanged.

Updates the given key k of coll by calling a function fun and passing optional arguments specified as additional arguments. Will not perform any update if the given key exists within the collection, therefore the function will always receive nil as its argument. Returns updated collection.

If fun is not a function it will be made one by using constantly.

Converts the value(s) at the given key(s) in coll to byte arrays using normalize-to-bytes, skipping values that are already byte arrays.

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

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

Returns a 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.

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.