PermLib

set_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_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 
00039 namespace permlib {
00040 namespace partition {
00041 
00043 template<class BSGSIN,class TRANSRET>
00044 class SetStabilizerSearch : public RBase<BSGSIN,TRANSRET> {
00045 public:
00046         typedef typename RBase<BSGSIN,TRANSRET>::PERM PERM;
00047         
00049 
00053         SetStabilizerSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM);
00054         
00056 
00060         template<class InputIterator>
00061         void construct(InputIterator begin, InputIterator end);
00062 protected:
00063         virtual unsigned int processNewFixPoints(const Partition& pi, unsigned int backtrackCount);
00064 private:
00065         std::vector<unsigned long> toStab;
00066 };
00067 
00068 template<class BSGSIN,class TRANSRET>
00069 SetStabilizerSearch<BSGSIN,TRANSRET>::SetStabilizerSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM) 
00070         : RBase<BSGSIN,TRANSRET>(bsgs, pruningLevelDCM)
00071 { }
00072 
00073 template<class BSGSIN,class TRANSRET>
00074 template<class InputIterator>
00075 void SetStabilizerSearch<BSGSIN,TRANSRET>::construct(InputIterator begin, InputIterator end) {
00076         SetwiseStabilizerPredicate<PERM>* stabPred = new SetwiseStabilizerPredicate<PERM>(begin, end);
00077         toStab.insert(toStab.begin(), begin, end);
00078         
00079         SetStabilizeRefinement<PERM> ssr(RBase<BSGSIN,TRANSRET>::m_bsgs.n, toStab.begin(), toStab.end());
00080         ssr.initializeAndApply(RBase<BSGSIN,TRANSRET>::m_partition);
00081         PERM empty(RBase<BSGSIN,TRANSRET>::m_bsgs.n);
00082         ssr.apply2(RBase<BSGSIN,TRANSRET>::m_partition2, empty);
00083         
00084         RBase<BSGSIN,TRANSRET>::construct(stabPred, 0);
00085 }
00086 
00087 template<class BSGSIN,class TRANSRET>
00088 unsigned int SetStabilizerSearch<BSGSIN,TRANSRET>::processNewFixPoints(const Partition& pi, unsigned int level) {
00089         const unsigned int basePos = RBase<BSGSIN,TRANSRET>::processNewFixPoints(pi, level);
00090         if (!this->m_limitInitialized) {
00091                 bool allFound = true;
00092                 BOOST_FOREACH(unsigned long alpha, toStab) {
00093                         if (std::find(pi.fixPointsBegin(), pi.fixPointsEnd(), alpha) == pi.fixPointsEnd()) {
00094                                 allFound = false;
00095                                 break;
00096                         }
00097                 }
00098                 if (allFound) {
00099                         this->m_limitLevel = level;
00100                         this->m_limitBase = basePos;
00101                         this->m_limitInitialized = true;
00102                 }
00103         }
00104         return basePos;
00105 }
00106 
00107 }
00108 }
00109 
00110 #endif // -- PARTITION_SET_STABILIZER_SEARCH_H_