com.wsscode.misc.coll — com.wsscode/cljc-misc 2021.07.24

assoc-if clj/s

(assoc-if m k v)

(assoc-if m k v & kvs)

Like assoc, but noop if v is falsy.

coll-append-at-head? clj/s

(coll-append-at-head? s)

Return true if column add items at head with conj.

collection? clj/s

(collection? x)

Returns true for sequential collections and sets, false for maps.

conj-at-index clj/s

(conj-at-index v idx x)

Add element to a vector at some specific index. Only works with vectors!

dedupe-by clj/s

(dedupe-by f)

(dedupe-by f coll)

Returns a lazy sequence removing consecutive duplicates in coll when passed to a function f. Returns a transducer when no collection is provided.

distinct-by clj/s

(distinct-by f)

(distinct-by f coll)

Returns a lazy sequence of the elements of coll, removing any elements that return duplicate values when passed to a function f.

filter-keys clj/s

(filter-keys f m)

filter-vals clj/s

(filter-vals f m)

find-first clj/s

(find-first f coll)

Return the first element in coll that returns true for f.

index-by clj/s

(index-by f coll)

Like group by, but will keep only the last result.

index-of clj/s

(index-of coll x)

Find the index of element x in coll. Return nil if element is not found.

iterate-while clj/s

(iterate-while f x)

Like iterate, but stops when it sees a nil value.

iterator clj/s

(iterator coll)

CLJC utility to get an iterator from the collection.

keys-set clj/s

(keys-set m)

Return the map keys, as a set. This also checks if the entry is a map, otherwise returns nil (instead of throw).

make-map-entry clj/s

(make-map-entry k v)

CLJC helper to create MapEntry.

map-keys clj/s

(map-keys f m)

Map over the given hash-map keys.

Example: (map-keys #(str/replace (name %) "_" "-") {"foo_bar" 1}) => {"foo-bar" 1}

map-vals clj/s

(map-vals f m)

Map over the given hash-map vals.

Example: (map-vals inc {:a 1 :b 2})

merge-defaults clj/s

(merge-defaults m defaults)

Like merge, but only add keys that are not present in the original map.

merge-grow clj/s

(merge-grow)

(merge-grow a)

(merge-grow a b)

Additive merging.

When merging maps, it does a deep merge. When merging sets, makes a union of them.

When value of the right side is nil, the left side will be kept.

For the rest works as standard merge.

native-map? clj/s

(native-map? x)

queue clj/s

(queue)

(queue coll)

Return a blank immutable queue or create one from coll.

remove-keys clj/s

(remove-keys f m)

remove-vals clj/s

(remove-vals f m)

restore-order clj/s

(restore-order inputs key items)

(restore-order inputs key items default-fn)

Sorts output list to match input list order.

sconj clj/s

update-contained clj/s

(update-contained m k f)

(update-contained m k f a1)

(update-contained m k f a1 a2)

(update-contained m k f a1 a2 a3)

(update-contained m k f a1 a2 a3 & args)

Update some key when that key is present in the map.

update-if clj/s

(update-if m k f)

(update-if m k f a1)

(update-if m k f a1 a2)

(update-if m k f a1 a2 a3)

(update-if m k f a1 a2 a3 & args)

Update some key that key is present in the map and value is truthy.

vconj clj/s

vector-compare clj/s

(vector-compare [value1 & rest1] [value2 & rest2])

Compare two vectors, this expects the vectors to be ordered.