/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/ |
algorithm.hpp | 33 /// @param first1 - first collection begin iterator 39 mismatch( InputIter1 first1, InputIter1 last1, 42 while( first1 != last1 && first2 != last2 && *first1 == *first2 ) { 43 ++first1; 47 return std::pair<InputIter1, InputIter2>(first1, first2); 56 /// @param first1 - first collection begin iterator 63 mismatch( InputIter1 first1, InputIter1 last1, 67 while( first1 != last1 && first2 != last2 && pred( *first1, *first2 ) ) [all...] |
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/range/algorithm/ |
equal.hpp | 27 inline bool equal_impl( SinglePassTraversalReadableIterator1 first1, 39 if (first1 == last1) 49 if (*first1 != *first2) 52 ++first1; 66 inline bool equal_impl( SinglePassTraversalReadableIterator1 first1, 79 if (first1 == last1) 89 if (!pred(*first1, *first2)) 92 ++first1; 105 inline bool equal_impl( RandomAccessTraversalReadableIterator1 first1, 112 return ((last1 - first1) == (last2 - first2) [all...] |
/external/stlport/src/ |
num_get.cpp | 38 __valid_grouping(const char * first1, const char * last1, 40 if (first1 == last1 || first2 == last2) return true; 44 while (first1 != last1) {
|
/ndk/sources/cxx-stl/stlport/src/ |
num_get.cpp | 38 __valid_grouping(const char * first1, const char * last1, 40 if (first1 == last1 || first2 == last2) return true; 44 while (first1 != last1) {
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/inner.product/ |
inner_product.pass.cpp | 20 // inner_product(Iter1 first1, Iter1 last1, Iter2 first2, T init); 29 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) 31 assert(std::inner_product(first1, last1, first2, init) == x);
|
inner_product_comp.pass.cpp | 20 // inner_product(Iter1 first1, Iter1 last1, Iter2 first2, 31 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) 33 assert(std::inner_product(first1, last1, first2, init,
|
/external/llvm/include/llvm/ADT/ |
ilist.h | 618 iterator first1 = begin(), last1 = end(); local 620 while (first1 != last1 && first2 != last2) 621 if (pred(*first2, *first1)) { 623 transfer(first1, right, first2, ++next); 626 ++first1; 685 template<class InIt> void assign(InIt first1, InIt last1) { 687 for ( ; first1 != last1 && first2 != last2; ++first1, ++first2) 688 *first1 = *first2; 690 erase(first1, last1) [all...] |
/external/jdiff/src/jdiff/ |
Diff.java | 136 int first1 = hunk.line1; // Index of first inserted word local 139 newDocWords[first1 - 1].compareTo(" ") == 0 && 141 first1 == lasthunk.line1 + lasthunk.inserted + 1) { 193 int first1 = hunk.line1; // Index of first inserted word local 203 System.out.println("first1: " + first1); 240 for (int i = first1; i <= last1; i++) { [all...] |
/external/stlport/test/eh/ |
test_insert.h | 170 DstIter first1 = original.begin(); local 179 EH_STD::pair<DstIter, DstIter> p = EH_STD::mismatch( first1, original.end(), first2 ); 200 dstItem = EH_STD::find( first1, original.end(), *p.first ); 209 first1 = p.first;
|
/external/stlport/test/unit/ |
codecvt_test.cpp | 464 virtual result do_in(state_type& /*state*/, const extern_type* first1, 468 for ( next1 = first1, next2 = first2; next1 < last1; next1 += 2 ) {
|
/ndk/tests/device/test-gnustl-full/unit/ |
codecvt_test.cpp | 466 virtual result do_in(state_type& /*state*/, const extern_type* first1, 470 for ( next1 = first1, next2 = first2; next1 < last1; next1 += 2 ) {
|
/ndk/tests/device/test-stlport/unit/ |
codecvt_test.cpp | 466 virtual result do_in(state_type& /*state*/, const extern_type* first1, 470 for ( next1 = first1, next2 = first2; next1 < last1; next1 += 2 ) {
|
/external/guava/guava/lib/ |
jdiff.jar | |
/prebuilts/devtools/tools/lib/ |
sdkuilib.jar | |
/external/grub/docs/ |
texinfo.tex | [all...] |
/external/bison/build-aux/ |
texinfo.tex | [all...] |
/ndk/sources/host-tools/sed-4.2.1/build-aux/ |
texinfo.tex | [all...] |