- *deep-merge-handlers*
- assoc-if
- coll-append-at-head?
- collection?
- conj-at-index
- dedupe-by
- deep-mergeclj/s≠
- distinct-by
- filter-keys
- filter-vals
- find-first
- index-by
- index-of
- iterate-while
- iterator
- keep-current
- keep-new
- keys-set
- make-map-entry
- map-keys
- map-vals
- merge-defaults
- merge-grow
- native-map?
- queue
- remove-keys
- remove-vals
- restore-order
- sconj
- update-contained
- update-if
- value-merger
- vconj
- vector-compare
com.wsscode.misc.coll
assoc-ifclj/s
(assoc-if m k v)(assoc-if m k v & kvs)Like assoc, but noop if v is falsy.
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.
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.
Returns true for sequential collections and sets, false for maps.
conj-at-indexclj/s
(conj-at-index v idx x)Add element to a vector at some specific index. Only works with vectors!
Add element to a vector at some specific index. Only works with vectors!
dedupe-byclj/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.
Returns a lazy sequence removing consecutive duplicates in coll when passed to a function f. Returns a transducer when no collection is provided.
deep-mergeclj/s≠
(deep-merge & maps)(deep-merge)(deep-merge a)(deep-merge a b)(deep-merge a b & more)Recursively merges maps together. If all the maps supplied have nested maps under the same keys, these nested maps are merged.
A custom merge strategy may be configured for specific keys, to do so you need to bind the value of deep-merge-handlers, the keys are the keywords and the values are functions to handle the merge of that key.
(binding [*deep-merge-handlers* {:foo +}]
(deep-merge {:foo 1} {:foo 2}))
; => {:foo 3}
Another way to control the merge of values is to set some metadata to control the merge process (notice it only applies for types that support meta like maps and vectors, but not for keywords or numbers for example).
(deep-merge {:list [1 2 3]} ^{::merge-with into} {:list [:a :b]})
; => {:list [1 2 3 :a :b]}
The meta may go in the left or side of the merge, the right side has higher priority.
Note that meta mergers have higher priority than merge handlers.
Here is the merger pick order for clarity:
- Value merger from meta at new value
- Value merger from meta at current value
- Merge key handler
- Deep merge (in case both values are maps)
- Keep the new value (as in
clojure.core/merge)
Forked from Medley library.
Recursively merges maps together. If all the maps supplied have nested maps
under the same keys, these nested maps are merged.
A custom merge strategy may be configured for specific keys, to do so you need to
bind the value of *deep-merge-handlers*, the keys are the keywords and the values
are functions to handle the merge of that key.
(binding [*deep-merge-handlers* {:foo +}]
(deep-merge {:foo 1} {:foo 2}))
; => {:foo 3}
Another way to control the merge of values is to set some metadata to control the
merge process (notice it only applies for types that support meta like maps and vectors,
but not for keywords or numbers for example).
(deep-merge {:list [1 2 3]} ^{::merge-with into} {:list [:a :b]})
; => {:list [1 2 3 :a :b]}
The meta may go in the left or side of the merge, the right side has higher priority.
Note that meta mergers have higher priority than merge handlers.
Here is the merger pick order for clarity:
1. Value merger from meta at new value
2. Value merger from meta at current value
3. Merge key handler
4. Deep merge (in case both values are maps)
5. Keep the new value (as in `clojure.core/merge`)
Forked from Medley library.distinct-byclj/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.
Returns a lazy sequence of the elements of coll, removing any elements that return duplicate values when passed to a function f.
find-firstclj/s
(find-first f coll)Return the first element in coll that returns true for f.
Return the first element in coll that returns true for f.
index-byclj/s
(index-by f coll)Like group by, but will keep only the last result.
Like group by, but will keep only the last result.
index-ofclj/s
(index-of coll x)Find the index of element x in coll. Return nil if element is not found.
Find the index of element x in coll. Return nil if element is not found.
iterate-whileclj/s
(iterate-while f x)Like iterate, but stops when it sees a nil value.
Like iterate, but stops when it sees a `nil` value.
iteratorclj/s
(iterator coll)CLJC utility to get an iterator from the collection.
CLJC utility to get an iterator from the collection.
keep-currentclj/s
(keep-current a _)Merge util to keep the value from the left side.
Merge util to keep the value from the left side.
keep-newclj/s
(keep-new _ b)Merge util to keep the value from the right side.
Merge util to keep the value from the right side.
keys-setclj/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).
Return the map keys, as a set. This also checks if the entry is a map, otherwise returns nil (instead of throw).
make-map-entryclj/s
(make-map-entry k v)CLJC helper to create MapEntry.
CLJC helper to create MapEntry.
map-keysclj/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 over the given hash-map keys.
Example:
(map-keys #(str/replace (name %) "_" "-") {"foo_bar" 1}) => {"foo-bar" 1}
map-valsclj/s
(map-vals f m)Map over the given hash-map vals.
Example: (map-vals inc {:a 1 :b 2})
Map over the given hash-map vals.
Example:
(map-vals inc {:a 1 :b 2})
merge-defaultsclj/s
(merge-defaults m defaults)Like merge, but only add keys that are not present in the original map.
Like merge, but only add keys that are not present in the original map.
merge-growclj/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.
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.
queueclj/s
(queue)(queue coll)Return a blank immutable queue or create one from coll.
Return a blank immutable queue or create one from coll.
restore-orderclj/s
(restore-order inputs key items)(restore-order inputs key items default-fn)Sorts output list to match input list order.
Sorts output list to match input list order.
update-containedclj/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 some key when that key is present in the map.
update-ifclj/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 if that key is present in the map and value is truthy.
Update some key if that key is present in the map and value is truthy.
vector-compareclj/s
(vector-compare [value1 & rest1] [value2 & rest2])Compare two vectors, this expects the vectors to be ordered.
Compare two vectors, this expects the vectors to be ordered.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close