prf::CompositePredicate< T > Class Template Reference

A composite predicate class. More...

#include <CompositePredicate.hh>

Detailed Description

template<class T>
class prf::CompositePredicate< T >

An arbitrary logical composite of several predicates can be represented as a binary tree, where each node is either a simple predicate, or a predicate whose value is calculated using the results of the evaluation of the daughter nodes and their combination with a logical operator. This class is meant to represent that abstract idea of composition. The exact nature of the predicates does not matter for the tree structure of the composites. Using the helper class SimplePredicate, it is possible to leave the exact way the predicates handle the data entirely out of consideration when compositing. In other words, one can composite two predicates which do entirely unrelated operations on the data.

---

The documentation for this class was generated from the following file:

• model/Aux/CompositePredicate.hh