1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
10
11// <flat_set>
12
13// pair<iterator,iterator> equal_range(const key_type& k);
14// pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
15
16#include <cassert>
17#include <deque>
18#include <flat_set>
19#include <functional>
20#include <utility>
21
22#include "MinSequenceContainer.h"
23#include "test_macros.h"
24#include "min_allocator.h"
25
26template <class KeyContainer>
27void test_one() {
28 using Key = typename KeyContainer::value_type;
29 {
30 using M = std::flat_multiset<Key, std::less<>, KeyContainer>;
31 using R = std::pair<typename M::iterator, typename M::iterator>;
32 using CR = std::pair<typename M::const_iterator, typename M::const_iterator>;
33 M m = {1, 2, 2, 4, 4, 5, 5, 5, 8};
34 ASSERT_SAME_TYPE(decltype(m.equal_range(0)), R);
35 ASSERT_SAME_TYPE(decltype(std::as_const(m).equal_range(0)), CR);
36 auto begin = m.begin();
37 assert(m.equal_range(0) == std::pair(begin, begin));
38 assert(m.equal_range(1) == std::pair(begin, begin + 1));
39 assert(m.equal_range(2) == std::pair(begin + 1, begin + 3));
40 assert(m.equal_range(3) == std::pair(begin + 3, begin + 3));
41 assert(m.equal_range(4) == std::pair(begin + 3, begin + 5));
42 assert(m.equal_range(5) == std::pair(begin + 5, begin + 8));
43 assert(m.equal_range(6) == std::pair(begin + 8, begin + 8));
44 assert(m.equal_range(7) == std::pair(begin + 8, begin + 8));
45 assert(std::as_const(m).equal_range(8) == std::pair(m.cbegin() + 8, m.cbegin() + 9));
46 assert(std::as_const(m).equal_range(9) == std::pair(m.cbegin() + 9, m.cbegin() + 9));
47 }
48
49 {
50 using M = std::flat_multiset<Key, std::greater<int>, KeyContainer>;
51 using R = std::pair<typename M::iterator, typename M::iterator>;
52 using CR = std::pair<typename M::const_iterator, typename M::const_iterator>;
53 M m = {1, 1, 1, 2, 4, 5, 8, 8};
54 ASSERT_SAME_TYPE(decltype(m.equal_range(0)), R);
55 ASSERT_SAME_TYPE(decltype(std::as_const(m).equal_range(0)), CR);
56 auto begin = m.begin();
57 assert(m.equal_range(0) == std::pair(begin + 8, begin + 8));
58 assert(m.equal_range(1) == std::pair(begin + 5, begin + 8));
59 assert(m.equal_range(2) == std::pair(begin + 4, begin + 5));
60 assert(m.equal_range(3) == std::pair(begin + 4, begin + 4));
61 assert(m.equal_range(4) == std::pair(begin + 3, begin + 4));
62 assert(m.equal_range(5) == std::pair(begin + 2, begin + 3));
63 assert(m.equal_range(6) == std::pair(begin + 2, begin + 2));
64 assert(m.equal_range(7) == std::pair(begin + 2, begin + 2));
65 assert(std::as_const(m).equal_range(8) == std::pair(m.cbegin(), m.cbegin() + 2));
66 assert(std::as_const(m).equal_range(9) == std::pair(m.cbegin(), m.cbegin()));
67 }
68 {
69 // empty
70 using M = std::flat_multiset<Key, std::less<>, KeyContainer>;
71 M m;
72 auto end = m.end();
73 assert(m.equal_range(0) == std::pair(end, end));
74 }
75}
76
77void test() {
78 test_one<std::vector<int>>();
79 test_one<std::deque<int>>();
80 test_one<MinSequenceContainer<int>>();
81 test_one<std::vector<int, min_allocator<int>>>();
82}
83
84int main(int, char**) {
85 test();
86
87 return 0;
88}
89

source code of libcxx/test/std/containers/container.adaptors/flat.multiset/flat.multiset.operations/equal_range.pass.cpp