DiaDes
0.1
DIAgnosis of Discrete-Event System
|
#include <algorithm>
Go to the source code of this file.
Namespaces | |
Diades | |
Namespace of the Diades project. | |
Diades::Utils | |
Functions | |
template<typename InputIterator > | |
IsIn< InputIterator > | Diades::Utils::isIn (InputIterator first, InputIterator last) |
template<typename InputIterator > | |
IsNotIn< InputIterator > | Diades::Utils::isNotIn (InputIterator first, InputIterator last) |
template<typename InputIterator , typename OutputIterator1 , typename OutputIterator2 , typename _UnaryPredicate > | |
void | Diades::Utils::dispatch (InputIterator first, InputIterator last, OutputIterator1 output1, OutputIterator2 output2, _UnaryPredicate predicate) |
template<class F , class G , class H > | |
CompositionFunctorFGxHx< F, G, H > | Diades::Utils::fgxhx (const F &f, const G &g, const H &h) |
template<class F , class G > | |
CompositionFunctorFGx< F, G > | Diades::Utils::fgx (const F &f, const G &g) |
template<class F , class G , class H > | |
CompositionFunctorFGxHy< F, G, H > | Diades::Utils::fgxhy (const F &f, const G &g, const H &h) |
template<class Predicate1 , class Predicate2 > | |
UnaryAnd< Predicate1, Predicate2 > | Diades::Utils::unaryAnd (const Predicate1 &p1, const Predicate2 &p2) |
template<class Predicate1 , class Predicate2 > | |
UnaryOr< Predicate1, Predicate2 > | Diades::Utils::unaryOr (const Predicate1 &p1, const Predicate2 &p2) |
template<class Predicate1 , class Predicate2 > | |
BinaryAnd< Predicate1, Predicate2 > | Diades::Utils::binaryAnd (const Predicate1 &p1, const Predicate2 &p2) |
template<class Predicate1 , class Predicate2 > | |
BinaryOr< Predicate1, Predicate2 > | Diades::Utils::binaryOr (const Predicate1 &p1, const Predicate2 &p2) |