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
|
/*
* 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/array_sorted_map.h"
#include <numeric>
#include <random>
#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 = ArraySortedMap<int, int>;
constexpr IntMap::size_type kFixedSize = IntMap::kFixedSize;
TEST(ArraySortedMap, RemoveKeyValuePair) {
IntMap map{{1, 3}, {2, 4}};
IntMap new_map = map.erase(1);
ASSERT_TRUE(Found(new_map, 2, 4));
ASSERT_TRUE(NotFound(new_map, 1));
// Make sure the original one is not mutated
ASSERT_TRUE(Found(map, 1, 3));
ASSERT_TRUE(Found(map, 2, 4));
}
TEST(ArraySortedMap, MoreRemovals) {
IntMap map = IntMap{}
.insert(1, 1)
.insert(50, 50)
.insert(3, 3)
.insert(4, 4)
.insert(7, 7)
.insert(9, 9)
.insert(1, 20)
.insert(18, 18)
.insert(3, 2)
.insert(4, 71)
.insert(7, 42)
.insert(9, 88);
ASSERT_TRUE(Found(map, 7, 42));
ASSERT_TRUE(Found(map, 3, 2));
ASSERT_TRUE(Found(map, 1, 20));
IntMap s1 = map.erase(7);
IntMap s2 = map.erase(3);
IntMap s3 = map.erase(1);
ASSERT_TRUE(NotFound(s1, 7));
ASSERT_TRUE(Found(s1, 3, 2));
ASSERT_TRUE(Found(s1, 1, 20));
ASSERT_TRUE(Found(s2, 7, 42));
ASSERT_TRUE(NotFound(s2, 3));
ASSERT_TRUE(Found(s2, 1, 20));
ASSERT_TRUE(Found(s3, 7, 42));
ASSERT_TRUE(Found(s3, 3, 2));
ASSERT_TRUE(NotFound(s3, 1));
}
TEST(ArraySortedMap, RemovesMiddle) {
IntMap map{{1, 1}, {2, 2}, {3, 3}};
ASSERT_TRUE(Found(map, 1, 1));
ASSERT_TRUE(Found(map, 2, 2));
ASSERT_TRUE(Found(map, 3, 3));
IntMap s1 = map.erase(2);
ASSERT_TRUE(Found(s1, 1, 1));
ASSERT_TRUE(NotFound(s1, 2));
ASSERT_TRUE(Found(s1, 3, 3));
}
TEST(ArraySortedMap, ChecksSize) {
std::vector<int> to_insert = Sequence(kFixedSize);
IntMap map = ToMap<IntMap>(to_insert);
// Replacing an existing entry should not hit increase size
map = map.insert(5, 10);
int next = kFixedSize;
ASSERT_ANY_THROW(map.insert(next, next));
}
TEST(ArraySortedMap, EmptyRemoval) {
IntMap map;
IntMap new_map = map.erase(1);
EXPECT_TRUE(new_map.empty());
EXPECT_EQ(0u, new_map.size());
EXPECT_TRUE(NotFound(new_map, 1));
}
TEST(ArraySortedMap, InsertionAndRemovalOfMaxItems) {
auto expected_size = kFixedSize;
auto n = static_cast<int>(expected_size);
std::vector<int> to_insert = Shuffled(Sequence(n));
std::vector<int> to_remove = Shuffled(to_insert);
// Add them to the map
IntMap map = ToMap<IntMap>(to_insert);
ASSERT_EQ(expected_size, map.size())
<< "Check if all N objects are in the map";
// check the order is correct
ASSERT_SEQ_EQ(Pairs(Sorted(to_insert)), map);
for (int i : to_remove) {
map = map.erase(i);
}
ASSERT_EQ(0u, map.size()) << "Check we removed all of the items";
}
TEST(ArraySortedMap, BalanceProblem) {
std::vector<int> to_insert{1, 7, 8, 5, 2, 6, 4, 0, 3};
IntMap map = ToMap<IntMap>(to_insert);
ASSERT_SEQ_EQ(Pairs(Sorted(to_insert)), map);
}
} // namespace impl
} // namespace immutable
} // namespace firestore
} // namespace firebase
|
