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// void insert(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
23int main(int, char**) {
24 {
25 typedef std::set<int> M;
26 typedef int V;
27 V ar[] = {1, 1, 1, 2, 2, 2, 3, 3, 3};
28 M m;
29 m.insert(cpp17_input_iterator<const V*>(ar), cpp17_input_iterator<const V*>(ar + sizeof(ar) / sizeof(ar[0])));
30 assert(m.size() == 3);
31 assert(*m.begin() == 1);
32 assert(*std::next(m.begin()) == 2);
33 assert(*std::next(m.begin(), 2) == 3);
34 }
35#if TEST_STD_VER >= 11
36 {
37 typedef std::set<int, std::less<int>, min_allocator<int>> M;
38 typedef int V;
39 V ar[] = {1, 1, 1, 2, 2, 2, 3, 3, 3};
40 M m;
41 m.insert(cpp17_input_iterator<const V*>(ar), cpp17_input_iterator<const V*>(ar + sizeof(ar) / sizeof(ar[0])));
42 assert(m.size() == 3);
43 assert(*m.begin() == 1);
44 assert(*std::next(m.begin()) == 2);
45 assert(*std::next(m.begin(), 2) == 3);
46 }
47#endif
48
49 return 0;
50}
51

source code of libcxx/test/std/containers/associative/set/insert_iter_iter.pass.cpp