/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/ |
find_end_pred.pass.cpp | 16 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
search.pass.cpp | 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
search_pred.pass.cpp | 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/ |
includes.pass.cpp | 16 // includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
includes_comp.pass.cpp | 16 // includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Compare comp);
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
search_pred.pass.cpp | 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
/external/llvm/test/Transforms/InstSimplify/ |
compare.ll | 113 %first2 = getelementptr inbounds i8, i8* %first1, i32 1 114 %first3 = getelementptr inbounds i8, i8* %first2, i32 2 116 %last1 = getelementptr inbounds i8, i8* %first2, i32 48 133 %first2 = getelementptr inbounds i8, i8* %first1, i32 44 136 %first.int = ptrtoint i8* %first2 to i32
|
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ |
binary_transform.pass.cpp | 16 // transform(InIter1 first1, InIter1 last1, InIter2 first2, OutIter result, BinaryOp binary_op);
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
merge.pass.cpp | 19 // merge(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2, OutIter result);
|
merge_comp.pass.cpp | 21 // InIter2 first2, InIter2 last2, OutIter result, Compare comp);
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
set_difference.pass.cpp | 18 // set_difference(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
set_difference_comp.pass.cpp | 19 // set_difference(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
set_intersection.pass.cpp | 18 // set_intersection(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
set_intersection_comp.pass.cpp | 19 // set_intersection(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
set_symmetric_difference.pass.cpp | 19 // InIter2 first2, InIter2 last2,
|
set_symmetric_difference_comp.pass.cpp | 20 // InIter2 first2, InIter2 last2,
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
set_union.pass.cpp | 19 // InIter2 first2, InIter2 last2, OutIter result);
|
set_union_comp.pass.cpp | 19 // set_union(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.transform/ |
binary_transform.pass.cpp | 16 // transform(InIter1 first1, InIter1 last1, InIter2 first2, OutIter result, BinaryOp binary_op);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/ |
merge.pass.cpp | 17 // merge(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2, OutIter result);
|
merge_comp.pass.cpp | 19 // InIter2 first2, InIter2 last2, OutIter result, Compare comp);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
set_difference.pass.cpp | 18 // set_difference(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
set_difference_comp.pass.cpp | 19 // set_difference(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
set_intersection.pass.cpp | 18 // set_intersection(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
set_intersection_comp.pass.cpp | 19 // set_intersection(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|