| //===----------------------------------------------------------------------===// |
| // |
| // 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, c++11, c++14 |
| |
| // <unordered_map> |
| |
| // class unordered_map |
| |
| // iterator insert(const_iterator hint, node_type&&); |
| |
| #include <unordered_map> |
| #include "test_macros.h" |
| #include "min_allocator.h" |
| |
| template <class Container> |
| typename Container::node_type |
| node_factory(typename Container::key_type const& key, |
| typename Container::mapped_type const& mapped) |
| { |
| static Container c; |
| auto p = c.insert({key, mapped}); |
| assert(p.second); |
| return c.extract(p.first); |
| } |
| |
| template <class Container> |
| void test(Container& c) |
| { |
| auto* nf = &node_factory<Container>; |
| |
| for (int i = 0; i != 10; ++i) |
| { |
| typename Container::node_type node = nf(i, i + 1); |
| assert(!node.empty()); |
| size_t prev = c.size(); |
| auto it = c.insert(c.end(), std::move(node)); |
| assert(node.empty()); |
| assert(prev + 1 == c.size()); |
| assert(it->first == i); |
| assert(it->second == i + 1); |
| } |
| |
| assert(c.size() == 10); |
| |
| for (int i = 0; i != 10; ++i) |
| { |
| assert(c.count(i) == 1); |
| assert(c[i] == i + 1); |
| } |
| } |
| |
| int main(int, char**) |
| { |
| std::unordered_map<int, int> m; |
| test(m); |
| std::unordered_map<int, int, std::hash<int>, std::equal_to<int>, min_allocator<std::pair<const int, int>>> m2; |
| test(m2); |
| |
| return 0; |
| } |