-
Notifications
You must be signed in to change notification settings - Fork 8
/
utiltest.cc
155 lines (134 loc) · 4.46 KB
/
utiltest.cc
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
//
// Tests for Utility functions
//
// Copyright(C) 2010 Mizuki Fujisawa <[email protected]>
//
// 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; version 2 of the License.
//
// 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
//
#include <gtest/gtest.h>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <utility>
#include <vector>
#include "util.h"
namespace {
/* constants */
const size_t NUM_PAIRS = 100; ///< number of pairs
const size_t NUM_INTEGERS = 10; ///< number of integers
/* function prototypes */
static void random_pairs(size_t size,
std::vector<std::pair<int, double> > &pairs);
/* set random pairs */
static void random_pairs(size_t size,
std::vector<std::pair<int, double> > &pairs) {
for (size_t i = 0; i < size; i++) {
std::pair<int, double> p;
p.first = i;
p.second = rand();
if (i % 2 == 0) p.second *= -1;
pairs.push_back(p);
}
}
} /* namespace */
/* greater_pair */
TEST(UtilTest, ComparePairItemsTest) {
std::vector<std::pair<int, double> > pairs;
random_pairs(NUM_PAIRS, pairs);
std::sort(pairs.begin(), pairs.end(), bayon::greater_pair<int, double>);
for (size_t i = 1; i < pairs.size(); i++) {
EXPECT_TRUE(pairs[i-1].second >= pairs[i].second);
}
}
/* greater_pair */
TEST(UtilTest, ComparePairItemsSameValueTest) {
std::vector<std::pair<int, int> > pairs;
pairs.push_back(std::pair<int, int>(1, 1));
pairs.push_back(std::pair<int, int>(2, 1));
std::sort(pairs.begin(), pairs.end(), bayon::greater_pair<int, int>);
EXPECT_TRUE(pairs[0].first > pairs[1].first);
}
/* greater_pair_abs */
TEST(UtilTest, ComparePairItemsAbsTest) {
std::vector<std::pair<int, double> > pairs;
random_pairs(NUM_PAIRS, pairs);
std::sort(pairs.begin(), pairs.end(), bayon::greater_pair_abs<int, double>);
for (size_t i = 1; i < pairs.size(); i++) {
EXPECT_TRUE(std::abs(pairs[i-1].second) >= std::abs(pairs[i].second));
}
}
/* greater_pair_abs */
TEST(UtilTest, ComparePairItemsAbsSameValueTest) {
std::vector<std::pair<int, int> > pairs;
pairs.push_back(std::pair<int, int>(1, 1));
pairs.push_back(std::pair<int, int>(2, -1));
std::sort(pairs.begin(), pairs.end(), bayon::greater_pair_abs<int, int>);
EXPECT_TRUE(pairs[0].first > pairs[1].first);
}
/* get_extention */
TEST(UtilTest, GetExtensionTest) {
std::string filename;
filename = "test.tsv";
EXPECT_EQ("tsv", bayon::get_extension(filename));
filename = "test.tsv.txt";
EXPECT_EQ("txt", bayon::get_extension(filename));
filename = "test.tsv.";
EXPECT_EQ("", bayon::get_extension(filename));
filename = "test";
EXPECT_EQ("", bayon::get_extension(filename));
}
/* split_string */
TEST(UtilTest, SplitStringTest) {
std::string input;
std::vector<std::string> splited;
// space delimiter
input = "This is a pen";
bayon::split_string(input, " ", splited);
EXPECT_EQ(4, splited.size());
EXPECT_EQ("This", splited[0]);
EXPECT_EQ("is", splited[1]);
EXPECT_EQ("a", splited[2]);
EXPECT_EQ("pen", splited[3]);
splited.clear();
// tab delimiter
input = "This\tis\ta\tpen";
bayon::split_string(input, "\t", splited);
EXPECT_EQ(4, splited.size());
EXPECT_EQ("This", splited[0]);
EXPECT_EQ("is", splited[1]);
EXPECT_EQ("a", splited[2]);
EXPECT_EQ("pen", splited[3]);
splited.clear();
// space delimiter
input = "あい うえ おか";
bayon::split_string(input, " ", splited);
EXPECT_EQ(3, splited.size());
EXPECT_EQ("あい", splited[0]);
EXPECT_EQ("うえ", splited[1]);
EXPECT_EQ("おか", splited[2]);
splited.clear();
// tab delimiter
input = "あい\tうえ\tおか";
bayon::split_string(input, "\t", splited);
EXPECT_EQ(3, splited.size());
EXPECT_EQ("あい", splited[0]);
EXPECT_EQ("うえ", splited[1]);
EXPECT_EQ("おか", splited[2]);
splited.clear();
}
int main(int argc, char **argv) {
srand((unsigned int)time(NULL));
testing::InitGoogleTest(&argc, argv);
return RUN_ALL_TESTS();
}