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
10
11// <unordered_map>
12
13// class unordered_map
14
15// node_type extract(key_type const&);
16
17#include <iterator>
18#include <unordered_map>
19
20#include "test_macros.h"
21#include "min_allocator.h"
22#include "Counter.h"
23
24template <class Container, class KeyTypeIter>
25void test(Container& c, KeyTypeIter first, KeyTypeIter last) {
26 std::size_t sz = c.size();
27 assert((std::size_t)std::distance(first, last) == sz);
28
29 for (KeyTypeIter copy = first; copy != last; ++copy) {
30 typename Container::node_type t = c.extract(*copy);
31 assert(!t.empty());
32 --sz;
33 assert(t.key() == *copy);
34 t.key() = *first; // We should be able to mutate key.
35 assert(t.key() == *first);
36 assert(t.get_allocator() == c.get_allocator());
37 assert(sz == c.size());
38 }
39
40 assert(c.size() == 0);
41
42 for (KeyTypeIter copy = first; copy != last; ++copy) {
43 typename Container::node_type t = c.extract(*copy);
44 assert(t.empty());
45 }
46}
47
48int main(int, char**) {
49 {
50 std::unordered_map<int, int> m = {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {5, 5}, {6, 6}};
51 int keys[] = {1, 2, 3, 4, 5, 6};
52 test(c&: m, first: std::begin(arr&: keys), last: std::end(arr&: keys));
53 }
54
55 {
56 std::unordered_map<Counter<int>, Counter<int>> m = {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {5, 5}, {6, 6}};
57 {
58 Counter<int> keys[] = {1, 2, 3, 4, 5, 6};
59 assert(Counter_base::gConstructed == 12 + 6);
60 test(m, std::begin(keys), std::end(keys));
61 }
62 assert(Counter_base::gConstructed == 0);
63 }
64
65 {
66 using min_alloc_map =
67 std::unordered_map<int, int, std::hash<int>, std::equal_to<int>, min_allocator<std::pair<const int, int>>>;
68 min_alloc_map m = {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {5, 5}, {6, 6}};
69 int keys[] = {1, 2, 3, 4, 5, 6};
70 test(m, std::begin(arr&: keys), std::end(arr&: keys));
71 }
72
73 return 0;
74}
75

source code of libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/extract_key.pass.cpp