insertion position after first non-trivial transversal More...
#include <redundant_base_point_insertion_strategy.h>
Public Member Functions | |
TrivialRedundantBasePointInsertionStrategy (const BSGS< PERM, TRANS > &bsgs) | |
constructor | |
virtual int | findInsertionPoint (uint beta, PERMlist &S_i) const |
finds possible insertion point for base point | |
TrivialRedundantBasePointInsertionStrategy (const BSGS< PERM, TRANS > &bsgs) | |
constructor | |
virtual int | findInsertionPoint (uint beta, PERMlist &S_i) const |
finds possible insertion point for base point |
insertion position after first non-trivial transversal
virtual int permlib::TrivialRedundantBasePointInsertionStrategy< PERM, TRANS >::findInsertionPoint | ( | uint | beta, | |
PERMlist & | S_i | |||
) | const [inline, virtual] |
finds possible insertion point for base point
beta | base point to be inserted | |
S_i | generators for i-th fundamental orbit where i is the insert position found |
Implements permlib::RedundantBasePointInsertionStrategy< PERM, TRANS >.
virtual int permlib::TrivialRedundantBasePointInsertionStrategy< PERM, TRANS >::findInsertionPoint | ( | uint | beta, | |
PERMlist & | S_i | |||
) | const [inline, virtual] |
finds possible insertion point for base point
beta | base point to be inserted | |
S_i | generators for i-th fundamental orbit where i is the insert position found |
Implements permlib::RedundantBasePointInsertionStrategy< PERM, TRANS >.