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
|
//===----------------------------------------------------------------------===//
//
// 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_set>
// pair<iterator,iterator> equal_range(const key_type& k);
// pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
#include <cassert>
#include <deque>
#include <flat_set>
#include <functional>
#include <utility>
#include "MinSequenceContainer.h"
#include "test_macros.h"
#include "min_allocator.h"
template <class KeyContainer>
constexpr void test_one() {
using Key = typename KeyContainer::value_type;
{
using M = std::flat_set<Key, std::less<>, KeyContainer>;
using R = std::pair<typename M::iterator, typename M::iterator>;
using CR = std::pair<typename M::const_iterator, typename M::const_iterator>;
M m = {1, 2, 4, 5, 8};
ASSERT_SAME_TYPE(decltype(m.equal_range(0)), R);
ASSERT_SAME_TYPE(decltype(std::as_const(m).equal_range(0)), CR);
auto begin = m.begin();
assert(m.equal_range(0) == std::pair(begin, begin));
assert(m.equal_range(1) == std::pair(begin, begin + 1));
assert(m.equal_range(2) == std::pair(begin + 1, begin + 2));
assert(m.equal_range(3) == std::pair(begin + 2, begin + 2));
assert(m.equal_range(4) == std::pair(begin + 2, begin + 3));
assert(m.equal_range(5) == std::pair(begin + 3, begin + 4));
assert(m.equal_range(6) == std::pair(begin + 4, begin + 4));
assert(m.equal_range(7) == std::pair(begin + 4, begin + 4));
assert(std::as_const(m).equal_range(8) == std::pair(m.cbegin() + 4, m.cbegin() + 5));
assert(std::as_const(m).equal_range(9) == std::pair(m.cbegin() + 5, m.cbegin() + 5));
}
{
using M = std::flat_set<Key, std::greater<int>, KeyContainer>;
using R = std::pair<typename M::iterator, typename M::iterator>;
using CR = std::pair<typename M::const_iterator, typename M::const_iterator>;
M m = {1, 2, 4, 5, 8};
ASSERT_SAME_TYPE(decltype(m.equal_range(0)), R);
ASSERT_SAME_TYPE(decltype(std::as_const(m).equal_range(0)), CR);
auto begin = m.begin();
assert(m.equal_range(0) == std::pair(begin + 5, begin + 5));
assert(m.equal_range(1) == std::pair(begin + 4, begin + 5));
assert(m.equal_range(2) == std::pair(begin + 3, begin + 4));
assert(m.equal_range(3) == std::pair(begin + 3, begin + 3));
assert(m.equal_range(4) == std::pair(begin + 2, begin + 3));
assert(m.equal_range(5) == std::pair(begin + 1, begin + 2));
assert(m.equal_range(6) == std::pair(begin + 1, begin + 1));
assert(m.equal_range(7) == std::pair(begin + 1, begin + 1));
assert(std::as_const(m).equal_range(8) == std::pair(m.cbegin(), m.cbegin() + 1));
assert(std::as_const(m).equal_range(9) == std::pair(m.cbegin(), m.cbegin()));
}
{
// empty
using M = std::flat_set<Key, std::less<>, KeyContainer>;
M m;
auto end = m.end();
assert(m.equal_range(0) == std::pair(end, end));
}
}
constexpr bool test() {
test_one<std::vector<int>>();
#ifndef __cpp_lib_constexpr_deque
if (!TEST_IS_CONSTANT_EVALUATED)
#endif
test_one<std::deque<int>>();
test_one<MinSequenceContainer<int>>();
test_one<std::vector<int, min_allocator<int>>>();
return true;
}
int main(int, char**) {
test();
#if TEST_STD_VER >= 26
static_assert(test());
#endif
return 0;
}
|
