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// map(const map& m);
14
15#include <map>
16#include <cassert>
17
18#include "test_macros.h"
19#include "../../../test_compare.h"
20#include "test_allocator.h"
21#include "min_allocator.h"
22
23int main(int, char**) {
24 {
25 typedef std::pair<const int, double> V;
26 V ar[] = {
27 V(1, 1),
28 V(1, 1.5),
29 V(1, 2),
30 V(2, 1),
31 V(2, 1.5),
32 V(2, 2),
33 V(3, 1),
34 V(3, 1.5),
35 V(3, 2),
36 };
37 typedef test_less<int> C;
38 typedef test_allocator<V> A;
39 std::map<int, double, C, A> mo(ar, ar + sizeof(ar) / sizeof(ar[0]), C(5), A(7));
40 std::map<int, double, C, A> m = mo;
41 assert(m.get_allocator() == A(7));
42 assert(m.key_comp() == C(5));
43 assert(m.size() == 3);
44 assert(std::distance(m.begin(), m.end()) == 3);
45 assert(*m.begin() == V(1, 1));
46 assert(*std::next(m.begin()) == V(2, 1));
47 assert(*std::next(m.begin(), 2) == V(3, 1));
48
49 assert(mo.get_allocator() == A(7));
50 assert(mo.key_comp() == C(5));
51 assert(mo.size() == 3);
52 assert(std::distance(mo.begin(), mo.end()) == 3);
53 assert(*mo.begin() == V(1, 1));
54 assert(*std::next(mo.begin()) == V(2, 1));
55 assert(*std::next(mo.begin(), 2) == V(3, 1));
56 }
57#if TEST_STD_VER >= 11
58 {
59 typedef std::pair<const int, double> V;
60 V ar[] = {
61 V(1, 1),
62 V(1, 1.5),
63 V(1, 2),
64 V(2, 1),
65 V(2, 1.5),
66 V(2, 2),
67 V(3, 1),
68 V(3, 1.5),
69 V(3, 2),
70 };
71 typedef test_less<int> C;
72 typedef other_allocator<V> A;
73 std::map<int, double, C, A> mo(ar, ar + sizeof(ar) / sizeof(ar[0]), C(5), A(7));
74 std::map<int, double, C, A> m = mo;
75 assert(m.get_allocator() == A(-2));
76 assert(m.key_comp() == C(5));
77 assert(m.size() == 3);
78 assert(std::distance(m.begin(), m.end()) == 3);
79 assert(*m.begin() == V(1, 1));
80 assert(*std::next(m.begin()) == V(2, 1));
81 assert(*std::next(m.begin(), 2) == V(3, 1));
82
83 assert(mo.get_allocator() == A(7));
84 assert(mo.key_comp() == C(5));
85 assert(mo.size() == 3);
86 assert(std::distance(mo.begin(), mo.end()) == 3);
87 assert(*mo.begin() == V(1, 1));
88 assert(*std::next(mo.begin()) == V(2, 1));
89 assert(*std::next(mo.begin(), 2) == V(3, 1));
90 }
91 {
92 typedef std::pair<const int, double> V;
93 V ar[] = {
94 V(1, 1),
95 V(1, 1.5),
96 V(1, 2),
97 V(2, 1),
98 V(2, 1.5),
99 V(2, 2),
100 V(3, 1),
101 V(3, 1.5),
102 V(3, 2),
103 };
104 typedef test_less<int> C;
105 typedef min_allocator<V> A;
106 std::map<int, double, C, A> mo(ar, ar + sizeof(ar) / sizeof(ar[0]), C(5), A());
107 std::map<int, double, C, A> m = mo;
108 assert(m.get_allocator() == A());
109 assert(m.key_comp() == C(5));
110 assert(m.size() == 3);
111 assert(std::distance(m.begin(), m.end()) == 3);
112 assert(*m.begin() == V(1, 1));
113 assert(*std::next(m.begin()) == V(2, 1));
114 assert(*std::next(m.begin(), 2) == V(3, 1));
115
116 assert(mo.get_allocator() == A());
117 assert(mo.key_comp() == C(5));
118 assert(mo.size() == 3);
119 assert(std::distance(mo.begin(), mo.end()) == 3);
120 assert(*mo.begin() == V(1, 1));
121 assert(*std::next(mo.begin()) == V(2, 1));
122 assert(*std::next(mo.begin(), 2) == V(3, 1));
123 }
124#endif
125
126 return 0;
127}
128

source code of libcxx/test/std/containers/associative/map/map.cons/copy.pass.cpp