33#ifndef NEWBASECHANGE_H_
34#define NEWBASECHANGE_H_
36#include <permlib/change/base_change.h>
37#include <permlib/generator/bsgs_random_generator.h>
38#include <permlib/construct/random_schreier_sims_construction.h>
43template<
class PERM,
class TRANS>
52 template <
class InputIterator>
53 void change(
BSGS<PERM,TRANS> &bsgs, InputIterator baseBegin, InputIterator baseEnd,
bool skipRedundant =
false)
const;
60template<
class PERM,
class TRANS>
63 rssc(bsgs.n, rng, bsgs.order())
66template<
class PERM,
class TRANS>
71template<
class PERM,
class TRANS>
72template <
class InputIterator>
74 bool guarantee =
false;
75 bsgs = rssc.construct(bsgs.
S.begin(), bsgs.
S.end(), baseBegin, baseEnd, guarantee);
76 BOOST_ASSERT(guarantee);
generates uniformly distributed random group elements based on an existing BSGS
Definition bsgs_random_generator.h:43
BaseChange()
constructor
Definition base_change.h:49
~NewBaseChange()
destructor
Definition new_base_change.h:67
void change(BSGS< PERM, TRANS > &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant=false) const
changes base of bsgs so that it starts with the sequence given by baseBegin to baseEnd
Definition new_base_change.h:73
NewBaseChange(const BSGS< PERM, TRANS > &bsgs)
constructor
Definition new_base_change.h:61
abstract base class for random group element generators
Definition random_generator.h:42
BSGS construction with Random Schreier-Sims algorithm.
Definition random_schreier_sims_construction.h:51
PERMlist S
strong generating set
Definition bsgs_core.h:57
Represents a base and strong generating set (BSGS)
Definition bsgs.h:89