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 // <map>
12 
13 // class map
14 
15 // node_type extract(const_iterator);
16 
17 #include <map>
18 #include "test_macros.h"
19 #include "min_allocator.h"
20 #include "Counter.h"
21 
22 template <class Container>
23 void test(Container& c)
24 {
25     size_t sz = c.size();
26 
27     auto some_key = c.cbegin()->first;
28 
29     for (auto first = c.cbegin(); first != c.cend();)
30     {
31         auto key_value = first->first;
32         typename Container::node_type t = c.extract(first++);
33         --sz;
34         assert(t.key() == key_value);
35         t.key() = some_key;
36         assert(t.key() == some_key);
37         assert(t.get_allocator() == c.get_allocator());
38         assert(sz == c.size());
39     }
40 
41     assert(c.size() == 0);
42 }
43 
44 int main(int, char**)
45 {
46     {
47         using map_type = std::map<int, int>;
48         map_type m = {{1,1}, {2,2}, {3,3}, {4,4}, {5,5}, {6,6}};
49         test(m);
50     }
51 
52     {
53         std::map<Counter<int>, Counter<int>> m =
54             {{1,1}, {2,2}, {3,3}, {4,4}, {5,5}, {6,6}};
55         assert(Counter_base::gConstructed == 12);
56         test(m);
57         assert(Counter_base::gConstructed == 0);
58     }
59 
60     {
61         using min_alloc_map =
62             std::map<int, int, std::less<int>,
63                      min_allocator<std::pair<const int, int>>>;
64         min_alloc_map m = {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {5, 5}, {6, 6}};
65         test(m);
66     }
67 
68   return 0;
69 }
70