HomeSort by relevance Sort by last modified time
    Searched full:first2 (Results 1 - 25 of 150) sorted by null

1 2 3 4 5 6

  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/
algorithm.hpp 35 /// @param first2 - second collection begin iterator
40 InputIter2 first2, InputIter2 last2 )
42 while( first1 != last1 && first2 != last2 && *first1 == *first2 ) {
44 ++first2;
47 return std::pair<InputIter1, InputIter2>(first1, first2);
58 /// @param first2 - second collection begin iterator
64 InputIter2 first2, InputIter2 last2,
67 while( first1 != last1 && first2 != last2 && pred( *first1, *first2 ) ) {
    [all...]
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/range/algorithm/
equal.hpp 29 SinglePassTraversalReadableIterator2 first2,
40 return first2 == last2;
45 if (first2 == last2)
49 if (*first1 != *first2)
53 ++first2;
68 SinglePassTraversalReadableIterator2 first2,
80 return first2 == last2;
85 if (first2 == last2)
89 if (!pred(*first1, *first2))
93 ++first2;
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
numeric 170 InputIterator2 first2, T init,
172 { return _GLIBCXX_STD_P::inner_product(first1, last1, first2, init); }
178 InputIterator2 first2, T init, BinaryFunction1 binary_op1,
180 { return _GLIBCXX_STD_P::inner_product(first1, last1, first2, init,
189 RandomAccessIterator2 first2, T init,
206 RandomAccessIterator2, T> my_selector(first1, first2);
214 return inner_product(first1, last1, first2, init,
224 InputIterator2 first2, T init,
228 { return inner_product(first1, last1, first2, init,
236 InputIterator2 first2, T init, BinaryFunction1 binary_op1,
    [all...]
  /external/stlport/src/
num_get.cpp 39 const char * first2, const char * last2) {
40 if (first1 == last1 || first2 == last2) return true;
45 if (*last1 != *first2)
48 if (first2 != last2) ++first2;
51 return *last1 <= *first2;
  /ndk/sources/cxx-stl/stlport/src/
num_get.cpp 39 const char * first2, const char * last2) {
40 if (first1 == last1 || first2 == last2) return true;
45 if (*last1 != *first2)
48 if (first2 != last2) ++first2;
51 return *last1 <= *first2;
  /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,
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
stl_uninitialized.h 328 // move [first2, last2) into
329 // [result, result + (last1 - first1) + (last2 - first2)).
356 // copies [first2, last2) into
357 // [result, result + (last1 - first1) + (last2 - first2)).
405 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
406 // fills [first2 + (last1 - first1), last2) with x.
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_uninitialized.h 328 // move [first2, last2) into
329 // [result, result + (last1 - first1) + (last2 - first2)).
356 // copies [first2, last2) into
357 // [result, result + (last1 - first1) + (last2 - first2)).
405 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
406 // fills [first2 + (last1 - first1), last2) with x.
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_uninitialized.h 328 // move [first2, last2) into
329 // [result, result + (last1 - first1) + (last2 - first2)).
356 // copies [first2, last2) into
357 // [result, result + (last1 - first1) + (last2 - first2)).
405 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
406 // fills [first2 + (last1 - first1), last2) with x.
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_uninitialized.h 328 // move [first2, last2) into
329 // [result, result + (last1 - first1) + (last2 - first2)).
356 // copies [first2, last2) into
357 // [result, result + (last1 - first1) + (last2 - first2)).
405 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
406 // fills [first2 + (last1 - first1), last2) with x.
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/
stl_uninitialized.h 328 // move [first2, last2) into
329 // [result, result + (last1 - first1) + (last2 - first2)).
356 // copies [first2, last2) into
357 // [result, result + (last1 - first1) + (last2 - first2)).
405 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
406 // fills [first2 + (last1 - first1), last2) with x.
  /external/llvm/include/llvm/ADT/
ilist.h 619 iterator first2 = right.begin(), last2 = right.end(); local
620 while (first1 != last1 && first2 != last2)
621 if (pred(*first2, *first1)) {
622 iterator next = first2;
623 transfer(first1, right, first2, ++next);
624 first2 = next;
628 if (first2 != last2) transfer(last1, right, first2, last2);
686 iterator first2 = this->begin(), last2 = this->end(); local
687 for ( ; first1 != last1 && first2 != last2; ++first1, ++first2
    [all...]
  /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/
AttributedCharacterIteratorTest.java 43 assertEquals("Wrong first2", 's', it.current());
55 assertEquals("Wrong first2", 'T', it.first());
129 assertEquals("Wrong first2", 't', it.next());
  /external/llvm/test/Transforms/InstSimplify/
ptr_diff.ll 22 %first2 = getelementptr inbounds i8* %first1, i32 1
23 %first3 = getelementptr inbounds i8* %first2, i32 2
25 %last1 = getelementptr inbounds i8* %first2, i32 48
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
stl_uninitialized.h 330 // move [first2, last2) into
331 // [result, result + (last1 - first1) + (last2 - first2)).
358 // copies [first2, last2) into
359 // [result, result + (last1 - first1) + (last2 - first2)).
407 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
408 // fills [first2 + (last1 - first1), last2) with x.
stl_algo.h 662 * @param first2 Start of sequence to match.
665 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
666 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
670 * equal value-by-value with the sequence given by @p [first2,last2) and
677 * @p last1-(last2-first2) where @p last2-first2 is the length of the
680 * @p [first1,last1-(last2-first2))
706 * @param first2 Start of sequence to match.
710 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
stl_uninitialized.h 330 // move [first2, last2) into
331 // [result, result + (last1 - first1) + (last2 - first2)).
358 // copies [first2, last2) into
359 // [result, result + (last1 - first1) + (last2 - first2)).
407 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
408 // fills [first2 + (last1 - first1), last2) with x.
stl_algo.h 662 * @param first2 Start of sequence to match.
665 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
666 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
670 * equal value-by-value with the sequence given by @p [first2,last2) and
677 * @p last1-(last2-first2) where @p last2-first2 is the length of the
680 * @p [first1,last1-(last2-first2))
706 * @param first2 Start of sequence to match.
710 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
stl_uninitialized.h 330 // move [first2, last2) into
331 // [result, result + (last1 - first1) + (last2 - first2)).
358 // copies [first2, last2) into
359 // [result, result + (last1 - first1) + (last2 - first2)).
407 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
408 // fills [first2 + (last1 - first1), last2) with x.
stl_algo.h 662 * @param first2 Start of sequence to match.
665 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
666 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
670 * equal value-by-value with the sequence given by @p [first2,last2) and
677 * @p last1-(last2-first2) where @p last2-first2 is the length of the
680 * @p [first1,last1-(last2-first2))
706 * @param first2 Start of sequence to match.
710 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_uninitialized.h 346 // move [first2, last2) into
347 // [result, result + (last1 - first1) + (last2 - first2)).
374 // copies [first2, last2) into
375 // [result, result + (last1 - first1) + (last2 - first2)).
423 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
424 // fills [first2 + (last1 - first1), last2) with x.
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
stl_uninitialized.h 330 // move [first2, last2) into
331 // [result, result + (last1 - first1) + (last2 - first2)).
358 // copies [first2, last2) into
359 // [result, result + (last1 - first1) + (last2 - first2)).
407 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
408 // fills [first2 + (last1 - first1), last2) with x.
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_uninitialized.h 346 // move [first2, last2) into
347 // [result, result + (last1 - first1) + (last2 - first2)).
374 // copies [first2, last2) into
375 // [result, result + (last1 - first1) + (last2 - first2)).
423 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
424 // fills [first2 + (last1 - first1), last2) with x.
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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)).
421 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
422 // fills [first2 + (last1 - first1), last2) with x.

Completed in 1894 milliseconds

1 2 3 4 5 6