/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/ |
algorithm.hpp | 36 /// @param last2 - second collection end iterator 40 InputIter2 first2, InputIter2 last2 ) 42 while( first1 != last1 && first2 != last2 && *first1 == *first2 ) { 59 /// @param last2 - second collection end iterator 64 InputIter2 first2, InputIter2 last2, 67 while( first1 != last1 && first2 != last2 && pred( *first1, *first2 ) ) { 82 /// @param last2 - second collection end iterator 86 ForwardIterator2 first2, ForwardIterator2 last2 ) 89 if( std::find( first2, last2, *first1 ) == last2 ) [all...] |
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/range/algorithm/ |
equal.hpp | 30 SinglePassTraversalReadableIterator2 last2, 40 return first2 == last2; 45 if (first2 == last2) 69 SinglePassTraversalReadableIterator2 last2, 80 return first2 == last2; 85 if (first2 == last2) 108 RandomAccessTraversalReadableIterator2 last2, 112 return ((last1 - first1) == (last2 - first2)) 122 RandomAccessTraversalReadableIterator2 last2, 125 return ((last1 - first1) == (last2 - first2) [all...] |
/cts/tests/tests/provider/src/android/provider/cts/ |
ContactsContract_AggregationSuggestionsTest.java | 124 .addNameParameter("first2 last2") 134 values.put(Contacts.DISPLAY_NAME, "first2 last2"); 144 .addNameParameter("first2 last2") 155 values.put(Contacts.DISPLAY_NAME, "first2 last2"); 177 .with(StructuredName.FAMILY_NAME, "last2")
|
/ndk/sources/cxx-stl/stlport/src/ |
num_get.cpp | 39 const char * first2, const char * last2) { 40 if (first1 == last1 || first2 == last2) return true; 42 --last1; --last2; 48 if (first2 != last2) ++first2;
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
find_first_of.pass.cpp | 15 // find_first_of(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
find_first_of_pred.pass.cpp | 16 // find_first_of(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/ |
find_first_of.pass.cpp | 15 // find_first_of(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
find_first_of_pred.pass.cpp | 16 // find_first_of(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);
|
/external/llvm/test/Transforms/InstSimplify/ |
ptr_diff.ll | 26 %last2 = getelementptr inbounds i8, i8* %last1, i32 8 27 %last3 = getelementptr inbounds i8, i8* %last2, i32 -4
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
stl_uninitialized.h | 344 // move [first2, last2) into 345 // [result, result + (last1 - first1) + (last2 - first2)). 372 // copies [first2, last2) into 373 // [result, result + (last1 - first1) + (last2 - first2)). 422 // fills [first2 + (last1 - first1), last2) with x.
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
stl_uninitialized.h | 344 // move [first2, last2) into 345 // [result, result + (last1 - first1) + (last2 - first2)). 372 // copies [first2, last2) into 373 // [result, result + (last1 - first1) + (last2 - first2)). 422 // fills [first2 + (last1 - first1), last2) with x.
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
stl_uninitialized.h | 344 // move [first2, last2) into 345 // [result, result + (last1 - first1) + (last2 - first2)). 372 // copies [first2, last2) into 373 // [result, result + (last1 - first1) + (last2 - first2)). 422 // fills [first2 + (last1 - first1), last2) with x.
|
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
stl_uninitialized.h | 364 // move [first2, last2) into 365 // [result, result + (last1 - first1) + (last2 - first2)). 392 // copies [first2, last2) into 393 // [result, result + (last1 - first1) + (last2 - first2)). 442 // fills [first2 + (last1 - first1), last2) with x.
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
find_end.pass.cpp | 15 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
lexicographical_compare.pass.cpp | 16 // lexicographical_compare(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
lexicographical_compare_comp.pass.cpp | 17 // Iter2 first2, Iter2 last2, Compare comp);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/ |
find_end.pass.cpp | 15 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/ |
lexicographical_compare.pass.cpp | 16 // lexicographical_compare(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
lexicographical_compare_comp.pass.cpp | 17 // Iter2 first2, Iter2 last2, Compare comp);
|
/external/llvm/include/llvm/ADT/ |
ilist.h | 649 iterator First2 = Right.begin(), Last2 = Right.end(); 650 while (First1 != Last1 && First2 != Last2) { 659 if (First2 != Last2) 660 transfer(Last1, Right, First2, Last2); 766 iterator first2 = this->begin(), last2 = this->end(); local 767 for ( ; first1 != last1 && first2 != last2; ++first1, ++first2) 769 if (first2 == last2) 772 insert(last1, first2, last2);
|
/external/libcxx/include/ |
algorithm | 53 ForwardIterator2 first2, ForwardIterator2 last2); 58 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 63 ForwardIterator2 first2, ForwardIterator2 last2); 68 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 93 InputIterator2 first2, InputIterator2 last2); // **C++14** 103 InputIterator2 first2, InputIterator2 last2, 113 InputIterator2 first2, InputIterator2 last2); // **C++14** 123 InputIterator2 first2, InputIterator2 last2, 134 ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 144 ForwardIterator2 first2, ForwardIterator2 last2, [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
algorithm | 53 ForwardIterator2 first2, ForwardIterator2 last2); 58 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 63 ForwardIterator2 first2, ForwardIterator2 last2); 68 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 93 InputIterator2 first2, InputIterator2 last2); // **C++14** 103 InputIterator2 first2, InputIterator2 last2, 113 InputIterator2 first2, InputIterator2 last2); // **C++14** 123 InputIterator2 first2, InputIterator2 last2, 134 ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 144 ForwardIterator2 first2, ForwardIterator2 last2, [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/libcxx/include/ |
algorithm | 53 ForwardIterator2 first2, ForwardIterator2 last2); 58 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 63 ForwardIterator2 first2, ForwardIterator2 last2); 68 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 93 InputIterator2 first2, InputIterator2 last2); // **C++14** 103 InputIterator2 first2, InputIterator2 last2, 113 InputIterator2 first2, InputIterator2 last2); // **C++14** 123 InputIterator2 first2, InputIterator2 last2, 134 ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 144 ForwardIterator2 first2, ForwardIterator2 last2, [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
_uninitialized.h | 366 // copies [first2, last2) into 367 // [result + (last1 - first1), result + (last1 - first1) + (last2 - first2)). 401 // fills [first2 + (last1 - first1), last2) with x.
|
/prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/ |
_uninitialized.h | 366 // copies [first2, last2) into 367 // [result + (last1 - first1), result + (last1 - first1) + (last2 - first2)). 401 // fills [first2 + (last1 - first1), last2) with x.
|