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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
|
/*
* Copyright 2018 Google
*
* 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.
*/
#include "Firestore/core/src/firebase/firestore/immutable/tree_sorted_map.h"
#include "Firestore/core/src/firebase/firestore/util/secure_random.h"
#include "Firestore/core/test/firebase/firestore/immutable/testing.h"
#include "gtest/gtest.h"
namespace firebase {
namespace firestore {
namespace immutable {
namespace impl {
using IntMap = TreeSortedMap<int, int>;
TEST(TreeSortedMap, EmptySize) {
IntMap map;
EXPECT_TRUE(map.empty());
EXPECT_EQ(0u, map.size());
EXPECT_EQ(Color::Black, map.root().color());
}
TEST(TreeSortedMap, EmptyHasEmptyChildren) {
IntMap map;
IntMap::node_type left = map.root().left();
ASSERT_TRUE(left.empty());
IntMap::node_type right = map.root().right();
ASSERT_TRUE(right.empty());
}
TEST(TreeSortedMap, PropertiesForEmpty) {
IntMap empty;
EXPECT_TRUE(empty.empty());
EXPECT_EQ(0, empty.root().value());
EXPECT_EQ(Color::Black, empty.root().color());
EXPECT_FALSE(empty.root().red());
}
TEST(TreeSortedMap, PropertiesForNonEmpty) {
IntMap empty;
IntMap non_empty = empty.insert(1, 2);
EXPECT_FALSE(non_empty.empty());
EXPECT_EQ(1, non_empty.root().key());
EXPECT_EQ(2, non_empty.root().value());
// Root nodes are always black
EXPECT_EQ(Color::Black, non_empty.root().color());
EXPECT_FALSE(non_empty.root().red());
EXPECT_TRUE(non_empty.root().left().empty());
EXPECT_TRUE(non_empty.root().right().empty());
}
TEST(TreeSortedMap, RotatesLeft) {
IntMap map;
EXPECT_EQ(Color::Black, map.root().color());
// root node, with two empty children
map = map.insert(1, 1);
EXPECT_EQ(Color::Black, map.root().color());
EXPECT_EQ(Color::Black, map.root().left().color());
EXPECT_EQ(Color::Black, map.root().right().color());
// insert successor, leans left, rotation required
map = map.insert(2, 2);
EXPECT_EQ(Color::Black, map.root().color());
EXPECT_EQ(Color::Red, map.root().left().color());
EXPECT_EQ(Color::Black, map.root().right().color());
// insert successor, balanced, color flip required
map = map.insert(3, 3);
EXPECT_EQ(2, map.root().key());
EXPECT_EQ(Color::Black, map.root().color());
EXPECT_EQ(Color::Black, map.root().left().color());
EXPECT_EQ(Color::Black, map.root().right().color());
}
TEST(TreeSortedMap, RotatesLeftWithSubtree) {
// Build an initially balanced, all black tree
IntMap map;
map = map.insert(5, 5);
map = map.insert(3, 3);
map = map.insert(7, 7);
EXPECT_EQ(Color::Black, map.root().color());
EXPECT_EQ(Color::Black, map.root().left().color());
EXPECT_EQ(Color::Black, map.root().right().color());
// left child of right, no rotation yet
map = map.insert(6, 6);
EXPECT_EQ(5, map.root().key());
EXPECT_EQ(6, map.root().right().left().key());
EXPECT_EQ(Color::Red, map.root().right().left().color());
// right child of right, triggers a color flip in the right node and forces
// a left rotation of the root
map = map.insert(8, 8);
EXPECT_EQ(7, map.root().key());
EXPECT_EQ(Color::Black, map.root().color());
EXPECT_EQ(5, map.root().left().key());
EXPECT_EQ(Color::Red, map.root().left().color());
EXPECT_EQ(3, map.root().left().left().key());
EXPECT_EQ(Color::Black, map.root().left().left().color());
EXPECT_EQ(6, map.root().left().right().key());
EXPECT_EQ(Color::Black, map.root().left().right().color());
EXPECT_EQ(8, map.root().right().key());
EXPECT_EQ(Color::Black, map.root().right().color());
}
TEST(TreeSortedMap, RotatesRight) {
IntMap map;
EXPECT_EQ(Color::Black, map.root().color());
// root node, with two empty children
map = map.insert(3, 3);
EXPECT_EQ(Color::Black, map.root().color());
EXPECT_EQ(Color::Black, map.root().left().color());
EXPECT_EQ(Color::Black, map.root().right().color());
// insert predecessor, leans left, no rotation
map = map.insert(2, 2);
EXPECT_EQ(Color::Black, map.root().color());
EXPECT_EQ(Color::Red, map.root().left().color());
EXPECT_EQ(Color::Black, map.root().right().color());
// insert predecessor, rotation required
map = map.insert(1, 2);
EXPECT_EQ(2, map.root().key());
EXPECT_EQ(Color::Black, map.root().color());
EXPECT_EQ(Color::Black, map.root().left().color());
EXPECT_EQ(Color::Black, map.root().right().color());
}
TEST(TreeSortedMap, RotatesRightWithSubtree) {
// Build an initially balanced, all black tree
IntMap map;
map = map.insert(5, 5);
map = map.insert(3, 3);
map = map.insert(7, 7);
EXPECT_EQ(Color::Black, map.root().color());
EXPECT_EQ(Color::Black, map.root().left().color());
EXPECT_EQ(Color::Black, map.root().right().color());
// insert left.left, no rotation yet
map = map.insert(1, 1);
EXPECT_EQ(5, map.root().key());
EXPECT_EQ(1, map.root().left().left().key());
EXPECT_EQ(Color::Red, map.root().left().left().color());
// insert left.right, triggers a color flip in left but no rotation
map = map.insert(4, 4);
EXPECT_EQ(5, map.root().key());
EXPECT_EQ(Color::Red, map.root().left().color());
EXPECT_EQ(Color::Black, map.root().left().left().color());
EXPECT_EQ(Color::Black, map.root().left().right().color());
// insert left.left.left; still no rotation
map = map.insert(0, 0);
EXPECT_EQ(5, map.root().key());
EXPECT_EQ(Color::Black, map.root().color());
EXPECT_EQ(Color::Red, map.root().left().color());
EXPECT_EQ(Color::Black, map.root().left().left().color());
EXPECT_EQ(Color::Red, map.root().left().left().left().color());
EXPECT_EQ(Color::Black, map.root().right().color());
// insert left.left.right:
// * triggers a color flip on left.left => Red
// * triggers right rotation at the root because left and left.left are Red
// * triggers a color flip on root => whole tree black
map = map.insert(2, 2);
EXPECT_EQ(3, map.root().key());
EXPECT_EQ(Color::Black, map.root().color());
EXPECT_EQ(1, map.root().left().key());
EXPECT_EQ(Color::Black, map.root().left().color());
EXPECT_EQ(0, map.root().left().left().key());
EXPECT_EQ(Color::Black, map.root().left().left().color());
EXPECT_EQ(2, map.root().left().right().key());
EXPECT_EQ(Color::Black, map.root().left().right().color());
EXPECT_EQ(5, map.root().right().key());
EXPECT_EQ(Color::Black, map.root().right().color());
EXPECT_EQ(4, map.root().right().left().key());
EXPECT_EQ(Color::Black, map.root().right().left().color());
EXPECT_EQ(7, map.root().right().right().key());
EXPECT_EQ(Color::Black, map.root().right().right().color());
}
TEST(TreeSortedMap, InsertIsImmutable) {
IntMap original = IntMap{}.insert(3, 3);
IntMap modified = original.insert(2, 2).insert(1, 1);
EXPECT_EQ(3, original.root().key());
EXPECT_EQ(3, original.root().value());
EXPECT_EQ(Color::Black, original.root().color());
EXPECT_TRUE(original.root().left().empty());
EXPECT_TRUE(original.root().right().empty());
}
} // namespace impl
} // namespace immutable
} // namespace firestore
} // namespace firebase
|
