permlib 0.2.9
Library for permutation computations
Loading...
Searching...
No Matches
permlib::TrivialRedundantBasePointInsertionStrategy< PERM, TRANS > Class Template Reference

insertion position after first non-trivial transversal More...

#include <redundant_base_point_insertion_strategy.h>

Inheritance diagram for permlib::TrivialRedundantBasePointInsertionStrategy< PERM, TRANS >:
permlib::RedundantBasePointInsertionStrategy< PERM, TRANS >

Public Member Functions

 TrivialRedundantBasePointInsertionStrategy (const BSGS< PERM, TRANS > &bsgs)
 constructor
 
virtual int findInsertionPoint (dom_int beta, std::list< typename PERM::ptr > &S_i) const
 finds possible insertion point for base point
 
- Public Member Functions inherited from permlib::RedundantBasePointInsertionStrategy< PERM, TRANS >
 RedundantBasePointInsertionStrategy (const BSGS< PERM, TRANS > &bsgs)
 constructor
 

Additional Inherited Members

- Protected Attributes inherited from permlib::RedundantBasePointInsertionStrategy< PERM, TRANS >
const BSGS< PERM, TRANS > & m_bsgs
 BSGS to work on.
 

Detailed Description

template<class PERM, class TRANS>
class permlib::TrivialRedundantBasePointInsertionStrategy< PERM, TRANS >

insertion position after first non-trivial transversal

Member Function Documentation

◆ findInsertionPoint()

template<class PERM, class TRANS>
virtual int permlib::TrivialRedundantBasePointInsertionStrategy< PERM, TRANS >::findInsertionPoint ( dom_int beta,
std::list< typename PERM::ptr > & S_i ) const
inlinevirtual

finds possible insertion point for base point

Parameters
betabase point to be inserted
S_igenerators for i-th fundamental orbit where i is the insert position found
Returns
insert position; if negative then beta is already base point at position -$retVal-1

Implements permlib::RedundantBasePointInsertionStrategy< PERM, TRANS >.


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