eidolon.core
INDEXEDclj
A path that visits v and collects k in [[k v], ...].
This is useful if you want to collect a path to something, see path-walker
and path-finder.
A path that visits v and collects k in [[k v], ...]. This is useful if you want to collect a path to something, see [[path-walker]] and [[path-finder]].
INDEXED-SEQclj
A selector that visits all elements of a seq, and collects their indices.
This is useful if you want to collect a path to something, see path-walker
and path-finder.
A selector that visits all elements of a seq, and collects their indices. This is useful if you want to collect a path to something, see [[path-walker]] and [[path-finder]].
NESTEDclj
A navigator for junctions in nested data structures.
A navigator for junctions in nested data structures.
NESTED-PATHSclj
Like NESTED, but collects the path along the way.
Like [[NESTED]], but collects the path along the way.
path-finderclj
Finds the first entry matching pred in a deeply nested structure of maps
and vectors, and collects the path on the way there.
Finds the first entry matching `pred` in a deeply nested structure of maps and vectors, and collects the path on the way there.
path-walkerclj
Walks the first entry matching pred in a deeply nested structure of maps
and vectors, and collects the path on the way there.
This will do depth-first search. This is important, because if you use it with a transform, you may be modifying the tree in a way that invalidates the previously-collected path.
Like path-finder, but will recurse into matching entries. Hence, also
takes a recurse path to tell it how to continue recursing on matches. For
example, if you're matching a vector, you may want [[sr/ALL]]; if you're
matching a map, you may want [[sr/MAP-VALS]]. Of course, those wouldn't
collect that part of the path, so you might want INDEXED
or INDEXED-SEQ instead.
Walks the first entry matching `pred` in a deeply nested structure of maps and vectors, and collects the path on the way there. This will do depth-first search. This is important, because if you use it with a transform, you may be modifying the tree in a way that invalidates the previously-collected path. Like [[path-finder]], but will recurse into matching entries. Hence, also takes a recurse path to tell it how to continue recursing on matches. For example, if you're matching a vector, you may want [[sr/ALL]]; if you're matching a map, you may want [[sr/MAP-VALS]]. Of course, those wouldn't collect that part of the path, so you might want [[INDEXED]] or [[INDEXED-SEQ]] instead.
TREE-KEYSclj
A navigator for all of the map keys in a nested tree.
A navigator for all of the map keys in a nested tree.
TREE-LEAVESclj
A navigator for all of the leaves in a nested tree.
A navigator for all of the leaves in a nested tree.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close