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_map> |
12 | |
13 | // class flat_multimap |
14 | |
15 | // pair<iterator,iterator> equal_range(const key_type& k); |
16 | // pair<const_iterator,const_iterator> equal_range(const key_type& k) const; |
17 | |
18 | #include <cassert> |
19 | #include <deque> |
20 | #include <flat_map> |
21 | #include <functional> |
22 | #include <utility> |
23 | |
24 | #include "MinSequenceContainer.h" |
25 | #include "test_macros.h" |
26 | #include "min_allocator.h" |
27 | |
28 | template <class KeyContainer, class ValueContainer> |
29 | void test() { |
30 | using Key = typename KeyContainer::value_type; |
31 | using Value = typename ValueContainer::value_type; |
32 | { |
33 | using M = std::flat_multimap<Key, Value, std::less<>, KeyContainer, ValueContainer>; |
34 | using R = std::pair<typename M::iterator, typename M::iterator>; |
35 | using CR = std::pair<typename M::const_iterator, typename M::const_iterator>; |
36 | M m = {{1, 'a'}, {1, 'a'}, {1, 'A'}, {2, 'b'}, {4, 'd'}, {5, 'E'}, {5, 'e'}, {8, 'h'}, {8, 'z'}}; |
37 | ASSERT_SAME_TYPE(decltype(m.equal_range(0)), R); |
38 | ASSERT_SAME_TYPE(decltype(std::as_const(m).equal_range(0)), CR); |
39 | auto begin = m.begin(); |
40 | assert(m.equal_range(0) == std::pair(begin, begin)); |
41 | assert(m.equal_range(1) == std::pair(begin, begin + 3)); |
42 | assert(m.equal_range(2) == std::pair(begin + 3, begin + 4)); |
43 | assert(m.equal_range(3) == std::pair(begin + 4, begin + 4)); |
44 | assert(m.equal_range(4) == std::pair(begin + 4, begin + 5)); |
45 | assert(m.equal_range(5) == std::pair(begin + 5, begin + 7)); |
46 | assert(m.equal_range(6) == std::pair(begin + 7, begin + 7)); |
47 | assert(m.equal_range(7) == std::pair(begin + 7, begin + 7)); |
48 | assert(std::as_const(m).equal_range(8) == std::pair(m.cbegin() + 7, m.cbegin() + 9)); |
49 | assert(std::as_const(m).equal_range(9) == std::pair(m.cbegin() + 9, m.cbegin() + 9)); |
50 | } |
51 | |
52 | { |
53 | using M = std::flat_multimap<Key, Value, std::greater<int>, KeyContainer, ValueContainer>; |
54 | using R = std::pair<typename M::iterator, typename M::iterator>; |
55 | using CR = std::pair<typename M::const_iterator, typename M::const_iterator>; |
56 | M m = { |
57 | {1, 'a'}, {2, 'b'}, {2, 'b'}, {2, 'c'}, {4, 'a'}, {4, 'b'}, {4, 'c'}, {4, 'd'}, {5, 'e'}, {8, 'a'}, {8, 'h'}}; |
58 | ASSERT_SAME_TYPE(decltype(m.equal_range(0)), R); |
59 | ASSERT_SAME_TYPE(decltype(std::as_const(m).equal_range(0)), CR); |
60 | auto begin = m.begin(); |
61 | assert(m.equal_range(0) == std::pair(begin + 11, begin + 11)); |
62 | assert(m.equal_range(1) == std::pair(begin + 10, begin + 11)); |
63 | assert(m.equal_range(2) == std::pair(begin + 7, begin + 10)); |
64 | assert(m.equal_range(3) == std::pair(begin + 7, begin + 7)); |
65 | assert(m.equal_range(4) == std::pair(begin + 3, begin + 7)); |
66 | assert(m.equal_range(5) == std::pair(begin + 2, begin + 3)); |
67 | assert(m.equal_range(6) == std::pair(begin + 2, begin + 2)); |
68 | assert(m.equal_range(7) == std::pair(begin + 2, begin + 2)); |
69 | assert(std::as_const(m).equal_range(8) == std::pair(m.cbegin(), m.cbegin() + 2)); |
70 | assert(std::as_const(m).equal_range(9) == std::pair(m.cbegin(), m.cbegin())); |
71 | } |
72 | } |
73 | |
74 | int main(int, char**) { |
75 | test<std::vector<int>, std::vector<char>>(); |
76 | test<std::deque<int>, std::vector<char>>(); |
77 | test<MinSequenceContainer<int>, MinSequenceContainer<char>>(); |
78 | test<std::vector<int, min_allocator<int>>, std::vector<char, min_allocator<char>>>(); |
79 | |
80 | return 0; |
81 | } |
82 | |