base class for BSGS construction algorithms
More...
#include <base_construction.h>
|
| template<class ForwardIterator , class InputIterator > |
| void | setup (ForwardIterator generatorsBegin, ForwardIterator generatorsEnd, InputIterator prescribedBaseBegin, InputIterator prescribedBaseEnd, BSGS< PERM, TRANS > &bsgs, std::vector< std::list< typename PERM::ptr > > &S) const |
| | initializes BSGS object More...
|
| |
|
void | mergeGenerators (std::vector< std::list< typename PERM::ptr > > &S, BSGS< PERM, TRANS > &ret) const |
| | merges all strong generators in S into a single strong generating set ret.S
|
| |
|
|
dom_int | m_n |
| | cardinality of the set the group is acting on
|
| |
|
|
static const unsigned long * | empty = static_cast<unsigned long*>(0) |
| | auxilliary element marking an empty iterator
|
| |
template<class PERM, class TRANS>
class permlib::BaseConstruction< PERM, TRANS >
base class for BSGS construction algorithms
◆ BaseConstruction()
template<class PERM , class TRANS >
constructor
- Parameters
-
| n | cardinality of the set the group is acting on |
◆ setup()
template<class PERM , class TRANS >
template<class ForwardIterator , class InputIterator >
| void permlib::BaseConstruction< PERM, TRANS >::setup |
( |
ForwardIterator |
generatorsBegin, |
|
|
ForwardIterator |
generatorsEnd, |
|
|
InputIterator |
prescribedBaseBegin, |
|
|
InputIterator |
prescribedBaseEnd, |
|
|
BSGS< PERM, TRANS > & |
bsgs, |
|
|
std::vector< std::list< typename PERM::ptr > > & |
S |
|
) |
| const |
|
protected |
initializes BSGS object
- Parameters
-
| generatorsBegin | begin iterator of group generators of type PERM |
| generatorsEnd | end iterator of group generators of type PERM |
| prescribedBaseBegin | begin iterator of prescribed base of type unsigned long |
| prescribedBaseEnd | end iterator of prescribed base of type unsigned long |
| bsgs | BSGS object to work on |
| S | approximation of strong generating set to fill |
The documentation for this class was generated from the following file: