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 // <map>
10 
11 // class map
12 
13 // template <class InputIterator>
14 //   void insert(InputIterator first, InputIterator last);
15 
16 #include <map>
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 std::map<int, double> M;
27         typedef std::pair<int, double> P;
28         P ar[] =
29         {
30             P(1, 1),
31             P(1, 1.5),
32             P(1, 2),
33             P(2, 1),
34             P(2, 1.5),
35             P(2, 2),
36             P(3, 1),
37             P(3, 1.5),
38             P(3, 2),
39         };
40         M m;
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(next(m.begin())->first == 2);
46         assert(next(m.begin())->second == 1);
47         assert(next(m.begin(), 2)->first == 3);
48         assert(next(m.begin(), 2)->second == 1);
49     }
50 #if TEST_STD_VER >= 11
51     {
52         typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
53         typedef std::pair<int, double> P;
54         P ar[] =
55         {
56             P(1, 1),
57             P(1, 1.5),
58             P(1, 2),
59             P(2, 1),
60             P(2, 1.5),
61             P(2, 2),
62             P(3, 1),
63             P(3, 1.5),
64             P(3, 2),
65         };
66         M m;
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(next(m.begin())->first == 2);
72         assert(next(m.begin())->second == 1);
73         assert(next(m.begin(), 2)->first == 3);
74         assert(next(m.begin(), 2)->second == 1);
75     }
76 #endif
77 
78   return 0;
79 }
80