Protocol for collection types that can implement reduce faster than first/next recursion. Called by clojure.core/reduce. Baseline implementation defined in terms of Iterable.
Protocol for collection types that can implement reduce faster than first/next recursion. Called by clojure.core/reduce. Baseline implementation defined in terms of Iterable.
(coll-reduce coll f)(coll-reduce coll f val)(datafy o)return a representation of o as data (default identity)
return a representation of o as data (default identity)
Protocol for concrete associative types that can reduce themselves via a function of key and val faster than first/next recursion over map entries. Called by clojure.core/reduce-kv, and has same semantics (just different arg order).
Protocol for concrete associative types that can reduce themselves via a function of key and val faster than first/next recursion over map entries. Called by clojure.core/reduce-kv, and has same semantics (just different arg order).
(kv-reduce amap f init)Protocol for concrete seq types that can reduce themselves faster than first/next recursion. Called by clojure.core/reduce.
Protocol for concrete seq types that can reduce themselves faster than first/next recursion. Called by clojure.core/reduce.
(internal-reduce seq f start)(nav coll k v)return (possibly transformed) v in the context of coll and k (a key/index or nil), defaults to returning v.
return (possibly transformed) v in the context of coll and k (a key/index or nil), defaults to returning v.
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |