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 CLASSIC_INTERSECTION_SEARCH_H_ 00034 #define CLASSIC_INTERSECTION_SEARCH_H_ 00035 00036 #include <permlib/search/classic/backtrack_search.h> 00037 #include <permlib/predicate/group_intersection_predicate.h> 00038 00039 namespace permlib { 00040 namespace classic { 00041 00043 template<class BSGSIN,class TRANSRET> 00044 class IntersectionSearch : public BacktrackSearch<BSGSIN,TRANSRET> { 00045 public: 00046 typedef typename BacktrackSearch<BSGSIN,TRANSRET>::PERM PERM; 00047 typedef typename BacktrackSearch<BSGSIN,TRANSRET>::TRANS TRANS; 00048 00050 00054 IntersectionSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM); 00055 00057 00060 void construct(BSGSIN* bsgs2); 00061 }; 00062 00063 template<class BSGSIN,class TRANSRET> 00064 IntersectionSearch<BSGSIN,TRANSRET>::IntersectionSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM) 00065 : BacktrackSearch<BSGSIN,TRANSRET>(bsgs, pruningLevelDCM) 00066 { } 00067 00068 template<class BSGSIN,class TRANSRET> 00069 void IntersectionSearch<BSGSIN,TRANSRET>::construct(BSGSIN* bsgs2) { 00070 GroupIntersectionPredicate<PERM,TRANS>* intersectPred = new GroupIntersectionPredicate<PERM,TRANS>(BacktrackSearch<BSGSIN,TRANSRET>::m_bsgs, *bsgs2); 00071 BacktrackSearch<BSGSIN,TRANSRET>::m_bsgs2 = bsgs2; 00072 00073 BacktrackSearch<BSGSIN,TRANSRET>::construct(intersectPred, false); 00074 } 00075 00076 } 00077 } 00078 00079 #endif // -- CLASSIC_INTERSECTION_SEARCH_H_