1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // UNSUPPORTED: c++98, c++03, c++11, c++14
14 // class unordered_multimap
16 // node_type extract(const_iterator);
18 #include <unordered_map>
19 #include "min_allocator.h"
22 template <class Container>
23 void test(Container& c)
27 auto some_key = c.cbegin()->first;
29 for (auto first = c.cbegin(); first != c.cend();)
31 auto key_value = first->first;
32 typename Container::node_type t = c.extract(first++);
34 assert(t.key() == key_value);
36 assert(t.key() == some_key);
37 assert(t.get_allocator() == c.get_allocator());
38 assert(sz == c.size());
41 assert(c.size() == 0);
47 using map_type = std::unordered_multimap<int, int>;
48 map_type m = {{1,1}, {2,2}, {3,3}, {4,4}, {5,5}, {6,6}};
53 std::unordered_multimap<Counter<int>, Counter<int>> m =
54 {{1,1}, {2,2}, {3,3}, {4,4}, {5,5}, {6,6}};
55 assert(Counter_base::gConstructed == 12);
57 assert(Counter_base::gConstructed == 0);
62 std::unordered_multimap<int, int, std::hash<int>, std::equal_to<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}};