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
|
/**************************************************************************
* *
* 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 "maths/arrow.h"
#include "utilities/stringutils.h"
#include "utilities/tightencodingtest.h"
using regina::Arrow;
using regina::Integer;
using regina::Laurent;
class ArrowTest : public testing::Test {
protected:
Arrow zero {};
Arrow one { {{}, {0, {1}}} };
Arrow minusOne { {{}, {0, {-1}}} };
Arrow two { {{}, {0, {2}}} };
Arrow minusTwo { {{}, {0, {-2}}} };
Arrow k1 { {{1}, {0, {1}}} };
Arrow k2 { {{0,1}, {0, {1}}} };
Arrow trefoil { {{}, {-16, {-1,0,0,0,1,0,0,0,0,0,0,0,1}}} };
Arrow shiftedTrefoil { {{0,1}, {-16, {-1,0,0,0,1,0,0,0,0,0,0,0,1}}} };
Arrow virtualTrefoil {
{{}, {-4, {1}}},
{{1}, {-10, {-1,0,0,0,1}}} };
Arrow kishino {
{{}, {-4, {1,0,0,0,1,0,0,0,1}}},
{{0,1}, {0, {2}}},
{{2}, {-4, {-1,0,0,0,-2,0,0,0,-1}}} };
};
// We could probably do with a lot more tests here (though much of the
// arithmetic is actually performed by Laurent<Integer>, which does already
// come with its own arithmetic tests).
//
// Note also that we do have implicit testing of the Arrow class via the Link
// tests, where we verify computations of many different arrow polynomials of
// classical and virtual links.
TEST_F(ArrowTest, ringConstants) {
// Verify that the RingTraits constants looks correct.
EXPECT_EQ(regina::RingTraits<Arrow>::zero.str(), "0");
EXPECT_EQ(regina::RingTraits<Arrow>::one.str(), "1");
}
TEST_F(ArrowTest, output) {
EXPECT_EQ(zero.str(), "0");
EXPECT_EQ(one.str(), "1");
EXPECT_EQ(minusOne.str(), "-1");
EXPECT_EQ(two.str(), "2");
EXPECT_EQ(minusTwo.str(), "-2");
EXPECT_EQ(k1.str(), "K_1");
EXPECT_EQ(k2.str(), "K_2");
EXPECT_EQ(trefoil.str(), "A^-4 + A^-12 - A^-16");
EXPECT_EQ(shiftedTrefoil.str(), "(A^-4 + A^-12 - A^-16) K_2");
EXPECT_EQ(virtualTrefoil.str(), "A^-4 + (A^-6 - A^-10) K_1");
EXPECT_EQ(kishino.str(),
"(A^4 + 1 + A^-4) + 2 K_2 + (-A^4 - 2 - A^-4) K_1^2");
}
TEST_F(ArrowTest, tightEncoding) {
TightEncodingTest<Arrow>::verifyTightEncoding(zero);
TightEncodingTest<Arrow>::verifyTightEncoding(one);
TightEncodingTest<Arrow>::verifyTightEncoding(minusOne);
TightEncodingTest<Arrow>::verifyTightEncoding(two);
TightEncodingTest<Arrow>::verifyTightEncoding(minusTwo);
TightEncodingTest<Arrow>::verifyTightEncoding(k1);
TightEncodingTest<Arrow>::verifyTightEncoding(k2);
TightEncodingTest<Arrow>::verifyTightEncoding(trefoil);
TightEncodingTest<Arrow>::verifyTightEncoding(shiftedTrefoil);
TightEncodingTest<Arrow>::verifyTightEncoding(virtualTrefoil);
TightEncodingTest<Arrow>::verifyTightEncoding(kishino);
}
|
