convert a tree representation like this ((0 a) (1 b) (2 c) (1 d)) to this (a (b c) d).
cases like ((0 a) (3 b) (0 c)) are converted to (a ((b)) c)

convert a tree representation like this ((0 a) (1 b) (2 c) (1 d)) to this (a (b (c) d))

map the nesting-depth of each element with operator and arguments.
the lowest possible depth is bounded to zero.
example:
(denoted-tree-adjust-depth a + 1)

decrease nesting-depth for all element until at least one element has a nesting-depth of zero

denoted-tree but the nesting-depth number corresponds to prefix-tree interpretation. example
(a b (c (d e)) f) -> ((0 . a) (1 . b) (2 . c) (3 . d) (3 . e) (0 . 4))

converts list structures like (or a b (and c d)) to (a or b or (c and d))
the optional procedure translates prefixes

regard tree as a nested list representation of a filesystem file and directory structure
and return a flat list of filesystem path strings.
example:
(prefix-tree->paths (list \"/usr\" (list \"bin\" (list \"share\" \"guile\") \"include\") \"/var\"))
creates
(list
\"/usr/bin\"
\"/usr/share/guile\"
\"/usr/include\"
\"/var\")

create a list of all individual relations between prefix and tail elements or tail element prefixes.
example:
((a (b c (d e)))) -> ((a . b) (b . c) (b . d) (d . e))

true if pattern exists in prefix-tree with the same tree interpretation as prefix-tree-context-produce.
example: (a b (d c)) contains patterns (a d c) and (a b) and (a d)

{any:prefix list:tail} list -> list
map only lists, split into prefix and tail

procedure:{prefix tail} procedure:{list procedure:f procedure:continue:{list ->}} list -> list
maps over only the lists, split into prefix and tail.
the procedure continue& gets a procedure argument that when called continues the iteration. if it is not called,
the iteration stops and the result of continue& is the main result

{any:prefix list:tail any} {list procedure:f {list ->} any}:continue list [{integer -> integer}] -> list
like prefix-tree-map-c but with additional arguments for the current nesting-depth

like prefix-tree-map but with an additional argument for the current nesting-depth

denoted-tree-->flat but the nesting-depth number corresponds to prefix-tree interpretation

{any list:upper-prefixes} list -> list
like (prefix-tree-map) but with an additional argument for parent prefixes

calls f for each combination of prefix and tail

context is a list containing nested-list prefixes in bottom-to-top order.
for example (a (d e f) k (g h i) j) leads to f called with each of the following arguments:
(d (a)), (e (d a)), (f (d a)),(k (a)), (g (a)), (h (g a)), (i (g a)), (j (a))
ignore-prefixes ignores lists that are themselves prefixes

like prefix-tree-produce-with-context but lists can be used as list prefixes for many-to-many relations

replace all list prefixes, the first element of a list, in tree based on the given replacements structure

convert a tree to an association list where each element is a list having a nesting-depth number
as the first element. similar to this is the usage of indentation for nesting depth.
(a b (c (d e)) f) -> ((0 . a) (0 . b) (1 . c) (2 . d) (2 . e) (0 . f))

call f with each tree element list or leaf from top to bottom and return the first true result of f.
can be used to extract single elements from tree. aliased as tree-any and tree-extract

like tree-contains? but true only if every of the search-values has been found

like tree-contains? but true only if any of the search-values is not contained

like tree-contains? and true if any of the search-values is found

compares all list and non-list elements with search-value and returns true on a match

call f for every element in tree, lists and non-lists.
list elements left to right, nested lists bottom to top.
tree-for-each

call f for each non-list element in tree

call f with each tree element list or leaf from top to bottom and return the first true result of f.
can be used to extract single elements from tree. aliased as tree-any and tree-extract

call predicate for each non-list and list element in tree and
only keep the elements for which predicate returned true.
elements left to right, nested lists bottom to top.
example
(tree-filter (l (a) (or (list? a) (even? a))) (q (1 2 3 (4 5 (6 7) (8 9 10)))))
->
(2 (4 (6) (8 10)))

results in a flat list of all list and non-lists elements of tree
for which predicate returned true

like tree-filter but calls predicate only for non-list elements

like tree-filter but calls predicate only for list elements.
example - keep only lists with more than 3 elements
(tree-filter-lists (l (a) (< 3 (length a))) (q (1 2 3 (4 5 (6 7) (8 9 10)))))
->
(1 2 3)

find a sub-tree that contains an element that matches predicate

call f with each tree list and leaf from top to bottom and return true results of f

fold over all lists and non-list elements in tree
elements from left to right, nested lists bottom to top.
lists passed to f will be fold results from list elements that have already been processed.
see tree-fold-right for examples

procedure:{element result integer:depth} any tree [integer:depth procedure:{integer -> integer}] -> any
like tree-fold but keeps track of the current nesting depth

fold over all list and non-list elements in tree.
elements from left to right, nested lists bottom to top
example 1
(tree-fold-right
(l (a r) (pair a r))
(list)
(q (1 2 3 (4 5 (6 7) (8 9 10)))))
->
(q (1 2 3 (4 5 (6 7) (8 9 10))))
example 2
(tree-fold-right
(l (a r) (if (list? a) a (if (even? a) (pair a r) r)))
(list) (q (1 2 3 (4 5 (6 7) (8 9 10)))))
->
(q (1 2 3 (4 5 (6 7) (8 9 10))))

fold over all list and non-list elements in tree.
elements from left to right, nested lists bottom to top

maps elements left to right and nested lists bottom to top.
not map the topmost tree structure itself.

procedure:{any:element integer:depth} list [integer] -> list
like tree-map but also passes a number for the current nesting depth to f

map elements of tree to a flat list. apply f with a number
stating how deeply the element is nested in other lists and the current element

call f only with non-list elements, all other elements are kept

like tree-map but pass only the lists in tree to f, skipping and keeping non-list elements. bottom-to-top

like tree-map-lists with additional arguments for the current nesting depth

like tree-map-and-self but calls f only for list elements

like tree-map-lists but also map the given list itself

like tree-map but can carry and update a number of custom values per call, similar to fold-multiple

map over lists and sub-lists using the given map procedure, which needs to have the same
signature as \"map\".
maps from bottom to top

call f with each ordered combination between elements of two lists with a
map procedure that is called nested like
(each (lambda (a) (each (lambda (b) (f a b)) b)) a)

maps from top to bottom.
list results of f will be entered for further mapping.
this procedure is used to map sub-lists before eventually
mapping their elements if the map result is a list

apply f with every possible ordered combination of list and non-list elements of trees.
traverses like tree-map

like tree-produce only for list elements

{any:element-a any:element-b integer:depth-a integer:depth-b} list:list-a list:list-b [{integer -> integer} integer] -> list

searches through tree recursively, collecting all elements (including lists) that match collect-proc, then calls
f with a list of matched elements. the result of f must of length zero (no replacement) or matched-element-count (replaces all matches).
results in the tree with the matched elements are replaced in order by the result elements from calling f

replace each non-list element in tree that matches replace? with the next element from replacements.
it is an error if there are more replacements than matches

merge nested lists with that match predicate with their parent list.
example
(tree-splice (l (a) (= 3 (length a))) (q (1 2 3 (4 5 (6 7) (8 9 10)))))
->
(1 2 3 (4 5 (6 7) 8 9 10))

descend :: any:element procedure:recurse-descend -> (any:result-element boolean:continue?)
ascend :: any:element -> any:result-element
terminal :: any:element -> any:result-element
map/transform list and sub-lists first top to bottom, calling \"descend\" for each sub-list,
then bottom to top, calling \"ascend\" for lists and \"terminal\" for non-lists/leafs.
descend should return a list of two values: the first for the result and the second a boolean indicating if the result
should be passed to ascend and terminal (true) or if that should be skipped (false).
example use cases:
* compile s-expression list trees into string output languages by mapping all expressions and sub-expressions to strings
* replace some lists in a tree

descend :: any:element procedure:recurse-descend any:state ... -> (any:result-element boolean:continue? any:state ...)
ascend :: any:element any:state ... -> (any:result-element any:state ...)
terminal :: any:element any:state ... -> (any:result-element any:state ...)
like tree-transform but also takes, passes and updates caller specified values

a tree-transform descend procedure that does not do anything