permlib
0.2.6
Library for permutation computations
|
00001 // --------------------------------------------------------------------------- 00002 // 00003 // This file is part of PermLib. 00004 // 00005 // Copyright (c) 2009-2011 Thomas Rehn <thomas@carmen76.de> 00006 // All rights reserved. 00007 // 00008 // Redistribution and use in source and binary forms, with or without 00009 // modification, are permitted provided that the following conditions 00010 // are met: 00011 // 1. Redistributions of source code must retain the above copyright 00012 // notice, this list of conditions and the following disclaimer. 00013 // 2. Redistributions in binary form must reproduce the above copyright 00014 // notice, this list of conditions and the following disclaimer in the 00015 // documentation and/or other materials provided with the distribution. 00016 // 3. The name of the author may not be used to endorse or promote products 00017 // derived from this software without specific prior written permission. 00018 // 00019 // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 00020 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 00021 // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 00022 // IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 00023 // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 00024 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 00025 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 00026 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 00027 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 00028 // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00029 // 00030 // --------------------------------------------------------------------------- 00031 00032 00033 #ifndef PARTITION_SET_STABILIZER_SEARCH_H_ 00034 #define PARTITION_SET_STABILIZER_SEARCH_H_ 00035 00036 #include <permlib/search/partition/r_base.h> 00037 #include <permlib/predicate/setwise_stabilizer_predicate.h> 00038 #include <permlib/search/partition/set_stabilize_refinement.h> 00039 #include <permlib/search/partition/refinement_family.h> 00040 00041 namespace permlib { 00042 namespace partition { 00043 00045 template<class BSGSIN,class TRANSRET> 00046 class SetStabilizerSearch : public RBase<BSGSIN,TRANSRET> { 00047 public: 00048 typedef typename RBase<BSGSIN,TRANSRET>::PERM PERM; 00049 00051 00055 SetStabilizerSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM); 00056 00058 00062 template<class InputIterator> 00063 void construct(InputIterator begin, InputIterator end); 00064 protected: 00065 virtual unsigned int processNewFixPoints(const Partition& pi, unsigned int backtrackCount); 00066 private: 00067 std::vector<unsigned long> toStab; 00068 }; 00069 00070 template<class BSGSIN,class TRANSRET> 00071 SetStabilizerSearch<BSGSIN,TRANSRET>::SetStabilizerSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM) 00072 : RBase<BSGSIN,TRANSRET>(bsgs, pruningLevelDCM) 00073 { } 00074 00075 template<class BSGSIN,class TRANSRET> 00076 template<class InputIterator> 00077 void SetStabilizerSearch<BSGSIN,TRANSRET>::construct(InputIterator begin, InputIterator end) { 00078 SetwiseStabilizerPredicate<PERM>* stabPred = new SetwiseStabilizerPredicate<PERM>(begin, end); 00079 toStab.insert(toStab.begin(), begin, end); 00080 00081 SetStabilizeRefinement<PERM> ssr(RBase<BSGSIN,TRANSRET>::m_bsgs.n, toStab.begin(), toStab.end()); 00082 ssr.initializeAndApply(RBase<BSGSIN,TRANSRET>::m_partition); 00083 PERM empty(RBase<BSGSIN,TRANSRET>::m_bsgs.n); 00084 ssr.apply2(RBase<BSGSIN,TRANSRET>::m_partition2, empty); 00085 00086 RBase<BSGSIN,TRANSRET>::construct(stabPred, 0); 00087 } 00088 00089 template<class BSGSIN,class TRANSRET> 00090 unsigned int SetStabilizerSearch<BSGSIN,TRANSRET>::processNewFixPoints(const Partition& pi, unsigned int level) { 00091 const unsigned int basePos = RBase<BSGSIN,TRANSRET>::processNewFixPoints(pi, level); 00092 if (!this->m_limitInitialized) { 00093 bool allFound = true; 00094 BOOST_FOREACH(unsigned long alpha, toStab) { 00095 if (std::find(pi.fixPointsBegin(), pi.fixPointsEnd(), alpha) == pi.fixPointsEnd()) { 00096 allFound = false; 00097 break; 00098 } 00099 } 00100 if (allFound) { 00101 this->m_limitLevel = level; 00102 this->m_limitBase = basePos; 00103 this->m_limitInitialized = true; 00104 } 00105 } 00106 return basePos; 00107 } 00108 00109 } 00110 } 00111 00112 #endif // -- PARTITION_SET_STABILIZER_SEARCH_H_