permlib
0.2.6
Library for permutation computations
|
strategy for redundant base point insertion More...
#include <redundant_base_point_insertion_strategy.h>
Public Member Functions | |
RedundantBasePointInsertionStrategy (const BSGS< PERM, TRANS > &bsgs) | |
constructor | |
virtual int | findInsertionPoint (dom_int beta, std::list< typename PERM::ptr > &S_i) const =0 |
finds possible insertion point for base point | |
Protected Attributes | |
const BSGS< PERM, TRANS > & | m_bsgs |
BSGS to work on. |
strategy for redundant base point insertion
permlib::RedundantBasePointInsertionStrategy< PERM, TRANS >::RedundantBasePointInsertionStrategy | ( | const BSGS< PERM, TRANS > & | bsgs | ) | [inline] |
constructor
bsgs | BSGS to work on |
virtual int permlib::RedundantBasePointInsertionStrategy< PERM, TRANS >::findInsertionPoint | ( | dom_int | beta, |
std::list< typename PERM::ptr > & | S_i | ||
) | const [pure 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 |
Implemented in permlib::FirstRedundantBasePointInsertionStrategy< PERM, TRANS >, and permlib::TrivialRedundantBasePointInsertionStrategy< PERM, TRANS >.