| /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 | equal_range.pass.cpp | 371 r = m.equal_range(C2Int(5)); in main()
374 r = m.equal_range(C2Int(7)); in main()
377 r = m.equal_range(C2Int(9)); in main()
380 r = m.equal_range(C2Int(11)); in main()
383 r = m.equal_range(C2Int(13)); in main()
386 r = m.equal_range(C2Int(15)); in main()
389 r = m.equal_range(C2Int(17)); in main()
392 r = m.equal_range(C2Int(19)); in main()
395 r = m.equal_range(C2Int(4)); in main()
398 r = m.equal_range(C2Int(6)); in main()
[all …]
|
| D | count0.pass.cpp | 33 assert(M().count(C2Int{5}) == 0); in main()
37 assert(M().count(C2Int{5}) == 0); 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()
|
| 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()
|
| 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 | equal_range0.pass.cpp | 35 P result = example.equal_range(C2Int{5}); in main()
42 P result = example.equal_range(C2Int{5}); in main()
|
| /external/libcxx/test/support/ |
| D | is_transparent.h | 71 struct C2Int { // comparable to int struct
72 C2Int() : i_(0) {} in C2Int() function
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/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 | 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 | 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 | 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 | 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()
|
| 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()
|
| D | equal_range0.pass.cpp | 35 P result = example.equal_range(C2Int{5}); in main()
42 P result = example.equal_range(C2Int{5}); in main()
|
| D | equal_range.pass.cpp | 224 r = m.equal_range(C2Int(4)); in main()
227 r = m.equal_range(C2Int(5)); in main()
230 r = m.equal_range(C2Int(6)); in main()
233 r = m.equal_range(C2Int(7)); in main()
236 r = m.equal_range(C2Int(8)); in main()
239 r = m.equal_range(C2Int(9)); in main()
242 r = m.equal_range(C2Int(10)); in main()
|
| D | count2.fail.cpp | 36 TEST_IGNORE_NODISCARD M().count(C2Int{5}); in main()
|
| D | equal_range3.fail.cpp | 37 TEST_IGNORE_NODISCARD M().equal_range(C2Int{5}); in main()
|
| D | find3.fail.cpp | 37 TEST_IGNORE_NODISCARD M().find(C2Int{5}); in main()
|
| D | lower_bound1.fail.cpp | 37 TEST_IGNORE_NODISCARD M().lower_bound(C2Int{5}); in main()
|
| D | find2.fail.cpp | 37 TEST_IGNORE_NODISCARD M().find(C2Int{5}); in main()
|