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
|
#include "a2functional.h"
#include <string>
#include <numeric>
#include <algorithm>
#include <cppunit/extensions/HelperMacros.h>
namespace aria2 {
class a2functionalTest : public CppUnit::TestFixture {
CPPUNIT_TEST_SUITE(a2functionalTest);
CPPUNIT_TEST(testStrjoin);
CPPUNIT_TEST(testLeastRecentAccess);
CPPUNIT_TEST_SUITE_END();
public:
void testStrjoin();
void testLeastRecentAccess();
struct LastAccess {
time_t lastAccess_;
LastAccess(time_t lastAccess) : lastAccess_(lastAccess) {}
time_t getLastAccessTime() const { return lastAccess_; }
};
};
CPPUNIT_TEST_SUITE_REGISTRATION(a2functionalTest);
void a2functionalTest::testStrjoin()
{
std::vector<std::string> v;
CPPUNIT_ASSERT_EQUAL(std::string(""), strjoin(v.begin(), v.end(), " "));
v.push_back("A");
CPPUNIT_ASSERT_EQUAL(std::string("A"), strjoin(v.begin(), v.end(), " "));
v.push_back("hero");
v.push_back("is");
v.push_back("lonely");
CPPUNIT_ASSERT_EQUAL(std::string("A hero is lonely"),
strjoin(v.begin(), v.end(), " "));
}
void a2functionalTest::testLeastRecentAccess()
{
std::vector<LastAccess> v;
for (int i = 99; i >= 0; --i) {
v.push_back(LastAccess(i));
}
std::sort(v.begin(), v.end(), LeastRecentAccess<LastAccess>());
for (int i = 0; i < 100; ++i) {
CPPUNIT_ASSERT_EQUAL((time_t)i, v[i].lastAccess_);
}
}
} // namespace aria2
|
