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
|
// Copyright 2020 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/containers/fixed_flat_map.h"
#include <string>
#include "base/ranges/algorithm.h"
#include "base/strings/string_piece.h"
#include "base/test/gtest_util.h"
#include "testing/gmock/include/gmock/gmock.h"
#include "testing/gtest/include/gtest/gtest.h"
using ::testing::ElementsAre;
using ::testing::Pair;
namespace base {
namespace {
struct Unsortable {
int value;
};
bool operator==(const Unsortable& lhs, const Unsortable& rhs) {
return lhs.value == rhs.value;
}
bool operator<(const Unsortable& lhs, const Unsortable& rhs) = delete;
bool operator<=(const Unsortable& lhs, const Unsortable& rhs) = delete;
bool operator>(const Unsortable& lhs, const Unsortable& rhs) = delete;
bool operator>=(const Unsortable& lhs, const Unsortable& rhs) = delete;
} // namespace
TEST(FixedFlatMapTest, MakeFixedFlatMap_SortedInput) {
constexpr auto kSquares =
MakeFixedFlatMap<int, int>({{1, 1}, {2, 4}, {3, 9}, {4, 16}});
static_assert(ranges::is_sorted(kSquares), "Error: Map is not sorted.");
static_assert(ranges::adjacent_find(kSquares) == kSquares.end(),
"Error: Map contains repeated elements.");
EXPECT_THAT(kSquares,
ElementsAre(Pair(1, 1), Pair(2, 4), Pair(3, 9), Pair(4, 16)));
}
TEST(FixedFlatMapTest, MakeFixedFlatMap_UnsortedInput) {
constexpr auto kMap =
MakeFixedFlatMap<StringPiece, int>({{"foo", 1}, {"bar", 2}, {"baz", 3}});
static_assert(ranges::is_sorted(kMap), "Error: Map is not sorted.");
static_assert(ranges::adjacent_find(kMap) == kMap.end(),
"Error: Map contains repeated elements.");
EXPECT_THAT(kMap,
ElementsAre(Pair("bar", 2), Pair("baz", 3), Pair("foo", 1)));
}
// Tests that even though the keys are immutable, the values of a non-const map
// can still be changed.
TEST(FixedFlatMapTest, MutableValues) {
auto map = MakeFixedFlatMap<std::string, int>({{"bar", 1}, {"foo", 2}});
EXPECT_THAT(map, ElementsAre(Pair("bar", 1), Pair("foo", 2)));
map.at("bar") = 2;
EXPECT_THAT(map, ElementsAre(Pair("bar", 2), Pair("foo", 2)));
}
// Tests that even though the values are unsortable the built in sort still
// correctly orders the keys.
TEST(FixedFlatMapTest, UnsortableValues) {
using PairType = std::pair<int, Unsortable>;
constexpr auto kSquares = MakeFixedFlatMap<int, Unsortable>({
{4, {16}},
{3, {9}},
{2, {4}},
{1, {1}},
});
EXPECT_THAT(kSquares, ElementsAre(PairType(1, {1}), PairType(2, {4}),
PairType(3, {9}), PairType(4, {16})));
}
// Verifies that passing repeated keys to MakeFixedFlatMap results in a CHECK
// failure.
TEST(FixedFlatMapTest, RepeatedKeys) {
// Note: The extra pair of parens is needed to escape the nested commas in the
// type list.
EXPECT_CHECK_DEATH((MakeFixedFlatMap<StringPiece, int>(
{{"foo", 1}, {"bar", 2}, {"foo", 3}})));
}
} // namespace base
|
