| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end_pred.pass.cpp | 16 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/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);
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/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/llvm/test/Transforms/InstSimplify/ |
| compare.ll | 116 %last1 = getelementptr inbounds i8, i8* %first2, i32 48
117 %last2 = getelementptr inbounds i8, i8* %last1, i32 8
134 %last1 = getelementptr inbounds i8, i8* %ptr, i32 48
135 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6
149 %last1 = getelementptr inbounds i8, i8* %ptr, i32 48
150 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6
162 %last1 = getelementptr inbounds i8, i8* %ptr, i32 48
163 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6
|
| /external/jdiff/src/jdiff/ |
| Diff.java | 195 int last1 = hunk.line1 + hunk.inserted - 1; local
204 System.out.println("last1: " + last1);
240 for (int i = first1; i <= last1; i++) {
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_pred.pass.cpp | 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search_pred.pass.cpp | 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
| /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 | 20 // merge(InIter1 first1, InIter1 last1,
|
| /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 | 18 // set_symmetric_difference(InIter1 first1, InIter1 last1,
|
| set_symmetric_difference_comp.pass.cpp | 19 // set_symmetric_difference(InIter1 first1, InIter1 last1,
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| set_union.pass.cpp | 18 // set_union(InIter1 first1, InIter1 last1,
|
| set_union_comp.pass.cpp | 19 // set_union(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_algobase.h | 157 * @return An iterator equal to @p first2+(last1-first1).
159 * Swaps each element in the range @p [first1,last1) with the
160 * corresponding element in the range @p [first2,(last1-first1)).
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_algobase.h | 157 * @return An iterator equal to @p first2+(last1-first1).
159 * Swaps each element in the range @p [first1,last1) with the
160 * corresponding element in the range @p [first2,(last1-first1)).
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_algobase.h | 157 * @return An iterator equal to @p first2+(last1-first1).
159 * Swaps each element in the range @p [first1,last1) with the
160 * corresponding element in the range @p [first2,(last1-first1)).
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_algobase.h | 158 * @return An iterator equal to @p first2+(last1-first1).
160 * Swaps each element in the range @p [first1,last1) with the
161 * corresponding element in the range @p [first2,(last1-first1)).
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/ |
| _algobase.c | 362 // Search [first2, last2) as a subsequence in [first1, last1), and return
|
