permlib  0.2.6
Library for permutation computations
 All Classes Functions Variables Typedefs Enumerations Friends
include/permlib/search/partition/vector_stabilizer_search.h
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_VECTOR_STABILIZER_SEARCH_H_
00034 #define PARTITION_VECTOR_STABILIZER_SEARCH_H_
00035 
00036 #include <permlib/search/partition/r_base.h>
00037 #include <permlib/predicate/vector_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 VectorStabilizerSearch : public RBase<BSGSIN,TRANSRET> {
00047 public:
00048         typedef typename RBase<BSGSIN,TRANSRET>::PERM PERM;
00049         
00051 
00055         VectorStabilizerSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM);
00056         
00058 
00064         template<class InputIterator>
00065         void construct(InputIterator begin, InputIterator end, unsigned int maxEntries);
00066 protected:
00067         virtual unsigned int processNewFixPoints(const Partition& pi, unsigned int backtrackCount);
00068 private:
00069         std::vector<unsigned int> toStab;
00070         unsigned int m_maxEntries;
00071 };
00072 
00073 template<class BSGSIN,class TRANSRET>
00074 VectorStabilizerSearch<BSGSIN,TRANSRET>::VectorStabilizerSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM) 
00075         : RBase<BSGSIN,TRANSRET>(bsgs, pruningLevelDCM)
00076 { }
00077 
00078 template<class BSGSIN,class TRANSRET>
00079 template<class InputIterator>
00080 void VectorStabilizerSearch<BSGSIN,TRANSRET>::construct(InputIterator begin, InputIterator end, unsigned int maxEntries) {
00081         VectorStabilizerPredicate<PERM>* stabPred = new VectorStabilizerPredicate<PERM>(begin, end);
00082         m_maxEntries = maxEntries;
00083         toStab.insert(toStab.begin(), begin, end);
00084         std::vector<unsigned int> stabC(toStab.size());
00085         
00086 #ifdef PERMLIB_DEBUGMODE
00087         BOOST_FOREACH(const unsigned int v, stabC) {
00088                 BOOST_ASSERT( v < maxEntries );
00089         }
00090 #endif
00091         
00092         // we can ignore the highest entries because these are automatically stabilized
00093         // if all other entries are stabilized
00094         for (unsigned int c = 0; c < maxEntries - 1; ++c) {
00095                 unsigned int i = 0;
00096                 std::vector<unsigned int>::iterator stabIt = toStab.begin(), cIt = stabC.begin();
00097                 for (; stabIt != toStab.end(); ++stabIt) {
00098                         BOOST_ASSERT( cIt != stabC.end() );
00099                         if (*stabIt == c)
00100                                 *cIt++ = i;
00101                         ++i;
00102                 }
00103                 SetStabilizeRefinement<PERM> ssr(this->m_bsgs.n, stabC.begin(), cIt);
00104                 ssr.initializeAndApply(this->m_partition);
00105                 PERM empty(this->m_bsgs.n);
00106                 ssr.apply2(this->m_partition2, empty);
00107         }
00108         RBase<BSGSIN,TRANSRET>::construct(stabPred, 0);
00109 }
00110 
00111 template<class BSGSIN,class TRANSRET>
00112 unsigned int VectorStabilizerSearch<BSGSIN,TRANSRET>::processNewFixPoints(const Partition& pi, unsigned int level) {
00113         const unsigned int basePos = RBase<BSGSIN,TRANSRET>::processNewFixPoints(pi, level);
00114         if (!this->m_limitInitialized) {
00115                 bool allFound = true;
00116                 int pos = -1;
00117                 BOOST_FOREACH(unsigned int alpha, toStab) {
00118                         ++pos;
00119                         if (alpha == m_maxEntries - 1)
00120                                 continue;
00121                         if (std::find(pi.fixPointsBegin(), pi.fixPointsEnd(), static_cast<unsigned int>(pos)) == pi.fixPointsEnd()) {
00122                                 allFound = false;
00123                                 break;
00124                         }
00125                 }
00126                 if (allFound) {
00127                         this->m_limitLevel = level;
00128                         this->m_limitBase = basePos;
00129                         this->m_limitInitialized = true;
00130                 }
00131         }
00132         return basePos;
00133 }
00134 
00135 }
00136 }
00137 
00138 #endif // -- PARTITION_VECTOR_STABILIZER_SEARCH_H_