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
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
// <flat_map>
// class flat_multimap
// template<class K> pair<iterator,iterator> equal_range(const K& x);
// template<class K> pair<const_iterator,const_iterator> equal_range(const K& x) const;
#include <algorithm>
#include <cassert>
#include <deque>
#include <flat_map>
#include <functional>
#include <string>
#include <utility>
#include "MinSequenceContainer.h"
#include "../helpers.h"
#include "test_macros.h"
#include "min_allocator.h"
// Constraints: The qualified-id Compare::is_transparent is valid and denotes a type.
template <class M>
concept CanEqualRange = requires(M m, Transparent<int> k) { m.equal_range(k); };
using TransparentMap = std::flat_multimap<int, double, TransparentComparator>;
using NonTransparentMap = std::flat_multimap<int, double, NonTransparentComparator>;
static_assert(CanEqualRange<TransparentMap>);
static_assert(CanEqualRange<const TransparentMap>);
static_assert(!CanEqualRange<NonTransparentMap>);
static_assert(!CanEqualRange<const NonTransparentMap>);
template <class KeyContainer, class ValueContainer>
constexpr void test() {
using Key = typename KeyContainer::value_type;
using Value = typename ValueContainer::value_type;
using M = std::flat_multimap<Key, Value, TransparentComparator, KeyContainer, ValueContainer>;
using R = std::pair<typename M::iterator, typename M::iterator>;
using CR = std::pair<typename M::const_iterator, typename M::const_iterator>;
M m = {{"alpha", 1},
{"alpha", 1},
{"alpha", 3},
{"beta", 2},
{"epsilon", 3},
{"epsilon", 0},
{"eta", 4},
{"gamma", 5},
{"gamma", 1}};
const auto& cm = m;
ASSERT_SAME_TYPE(decltype(m.equal_range(Transparent<std::string>{"abc"})), R);
ASSERT_SAME_TYPE(decltype(std::as_const(m).equal_range(Transparent<std::string>{"b"})), CR);
auto test_found = [&](auto&& map, const auto& expected_key, std::initializer_list<Value> expected_values) {
auto [first, last] = map.equal_range(Transparent<std::string>{expected_key});
auto expected_range =
expected_values | std::views::transform([&](auto&& val) { return std::pair(expected_key, val); });
assert(std::ranges::is_permutation(std::ranges::subrange(first, last), expected_range));
};
auto test_not_found = [&](auto&& map, const std::string& expected_key, long expected_offset) {
auto [first, last] = map.equal_range(Transparent<std::string>{expected_key});
assert(first == last);
assert(first - m.begin() == expected_offset);
};
test_found(m, "alpha", {1, 1, 3});
test_found(m, "beta", {2});
test_found(m, "epsilon", {3, 0});
test_found(m, "eta", {4});
test_found(m, "gamma", {5, 1});
test_found(cm, "alpha", {1, 1, 3});
test_found(cm, "beta", {2});
test_found(cm, "epsilon", {3, 0});
test_found(cm, "eta", {4});
test_found(cm, "gamma", {5, 1});
test_not_found(m, "charlie", 4);
test_not_found(m, "aaa", 0);
test_not_found(m, "zzz", 9);
test_not_found(cm, "charlie", 4);
test_not_found(cm, "aaa", 0);
test_not_found(cm, "zzz", 9);
}
constexpr bool test() {
test<std::vector<std::string>, std::vector<int>>();
#ifndef __cpp_lib_constexpr_deque
if (!TEST_IS_CONSTANT_EVALUATED)
#endif
test<std::deque<std::string>, std::vector<int>>();
test<MinSequenceContainer<std::string>, MinSequenceContainer<int>>();
test<std::vector<std::string, min_allocator<std::string>>, std::vector<int, min_allocator<int>>>();
{
bool transparent_used = false;
TransparentComparator c(transparent_used);
std::flat_multimap<int, int, TransparentComparator> m(std::sorted_equivalent, {{1, 1}, {2, 2}, {3, 1}, {3, 3}}, c);
assert(!transparent_used);
auto p = m.equal_range(Transparent<int>{3});
assert(p.first == m.begin() + 2);
assert(p.second == m.end());
assert(transparent_used);
}
{
// LWG4239 std::string and C string literal
using M = std::flat_multimap<std::string, int, std::less<>>;
M m{{"alpha", 1}, {"beta", 2}, {"beta", 1}, {"eta", 3}, {"gamma", 3}};
auto [first, last] = m.equal_range("beta");
assert(first == m.begin() + 1);
assert(last == m.begin() + 3);
}
return true;
}
int main(int, char**) {
test();
#if TEST_STD_VER >= 26
static_assert(test());
#endif
return 0;
}
|
