17 void do_list(
const Ex& tr, Ex::iterator it, std::function<
bool(Ex::iterator)> f);
24 int list_size(
const Ex& tr, Ex::iterator it);
30 Ex::iterator
find_in_list(
const Ex& tr, Ex::iterator it, std::function<Ex::iterator(Ex::iterator)> f);
36 Ex::iterator
find_in_subtree(
const Ex& tr, Ex::iterator it, std::function<
bool(Ex::iterator)> f,
bool including_head=
true);
53 typename T::iterator
do_subtree(
const T& tr,
typename T::iterator it, std::function<
typename T::iterator(
typename T::iterator)> f)
55 if(it==tr.end())
return it;
57 class T::post_order_iterator walk=it, last=it;
66 if(walk==it) cpy=
true;
Ex::iterator find_in_subtree(const Ex &tr, Ex::iterator it, std::function< bool(Ex::iterator)> f, bool including_head)
Returns an iterator to the first element for which 'f' returns 'true', or 'tr.end()'.
Definition: Functional.cc:33
void do_list(const Ex &tr, Ex::iterator it, std::function< bool(Ex::iterator)> f)
Apply a function on every element of a list, or if the iterator 'it' does not point to a list...
Definition: Functional.cc:6
T::iterator do_subtree(const T &tr, typename T::iterator it, std::function< typename T::iterator(typename T::iterator)> f)
Apply a function on every node in the tree at and below the given node, depth-first.
Definition: Functional.hh:53
Ex make_list(Ex el)
Ensure that the tree is a list, even if it contains only a single element.
Definition: Functional.cc:76
Ex::iterator find_in_list(const Ex &tr, Ex::iterator it, std::function< Ex::iterator(Ex::iterator)> f)
Returns an iterator to the first element for which 'f' does not return tr.end().
Definition: Functional.cc:59
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Algorithm.cc:1045
int list_size(const Ex &tr, Ex::iterator it)
For lists as defined above for 'do_list', return their size (in case you really need to know the size...
Definition: Functional.cc:25