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_MATRIX_AUTOMORPHISM_SEARCH_H_ 00034 #define PARTITION_MATRIX_AUTOMORPHISM_SEARCH_H_ 00035 00036 #include <permlib/search/partition/r_base.h> 00037 #include <permlib/search/partition/matrix_refinement1.h> 00038 #include <permlib/search/partition/refinement_family.h> 00039 #include <permlib/predicate/matrix_automorphism_predicate.h> 00040 00041 namespace permlib { 00042 namespace partition { 00043 00045 template<class BSGSIN,class TRANSRET> 00046 class MatrixAutomorphismSearch : public RBase<BSGSIN,TRANSRET> { 00047 public: 00048 typedef typename RBase<BSGSIN,TRANSRET>::PERM PERM; 00049 00051 00055 MatrixAutomorphismSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM); 00056 00058 00063 template<class MATRIX, class Iterator> 00064 void construct(const MATRIX& matrix, Iterator initialPartitionBegin, Iterator initialPartitionEnd); 00065 00067 00070 template<class MATRIX> 00071 void construct(const MATRIX& matrix) { construct<MATRIX, unsigned int*>(matrix, 0, 0); } 00072 }; 00073 00074 template<class BSGSIN,class TRANSRET> 00075 MatrixAutomorphismSearch<BSGSIN,TRANSRET>::MatrixAutomorphismSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM) 00076 : RBase<BSGSIN,TRANSRET>(bsgs, pruningLevelDCM) 00077 { } 00078 00079 template<class BSGSIN,class TRANSRET> 00080 template<class MATRIX, class Iterator> 00081 void MatrixAutomorphismSearch<BSGSIN,TRANSRET>::construct(const MATRIX& matrix, Iterator initialPartitionBegin, Iterator initialPartitionEnd) { 00082 MatrixAutomorphismPredicate<PERM,MATRIX>* matrixPred = new MatrixAutomorphismPredicate<PERM,MATRIX>(matrix); 00083 00084 if (initialPartitionBegin != initialPartitionEnd) { 00085 // set up partitions such that the elements of initialPartition will be mapped onto itself 00086 RBase<BSGSIN,TRANSRET>::m_partition.intersect(initialPartitionBegin, initialPartitionEnd, 0); 00087 RBase<BSGSIN,TRANSRET>::m_partition2.intersect(initialPartitionBegin, initialPartitionEnd, 0); 00088 } 00089 00090 MatrixRefinement1<PERM,MATRIX> matRef(RBase<BSGSIN,TRANSRET>::m_bsgs.n, matrix); 00091 matRef.initializeAndApply(RBase<BSGSIN,TRANSRET>::m_partition); 00092 PERM empty(RBase<BSGSIN,TRANSRET>::m_bsgs.n); 00093 matRef.apply2(RBase<BSGSIN,TRANSRET>::m_partition2, empty); 00094 00095 RBase<BSGSIN,TRANSRET>::construct(matrixPred, 00096 new MatrixAutomorphismRefinementFamily<PERM,MATRIX>(RBase<BSGSIN,TRANSRET>::m_bsgs.n, matrix)); 00097 } 00098 00099 } 00100 } 00101 00102 #endif // -- PARTITION_MATRIX_AUTOMORPHISM_SEARCH_H_