| //===----------------------------------------------------------------------===// |
| // |
| // 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++98, c++03 |
| |
| // <unordered_map> |
| |
| // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, |
| // class Alloc = allocator<pair<const Key, T>>> |
| // class unordered_map |
| |
| // template <class P, |
| // class = typename enable_if<is_convertible<P, value_type>::value>::type> |
| // pair<iterator, bool> insert(P&& x); |
| |
| #include <unordered_map> |
| #include <cassert> |
| |
| #include "test_macros.h" |
| #include "MoveOnly.h" |
| #include "min_allocator.h" |
| |
| int main(int, char**) |
| { |
| { |
| typedef std::unordered_map<double, int> C; |
| typedef std::pair<C::iterator, bool> R; |
| typedef std::pair<double, short> P; |
| C c; |
| R r = c.insert(P(3.5, static_cast<short>(3))); |
| assert(r.second); |
| assert(c.size() == 1); |
| assert(r.first->first == 3.5); |
| assert(r.first->second == 3); |
| |
| r = c.insert(P(3.5, static_cast<short>(4))); |
| assert(!r.second); |
| assert(c.size() == 1); |
| assert(r.first->first == 3.5); |
| assert(r.first->second == 3); |
| |
| r = c.insert(P(4.5, static_cast<short>(4))); |
| assert(r.second); |
| assert(c.size() == 2); |
| assert(r.first->first == 4.5); |
| assert(r.first->second == 4); |
| |
| r = c.insert(P(5.5, static_cast<short>(4))); |
| assert(r.second); |
| assert(c.size() == 3); |
| assert(r.first->first == 5.5); |
| assert(r.first->second == 4); |
| } |
| { |
| typedef std::unordered_map<MoveOnly, MoveOnly> C; |
| typedef std::pair<C::iterator, bool> R; |
| typedef std::pair<MoveOnly, MoveOnly> P; |
| C c; |
| R r = c.insert(P(3, 3)); |
| assert(r.second); |
| assert(c.size() == 1); |
| assert(r.first->first == 3); |
| assert(r.first->second == 3); |
| |
| r = c.insert(P(3, 4)); |
| assert(!r.second); |
| assert(c.size() == 1); |
| assert(r.first->first == 3); |
| assert(r.first->second == 3); |
| |
| r = c.insert(P(4, 4)); |
| assert(r.second); |
| assert(c.size() == 2); |
| assert(r.first->first == 4); |
| assert(r.first->second == 4); |
| |
| r = c.insert(P(5, 4)); |
| assert(r.second); |
| assert(c.size() == 3); |
| assert(r.first->first == 5); |
| assert(r.first->second == 4); |
| } |
| { |
| typedef std::unordered_map<double, int, std::hash<double>, std::equal_to<double>, |
| min_allocator<std::pair<const double, int>>> C; |
| typedef std::pair<C::iterator, bool> R; |
| typedef std::pair<double, short> P; |
| C c; |
| R r = c.insert(P(3.5, static_cast<short>(3))); |
| assert(r.second); |
| assert(c.size() == 1); |
| assert(r.first->first == 3.5); |
| assert(r.first->second == 3); |
| |
| r = c.insert(P(3.5, static_cast<short>(4))); |
| assert(!r.second); |
| assert(c.size() == 1); |
| assert(r.first->first == 3.5); |
| assert(r.first->second == 3); |
| |
| r = c.insert(P(4.5, static_cast<short>(4))); |
| assert(r.second); |
| assert(c.size() == 2); |
| assert(r.first->first == 4.5); |
| assert(r.first->second == 4); |
| |
| r = c.insert(P(5.5, static_cast<short>(4))); |
| assert(r.second); |
| assert(c.size() == 3); |
| assert(r.first->first == 5.5); |
| assert(r.first->second == 4); |
| } |
| { |
| typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, std::equal_to<MoveOnly>, |
| min_allocator<std::pair<const MoveOnly, MoveOnly>>> C; |
| typedef std::pair<C::iterator, bool> R; |
| typedef std::pair<MoveOnly, MoveOnly> P; |
| C c; |
| R r = c.insert(P(3, 3)); |
| assert(r.second); |
| assert(c.size() == 1); |
| assert(r.first->first == 3); |
| assert(r.first->second == 3); |
| |
| r = c.insert(P(3, 4)); |
| assert(!r.second); |
| assert(c.size() == 1); |
| assert(r.first->first == 3); |
| assert(r.first->second == 3); |
| |
| r = c.insert(P(4, 4)); |
| assert(r.second); |
| assert(c.size() == 2); |
| assert(r.first->first == 4); |
| assert(r.first->second == 4); |
| |
| r = c.insert(P(5, 4)); |
| assert(r.second); |
| assert(c.size() == 3); |
| assert(r.first->first == 5); |
| assert(r.first->second == 4); |
| } |
| { |
| typedef std::unordered_map<double, MoveOnly> C; |
| typedef std::pair<C::iterator, bool> R; |
| C c; |
| R r = c.insert({3.5, 3}); |
| assert(r.second); |
| assert(c.size() == 1); |
| assert(r.first->first == 3.5); |
| assert(r.first->second == 3); |
| |
| r = c.insert({3.5, 4}); |
| assert(!r.second); |
| assert(c.size() == 1); |
| assert(r.first->first == 3.5); |
| assert(r.first->second == 3); |
| |
| r = c.insert({4.5, 4}); |
| assert(r.second); |
| assert(c.size() == 2); |
| assert(r.first->first == 4.5); |
| assert(r.first->second == 4); |
| |
| r = c.insert({5.5, 4}); |
| assert(r.second); |
| assert(c.size() == 3); |
| assert(r.first->first == 5.5); |
| assert(r.first->second == 4); |
| } |
| |
| return 0; |
| } |