permlib  0.2.9
Library for permutation computations
intersection_search.h
1 // ---------------------------------------------------------------------------
2 //
3 // This file is part of PermLib.
4 //
5 // Copyright (c) 2009-2011 Thomas Rehn <thomas@carmen76.de>
6 // All rights reserved.
7 //
8 // Redistribution and use in source and binary forms, with or without
9 // modification, are permitted provided that the following conditions
10 // are met:
11 // 1. Redistributions of source code must retain the above copyright
12 // notice, this list of conditions and the following disclaimer.
13 // 2. Redistributions in binary form must reproduce the above copyright
14 // notice, this list of conditions and the following disclaimer in the
15 // documentation and/or other materials provided with the distribution.
16 // 3. The name of the author may not be used to endorse or promote products
17 // derived from this software without specific prior written permission.
18 //
19 // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 // IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28 // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 //
30 // ---------------------------------------------------------------------------
31 
32 
33 #ifndef PARTITION_INTERSECTION_SEARCH_H_
34 #define PARTITION_INTERSECTION_SEARCH_H_
35 
36 #include <permlib/search/partition/r_base.h>
37 #include <permlib/predicate/group_intersection_predicate.h>
38 
39 namespace permlib {
40 namespace partition {
41 
43 template<class BSGSIN,class TRANSRET>
44 class IntersectionSearch : public RBase<BSGSIN,TRANSRET> {
45 public:
46  typedef typename RBase<BSGSIN,TRANSRET>::PERM PERM;
47  typedef typename RBase<BSGSIN,TRANSRET>::TRANS TRANS;
48 
50 
54  IntersectionSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM);
55 
57 
60  void construct(BSGSIN* bsgs2);
61 
62  typedef typename RBase<BSGSIN,TRANSRET>::PartitionIt PartitionIt;
63 };
64 
65 template<class BSGSIN,class TRANSRET>
66 IntersectionSearch<BSGSIN,TRANSRET>::IntersectionSearch(const BSGSIN& bsgs, unsigned int pruningLevelDCM)
67  : RBase<BSGSIN,TRANSRET>(bsgs, pruningLevelDCM)
68 { }
69 
70 template<class BSGSIN,class TRANSRET>
74 
76 }
77 
78 }
79 }
80 
81 #endif // -- PARTITION_INTERSECTION_SEARCH_H_
subgroup search for a group intersection based on partition backtracking
Definition: intersection_search.h:44
void construct(BSGSIN *bsgs2)
initializes search
Definition: intersection_search.h:71
-refinements for group membership
Definition: refinement_family.h:67
predicate for the subgroup that arises as the intersection of two given groups
Definition: group_intersection_predicate.h:45
R-base for partition backtracking.
Definition: r_base.h:56
void construct(SubgroupPredicate< PERM > *pred, RefinementFamily< PERM > *predRefinement)
constructs an R-base for given predicate and refinement family
Definition: r_base.h:115
IntersectionSearch(const BSGSIN &bsgs, unsigned int pruningLevelDCM)
constructor
Definition: intersection_search.h:66
Definition: abstract_bsgs.h:49