permlib  0.2.6
Library for permutation computations
 All Classes Functions Variables Typedefs Enumerations Friends
include/permlib/search/classic/lex_smaller_image_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 CLASSIC_LEXSMALLERIMAGE_SEARCH_H_
00034 #define CLASSIC_LEXSMALLERIMAGE_SEARCH_H_
00035 
00036 #include <permlib/search/classic/backtrack_search.h>
00037 #include <permlib/predicate/lex_smaller_image_predicate.h>
00038 
00039 namespace permlib {
00040 namespace classic {
00041 
00043 
00046 template<class BSGSIN,class TRANSRET>
00047 class LexSmallerImageSearch : public BacktrackSearch<BSGSIN,TRANSRET> {
00048 public:
00049         typedef typename BacktrackSearch<BSGSIN,TRANSRET>::PERM PERM;
00050         
00052 
00056         LexSmallerImageSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM);
00057         
00059 
00065         template<class InputIteratorZ, class InputIteratorO>
00066         void construct(InputIteratorZ zerosBegin, InputIteratorZ zerosEnd, InputIteratorO onesBegin, InputIteratorO onesEnd);
00067 };
00068 
00069 template<class BSGSIN,class TRANSRET>
00070 LexSmallerImageSearch<BSGSIN,TRANSRET>::LexSmallerImageSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM) 
00071         : BacktrackSearch<BSGSIN,TRANSRET>(bsgs, pruningLevelDCM, false, true)
00072 { }
00073 
00074 template<class BSGSIN,class TRANSRET>
00075 template<class InputIteratorZ, class InputIteratorO>
00076 void LexSmallerImageSearch<BSGSIN,TRANSRET>::construct(InputIteratorZ zerosBegin, InputIteratorZ zerosEnd, InputIteratorO onesBegin, InputIteratorO onesEnd) {
00077         LexSmallerImagePredicate<PERM>* lexminPred = new LexSmallerImagePredicate<PERM>(this->m_bsgs.n, zerosBegin, zerosEnd, onesBegin, onesEnd);
00078         
00079         this->m_limitLevel = lexminPred->limit();
00080         this->m_limitBase = this->m_limitLevel;
00081         this->m_limitInitialized = true;
00082         
00083         BacktrackSearch<BSGSIN,TRANSRET>::construct(lexminPred, false);
00084 }
00085 
00086 }
00087 }
00088 
00089 #endif // -- CLASSIC_LEXSMALLERIMAGE_SEARCH_H_