coset-type predicate for group elements that map one set of points onto another given set of points More...
#include <set_image_predicate.h>
Public Member Functions | |
template<class InputIterator > | |
SetImagePredicate (InputIterator deltaBegin, InputIterator deltaEnd, InputIterator gammaBegin, InputIterator gammaEnd) | |
constructor | |
virtual bool | operator() (const PERM &p) const |
true iff group element fulfills predicate | |
virtual bool | childRestriction (const PERM &h, uint i, ulong beta_i) const |
checks if a given group element should not be followed in backtrack search | |
virtual uint | limit () const |
limit of recursion depth in backtrack search | |
template<class InputIterator > | |
SetImagePredicate (InputIterator deltaBegin, InputIterator deltaEnd, InputIterator gammaBegin, InputIterator gammaEnd) | |
constructor | |
virtual bool | operator() (const PERM &p) const |
true iff group element fulfills predicate | |
virtual bool | childRestriction (const PERM &h, uint i, ulong beta_i) const |
checks if a given group element should not be followed in backtrack search | |
virtual uint | limit () const |
limit of recursion depth in backtrack search |
coset-type predicate for group elements that map one set of points onto another given set of points
holds for a such that
for two given sets
permlib::SetImagePredicate< PERM >::SetImagePredicate | ( | InputIterator | deltaBegin, | |
InputIterator | deltaEnd, | |||
InputIterator | gammaBegin, | |||
InputIterator | gammaEnd | |||
) | [inline] |
constructor
deltaBegin | begin iterator for source list of points (ulong) mapped to be onto target | |
deltaEnd | end iterator for source list of points (ulong) mapped to be onto target | |
gammaBegin | begin iterator for target list of points (ulong) | |
gammaEnd | end iterator for target list of points (ulong) |
permlib::SetImagePredicate< PERM >::SetImagePredicate | ( | InputIterator | deltaBegin, | |
InputIterator | deltaEnd, | |||
InputIterator | gammaBegin, | |||
InputIterator | gammaEnd | |||
) | [inline] |
constructor
deltaBegin | begin iterator for source list of points (ulong) mapped to be onto target | |
deltaEnd | end iterator for source list of points (ulong) mapped to be onto target | |
gammaBegin | begin iterator for target list of points (ulong) | |
gammaEnd | end iterator for target list of points (ulong) |
virtual bool permlib::SetImagePredicate< PERM >::childRestriction | ( | const PERM & | h, | |
uint | i, | |||
ulong | beta_i | |||
) | const [virtual] |
checks if a given group element should not be followed in backtrack search
If returns false then element h that arises at backtrack level i with corresponding base element beta_i will not extend to a "complete" group element that fulfills the predicate
h | (partial) group element, arising in the backtrack search | |
i | backtrack recursion level | |
beta_i | base element corresponding to current backtrack recursion level |
Implements permlib::SubgroupPredicate< PERM >.
bool permlib::SetImagePredicate< PERM >::childRestriction | ( | const PERM & | h, | |
uint | i, | |||
ulong | beta_i | |||
) | const [inline, virtual] |
checks if a given group element should not be followed in backtrack search
If returns false then element h that arises at backtrack level i with corresponding base element beta_i will not extend to a "complete" group element that fulfills the predicate
h | (partial) group element, arising in the backtrack search | |
i | backtrack recursion level | |
beta_i | base element corresponding to current backtrack recursion level |
Implements permlib::SubgroupPredicate< PERM >.
virtual uint permlib::SetImagePredicate< PERM >::limit | ( | ) | const [virtual] |
limit of recursion depth in backtrack search
only images of the #{limit()} first base points have to be considered
Implements permlib::SubgroupPredicate< PERM >.
uint permlib::SetImagePredicate< PERM >::limit | ( | ) | const [inline, virtual] |
limit of recursion depth in backtrack search
only images of the #{limit()} first base points have to be considered
Implements permlib::SubgroupPredicate< PERM >.