| //===----------------------------------------------------------------------===// |
| // |
| // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| // See https://llvm.org/LICENSE.txt for license information. |
| // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| // |
| //===----------------------------------------------------------------------===// |
| |
| // <unordered_set> |
| |
| // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, |
| // class Alloc = allocator<Value>> |
| // class unordered_set |
| |
| // template <class InputIterator> |
| // void insert(InputIterator first, InputIterator last); |
| |
| #include <unordered_set> |
| #include <cassert> |
| |
| #include "test_macros.h" |
| #include "test_iterators.h" |
| #include "min_allocator.h" |
| |
| int main(int, char**) |
| { |
| { |
| typedef std::unordered_set<int> C; |
| typedef int P; |
| P a[] = |
| { |
| P(1), |
| P(2), |
| P(3), |
| P(4), |
| P(1), |
| P(2) |
| }; |
| C c; |
| c.insert(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0]))); |
| assert(c.size() == 4); |
| assert(c.count(1) == 1); |
| assert(c.count(2) == 1); |
| assert(c.count(3) == 1); |
| assert(c.count(4) == 1); |
| } |
| #if TEST_STD_VER >= 11 |
| { |
| typedef std::unordered_set<int, std::hash<int>, |
| std::equal_to<int>, min_allocator<int>> C; |
| typedef int P; |
| P a[] = |
| { |
| P(1), |
| P(2), |
| P(3), |
| P(4), |
| P(1), |
| P(2) |
| }; |
| C c; |
| c.insert(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0]))); |
| assert(c.size() == 4); |
| assert(c.count(1) == 1); |
| assert(c.count(2) == 1); |
| assert(c.count(3) == 1); |
| assert(c.count(4) == 1); |
| } |
| #endif |
| |
| return 0; |
| } |