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
|
#include "testing/testing.hpp"
#include "indexer/feature_covering.hpp"
#include <vector>
using namespace std;
UNIT_TEST(SortAndMergeIntervals_1Interval)
{
vector<pair<int64_t, int64_t> > v;
v.push_back(make_pair(1ULL, 2ULL));
TEST_EQUAL(covering::SortAndMergeIntervals(v), v, ());
}
UNIT_TEST(SortAndMergeIntervals_2NotSortedNotOverlappin)
{
vector<pair<int64_t, int64_t> > v;
v.push_back(make_pair(3ULL, 4ULL));
v.push_back(make_pair(1ULL, 2ULL));
vector<pair<int64_t, int64_t> > e;
e.push_back(make_pair(1ULL, 2ULL));
e.push_back(make_pair(3ULL, 4ULL));
TEST_EQUAL(covering::SortAndMergeIntervals(v), e, ());
}
UNIT_TEST(SortAndMergeIntervals_BorderMerge)
{
vector<pair<int64_t, int64_t> > v;
v.push_back(make_pair(1ULL, 2ULL));
v.push_back(make_pair(2ULL, 3ULL));
vector<pair<int64_t, int64_t> > e;
e.push_back(make_pair(1ULL, 3ULL));
TEST_EQUAL(covering::SortAndMergeIntervals(v), e, ());
}
UNIT_TEST(SortAndMergeIntervals_Overlap)
{
vector<pair<int64_t, int64_t> > v;
v.push_back(make_pair(1ULL, 3ULL));
v.push_back(make_pair(2ULL, 4ULL));
vector<pair<int64_t, int64_t> > e;
e.push_back(make_pair(1ULL, 4ULL));
TEST_EQUAL(covering::SortAndMergeIntervals(v), e, ());
}
UNIT_TEST(SortAndMergeIntervals_Contain)
{
vector<pair<int64_t, int64_t> > v;
v.push_back(make_pair(2ULL, 3ULL));
v.push_back(make_pair(1ULL, 4ULL));
vector<pair<int64_t, int64_t> > e;
e.push_back(make_pair(1ULL, 4ULL));
TEST_EQUAL(covering::SortAndMergeIntervals(v), e, ());
}
UNIT_TEST(SortAndMergeIntervals_ContainAndTouchBorder)
{
vector<pair<int64_t, int64_t> > v;
v.push_back(make_pair(1ULL, 3ULL));
v.push_back(make_pair(1ULL, 4ULL));
vector<pair<int64_t, int64_t> > e;
e.push_back(make_pair(1ULL, 4ULL));
TEST_EQUAL(covering::SortAndMergeIntervals(v), e, ());
}
|
