| 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 |
| 10 | |
| 11 | // <unordered_map> |
| 12 | |
| 13 | // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, |
| 14 | // class Alloc = allocator<pair<const Key, T>>> |
| 15 | // class unordered_multimap |
| 16 | |
| 17 | // template <class P, |
| 18 | // class = typename enable_if<is_convertible<P, value_type>::value>::type> |
| 19 | // iterator insert(P&& x); |
| 20 | |
| 21 | #include <unordered_map> |
| 22 | #include <cassert> |
| 23 | |
| 24 | #include "test_macros.h" |
| 25 | #include "MoveOnly.h" |
| 26 | #include "min_allocator.h" |
| 27 | |
| 28 | int main(int, char**) { |
| 29 | { |
| 30 | typedef std::unordered_multimap<double, int> C; |
| 31 | typedef C::iterator R; |
| 32 | typedef std::pair<double, short> P; |
| 33 | C c; |
| 34 | R r = c.insert(x: P(3.5, static_cast<short>(3))); |
| 35 | assert(c.size() == 1); |
| 36 | assert(r->first == 3.5); |
| 37 | assert(r->second == 3); |
| 38 | |
| 39 | r = c.insert(x: P(3.5, static_cast<short>(4))); |
| 40 | assert(c.size() == 2); |
| 41 | assert(r->first == 3.5); |
| 42 | assert(r->second == 4); |
| 43 | |
| 44 | r = c.insert(x: P(4.5, static_cast<short>(4))); |
| 45 | assert(c.size() == 3); |
| 46 | assert(r->first == 4.5); |
| 47 | assert(r->second == 4); |
| 48 | |
| 49 | r = c.insert(x: P(5.5, static_cast<short>(4))); |
| 50 | assert(c.size() == 4); |
| 51 | assert(r->first == 5.5); |
| 52 | assert(r->second == 4); |
| 53 | } |
| 54 | { |
| 55 | typedef std::unordered_multimap<MoveOnly, MoveOnly> C; |
| 56 | typedef C::iterator R; |
| 57 | typedef std::pair<MoveOnly, MoveOnly> P; |
| 58 | C c; |
| 59 | R r = c.insert(P(3, 3)); |
| 60 | assert(c.size() == 1); |
| 61 | assert(r->first == 3); |
| 62 | assert(r->second == 3); |
| 63 | |
| 64 | r = c.insert(P(3, 4)); |
| 65 | assert(c.size() == 2); |
| 66 | assert(r->first == 3); |
| 67 | assert(r->second == 4); |
| 68 | |
| 69 | r = c.insert(P(4, 4)); |
| 70 | assert(c.size() == 3); |
| 71 | assert(r->first == 4); |
| 72 | assert(r->second == 4); |
| 73 | |
| 74 | r = c.insert(P(5, 4)); |
| 75 | assert(c.size() == 4); |
| 76 | assert(r->first == 5); |
| 77 | assert(r->second == 4); |
| 78 | } |
| 79 | { |
| 80 | typedef std::unordered_multimap<double, |
| 81 | int, |
| 82 | std::hash<double>, |
| 83 | std::equal_to<double>, |
| 84 | min_allocator<std::pair<const double, int>>> |
| 85 | C; |
| 86 | typedef C::iterator R; |
| 87 | typedef std::pair<double, short> P; |
| 88 | C c; |
| 89 | R r = c.insert(P(3.5, static_cast<short>(3))); |
| 90 | assert(c.size() == 1); |
| 91 | assert(r->first == 3.5); |
| 92 | assert(r->second == 3); |
| 93 | |
| 94 | r = c.insert(P(3.5, static_cast<short>(4))); |
| 95 | assert(c.size() == 2); |
| 96 | assert(r->first == 3.5); |
| 97 | assert(r->second == 4); |
| 98 | |
| 99 | r = c.insert(P(4.5, static_cast<short>(4))); |
| 100 | assert(c.size() == 3); |
| 101 | assert(r->first == 4.5); |
| 102 | assert(r->second == 4); |
| 103 | |
| 104 | r = c.insert(P(5.5, static_cast<short>(4))); |
| 105 | assert(c.size() == 4); |
| 106 | assert(r->first == 5.5); |
| 107 | assert(r->second == 4); |
| 108 | } |
| 109 | { |
| 110 | typedef std::unordered_multimap<MoveOnly, |
| 111 | MoveOnly, |
| 112 | std::hash<MoveOnly>, |
| 113 | std::equal_to<MoveOnly>, |
| 114 | min_allocator<std::pair<const MoveOnly, MoveOnly>>> |
| 115 | C; |
| 116 | typedef C::iterator R; |
| 117 | typedef std::pair<MoveOnly, MoveOnly> P; |
| 118 | C c; |
| 119 | R r = c.insert(P(3, 3)); |
| 120 | assert(c.size() == 1); |
| 121 | assert(r->first == 3); |
| 122 | assert(r->second == 3); |
| 123 | |
| 124 | r = c.insert(P(3, 4)); |
| 125 | assert(c.size() == 2); |
| 126 | assert(r->first == 3); |
| 127 | assert(r->second == 4); |
| 128 | |
| 129 | r = c.insert(P(4, 4)); |
| 130 | assert(c.size() == 3); |
| 131 | assert(r->first == 4); |
| 132 | assert(r->second == 4); |
| 133 | |
| 134 | r = c.insert(P(5, 4)); |
| 135 | assert(c.size() == 4); |
| 136 | assert(r->first == 5); |
| 137 | assert(r->second == 4); |
| 138 | } |
| 139 | { |
| 140 | typedef std::unordered_multimap<double, MoveOnly> C; |
| 141 | typedef C::iterator R; |
| 142 | C c; |
| 143 | R r = c.insert({3.5, 3}); |
| 144 | assert(c.size() == 1); |
| 145 | assert(r->first == 3.5); |
| 146 | assert(r->second == 3); |
| 147 | |
| 148 | r = c.insert({3.5, 4}); |
| 149 | assert(c.size() == 2); |
| 150 | assert(r->first == 3.5); |
| 151 | assert(r->second == 4); |
| 152 | |
| 153 | r = c.insert({4.5, 4}); |
| 154 | assert(c.size() == 3); |
| 155 | assert(r->first == 4.5); |
| 156 | assert(r->second == 4); |
| 157 | |
| 158 | r = c.insert({5.5, 4}); |
| 159 | assert(c.size() == 4); |
| 160 | assert(r->first == 5.5); |
| 161 | assert(r->second == 4); |
| 162 | } |
| 163 | |
| 164 | return 0; |
| 165 | } |
| 166 | |