permlib  0.2.9
Library for permutation computations
set_stabilizer_search.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 PARTITION_SET_STABILIZER_SEARCH_H_
34 #define PARTITION_SET_STABILIZER_SEARCH_H_
35 
36 #include <permlib/search/partition/r_base.h>
37 #include <permlib/predicate/setwise_stabilizer_predicate.h>
38 #include <permlib/search/partition/set_stabilize_refinement.h>
39 #include <permlib/search/partition/refinement_family.h>
40 
41 namespace permlib {
42 namespace partition {
43 
45 template<class BSGSIN,class TRANSRET>
46 class SetStabilizerSearch : public RBase<BSGSIN,TRANSRET> {
47 public:
48  typedef typename RBase<BSGSIN,TRANSRET>::PERM PERM;
49 
51 
55  SetStabilizerSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM);
56 
58 
62  template<class InputIterator>
63  void construct(InputIterator begin, InputIterator end);
64 protected:
65  virtual unsigned int processNewFixPoints(const Partition& pi, unsigned int backtrackCount);
66 private:
67  std::vector<unsigned long> toStab;
68 };
69 
70 template<class BSGSIN,class TRANSRET>
71 SetStabilizerSearch<BSGSIN,TRANSRET>::SetStabilizerSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM)
72  : RBase<BSGSIN,TRANSRET>(bsgs, pruningLevelDCM)
73 { }
74 
75 template<class BSGSIN,class TRANSRET>
76 template<class InputIterator>
77 void SetStabilizerSearch<BSGSIN,TRANSRET>::construct(InputIterator begin, InputIterator end) {
79  toStab.insert(toStab.begin(), begin, end);
80 
81  SetStabilizeRefinement<PERM> ssr(RBase<BSGSIN,TRANSRET>::m_bsgs.n, toStab.begin(), toStab.end());
83  PERM empty(RBase<BSGSIN,TRANSRET>::m_bsgs.n);
84  ssr.apply2(RBase<BSGSIN,TRANSRET>::m_partition2, empty);
85 
87 }
88 
89 template<class BSGSIN,class TRANSRET>
90 unsigned int SetStabilizerSearch<BSGSIN,TRANSRET>::processNewFixPoints(const Partition& pi, unsigned int level) {
91  const unsigned int basePos = RBase<BSGSIN,TRANSRET>::processNewFixPoints(pi, level);
92  if (!this->m_limitInitialized) {
93  bool allFound = true;
94  BOOST_FOREACH(unsigned long alpha, toStab) {
95  if (std::find(pi.fixPointsBegin(), pi.fixPointsEnd(), alpha) == pi.fixPointsEnd()) {
96  allFound = false;
97  break;
98  }
99  }
100  if (allFound) {
101  this->m_limitLevel = level;
102  this->m_limitBase = basePos;
103  this->m_limitInitialized = true;
104  }
105  }
106  return basePos;
107 }
108 
109 }
110 }
111 
112 #endif // -- PARTITION_SET_STABILIZER_SEARCH_H_
bool initializeAndApply(Partition &pi)
applies (left-)refinement to partition and initializes refinement for future use in R-base ...
Definition: refinement.h:136
vector_t::const_iterator fixPointsEnd() const
iterator to the end of fix points
Definition: partition.h:167
concrete -refinements for set stabilization
Definition: set_stabilize_refinement.h:50
SetStabilizerSearch(const BSGSIN &bsgs, unsigned int pruningLevelDCM)
constructor
Definition: set_stabilizer_search.h:71
partition
Definition: partition.h:48
predicate for the subgroup that stabilizes a given point set
Definition: setwise_stabilizer_predicate.h:44
subgroup search for a set stabilizer based on partition backtracking
Definition: set_stabilizer_search.h:46
virtual unsigned int processNewFixPoints(const Partition &pi, unsigned int backtrackCount)
callback when a new fix point appears during R-base construction
Definition: set_stabilizer_search.h:90
R-base for partition backtracking.
Definition: r_base.h:56
void construct(SubgroupPredicate< PERM > *pred, RefinementFamily< PERM > *predRefinement)
constructs an R-base for given predicate and refinement family
Definition: r_base.h:115
virtual unsigned int processNewFixPoints(const Partition &pi, unsigned int level)
callback when a new fix point appears during R-base construction
Definition: r_base.h:197
void construct(InputIterator begin, InputIterator end)
initializes search
Definition: set_stabilizer_search.h:77
vector_t::const_iterator fixPointsBegin() const
iterator to the begin of fix points
Definition: partition.h:164
Definition: abstract_bsgs.h:49