1 //===----------------------------------------------------------------------===//
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
7 //===----------------------------------------------------------------------===//
11 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
12 // class Alloc = allocator<Value>>
13 // class unordered_set
15 // template <class InputIterator>
16 // void insert(InputIterator first, InputIterator last);
18 #include <unordered_set>
21 #include "test_macros.h"
22 #include "test_iterators.h"
23 #include "min_allocator.h"
28 typedef std::unordered_set
<int> C
;
40 c
.insert(cpp17_input_iterator
<P
*>(a
), cpp17_input_iterator
<P
*>(a
+ sizeof(a
)/sizeof(a
[0])));
41 assert(c
.size() == 4);
42 assert(c
.count(1) == 1);
43 assert(c
.count(2) == 1);
44 assert(c
.count(3) == 1);
45 assert(c
.count(4) == 1);
47 #if TEST_STD_VER >= 11
49 typedef std::unordered_set
<int, std::hash
<int>,
50 std::equal_to
<int>, min_allocator
<int>> C
;
62 c
.insert(cpp17_input_iterator
<P
*>(a
), cpp17_input_iterator
<P
*>(a
+ sizeof(a
)/sizeof(a
[0])));
63 assert(c
.size() == 4);
64 assert(c
.count(1) == 1);
65 assert(c
.count(2) == 1);
66 assert(c
.count(3) == 1);
67 assert(c
.count(4) == 1);