| /external/llvm-project/libcxx/test/std/containers/associative/map/map.ops/ |
| D | count.pass.cpp | 138 r = m.count(C2Int(5)); in main()
140 r = m.count(C2Int(6)); in main()
142 r = m.count(C2Int(7)); in main()
144 r = m.count(C2Int(8)); in main()
146 r = m.count(C2Int(9)); in main()
148 r = m.count(C2Int(10)); in main()
150 r = m.count(C2Int(11)); in main()
152 r = m.count(C2Int(12)); in main()
154 r = m.count(C2Int(4)); in main()
|
| D | lower_bound.pass.cpp | 285 r = m.lower_bound(C2Int(5)); in main()
287 r = m.lower_bound(C2Int(7)); in main()
289 r = m.lower_bound(C2Int(9)); in main()
291 r = m.lower_bound(C2Int(11)); in main()
293 r = m.lower_bound(C2Int(13)); in main()
295 r = m.lower_bound(C2Int(15)); in main()
297 r = m.lower_bound(C2Int(17)); in main()
299 r = m.lower_bound(C2Int(19)); in main()
301 r = m.lower_bound(C2Int(4)); in main()
303 r = m.lower_bound(C2Int(6)); in main()
[all …]
|
| D | find.pass.cpp | 205 r = m.find(C2Int(5)); in main()
207 r = m.find(C2Int(6)); in main()
209 r = m.find(C2Int(7)); in main()
211 r = m.find(C2Int(8)); in main()
213 r = m.find(C2Int(9)); in main()
215 r = m.find(C2Int(10)); in main()
217 r = m.find(C2Int(11)); in main()
219 r = m.find(C2Int(12)); in main()
221 r = m.find(C2Int(4)); in main()
|
| D | count0.pass.cpp | 33 assert(M().count(C2Int{5}) == 0); in main()
37 assert(M().count(C2Int{5}) == 0); in main()
|
| D | upper_bound0.pass.cpp | 34 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
39 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
|
| D | lower_bound0.pass.cpp | 34 assert(example.lower_bound(C2Int{5}) == example.end()); in main()
39 assert(example.lower_bound(C2Int{5}) == example.end()); in main()
|
| /external/libcxx/test/std/containers/associative/map/map.ops/ |
| D | count.pass.cpp | 139 r = m.count(C2Int(5)); in main()
141 r = m.count(C2Int(6)); in main()
143 r = m.count(C2Int(7)); in main()
145 r = m.count(C2Int(8)); in main()
147 r = m.count(C2Int(9)); in main()
149 r = m.count(C2Int(10)); in main()
151 r = m.count(C2Int(11)); in main()
153 r = m.count(C2Int(12)); in main()
155 r = m.count(C2Int(4)); in main()
|
| D | lower_bound.pass.cpp | 286 r = m.lower_bound(C2Int(5)); in main()
288 r = m.lower_bound(C2Int(7)); in main()
290 r = m.lower_bound(C2Int(9)); in main()
292 r = m.lower_bound(C2Int(11)); in main()
294 r = m.lower_bound(C2Int(13)); in main()
296 r = m.lower_bound(C2Int(15)); in main()
298 r = m.lower_bound(C2Int(17)); in main()
300 r = m.lower_bound(C2Int(19)); in main()
302 r = m.lower_bound(C2Int(4)); in main()
304 r = m.lower_bound(C2Int(6)); in main()
[all …]
|
| D | find.pass.cpp | 206 r = m.find(C2Int(5)); in main()
208 r = m.find(C2Int(6)); in main()
210 r = m.find(C2Int(7)); in main()
212 r = m.find(C2Int(8)); in main()
214 r = m.find(C2Int(9)); in main()
216 r = m.find(C2Int(10)); in main()
218 r = m.find(C2Int(11)); in main()
220 r = m.find(C2Int(12)); in main()
222 r = m.find(C2Int(4)); in main()
|
| D | count0.pass.cpp | 33 assert(M().count(C2Int{5}) == 0); in main()
37 assert(M().count(C2Int{5}) == 0); in main()
|
| D | upper_bound0.pass.cpp | 34 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
39 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
|
| D | find0.pass.cpp | 34 assert(example.find(C2Int{5}) == example.end()); in main()
39 assert(example.find(C2Int{5}) == example.end()); in main()
|
| /external/libcxx/test/support/ |
| D | is_transparent.h | 71 struct C2Int { // comparable to int struct
72 C2Int() : i_(0) {} in C2Int() argument
73 C2Int(int i): i_(i) {} in C2Int() function
79 bool operator <(int rhs, const C2Int& lhs) { return rhs < lhs.get(); } argument
80 bool operator <(const C2Int& rhs, const C2Int& lhs) { return rhs.get() < lhs.get(); }
81 bool operator <(const C2Int& rhs, int lhs) { return rhs.get() < lhs; }
|
| /external/llvm-project/libcxx/test/support/ |
| D | is_transparent.h | 72 struct C2Int { // comparable to int struct
73 C2Int() : i_(0) {} in C2Int() function
74 C2Int(int i): i_(i) {} in C2Int() argument
80 bool operator <(int rhs, const C2Int& lhs) { return rhs < lhs.get(); } argument
81 bool operator <(const C2Int& rhs, const C2Int& lhs) { return rhs.get() < lhs.get(); }
82 bool operator <(const C2Int& rhs, int lhs) { return rhs.get() < lhs; }
|
| /external/llvm-project/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
| D | count.pass.cpp | 127 r = m.count(C2Int(4)); in main()
129 r = m.count(C2Int(5)); in main()
131 r = m.count(C2Int(6)); in main()
133 r = m.count(C2Int(7)); in main()
135 r = m.count(C2Int(8)); in main()
137 r = m.count(C2Int(9)); in main()
139 r = m.count(C2Int(10)); in main()
|
| D | lower_bound.pass.cpp | 187 r = m.lower_bound(C2Int(4)); in main()
189 r = m.lower_bound(C2Int(5)); in main()
191 r = m.lower_bound(C2Int(6)); in main()
193 r = m.lower_bound(C2Int(7)); in main()
195 r = m.lower_bound(C2Int(8)); in main()
197 r = m.lower_bound(C2Int(9)); in main()
199 r = m.lower_bound(C2Int(10)); in main()
|
| D | upper_bound.pass.cpp | 187 r = m.upper_bound(C2Int(4)); in main()
189 r = m.upper_bound(C2Int(5)); in main()
191 r = m.upper_bound(C2Int(6)); in main()
193 r = m.upper_bound(C2Int(7)); in main()
195 r = m.upper_bound(C2Int(8)); in main()
197 r = m.upper_bound(C2Int(9)); in main()
199 r = m.upper_bound(C2Int(10)); in main()
|
| D | count0.pass.cpp | 33 assert(M().count(C2Int{5}) == 0); in main()
37 assert(M().count(C2Int{5}) == 0); in main()
|
| D | find.pass.cpp | 178 r = m.find(C2Int(5)); in main()
180 r = m.find(C2Int(6)); in main()
182 r = m.find(C2Int(7)); in main()
184 r = m.find(C2Int(8)); in main()
186 r = m.find(C2Int(9)); in main()
188 r = m.find(C2Int(10)); in main()
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
| D | count.pass.cpp | 128 r = m.count(C2Int(4)); in main()
130 r = m.count(C2Int(5)); in main()
132 r = m.count(C2Int(6)); in main()
134 r = m.count(C2Int(7)); in main()
136 r = m.count(C2Int(8)); in main()
138 r = m.count(C2Int(9)); in main()
140 r = m.count(C2Int(10)); in main()
|
| D | upper_bound.pass.cpp | 188 r = m.upper_bound(C2Int(4)); in main()
190 r = m.upper_bound(C2Int(5)); in main()
192 r = m.upper_bound(C2Int(6)); in main()
194 r = m.upper_bound(C2Int(7)); in main()
196 r = m.upper_bound(C2Int(8)); in main()
198 r = m.upper_bound(C2Int(9)); in main()
200 r = m.upper_bound(C2Int(10)); in main()
|
| D | lower_bound.pass.cpp | 188 r = m.lower_bound(C2Int(4)); in main()
190 r = m.lower_bound(C2Int(5)); in main()
192 r = m.lower_bound(C2Int(6)); in main()
194 r = m.lower_bound(C2Int(7)); in main()
196 r = m.lower_bound(C2Int(8)); in main()
198 r = m.lower_bound(C2Int(9)); in main()
200 r = m.lower_bound(C2Int(10)); in main()
|
| D | count0.pass.cpp | 33 assert(M().count(C2Int{5}) == 0); in main()
37 assert(M().count(C2Int{5}) == 0); in main()
|
| D | find.pass.cpp | 179 r = m.find(C2Int(5)); in main()
181 r = m.find(C2Int(6)); in main()
183 r = m.find(C2Int(7)); in main()
185 r = m.find(C2Int(8)); in main()
187 r = m.find(C2Int(9)); in main()
189 r = m.find(C2Int(10)); in main()
|
| D | find0.pass.cpp | 34 assert(example.find(C2Int{5}) == example.end()); in main()
39 assert(example.find(C2Int{5}) == example.end()); in main()
|