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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Computational Engine *
* *
* Copyright (c) 1999-2008, Ben Burton *
* For further details contact Ben Burton (bab@debian.org). *
* *
* This program is free software; you can redistribute it and/or *
* modify it under the terms of the GNU General Public License as *
* published by the Free Software Foundation; either version 2 of the *
* License, or (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, but *
* WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *
* General Public License for more details. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program; if not, write to the Free *
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, *
* MA 02110-1301, USA. *
* *
**************************************************************************/
/* end stub */
#include <sstream>
#include "triangulation/nperm.h"
namespace regina {
const NPerm allPermsS4[24] = {
NPerm(0,1,2,3), NPerm(0,1,3,2), NPerm(0,2,3,1), NPerm(0,2,1,3),
NPerm(0,3,1,2), NPerm(0,3,2,1), NPerm(1,0,3,2), NPerm(1,0,2,3),
NPerm(1,2,0,3), NPerm(1,2,3,0), NPerm(1,3,2,0), NPerm(1,3,0,2),
NPerm(2,0,1,3), NPerm(2,0,3,1), NPerm(2,1,3,0), NPerm(2,1,0,3),
NPerm(2,3,0,1), NPerm(2,3,1,0), NPerm(3,0,2,1), NPerm(3,0,1,2),
NPerm(3,1,0,2), NPerm(3,1,2,0), NPerm(3,2,1,0), NPerm(3,2,0,1)
};
const unsigned allPermsS4Inv[24] = {
0, 1, 4, 3,
2, 5, 6, 7,
12, 19, 18, 13,
8, 11, 20, 15,
16, 23, 10, 9,
14, 21, 22, 17
};
const NPerm orderedPermsS4[24] = {
NPerm(0,1,2,3), NPerm(0,1,3,2), NPerm(0,2,1,3), NPerm(0,2,3,1),
NPerm(0,3,1,2), NPerm(0,3,2,1), NPerm(1,0,2,3), NPerm(1,0,3,2),
NPerm(1,2,0,3), NPerm(1,2,3,0), NPerm(1,3,0,2), NPerm(1,3,2,0),
NPerm(2,0,1,3), NPerm(2,0,3,1), NPerm(2,1,0,3), NPerm(2,1,3,0),
NPerm(2,3,0,1), NPerm(2,3,1,0), NPerm(3,0,1,2), NPerm(3,0,2,1),
NPerm(3,1,0,2), NPerm(3,1,2,0), NPerm(3,2,0,1), NPerm(3,2,1,0)
};
const NPerm allPermsS3[6] = {
NPerm(0,1,2,3), NPerm(0,2,1,3),
NPerm(1,2,0,3), NPerm(1,0,2,3),
NPerm(2,0,1,3), NPerm(2,1,0,3)
};
const unsigned allPermsS3Inv[6] = {
0, 1,
4, 3,
2, 5
};
const NPerm orderedPermsS3[6] = {
NPerm(0,1,2,3), NPerm(0,2,1,3),
NPerm(1,0,2,3), NPerm(1,2,0,3),
NPerm(2,0,1,3), NPerm(2,1,0,3)
};
const NPerm allPermsS2[2] = {
NPerm(0,1,2,3), NPerm(1,0,2,3)
};
const unsigned allPermsS2Inv[2] = {
0, 1
};
bool NPerm::isPermCode(unsigned char code) {
unsigned char mask = 0;
for (int i = 0; i < 4; i++)
mask |= (1 << ((code >> (2 * i)) & 3));
// mask |= (1 << imageOf(i));
return (mask == 15);
}
int NPerm::sign() const {
// The code is a little non-obvious, but this routine needs to be
// streamlined since it gets called a _lot_ during census generation.
unsigned char matches = 0;
if ((code & 0x03) == 0x00)
++matches;
if ((code & 0x0c) == 0x04)
++matches;
if ((code & 0x30) == 0x20)
++matches;
if ((code & 0xc0) == 0xc0)
++matches;
if (matches == 4)
return 1;
if (matches == 2)
return -1;
if (matches == 1)
return 1;
if ( code == 0xb1 /* 2301 */ ||
code == 0x1b /* 0123 */ ||
code == 0x4e /* 1032 */)
return 1;
return -1;
}
int NPerm::compareWith(const NPerm& other) const {
for (int i = 0; i < 4; i++) {
if (imageOf(i) < other.imageOf(i))
return -1;
if (imageOf(i) > other.imageOf(i))
return 1;
}
return 0;
}
std::string NPerm::toString() const {
char ans[5];
for (int i = 0; i < 4; i++)
ans[i] = '0' + imageOf(i);
ans[4] = 0;
return ans;
}
NPerm faceOrdering(int face) {
switch(face) {
case 0:
return NPerm(1,2,3,0);
case 1:
return NPerm(0,2,3,1);
case 2:
return NPerm(0,1,3,2);
case 3:
return NPerm(0,1,2,3);
}
return NPerm();
}
NPerm edgeOrdering(int edge) {
switch(edge) {
case 0:
return NPerm(0,1,2,3);
case 1:
return NPerm(0,2,3,1);
case 2:
return NPerm(0,3,1,2);
case 3:
return NPerm(1,2,0,3);
case 4:
return NPerm(1,3,2,0);
case 5:
return NPerm(2,3,0,1);
}
return NPerm();
}
std::string faceDescription(int face) {
return faceDescription(faceOrdering(face));
}
std::string faceDescription(const NPerm& p) {
std::string ans;
ans += ('0' + p[0]);
ans += ('0' + p[1]);
ans += ('0' + p[2]);
return ans;
}
std::string edgeDescription(int edge) {
return edgeDescription(edgeOrdering(edge));
}
std::string edgeDescription(const NPerm& p) {
std::string ans;
ans += ('0' + p[0]);
ans += ('0' + p[1]);
return ans;
}
} // namespace regina
|
