permlib  0.2.9
Library for permutation computations
new_base_change.h
1 // ---------------------------------------------------------------------------
2 //
3 // This file is part of PermLib.
4 //
5 // Copyright (c) 2009-2011 Thomas Rehn <thomas@carmen76.de>
6 // All rights reserved.
7 //
8 // Redistribution and use in source and binary forms, with or without
9 // modification, are permitted provided that the following conditions
10 // are met:
11 // 1. Redistributions of source code must retain the above copyright
12 // notice, this list of conditions and the following disclaimer.
13 // 2. Redistributions in binary form must reproduce the above copyright
14 // notice, this list of conditions and the following disclaimer in the
15 // documentation and/or other materials provided with the distribution.
16 // 3. The name of the author may not be used to endorse or promote products
17 // derived from this software without specific prior written permission.
18 //
19 // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 // IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28 // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 //
30 // ---------------------------------------------------------------------------
31 
32 
33 #ifndef NEWBASECHANGE_H_
34 #define NEWBASECHANGE_H_
35 
36 #include <permlib/change/base_change.h>
37 #include <permlib/generator/bsgs_random_generator.h>
38 #include <permlib/construct/random_schreier_sims_construction.h>
39 
40 namespace permlib {
41 
43 template<class PERM, class TRANS>
44 class NewBaseChange : public BaseChange<PERM,TRANS> {
45 public:
47  NewBaseChange(const BSGS<PERM,TRANS> &bsgs);
50 
52  template <class InputIterator>
53  void change(BSGS<PERM,TRANS> &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant = false) const;
54 private:
57 };
58 
59 
60 template<class PERM, class TRANS>
62  : rng(new BSGSRandomGenerator<PERM,TRANS>(bsgs)),
63  rssc(bsgs.n, rng, bsgs.order())
64 { }
65 
66 template<class PERM, class TRANS>
68  delete rng;
69 }
70 
71 template<class PERM, class TRANS>
72 template <class InputIterator>
73 void NewBaseChange<PERM,TRANS>::change(BSGS<PERM,TRANS> &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant) const {
74  bool guarantee = false;
75  bsgs = rssc.construct(bsgs.S.begin(), bsgs.S.end(), baseBegin, baseEnd, guarantee);
76  BOOST_ASSERT(guarantee);
77 }
78 
79 }
80 
81 #endif // -- NEWBASECHANGE_H_
abstract base class for base change algorithms
Definition: base_change.h:46
abstract base class for random group element generators
Definition: random_generator.h:42
base change by constructing a new base with random schreier sims
Definition: new_base_change.h:44
~NewBaseChange()
destructor
Definition: new_base_change.h:67
NewBaseChange(const BSGS< PERM, TRANS > &bsgs)
constructor
Definition: new_base_change.h:61
generates uniformly distributed random group elements based on an existing BSGS
Definition: bsgs_random_generator.h:43
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
Represents a base and strong generating set (BSGS)
Definition: bsgs.h:58
PERMlist S
strong generating set
Definition: bsgs_core.h:57
Definition: abstract_bsgs.h:49