| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/strings/basic.string/string.iterators/ |
| H A D | cend.pass.cpp | 23 typename S::const_iterator ce = s.cend(); local
24 assert(ce == s.end());
|
| H A D | crend.pass.cpp | 23 typename S::const_reverse_iterator ce = s.crend(); local
24 assert(ce == s.rend());
|
| H A D | end.pass.cpp | 27 typename S::const_iterator ce = cs.end(); local
31 assert(ce == cs.begin());
34 assert(static_cast<std::size_t>(ce - cs.begin()) == cs.size());
|
| H A D | rend.pass.cpp | 27 typename S::const_reverse_iterator ce = cs.rend(); local
31 assert(ce == cs.rbegin());
34 assert(static_cast<std::size_t>(ce - cs.rbegin()) == cs.size());
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/strings/basic.string/string.iterators/ |
| H A D | cend.pass.cpp | 23 typename S::const_iterator ce = s.cend(); local
24 assert(ce == s.end());
|
| H A D | crend.pass.cpp | 23 typename S::const_reverse_iterator ce = s.crend(); local
24 assert(ce == s.rend());
|
| H A D | end.pass.cpp | 27 typename S::const_iterator ce = cs.end(); local
31 assert(ce == cs.begin());
34 assert(static_cast<std::size_t>(ce - cs.begin()) == cs.size());
|
| H A D | rend.pass.cpp | 27 typename S::const_reverse_iterator ce = cs.rend(); local
31 assert(ce == cs.rbegin());
34 assert(static_cast<std::size_t>(ce - cs.rbegin()) == cs.size());
|
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| H A D | set_intersection.pass.cpp | 37 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
41 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| H A D | set_intersection_comp.pass.cpp | 39 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| H A D | set_symmetric_difference.pass.cpp | 38 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), local
40 assert(base(ce) - ic == sr);
41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
44 assert(base(ce) - ic == sr);
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| H A D | set_symmetric_difference_comp.pass.cpp | 40 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), local
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
48 assert(base(ce) - ic == sr);
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| H A D | set_union.pass.cpp | 37 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
41 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| H A D | set_union_comp.pass.cpp | 39 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| H A D | set_intersection.pass.cpp | 37 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
41 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| H A D | set_intersection_comp.pass.cpp | 39 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| H A D | set_symmetric_difference.pass.cpp | 38 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), local
40 assert(base(ce) - ic == sr);
41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
44 assert(base(ce) - ic == sr);
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| H A D | set_symmetric_difference_comp.pass.cpp | 40 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), local
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
48 assert(base(ce) - ic == sr);
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| H A D | set_union.pass.cpp | 37 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
41 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| H A D | set_union_comp.pass.cpp | 39 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| H A D | set_difference.pass.cpp | 37 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == srr);
46 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);
|
| H A D | set_difference_comp.pass.cpp | 39 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
47 assert(base(ce) - ic == srr);
48 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| H A D | set_difference.pass.cpp | 37 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == srr);
46 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);
|
| H A D | set_difference_comp.pass.cpp | 39 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
47 assert(base(ce) - ic == srr);
48 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);
|
| /prebuilts/tools/common/jasmin/ |
| H A D | jasmin.jar | ... size (jas.ClassEnv, jas.CodeAttr) jas.ClassEnv ce
jas.CodeAttr code
void resolve (jas.ClassEnv) jas ... |