• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 //===----------------------------------------------------------------------===//
2 //
3 //                     The LLVM Compiler Infrastructure
4 //
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 
10 // <map>
11 
12 // class map
13 
14 // template <class InputIterator>
15 //   void insert(InputIterator first, InputIterator last);
16 
17 #include <map>
18 #include <cassert>
19 
20 #include "test_iterators.h"
21 #include "min_allocator.h"
22 
main()23 int main()
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(input_iterator<P*>(ar), 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 __cplusplus >= 201103L
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(input_iterator<P*>(ar), 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