xref: /llvm-project/libcxx/test/std/containers/associative/multimap/multimap.modifiers/extract_key.pass.cpp (revision fb855eb941b6d740cc6560297d0b4d3201dcaf9f)
1b0386a51SErik Pilkington //===----------------------------------------------------------------------===//
2b0386a51SErik Pilkington //
357b08b09SChandler Carruth // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
457b08b09SChandler Carruth // See https://llvm.org/LICENSE.txt for license information.
557b08b09SChandler Carruth // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6b0386a51SErik Pilkington //
7b0386a51SErik Pilkington //===----------------------------------------------------------------------===//
8b0386a51SErik Pilkington 
931cbe0f2SLouis Dionne // UNSUPPORTED: c++03, c++11, c++14
10b0386a51SErik Pilkington 
11b0386a51SErik Pilkington // <map>
12b0386a51SErik Pilkington 
13b0386a51SErik Pilkington // class multimap
14b0386a51SErik Pilkington 
15b0386a51SErik Pilkington // node_type extract(key_type const&);
16b0386a51SErik Pilkington 
17b0386a51SErik Pilkington #include <map>
187fc6a556SMarshall Clow #include "test_macros.h"
19b0386a51SErik Pilkington #include "min_allocator.h"
20b0386a51SErik Pilkington #include "Counter.h"
21b0386a51SErik Pilkington 
22b0386a51SErik Pilkington template <class Container, class KeyTypeIter>
test(Container & c,KeyTypeIter first,KeyTypeIter last)23b0386a51SErik Pilkington void test(Container& c, KeyTypeIter first, KeyTypeIter last)
24b0386a51SErik Pilkington {
25*fb855eb9SMark de Wever     std::size_t sz = c.size();
26*fb855eb9SMark de Wever     assert((std::size_t)std::distance(first, last) == sz);
27b0386a51SErik Pilkington 
28b0386a51SErik Pilkington     for (KeyTypeIter copy = first; copy != last; ++copy)
29b0386a51SErik Pilkington     {
30b0386a51SErik Pilkington         typename Container::node_type t = c.extract(*copy);
31b0386a51SErik Pilkington         assert(!t.empty());
32b0386a51SErik Pilkington         --sz;
33b0386a51SErik Pilkington         assert(t.key() == *copy);
34b0386a51SErik Pilkington         t.key() = *first; // We should be able to mutate key.
35b0386a51SErik Pilkington         assert(t.key() == *first);
36b0386a51SErik Pilkington         assert(t.get_allocator() == c.get_allocator());
37b0386a51SErik Pilkington         assert(sz == c.size());
38b0386a51SErik Pilkington     }
39b0386a51SErik Pilkington 
40b0386a51SErik Pilkington     assert(c.size() == 0);
41b0386a51SErik Pilkington 
42b0386a51SErik Pilkington     for (KeyTypeIter copy = first; copy != last; ++copy)
43b0386a51SErik Pilkington     {
44b0386a51SErik Pilkington         typename Container::node_type t = c.extract(*copy);
45b0386a51SErik Pilkington         assert(t.empty());
46b0386a51SErik Pilkington     }
47b0386a51SErik Pilkington }
48b0386a51SErik Pilkington 
main(int,char **)492df59c50SJF Bastien int main(int, char**)
50b0386a51SErik Pilkington {
51b0386a51SErik Pilkington     {
52b0386a51SErik Pilkington         std::multimap<int, int> m = {{1,1}, {2,2}, {3,3}, {4,4}, {5,5}, {6,6}};
53b0386a51SErik Pilkington         int keys[] = {1, 2, 3, 4, 5, 6};
54b0386a51SErik Pilkington         test(m, std::begin(keys), std::end(keys));
55b0386a51SErik Pilkington     }
56b0386a51SErik Pilkington 
57b0386a51SErik Pilkington     {
58b0386a51SErik Pilkington         std::multimap<Counter<int>, Counter<int>> m =
59b0386a51SErik Pilkington             {{1,1}, {2,2}, {3,3}, {4,4}, {5,5}, {6,6}};
60b0386a51SErik Pilkington         {
61b0386a51SErik Pilkington             Counter<int> keys[] = {1, 2, 3, 4, 5, 6};
62b0386a51SErik Pilkington             assert(Counter_base::gConstructed == 12+6);
63b0386a51SErik Pilkington             test(m, std::begin(keys), std::end(keys));
64b0386a51SErik Pilkington         }
65b0386a51SErik Pilkington         assert(Counter_base::gConstructed == 0);
66b0386a51SErik Pilkington     }
67b0386a51SErik Pilkington 
68b0386a51SErik Pilkington     {
69b0386a51SErik Pilkington         using min_alloc_map =
70b0386a51SErik Pilkington             std::multimap<int, int, std::less<int>,
71b0386a51SErik Pilkington                           min_allocator<std::pair<const int, int>>>;
72b0386a51SErik Pilkington         min_alloc_map m = {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {5, 5}, {6, 6}};
73b0386a51SErik Pilkington         int keys[] = {1, 2, 3, 4, 5, 6};
74b0386a51SErik Pilkington         test(m, std::begin(keys), std::end(keys));
75b0386a51SErik Pilkington     }
762df59c50SJF Bastien 
772df59c50SJF Bastien   return 0;
78b0386a51SErik Pilkington }
79