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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Test Suite *
* *
* Copyright (c) 1999-2025, 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. *
* *
* As an exception, when this program is distributed through (i) the *
* App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or *
* (iii) Google Play by Google Inc., then that store may impose any *
* digital rights management, device limits and/or redistribution *
* restrictions that are required by its terms of service. *
* *
* 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, see <https://www.gnu.org/licenses/>. *
* *
**************************************************************************/
#include "census/census.h"
#include "census/gluingpermsearcher2.h"
#include "census/gluingpermsearcher3.h"
#include "census/gluingpermsearcher4.h"
#include "link/link.h"
#include "link/modellinkgraph.h"
#include "packet/container.h"
#include "triangulation/dim2.h"
#include "triangulation/dim3.h"
#include "triangulation/dim4.h"
#include "testexhaustive.h"
// When we run tests over an entire census, do we use a larger census
// (which takes a long time to run), or a smaller census?
// #define LARGE_CENSUS
#define DIM2_CLOSED_CENSUS_SIZE 8
#define DIM2_BOUNDED_CENSUS_SIZE 6
#ifdef LARGE_CENSUS
#define DIM3_MIN_CLOSED_CENSUS_SIZE 6
#define DIM3_CLOSED_CENSUS_SIZE 4
#define DIM3_BOUNDED_CENSUS_SIZE 4
#define DIM3_IDEAL_CENSUS_SIZE 4
#define DIM3_SMALL_MIN_CLOSED_CENSUS_SIZE 4
#define DIM3_SMALL_CLOSED_CENSUS_SIZE 3
#define DIM3_SMALL_BOUNDED_CENSUS_SIZE 3
#define DIM3_SMALL_IDEAL_CENSUS_SIZE 3
#else
#define DIM3_MIN_CLOSED_CENSUS_SIZE 4
#define DIM3_CLOSED_CENSUS_SIZE 3
#define DIM3_BOUNDED_CENSUS_SIZE 3
#define DIM3_IDEAL_CENSUS_SIZE 3
#define DIM3_SMALL_MIN_CLOSED_CENSUS_SIZE 3
#define DIM3_SMALL_CLOSED_CENSUS_SIZE 2
#define DIM3_SMALL_BOUNDED_CENSUS_SIZE 2
#define DIM3_SMALL_IDEAL_CENSUS_SIZE 2
#endif
#ifdef LARGE_CENSUS
#define DIM4_CLOSED_CENSUS_SIZE 2
#define DIM4_BOUNDED_CENSUS_SIZE 3
#define DIM4_IDEAL_CENSUS_SIZE 2
#else
#define DIM4_CLOSED_CENSUS_SIZE 2
#define DIM4_BOUNDED_CENSUS_SIZE 2
#define DIM4_IDEAL_CENSUS_SIZE 2
#endif
#define LINK_CENSUS_SIZE 4
#define LINK_SMALL_CENSUS_SIZE 3
using regina::BoolSet;
using regina::CensusPurge;
using regina::FacetPairing;
using regina::GluingPerms;
using regina::GluingPermSearcher;
using regina::Link;
using regina::ModelLinkGraph;
using regina::Triangulation;
namespace {
void foundFacetPairing2(const FacetPairing<2>& pairing,
FacetPairing<2>::IsoList autos,
Triangulation2TestFunction f) {
GluingPermSearcher<2>::findAllPerms(pairing, std::move(autos),
false /* orientable only */,
[f](const GluingPerms<2>& perms) {
Triangulation<2> tri = perms.triangulate();
f(tri, tri.isoSig().c_str());
});
}
void foundFacetPairing3(const FacetPairing<3>& pairing,
FacetPairing<3>::IsoList autos,
Triangulation3TestFunction f, BoolSet finite, bool minimal) {
GluingPermSearcher<3>::findAllPerms(pairing, std::move(autos),
false /* orientable only */,
! finite.hasFalse() /* finite only */,
(minimal ? CensusPurge::NonMinimalPrime | CensusPurge::P2Reducible :
CensusPurge::None),
[f, finite](const GluingPerms<3>& perms) {
Triangulation<3> tri = perms.triangulate();
if (tri.isValid() && finite.contains(! tri.isIdeal()))
f(tri, tri.isoSig().c_str());
});
}
void foundFacetPairing4(const FacetPairing<4>& pairing,
FacetPairing<4>::IsoList autos,
Triangulation4TestFunction f, BoolSet finite) {
GluingPermSearcher<4>::findAllPerms(pairing, std::move(autos),
false /* orientable only */,
! finite.hasFalse() /* finite only */,
[f, finite](const GluingPerms<4>& perms) {
Triangulation<4> tri = perms.triangulate();
if (tri.isValid() && finite.contains(! tri.isIdeal()))
f(tri, tri.isoSig().c_str());
});
}
}
void runCensusAllClosed(Triangulation2TestFunction testFunction) {
FacetPairing<2>::findAllPairings(DIM2_CLOSED_CENSUS_SIZE,
false /* bounded */, -1 /* bdry faces */,
&foundFacetPairing2, testFunction);
}
void runCensusAllBounded(Triangulation2TestFunction testFunction) {
FacetPairing<2>::findAllPairings(DIM2_BOUNDED_CENSUS_SIZE,
true /* bounded */, -1 /* bdry faces */,
&foundFacetPairing2, testFunction);
}
void runCensusMinClosed(Triangulation3TestFunction testFunction, bool small_) {
FacetPairing<3>::findAllPairings(
(small_ ? DIM3_SMALL_MIN_CLOSED_CENSUS_SIZE :
DIM3_MIN_CLOSED_CENSUS_SIZE),
false /* bounded */, -1, /* bdry faces */
&foundFacetPairing3, testFunction, true /* finite */, true /* min */);
}
void runCensusAllClosed(Triangulation3TestFunction testFunction, bool small_) {
FacetPairing<3>::findAllPairings(
(small_ ? DIM3_SMALL_CLOSED_CENSUS_SIZE : DIM3_CLOSED_CENSUS_SIZE),
false /* bounded */, -1 /* bdry faces */,
&foundFacetPairing3, testFunction, true /* finite */, false /* min */);
}
void runCensusAllBounded(Triangulation3TestFunction testFunction, bool small_) {
FacetPairing<3>::findAllPairings(
(small_ ? DIM3_SMALL_BOUNDED_CENSUS_SIZE : DIM3_BOUNDED_CENSUS_SIZE),
true /* bounded */, -1 /* bdry faces */,
&foundFacetPairing3, testFunction, true /* finite */, false /* min */);
}
void runCensusAllIdeal(Triangulation3TestFunction testFunction, bool small_) {
FacetPairing<3>::findAllPairings(
(small_ ? DIM3_SMALL_IDEAL_CENSUS_SIZE : DIM3_IDEAL_CENSUS_SIZE),
false /* bounded */, -1 /* bdry faces */,
&foundFacetPairing3, testFunction, false /* finite */, false /* min */);
}
void runCensusAllNoBdry(Triangulation3TestFunction testFunction, bool small_) {
FacetPairing<3>::findAllPairings(
(small_ ? DIM3_SMALL_IDEAL_CENSUS_SIZE : DIM3_IDEAL_CENSUS_SIZE),
false /* bounded */, -1 /* bdry faces */,
&foundFacetPairing3, testFunction, BoolSet(true, true) /* finite */,
false /* min */);
}
void runCensusAllClosed(Triangulation4TestFunction testFunction, int size) {
FacetPairing<4>::findAllPairings(
size == 0 ? DIM4_CLOSED_CENSUS_SIZE : size,
false /* bounded */, -1 /* bdry faces */,
&foundFacetPairing4, testFunction, true /* finite */);
}
void runCensusAllBounded(Triangulation4TestFunction testFunction, int size) {
FacetPairing<4>::findAllPairings(
size == 0 ? DIM4_BOUNDED_CENSUS_SIZE : size,
true /* bounded */, -1 /* bdry faces */,
&foundFacetPairing4, testFunction, true /* finite */);
}
void runCensusAllNoBdry(Triangulation4TestFunction testFunction, int size) {
FacetPairing<4>::findAllPairings(
size == 0 ? DIM4_IDEAL_CENSUS_SIZE : size,
false /* bounded */, -1 /* bdry faces */,
&foundFacetPairing4, testFunction, BoolSet(true, true) /* finite */);
}
void runCensus(bool (*pairingFilter)(const FacetPairing<4>&),
Triangulation4TestFunction f, int size, bool orblOnly) {
FacetPairing<4>::findAllPairings(size,
{ true, true } /* bounded */, -1 /* bdry faces */,
[pairingFilter, f, orblOnly](const FacetPairing<4>& pairing,
FacetPairing<4>::IsoList autos) {
if (pairingFilter(pairing))
GluingPermSearcher<4>::findAllPerms(pairing,
std::move(autos), orblOnly, false /* finite only */,
[f](const GluingPerms<4>& perms) {
Triangulation<4> tri = perms.triangulate();
if (tri.isValid())
f(tri, tri.isoSig().c_str());
});
});
}
void runCensusAllVirtual(LinkTestFunction f, bool small_) {
for (int n = 1;
n <= (small_ ? LINK_SMALL_CENSUS_SIZE : LINK_CENSUS_SIZE); ++n) {
FacetPairing<3>::findAllPairings(n, false, -1,
[](const FacetPairing<3>& p, LinkTestFunction f) {
ModelLinkGraph::generateAllEmbeddings(p, false, {},
[](const ModelLinkGraph& g, LinkTestFunction f) {
g.generateAllLinks([](const Link& link, LinkTestFunction f) {
f(link, link.brief().c_str());
}, f);
}, f);
}, f);
}
}
|
