mCRL2
|
Implementations of algorithms. More...
Go to the source code of this file.
Namespaces | |
namespace | atermpp |
The main namespace for the aterm++ library. | |
namespace | atermpp::detail |
Functions | |
template<typename Function > | |
aterm | atermpp::detail::appl_apply (const aterm &a, const Function f) |
Applies the function f to all children of a. | |
template<typename UnaryFunction > | |
UnaryFunction | atermpp::detail::for_each_impl (aterm t, UnaryFunction op) |
Implements the for_each algorithm. | |
template<typename MatchPredicate > | |
bool | atermpp::detail::find_if_impl (const aterm &t, MatchPredicate match, aterm &output) |
Implements the find_if algorithm If the term t is found, it is stored in output and true is returned. | |
template<typename MatchPredicate , typename OutputIterator > | |
void | atermpp::detail::find_all_if_impl (const aterm &t, MatchPredicate op, OutputIterator &destBegin) |
Implements the find_all_if algorithm. | |
template<typename MatchPredicate , typename StopPredicate > | |
aterm | atermpp::detail::partial_find_if_impl (const aterm &t, MatchPredicate match, StopPredicate stop) |
Implements the partial_find_if_impl algorithm. | |
template<typename MatchPredicate , typename StopPredicate , typename OutputIterator > | |
void | atermpp::detail::partial_find_all_if_impl (const aterm &t, MatchPredicate match, StopPredicate stop, OutputIterator &destBegin) |
Implements the partial_find_all_if algorithm. | |
Implementations of algorithms.
Definition in file algorithm_impl.h.