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 multimap
12
13// iterator find(const key_type& k);
14// const_iterator find(const key_type& k) const;
15
16#include <map>
17#include <cassert>
18
19#include "test_macros.h"
20#include "min_allocator.h"
21#include "private_constructor.h"
22#include "is_transparent.h"
23
24int main(int, char**) {
25 typedef std::pair<const int, double> V;
26 {
27 typedef std::multimap<int, double> M;
28 {
29 typedef M::iterator R;
30 V ar[] = {V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3)};
31 M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
32 R r = m.find(x: 5);
33 assert(r == m.begin());
34 r = m.find(x: 6);
35 assert(r == m.end());
36 r = m.find(x: 7);
37 assert(r == std::next(m.begin(), 3));
38 r = m.find(x: 8);
39 assert(r == m.end());
40 r = m.find(x: 9);
41 assert(r == std::next(m.begin(), 6));
42 r = m.find(x: 10);
43 assert(r == m.end());
44 }
45 {
46 typedef M::const_iterator R;
47 V ar[] = {V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3)};
48 const M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
49 R r = m.find(x: 5);
50 assert(r == m.begin());
51 r = m.find(x: 6);
52 assert(r == m.end());
53 r = m.find(x: 7);
54 assert(r == std::next(m.begin(), 3));
55 r = m.find(x: 8);
56 assert(r == m.end());
57 r = m.find(x: 9);
58 assert(r == std::next(m.begin(), 6));
59 r = m.find(x: 10);
60 assert(r == m.end());
61 }
62 }
63#if TEST_STD_VER >= 11
64 {
65 typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
66 {
67 typedef M::iterator R;
68 V ar[] = {V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3)};
69 M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
70 R r = m.find(5);
71 assert(r == m.begin());
72 r = m.find(6);
73 assert(r == m.end());
74 r = m.find(7);
75 assert(r == std::next(m.begin(), 3));
76 r = m.find(8);
77 assert(r == m.end());
78 r = m.find(9);
79 assert(r == std::next(m.begin(), 6));
80 r = m.find(10);
81 assert(r == m.end());
82 }
83 {
84 typedef M::const_iterator R;
85 V ar[] = {V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3)};
86 const M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
87 R r = m.find(5);
88 assert(r == m.begin());
89 r = m.find(6);
90 assert(r == m.end());
91 r = m.find(7);
92 assert(r == std::next(m.begin(), 3));
93 r = m.find(8);
94 assert(r == m.end());
95 r = m.find(9);
96 assert(r == std::next(m.begin(), 6));
97 r = m.find(10);
98 assert(r == m.end());
99 }
100 }
101#endif
102#if TEST_STD_VER > 11
103 {
104 typedef std::multimap<int, double, std::less<>> M;
105 typedef M::iterator R;
106
107 V ar[] = {V(5, 1), V(5, 2), V(5, 3), V(7, 1), V(7, 2), V(7, 3), V(9, 1), V(9, 2), V(9, 3)};
108 M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
109 R r = m.find(5);
110 assert(r == m.begin());
111 r = m.find(6);
112 assert(r == m.end());
113 r = m.find(7);
114 assert(r == std::next(m.begin(), 3));
115 r = m.find(8);
116 assert(r == m.end());
117 r = m.find(9);
118 assert(r == std::next(m.begin(), 6));
119 r = m.find(10);
120 assert(r == m.end());
121
122 r = m.find(C2Int(5));
123 assert(r == m.begin());
124 r = m.find(C2Int(6));
125 assert(r == m.end());
126 r = m.find(C2Int(7));
127 assert(r == std::next(m.begin(), 3));
128 r = m.find(C2Int(8));
129 assert(r == m.end());
130 r = m.find(C2Int(9));
131 assert(r == std::next(m.begin(), 6));
132 r = m.find(C2Int(10));
133 assert(r == m.end());
134 }
135
136 {
137 typedef PrivateConstructor PC;
138 typedef std::multimap<PC, double, std::less<>> M;
139 typedef M::iterator R;
140
141 M m;
142 m.insert(std::make_pair<PC, double>(PC::make(5), 1));
143 m.insert(std::make_pair<PC, double>(PC::make(5), 2));
144 m.insert(std::make_pair<PC, double>(PC::make(5), 3));
145 m.insert(std::make_pair<PC, double>(PC::make(7), 1));
146 m.insert(std::make_pair<PC, double>(PC::make(7), 2));
147 m.insert(std::make_pair<PC, double>(PC::make(7), 3));
148 m.insert(std::make_pair<PC, double>(PC::make(9), 1));
149 m.insert(std::make_pair<PC, double>(PC::make(9), 2));
150 m.insert(std::make_pair<PC, double>(PC::make(9), 3));
151
152 R r = m.find(5);
153 assert(r == m.begin());
154 r = m.find(6);
155 assert(r == m.end());
156 r = m.find(7);
157 assert(r == std::next(m.begin(), 3));
158 r = m.find(8);
159 assert(r == m.end());
160 r = m.find(9);
161 assert(r == std::next(m.begin(), 6));
162 r = m.find(10);
163 assert(r == m.end());
164 }
165#endif
166
167 return 0;
168}
169

source code of libcxx/test/std/containers/associative/multimap/multimap.ops/find.pass.cpp