HomeSort by relevance Sort by last modified time
    Searched full:c2int (Results 1 - 25 of 100) sorted by null

1 2 3 4

  /external/libcxx/test/support/
is_transparent.h 61 struct C2Int { // comparable to int
62 C2Int() : i_(0) {}
63 C2Int(int i): i_(i) {}
69 bool operator <(int rhs, const C2Int& lhs) { return rhs < lhs.get(); }
70 bool operator <(const C2Int& rhs, const C2Int& lhs) { return rhs.get() < lhs.get(); }
71 bool operator <(const C2Int& rhs, int lhs) { return rhs.get() < lhs; }
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/support/
is_transparent.h 59 struct C2Int { // comparable to int
60 C2Int() : i_(0) {}
61 C2Int(int i): i_(i) {}
67 bool operator <(int rhs, const C2Int& lhs) { return rhs < lhs.get(); }
68 bool operator <(const C2Int& rhs, const C2Int& lhs) { return rhs.get() < lhs.get(); }
69 bool operator <(const C2Int& rhs, int lhs) { return rhs.get() < lhs; }
  /external/libcxx/test/std/containers/associative/map/map.ops/
count.pass.cpp 139 r = m.count(C2Int(5));
141 r = m.count(C2Int(6));
143 r = m.count(C2Int(7));
145 r = m.count(C2Int(8));
147 r = m.count(C2Int(9));
149 r = m.count(C2Int(10));
151 r = m.count(C2Int(11));
153 r = m.count(C2Int(12));
155 r = m.count(C2Int(4));
lower_bound.pass.cpp 286 r = m.lower_bound(C2Int(5));
288 r = m.lower_bound(C2Int(7));
290 r = m.lower_bound(C2Int(9));
292 r = m.lower_bound(C2Int(11));
294 r = m.lower_bound(C2Int(13));
296 r = m.lower_bound(C2Int(15));
298 r = m.lower_bound(C2Int(17));
300 r = m.lower_bound(C2Int(19));
302 r = m.lower_bound(C2Int(4));
304 r = m.lower_bound(C2Int(6))
    [all...]
find.pass.cpp 206 r = m.find(C2Int(5));
208 r = m.find(C2Int(6));
210 r = m.find(C2Int(7));
212 r = m.find(C2Int(8));
214 r = m.find(C2Int(9));
216 r = m.find(C2Int(10));
218 r = m.find(C2Int(11));
220 r = m.find(C2Int(12));
222 r = m.find(C2Int(4));
equal_range.pass.cpp 371 r = m.equal_range(C2Int(5));
374 r = m.equal_range(C2Int(7));
377 r = m.equal_range(C2Int(9));
380 r = m.equal_range(C2Int(11));
383 r = m.equal_range(C2Int(13));
386 r = m.equal_range(C2Int(15));
389 r = m.equal_range(C2Int(17));
392 r = m.equal_range(C2Int(19));
395 r = m.equal_range(C2Int(4));
398 r = m.equal_range(C2Int(6))
    [all...]
count0.pass.cpp 33 M().count(C2Int{5});
count1.fail.cpp 37 M().count(C2Int{5});
count2.fail.cpp 37 M().count(C2Int{5});
count3.fail.cpp 37 M().count(C2Int{5});
equal_range0.pass.cpp 33 M().equal_range(C2Int{5});
equal_range1.fail.cpp 37 M().equal_range(C2Int{5});
equal_range2.fail.cpp 37 M().equal_range(C2Int{5});
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.ops/
count.pass.cpp 138 r = m.count(C2Int(5));
140 r = m.count(C2Int(6));
142 r = m.count(C2Int(7));
144 r = m.count(C2Int(8));
146 r = m.count(C2Int(9));
148 r = m.count(C2Int(10));
150 r = m.count(C2Int(11));
152 r = m.count(C2Int(12));
154 r = m.count(C2Int(4));
lower_bound.pass.cpp 285 r = m.lower_bound(C2Int(5));
287 r = m.lower_bound(C2Int(7));
289 r = m.lower_bound(C2Int(9));
291 r = m.lower_bound(C2Int(11));
293 r = m.lower_bound(C2Int(13));
295 r = m.lower_bound(C2Int(15));
297 r = m.lower_bound(C2Int(17));
299 r = m.lower_bound(C2Int(19));
301 r = m.lower_bound(C2Int(4));
303 r = m.lower_bound(C2Int(6))
    [all...]
find.pass.cpp 205 r = m.find(C2Int(5));
207 r = m.find(C2Int(6));
209 r = m.find(C2Int(7));
211 r = m.find(C2Int(8));
213 r = m.find(C2Int(9));
215 r = m.find(C2Int(10));
217 r = m.find(C2Int(11));
219 r = m.find(C2Int(12));
221 r = m.find(C2Int(4));
equal_range.pass.cpp 370 r = m.equal_range(C2Int(5));
373 r = m.equal_range(C2Int(7));
376 r = m.equal_range(C2Int(9));
379 r = m.equal_range(C2Int(11));
382 r = m.equal_range(C2Int(13));
385 r = m.equal_range(C2Int(15));
388 r = m.equal_range(C2Int(17));
391 r = m.equal_range(C2Int(19));
394 r = m.equal_range(C2Int(4));
397 r = m.equal_range(C2Int(6))
    [all...]
  /external/libcxx/test/std/containers/associative/multimap/multimap.ops/
count.pass.cpp 128 r = m.count(C2Int(4));
130 r = m.count(C2Int(5));
132 r = m.count(C2Int(6));
134 r = m.count(C2Int(7));
136 r = m.count(C2Int(8));
138 r = m.count(C2Int(9));
140 r = m.count(C2Int(10));
find.pass.cpp 180 r = m.find(C2Int(5));
182 r = m.find(C2Int(6));
184 r = m.find(C2Int(7));
186 r = m.find(C2Int(8));
188 r = m.find(C2Int(9));
190 r = m.find(C2Int(10));
lower_bound.pass.cpp 189 r = m.lower_bound(C2Int(4));
191 r = m.lower_bound(C2Int(5));
193 r = m.lower_bound(C2Int(6));
195 r = m.lower_bound(C2Int(7));
197 r = m.lower_bound(C2Int(8));
199 r = m.lower_bound(C2Int(9));
201 r = m.lower_bound(C2Int(10));
upper_bound.pass.cpp 189 r = m.upper_bound(C2Int(4));
191 r = m.upper_bound(C2Int(5));
193 r = m.upper_bound(C2Int(6));
195 r = m.upper_bound(C2Int(7));
197 r = m.upper_bound(C2Int(8));
199 r = m.upper_bound(C2Int(9));
201 r = m.upper_bound(C2Int(10));
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.ops/
count.pass.cpp 127 r = m.count(C2Int(4));
129 r = m.count(C2Int(5));
131 r = m.count(C2Int(6));
133 r = m.count(C2Int(7));
135 r = m.count(C2Int(8));
137 r = m.count(C2Int(9));
139 r = m.count(C2Int(10));
find.pass.cpp 179 r = m.find(C2Int(5));
181 r = m.find(C2Int(6));
183 r = m.find(C2Int(7));
185 r = m.find(C2Int(8));
187 r = m.find(C2Int(9));
189 r = m.find(C2Int(10));
lower_bound.pass.cpp 188 r = m.lower_bound(C2Int(4));
190 r = m.lower_bound(C2Int(5));
192 r = m.lower_bound(C2Int(6));
194 r = m.lower_bound(C2Int(7));
196 r = m.lower_bound(C2Int(8));
198 r = m.lower_bound(C2Int(9));
200 r = m.lower_bound(C2Int(10));
upper_bound.pass.cpp 188 r = m.upper_bound(C2Int(4));
190 r = m.upper_bound(C2Int(5));
192 r = m.upper_bound(C2Int(6));
194 r = m.upper_bound(C2Int(7));
196 r = m.upper_bound(C2Int(8));
198 r = m.upper_bound(C2Int(9));
200 r = m.upper_bound(C2Int(10));

Completed in 561 milliseconds

1 2 3 4