permlib 0.2.9
Library for permutation computations
Loading...
Searching...
No Matches
set_image_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_IMAGE_SEARCH_H_
34#define PARTITION_SET_IMAGE_SEARCH_H_
35
36#include <permlib/search/partition/r_base.h>
37#include <permlib/predicate/set_image_predicate.h>
38
39namespace permlib {
40namespace partition {
41
43
46template<class BSGSIN,class TRANSRET>
47class SetImageSearch : public RBase<BSGSIN,TRANSRET> {
48public:
49 typedef typename RBase<BSGSIN,TRANSRET>::PERM PERM;
50
52
56 SetImageSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM);
57
59
65 template<class InputIterator>
66 void construct(InputIterator begin, InputIterator end, InputIterator beginImg, InputIterator endImg);
67protected:
68 virtual unsigned int processNewFixPoints(const Partition& pi, unsigned int backtrackCount);
69private:
70 std::vector<unsigned long> toStab;
71};
72
73template<class BSGSIN,class TRANSRET>
74SetImageSearch<BSGSIN,TRANSRET>::SetImageSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM)
75 : RBase<BSGSIN,TRANSRET>(bsgs, pruningLevelDCM, true)
76{ }
77
78template<class BSGSIN,class TRANSRET>
79template<class InputIterator>
80void SetImageSearch<BSGSIN,TRANSRET>::construct(InputIterator begin, InputIterator end, InputIterator beginImg, InputIterator endImg) {
81 SetImagePredicate<PERM>* stabPred = new SetImagePredicate<PERM>(begin, end, beginImg, endImg);
82 toStab.insert(toStab.begin(), begin, end);
83
84 SetImageRefinement<PERM> sir(RBase<BSGSIN,TRANSRET>::m_bsgs.n, begin, end, beginImg, endImg);
88
90}
91
92template<class BSGSIN,class TRANSRET>
93unsigned int SetImageSearch<BSGSIN,TRANSRET>::processNewFixPoints(const Partition& pi, unsigned int level) {
94 const unsigned int basePos = RBase<BSGSIN,TRANSRET>::processNewFixPoints(pi, level);
95 if (!this->m_limitInitialized) {
96 bool allFound = true;
97 BOOST_FOREACH(unsigned long alpha, toStab) {
98 if (std::find(pi.fixPointsBegin(), pi.fixPointsEnd(), alpha) == pi.fixPointsEnd()) {
99 allFound = false;
100 break;
101 }
102 }
103 if (allFound) {
104 this->m_limitLevel = level;
105 this->m_limitBase = basePos;
106 this->m_limitInitialized = true;
107 }
108 }
109 return basePos;
110}
111
112}
113}
114
115#endif // -- PARTITION_SET_IMAGE_SEARCH_H_
coset-type predicate for group elements that map one set of points onto another given set of points
Definition: set_image_predicate.h:47
partition
Definition: partition.h:48
vector_t::const_iterator fixPointsBegin() const
iterator to the begin of fix points
Definition: partition.h:164
vector_t::const_iterator fixPointsEnd() const
iterator to the end of fix points
Definition: partition.h:167
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
bool initializeAndApply(Partition &pi)
applies (left-)refinement to partition and initializes refinement for future use in R-base
Definition: refinement.h:136
Definition: set_image_refinement.h:51
virtual unsigned int apply2(Partition &pi, const PERM &t) const
applies (right-)refinement to pi which is the image of the original partition this refinement was ini...
Definition: set_image_refinement.h:95
coset representative search for a set image based on partition backtracking
Definition: set_image_search.h:47
void construct(InputIterator begin, InputIterator end, InputIterator beginImg, InputIterator endImg)
initializes search
Definition: set_image_search.h:80
SetImageSearch(const BSGSIN &bsgs, unsigned int pruningLevelDCM)
constructor
Definition: set_image_search.h:74
virtual unsigned int processNewFixPoints(const Partition &pi, unsigned int backtrackCount)
callback when a new fix point appears during R-base construction
Definition: set_image_search.h:93