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
16 // node_type extract(key_type const&);
19 #include "min_allocator.h"
22 template <class Container, class KeyTypeIter>
23 void test(Container& c, KeyTypeIter first, KeyTypeIter last)
26 assert((size_t)std::distance(first, last) == sz);
28 for (KeyTypeIter copy = first; copy != last; ++copy)
30 typename Container::node_type t = c.extract(*copy);
33 assert(t.value() == *copy);
34 assert(t.get_allocator() == c.get_allocator());
35 assert(sz == c.size());
38 assert(c.size() == 0);
40 for (KeyTypeIter copy = first; copy != last; ++copy)
42 typename Container::node_type t = c.extract(*copy);
50 std::set<int> m = {1, 2, 3, 4, 5, 6};
51 int keys[] = {1, 2, 3, 4, 5, 6};
52 test(m, std::begin(keys), std::end(keys));
56 std::set<Counter<int>> m = {1, 2, 3, 4, 5, 6};
58 Counter<int> keys[] = {1, 2, 3, 4, 5, 6};
59 assert(Counter_base::gConstructed == 6+6);
60 test(m, std::begin(keys), std::end(keys));
62 assert(Counter_base::gConstructed == 0);
66 using min_alloc_set = std::set<int, std::less<int>, min_allocator<int>>;
67 min_alloc_set m = {1, 2, 3, 4, 5, 6};
68 int keys[] = {1, 2, 3, 4, 5, 6};
69 test(m, std::begin(keys), std::end(keys));