/
test_ordered_map.cpp
142 lines (108 loc) · 3.81 KB
/
test_ordered_map.cpp
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
/*****************************************************************************/
/* Milliways - B+ trees and key-value store C++ library */
/* */
/* Copyright 2016 Marco Pantaleoni and J CUBE Inc. Tokyo, Japan. */
/* */
/* Author: Marco Pantaleoni <marco.pantaleoni@gmail.com> */
/* */
/* Licensed under the Apache License, Version 2.0 (the "License"); */
/* you may not use this file except in compliance with the License. */
/* You may obtain a copy of the License at */
/* */
/* http://www.apache.org/licenses/LICENSE-2.0 */
/* */
/* Unless required by applicable law or agreed to in writing, software */
/* distributed under the License is distributed on an "AS IS" BASIS, */
/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */
/* See the License for the specific language governing permissions and */
/* limitations under the License. */
/*****************************************************************************/
#define CATCH_CONFIG_MAIN // This tells Catch to provide a main() - only do this in one cpp file
#include "catch.hpp"
#include "ordered_map.h"
TEST_CASE( "Ordered map", "[ordered_map]" ) {
milliways::ordered_map<std::string, int> omap;
REQUIRE(omap.size() == 0);
SECTION( "can add elements" ) {
omap["Zed"] = 1;
omap["Something"] = 2;
omap["Abc"] = 3;
REQUIRE(omap.size() == 3);
REQUIRE(omap.size() == 3);
}
SECTION( "can find elements" ) {
REQUIRE(omap.size() == 0);
omap["Zed"] = 1;
omap["Something"] = 2;
omap["Abc"] = 3;
REQUIRE(omap.size() == 3);
REQUIRE(omap["Zed"] == 1);
REQUIRE(omap["Something"] == 2);
REQUIRE(omap["Abc"] == 3);
}
SECTION( "iteration respects insertion order" ) {
omap["Zed"] = 1;
omap["Something"] = 2;
omap["Abc"] = 3;
REQUIRE(omap.size() == 3);
milliways::ordered_map<std::string, int>::iterator it;
it = omap.begin();
REQUIRE(it);
REQUIRE(it->first == "Zed");
REQUIRE(it->second == 1);
REQUIRE(it != omap.end());
++it;
REQUIRE(it);
REQUIRE(it->first == "Something");
REQUIRE(it->second == 2);
REQUIRE(it != omap.end());
++it;
REQUIRE(it->first == "Abc");
REQUIRE(it->second == 3);
REQUIRE(it != omap.end());
++it;
REQUIRE(it == omap.end());
REQUIRE(!it);
}
SECTION( "const iterator works too" ) {
omap["Zed"] = 1;
omap["Something"] = 2;
omap["Abc"] = 3;
REQUIRE(omap.size() == 3);
milliways::ordered_map<std::string, int>::const_iterator it;
it = omap.begin();
REQUIRE(it);
REQUIRE(it->first == "Zed");
REQUIRE(it->second == 1);
REQUIRE(it != omap.end());
++it;
REQUIRE(it);
REQUIRE(it->first == "Something");
REQUIRE(it->second == 2);
REQUIRE(it != omap.end());
++it;
REQUIRE(it->first == "Abc");
REQUIRE(it->second == 3);
REQUIRE(it != omap.end());
++it;
REQUIRE(it == omap.end());
REQUIRE(!it);
}
SECTION( "pop() produces items in reverse order" ) {
omap["Zed"] = 1;
omap["Something"] = 2;
omap["Abc"] = 3;
REQUIRE(omap.size() == 3);
milliways::ordered_map<std::string, int>::value_type item;
item = omap.pop();
REQUIRE(item.first == "Abc");
REQUIRE(item.second == 3);
item = omap.pop();
REQUIRE(item.first == "Something");
REQUIRE(item.second == 2);
item = omap.pop();
REQUIRE(item.first == "Zed");
REQUIRE(item.second == 1);
REQUIRE(omap.size() == 0);
}
}