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
|
#include "StarOrderedMap.hpp"
#include "gtest/gtest.h"
using namespace Star;
TEST(OrderedMap, Insert) {
OrderedMap<int, int> map;
map.insert({3, 3});
map.insert({2, 2});
map.insert({1, 1});
{
List<int> comp = {3, 2, 1};
EXPECT_EQ(comp, map.keys());
}
{
List<int> comp = {3, 2, 1};
List<int> keys;
for (auto i = map.begin(); i != map.end(); ++i)
keys.append(i->first);
EXPECT_EQ(comp, keys);
}
{
List<int> comp = {1, 2, 3};
List<int> keys;
for (auto i = map.rbegin(); i != map.rend(); ++i)
keys.append(i->first);
EXPECT_EQ(comp, keys);
}
}
TEST(OrderedMap, Getters) {
OrderedMap<int, int> map;
map[1] = 1;
map[2] = 2;
map[3] = 3;
EXPECT_EQ(map.get(1), 1);
EXPECT_EQ(map.get(2), 2);
EXPECT_EQ(map.get(3), 3);
EXPECT_EQ(map.ptr(3), &map.get(3));
}
TEST(OrderedMap, ConstGetters) {
OrderedHashMap<int, int> const map{
{1, 1},
{2, 2},
{3, 3}
};
EXPECT_EQ(map.get(1), 1);
EXPECT_EQ(map.get(2), 2);
EXPECT_EQ(map.get(3), 3);
EXPECT_EQ(map.ptr(3), &map.get(3));
EXPECT_EQ(map.value(4, 4), 4);
EXPECT_EQ(map.maybe(5), Maybe<int>());
}
TEST(OrderedMap, Sorting) {
OrderedMap<int, int> map{
{1, 5},
{3, 3},
{2, 4},
{5, 1},
{4, 2}
};
EXPECT_EQ(map.keys(), List<int>({1, 3, 2, 5, 4}));
map.sortByKey();
EXPECT_EQ(map.keys(), List<int>({1, 2, 3, 4, 5}));
map.sortByValue();
EXPECT_EQ(map.keys(), List<int>({5, 4, 3, 2, 1}));
}
TEST(OrderedMap, Removing) {
OrderedHashMap<int, int> map{
{5, 5},
{4, 4},
{3, 3},
{2, 2},
{1, 1}
};
map.remove(3);
map.remove(1);
EXPECT_EQ(map.keys(), List<int>({5, 4, 2}));
}
|