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 //===----------------------------------------------------------------------===//
13 // template <class InputIterator>
14 // void insert(InputIterator first, InputIterator last);
19 #include "test_macros.h"
20 #include "test_iterators.h"
21 #include "min_allocator.h"
26 typedef std::map
<int, double> M
;
27 typedef std::pair
<int, double> P
;
41 m
.insert(cpp17_input_iterator
<P
*>(ar
), cpp17_input_iterator
<P
*>(ar
+ sizeof(ar
)/sizeof(ar
[0])));
42 assert(m
.size() == 3);
43 assert(m
.begin()->first
== 1);
44 assert(m
.begin()->second
== 1);
45 assert(std::next(m
.begin())->first
== 2);
46 assert(std::next(m
.begin())->second
== 1);
47 assert(std::next(m
.begin(), 2)->first
== 3);
48 assert(std::next(m
.begin(), 2)->second
== 1);
50 #if TEST_STD_VER >= 11
52 typedef std::map
<int, double, std::less
<int>, min_allocator
<std::pair
<const int, double>>> M
;
53 typedef std::pair
<int, double> P
;
67 m
.insert(cpp17_input_iterator
<P
*>(ar
), cpp17_input_iterator
<P
*>(ar
+ sizeof(ar
)/sizeof(ar
[0])));
68 assert(m
.size() == 3);
69 assert(m
.begin()->first
== 1);
70 assert(m
.begin()->second
== 1);
71 assert(std::next(m
.begin())->first
== 2);
72 assert(std::next(m
.begin())->second
== 1);
73 assert(std::next(m
.begin(), 2)->first
== 3);
74 assert(std::next(m
.begin(), 2)->second
== 1);