1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
/*1:*/
#line 5 "./symmetry.cweb"
#include "symmetry.h"
#include "permutation.h"
#include <cstdio>
/*2:*/
#line 23 "./symmetry.cweb"
Symmetry::Symmetry(const IntSequence&s)
:IntSequence(s.getNumDistinct(),0)
{
int p= 0;
if(s.size()> 0)
operator[](p)= 1;
for(int i= 1;i<s.size();i++){
if(s[i]!=s[i-1])
p++;
operator[](p)++;
}
}
/*:2*/
#line 11 "./symmetry.cweb"
;
/*3:*/
#line 38 "./symmetry.cweb"
int Symmetry::findClass(int i)const
{
int j= 0;
int sum= 0;
do{
sum+= operator[](j);
j++;
}while(j<size()&&sum<=i);
return j-1;
}
/*:3*/
#line 12 "./symmetry.cweb"
;
/*4:*/
#line 54 "./symmetry.cweb"
bool Symmetry::isFull()const
{
int count= 0;
for(int i= 0;i<num();i++)
if(operator[](i)!=0)
count++;
return count<=1;
}
/*:4*/
#line 13 "./symmetry.cweb"
;
/*5:*/
#line 70 "./symmetry.cweb"
symiterator::symiterator(SymmetrySet&ss)
:s(ss),subit(NULL),subs(NULL),end_flag(false)
{
s.sym()[0]= 0;
if(s.size()==2){
s.sym()[1]= s.dimen();
}else{
subs= new SymmetrySet(s,s.dimen());
subit= new symiterator(*subs);
}
}
/*:5*/
#line 14 "./symmetry.cweb"
;
/*6:*/
#line 85 "./symmetry.cweb"
symiterator::~symiterator()
{
if(subit)
delete subit;
if(subs)
delete subs;
}
/*:6*/
#line 15 "./symmetry.cweb"
;
/*7:*/
#line 101 "./symmetry.cweb"
symiterator&symiterator::operator++()
{
if(!end_flag){
if(s.size()==2){
s.sym()[0]++;
s.sym()[1]--;
}else{
++(*subit);
if(subit->isEnd()){
delete subit;
delete subs;
s.sym()[0]++;
subs= new SymmetrySet(s,s.dimen()-s.sym()[0]);
subit= new symiterator(*subs);
}
}
if(s.sym()[0]==s.dimen()+1)
end_flag= true;
}
return*this;
}
/*:7*/
#line 16 "./symmetry.cweb"
;
/*8:*/
#line 125 "./symmetry.cweb"
InducedSymmetries::InducedSymmetries(const Equivalence&e,const Symmetry&s)
{
for(Equivalence::const_seqit i= e.begin();i!=e.end();++i){
push_back(Symmetry(s,*i));
}
}
/*:8*/
#line 17 "./symmetry.cweb"
;
/*9:*/
#line 134 "./symmetry.cweb"
InducedSymmetries::InducedSymmetries(const Equivalence&e,const Permutation&p,
const Symmetry&s)
{
for(int i= 0;i<e.numClasses();i++){
Equivalence::const_seqit it= e.find(p.getMap()[i]);
push_back(Symmetry(s,*it));
}
}
/*:9*/
#line 18 "./symmetry.cweb"
;
/*10:*/
#line 145 "./symmetry.cweb"
void InducedSymmetries::print()const
{
printf("Induced symmetries: %lu\n",(unsigned long)size());
for(unsigned int i= 0;i<size();i++)
operator[](i).print();
}
/*:10*/
#line 19 "./symmetry.cweb"
;
/*:1*/
|
