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
|
/*************************************************************************
** PairTest.cpp **
** **
** This file is part of dvisvgm -- a fast DVI to SVG converter **
** Copyright (C) 2005-2017 Martin Gieseking <martin.gieseking@uos.de> **
** **
** 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 3 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, see <http://www.gnu.org/licenses/>. **
*************************************************************************/
#include <gtest/gtest.h>
#include <sstream>
#include "Pair.hpp"
using namespace std;
TEST(PairTest, constructor) {
DPair p(-1.5, 2);
ASSERT_EQ(p.x(), -1.5);
ASSERT_EQ(p.y(), 2);
DPair q = p;
ASSERT_EQ(q.x(), -1.5);
ASSERT_EQ(q.y(), 2);
}
TEST(PairTest, setter) {
DPair p(1,2);
ASSERT_EQ(p, DPair(1,2));
p.x(3);
ASSERT_EQ(p, DPair(3,2));
p.y(5);
ASSERT_EQ(p, DPair(3,5));
}
TEST(PairTest, length) {
ASSERT_EQ(DPair(0,0).length(), 0);
ASSERT_EQ(DPair(1,0).length(), 1);
ASSERT_EQ(DPair(0,1).length(), 1);
ASSERT_EQ(DPair(-1,0).length(), 1);
ASSERT_EQ(DPair(0,-1).length(), 1);
// check some Pythagorean triples
for (int i=1; i < 10; ++i) {
for (int j=i+1; j <= 10; ++j) {
int a = j*j-i*i;
int b = 2*i*j;
int c = j*j+i*i;
ASSERT_EQ(DPair(a, b).length(), c);
ASSERT_EQ(DPair(b, a).length(), c);
ASSERT_EQ(DPair(-a, b).length(), c);
ASSERT_EQ(DPair(-b, a).length(), c);
ASSERT_EQ(DPair(-a, -b).length(), c);
}
}
}
TEST(PairTest, add) {
ASSERT_EQ(DPair(2,3)+DPair(0,0), DPair(2,3));
ASSERT_EQ(DPair(2,3)+DPair(4,5), DPair(6,8));
ASSERT_EQ(DPair(2,3)+DPair(-4,-5), DPair(-2,-2));
}
TEST(PairTest, sub) {
ASSERT_EQ(DPair(2,3)-DPair(0,0), DPair(2,3));
ASSERT_EQ(DPair(2,3)-DPair(4,5), DPair(-2,-2));
ASSERT_EQ(DPair(2,3)-DPair(-4,-5), DPair(6,8));
}
TEST(PairTest, mul) {
ASSERT_EQ(DPair(2,3)*0.0, DPair(0,0));
ASSERT_EQ(DPair(2,3)*1.0, DPair(2,3));
ASSERT_EQ(DPair(2,3)*2.0, DPair(4,6));
ASSERT_EQ(DPair(2,3)*(-2.0), DPair(-4,-6));
}
TEST(PairTest, div) {
ASSERT_EQ(DPair(2,3)/1.0, DPair(2,3));
ASSERT_EQ(DPair(2,3)/2.0, DPair(1,1.5));
ASSERT_EQ(DPair(2,3)/(-2.0), DPair(-1,-1.5));
}
TEST(PairTest, equality) {
ASSERT_TRUE(DPair(2,3) == DPair(2,3));
ASSERT_FALSE(DPair(2,3) == DPair(-2,-3));
ASSERT_TRUE(DPair(2,3)+DPair(4,5) == DPair(6,8));
ASSERT_FALSE(DPair(2,3)+DPair(4,5) != DPair(6,8));
}
TEST(PairTest, ortho) {
ASSERT_EQ(DPair(0,0).ortho(), DPair(0,0));
ASSERT_EQ(DPair(1,0).ortho(), DPair(0,1));
ASSERT_EQ(DPair(0,1).ortho(), DPair(-1,0));
ASSERT_EQ(DPair(-1,0).ortho(), DPair(0,-1));
ASSERT_EQ(DPair(0,-1).ortho(), DPair(1,0));
}
TEST(PairTest, write) {
ostringstream oss;
DPair p(3,4);
oss << p;
ASSERT_EQ(oss.str(), "(3,4)");
p *= 2;
oss.str("");
oss << p;
ASSERT_EQ(oss.str(), "(6,8)");
}
|
