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
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Test Suite *
* *
* 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 <cppunit/extensions/HelperMacros.h>
#include "angle/nanglestructurelist.h"
#include "triangulation/nexampletriangulation.h"
#include "triangulation/ntriangulation.h"
#include "testsuite/angle/testangle.h"
using regina::NAngleStructure;
using regina::NAngleStructureList;
using regina::NExampleTriangulation;
using regina::NPerm;
using regina::NTetrahedron;
using regina::NTriangulation;
class NAngleStructureListTest : public CppUnit::TestFixture {
CPPUNIT_TEST_SUITE(NAngleStructureListTest);
CPPUNIT_TEST(empty);
CPPUNIT_TEST(gieseking);
CPPUNIT_TEST(figure8);
CPPUNIT_TEST(loopC2);
CPPUNIT_TEST_SUITE_END();
private:
NTriangulation triEmpty;
/**< An empty triangulation. */
NTriangulation triGieseking;
/**< The Gieseking manifold. */
NTriangulation triFigure8;
/**< The figure eight knot complement. */
NTriangulation triLoopC2;
/**< An untwisted layered loop of length 2. */
public:
void copyAndDelete(NTriangulation& dest, NTriangulation* source) {
dest.insertTriangulation(*source);
delete source;
}
void setUp() {
// Use pre-coded triangulations where we can.
copyAndDelete(triFigure8,
NExampleTriangulation::figureEightKnotComplement());
copyAndDelete(triGieseking, NExampleTriangulation::gieseking());
// Layered loops can be constructed automatically.
triLoopC2.insertLayeredLoop(2, false);
}
void tearDown() {
}
void testSize(NAngleStructureList* list, const char* triName,
unsigned long expectedSize,
bool allowStrict, bool allowTaut) {
{
std::ostringstream msg;
msg << "Number of angle structures for " << triName
<< " should be " << expectedSize << ", not "
<< list->getNumberOfStructures() << '.';
CPPUNIT_ASSERT_MESSAGE(msg.str(),
list->getNumberOfStructures() == expectedSize);
}
{
std::ostringstream msg;
msg << "Angle structures for " << triName
<< " should ";
if (! allowStrict)
msg << "not ";
msg << "support strict angle structures.";
CPPUNIT_ASSERT_MESSAGE(msg.str(),
list->allowsStrict() == allowStrict);
}
{
std::ostringstream msg;
msg << "Angle structures for " << triName
<< " should ";
if (! allowTaut)
msg << "not ";
msg << "support taut angle structures.";
CPPUNIT_ASSERT_MESSAGE(msg.str(),
list->allowsTaut() == allowTaut);
}
}
void countStructures(const NAngleStructureList* list,
const char* triName, unsigned long expectedCount,
bool strict, bool taut) {
unsigned long tot = 0;
unsigned long size = list->getNumberOfStructures();
const NAngleStructure* s;
for (unsigned long i = 0; i < size; i++) {
s = list->getStructure(i);
if (s->isStrict() == strict && s->isTaut() == taut)
tot++;
}
std::ostringstream msg;
msg << "Number of ";
if (strict)
msg << "strict ";
else if (taut)
msg << "taut ";
else
msg << "generic ";
msg << "angle structures on " << triName << " should be "
<< expectedCount << ", not " << tot << '.';
CPPUNIT_ASSERT_MESSAGE(msg.str(), expectedCount == tot);
}
void empty() {
NAngleStructureList* list = NAngleStructureList::enumerate(
&triEmpty);
testSize(list, "the empty triangulation", 1, true, true);
delete list;
}
void gieseking() {
NAngleStructureList* list = NAngleStructureList::enumerate(
&triGieseking);
testSize(list, "the Gieseking manifold", 3, true, true);
countStructures(list, "the Gieseking manifold", 3,
false /* strict */, true /* taut */);
delete list;
}
void figure8() {
NAngleStructureList* list = NAngleStructureList::enumerate(
&triFigure8);
testSize(list, "the figure eight knot complement", 5, true, true);
countStructures(list, "the figure eight knot complement", 3,
false /* strict */, true /* taut */);
countStructures(list, "the figure eight knot complement", 2,
false /* strict */, false /* taut */);
delete list;
}
void loopC2() {
NAngleStructureList* list = NAngleStructureList::enumerate(
&triLoopC2);
testSize(list, "the untwisted layered loop C(2)", 0, false, false);
delete list;
}
};
void addNAngleStructureList(CppUnit::TextUi::TestRunner& runner) {
runner.addTest(NAngleStructureListTest::suite());
}
|
