1 | //===----------------------------------------------------------------------===// |
2 | // |
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 |
6 | // |
7 | //===----------------------------------------------------------------------===// |
8 | |
9 | // <set> |
10 | |
11 | // class set |
12 | |
13 | // template <class InputIterator> |
14 | // set(InputIterator first, InputIterator last); |
15 | |
16 | #include <set> |
17 | #include <cassert> |
18 | |
19 | #include "test_macros.h" |
20 | #include "test_iterators.h" |
21 | #include "min_allocator.h" |
22 | |
23 | int main(int, char**) |
24 | { |
25 | { |
26 | typedef int V; |
27 | V ar[] = |
28 | { |
29 | 1, |
30 | 1, |
31 | 1, |
32 | 2, |
33 | 2, |
34 | 2, |
35 | 3, |
36 | 3, |
37 | 3 |
38 | }; |
39 | std::set<V> m(cpp17_input_iterator<const int*>(ar), |
40 | cpp17_input_iterator<const int*>(ar+sizeof(ar)/sizeof(ar[0]))); |
41 | assert(m.size() == 3); |
42 | assert(std::distance(m.begin(), m.end()) == 3); |
43 | assert(*m.begin() == 1); |
44 | assert(*std::next(m.begin()) == 2); |
45 | assert(*std::next(m.begin(), 2) == 3); |
46 | } |
47 | #if TEST_STD_VER >= 11 |
48 | { |
49 | typedef int V; |
50 | V ar[] = |
51 | { |
52 | 1, |
53 | 1, |
54 | 1, |
55 | 2, |
56 | 2, |
57 | 2, |
58 | 3, |
59 | 3, |
60 | 3 |
61 | }; |
62 | std::set<V, std::less<int>, min_allocator<int>> m(cpp17_input_iterator<const int*>(ar), |
63 | cpp17_input_iterator<const int*>(ar+sizeof(ar)/sizeof(ar[0]))); |
64 | assert(m.size() == 3); |
65 | assert(std::distance(m.begin(), m.end()) == 3); |
66 | assert(*m.begin() == 1); |
67 | assert(*std::next(m.begin()) == 2); |
68 | assert(*std::next(m.begin(), 2) == 3); |
69 | } |
70 | #endif |
71 | |
72 | return 0; |
73 | } |
74 | |