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 multimap
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::multimap<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() == 9);
43 assert(m.begin()->first == 1);
44 assert(m.begin()->second == 1);
45 assert(next(m.begin())->first == 1);
46 assert(next(m.begin())->second == 1.5);
47 assert(next(m.begin(), 2)->first == 1);
48 assert(next(m.begin(), 2)->second == 2);
49 assert(next(m.begin(), 3)->first == 2);
50 assert(next(m.begin(), 3)->second == 1);
51 assert(next(m.begin(), 4)->first == 2);
52 assert(next(m.begin(), 4)->second == 1.5);
53 assert(next(m.begin(), 5)->first == 2);
54 assert(next(m.begin(), 5)->second == 2);
55 assert(next(m.begin(), 6)->first == 3);
56 assert(next(m.begin(), 6)->second == 1);
57 assert(next(m.begin(), 7)->first == 3);
58 assert(next(m.begin(), 7)->second == 1.5);
59 assert(next(m.begin(), 8)->first == 3);
60 assert(next(m.begin(), 8)->second == 2);
61 }
62 #if TEST_STD_VER >= 11
63 {
64 typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
65 typedef std::pair<int, double> P;
66 P ar[] =
67 {
68 P(1, 1),
69 P(1, 1.5),
70 P(1, 2),
71 P(2, 1),
72 P(2, 1.5),
73 P(2, 2),
74 P(3, 1),
75 P(3, 1.5),
76 P(3, 2),
77 };
78 M m;
79 m.insert(input_iterator<P*>(ar), input_iterator<P*>(ar + sizeof(ar)/sizeof(ar[0])));
80 assert(m.size() == 9);
81 assert(m.begin()->first == 1);
82 assert(m.begin()->second == 1);
83 assert(next(m.begin())->first == 1);
84 assert(next(m.begin())->second == 1.5);
85 assert(next(m.begin(), 2)->first == 1);
86 assert(next(m.begin(), 2)->second == 2);
87 assert(next(m.begin(), 3)->first == 2);
88 assert(next(m.begin(), 3)->second == 1);
89 assert(next(m.begin(), 4)->first == 2);
90 assert(next(m.begin(), 4)->second == 1.5);
91 assert(next(m.begin(), 5)->first == 2);
92 assert(next(m.begin(), 5)->second == 2);
93 assert(next(m.begin(), 6)->first == 3);
94 assert(next(m.begin(), 6)->second == 1);
95 assert(next(m.begin(), 7)->first == 3);
96 assert(next(m.begin(), 7)->second == 1.5);
97 assert(next(m.begin(), 8)->first == 3);
98 assert(next(m.begin(), 8)->second == 2);
99 }
100 #endif
101 }
102