| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.iterators/ |
| D | end.pass.cpp | 26 typename S::const_iterator ce = cs.end(); in test() local
30 assert(ce == cs.begin()); in test()
33 assert(ce - cs.begin() == cs.size()); in test()
|
| D | rend.pass.cpp | 26 typename S::const_reverse_iterator ce = cs.rend(); in test() local
30 assert(ce == cs.rbegin()); in test()
33 assert(ce - cs.rbegin() == cs.size()); in test()
|
| D | cend.pass.cpp | 23 typename S::const_iterator ce = s.cend(); in test() local
24 assert(ce == s.end()); in test()
|
| D | crend.pass.cpp | 23 typename S::const_reverse_iterator ce = s.crend(); in test() local
24 assert(ce == s.rend()); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| D | set_symmetric_difference.pass.cpp | 38 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), in test() local
40 assert(base(ce) - ic == sr); in test()
41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb), in test()
44 assert(base(ce) - ic == sr); in test()
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| D | set_symmetric_difference_comp.pass.cpp | 40 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), in test() local
43 assert(base(ce) - ic == sr); in test()
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
45 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb), in test()
48 assert(base(ce) - ic == sr); in test()
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| D | set_intersection.pass.cpp | 37 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), in test() local
39 assert(base(ce) - ic == sr); in test()
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
41 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb), in test()
43 assert(base(ce) - ic == sr); in test()
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| D | set_intersection_comp.pass.cpp | 39 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), in test() local
41 assert(base(ce) - ic == sr); in test()
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
43 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb), in test()
45 assert(base(ce) - ic == sr); in test()
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/ |
| D | set_union.pass.cpp | 37 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), in test() local
39 assert(base(ce) - ic == sr); in test()
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
41 ce = std::set_union(Iter1(ib), Iter1(ib+sb), in test()
43 assert(base(ce) - ic == sr); in test()
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| D | set_union_comp.pass.cpp | 39 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), in test() local
41 assert(base(ce) - ic == sr); in test()
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
43 ce = std::set_union(Iter1(ib), Iter1(ib+sb), in test()
45 assert(base(ce) - ic == sr); in test()
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| D | set_difference_comp.pass.cpp | 39 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), in test() local
41 assert(base(ce) - ic == sr); in test()
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
45 ce = std::set_difference(Iter1(ib), Iter1(ib+sb), in test()
47 assert(base(ce) - ic == srr); in test()
48 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0); in test()
|
| D | set_difference.pass.cpp | 37 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), in test() local
39 assert(base(ce) - ic == sr); in test()
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
43 ce = std::set_difference(Iter1(ib), Iter1(ib+sb), in test()
45 assert(base(ce) - ic == srr); in test()
46 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0); in test()
|
| /ndk/sources/host-tools/sed-4.2.1/po/ |
| D | ru.po | 3 # Const Kaplinsky <const@ce.cctpu.edu.ru>, 1998.
|
| D | pl.po | 499 msgstr "Nieprawid�owe poprzedzaj�ce wyra�enie regularne"
|
| D | fr.po | 151 msgstr "impossible d'�diter %s: ce n'est pas un fichier r�gulier"
|
| /ndk/sources/android/support/src/stdio/ |
| D | strtod.c | 484 ULong *ce, *x, *xe; in copybits() local
489 ce = c + ((n-1) >> kshift) + 1; in copybits()
503 while(c < ce) in copybits()
|
| /ndk/sources/host-tools/sed-4.2.1/testsuite/ |
| D | BOOST.tests | 289 (a)\1bc*[ce]d aabcccd 0 7 0 1
|
| D | SPENCER.tests | 168 \(a\)\1bc*[ce]d b aabcccd aabcccd
|
| /ndk/sources/host-tools/make-3.81/po/ |
| D | pl.po | 1382 msgstr "uwaga: polecenia zakrywaj�ce dla obiektu `%s'"
|
| /ndk/sources/host-tools/sed-4.2.1/build-aux/ |
| D | texinfo.tex | 8185 \gdef^^ce{\^I}
8305 \gdef^^ce{\^I}
|