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