Home
last modified time | relevance | path

Searched refs:C2Int (Results 1 – 25 of 51) sorted by relevance

123

/llvm-project-15.0.7/libcxx/test/std/containers/associative/map/map.ops/
H A Dcount.pass.cpp138 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()
H A Dlower_bound.pass.cpp285 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 …]
H A Dfind.pass.cpp205 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()
H A Dcount0.pass.cpp32 assert(M().count(C2Int{5}) == 0); in main()
36 assert(M().count(C2Int{5}) == 0); in main()
H A Dfind0.pass.cpp34 assert(example.find(C2Int{5}) == example.end()); in main()
39 assert(example.find(C2Int{5}) == example.end()); in main()
H A Dupper_bound0.pass.cpp34 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
39 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
H A Dlower_bound0.pass.cpp34 assert(example.lower_bound(C2Int{5}) == example.end()); in main()
39 assert(example.lower_bound(C2Int{5}) == example.end()); in main()
H A Dequal_range.pass.cpp370 r = m.equal_range(C2Int(5)); in main()
373 r = m.equal_range(C2Int(7)); in main()
376 r = m.equal_range(C2Int(9)); in main()
379 r = m.equal_range(C2Int(11)); in main()
382 r = m.equal_range(C2Int(13)); in main()
385 r = m.equal_range(C2Int(15)); in main()
388 r = m.equal_range(C2Int(17)); in main()
391 r = m.equal_range(C2Int(19)); in main()
394 r = m.equal_range(C2Int(4)); in main()
397 r = m.equal_range(C2Int(6)); in main()
[all …]
H A Dequal_range0.pass.cpp35 P result = example.equal_range(C2Int{5}); in main()
42 P result = example.equal_range(C2Int{5}); in main()
/llvm-project-15.0.7/libcxx/test/support/
H A Dis_transparent.h72 struct C2Int { // comparable to int struct
73 C2Int() : i_(0) {} in C2Int() argument
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; }
/llvm-project-15.0.7/libcxx/test/std/containers/associative/multimap/multimap.ops/
H A Dcount.pass.cpp127 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()
H A Dlower_bound.pass.cpp187 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()
H A Dupper_bound.pass.cpp187 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()
H A Dfind.pass.cpp178 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()
H A Dcount0.pass.cpp32 assert(M().count(C2Int{5}) == 0); in main()
36 assert(M().count(C2Int{5}) == 0); in main()
H A Dlower_bound0.pass.cpp34 assert(example.lower_bound(C2Int{5}) == example.end()); in main()
39 assert(example.lower_bound(C2Int{5}) == example.end()); in main()
H A Dfind0.pass.cpp34 assert(example.find(C2Int{5}) == example.end()); in main()
39 assert(example.find(C2Int{5}) == example.end()); in main()
H A Dupper_bound0.pass.cpp34 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
39 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
H A Dequal_range0.pass.cpp35 P result = example.equal_range(C2Int{5}); in main()
42 P result = example.equal_range(C2Int{5}); in main()
H A Dequal_range.pass.cpp223 r = m.equal_range(C2Int(4)); in main()
226 r = m.equal_range(C2Int(5)); in main()
229 r = m.equal_range(C2Int(6)); in main()
232 r = m.equal_range(C2Int(7)); in main()
235 r = m.equal_range(C2Int(8)); in main()
238 r = m.equal_range(C2Int(9)); in main()
241 r = m.equal_range(C2Int(10)); in main()
H A Dfind3.compile.fail.cpp36 TEST_IGNORE_NODISCARD M().find(C2Int{5}); in main()
H A Dlower_bound1.compile.fail.cpp36 TEST_IGNORE_NODISCARD M().lower_bound(C2Int{5}); in main()
H A Dlower_bound2.compile.fail.cpp36 TEST_IGNORE_NODISCARD M().lower_bound(C2Int{5}); in main()
H A Dlower_bound3.compile.fail.cpp36 TEST_IGNORE_NODISCARD M().lower_bound(C2Int{5}); in main()
H A Dupper_bound2.compile.fail.cpp36 TEST_IGNORE_NODISCARD M().upper_bound(C2Int{5}); in main()

123