| /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...] |
| /external/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;
|
| /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;
|
| /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)).
406 // fills [first2 + (last1 - first1), last2) with x.
|
| stl_algo.h | 678 * @param last2 End of sequence to match.
680 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
681 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
685 * equal value-by-value with the sequence given by @p [first2,last2) and
692 * @p last1-(last2-first2) where @p last2-first2 is the length of the
695 * @p [first1,last1-(last2-first2))
722 * @param last2 End of sequence to match.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
726 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), o
[all...] |
| /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)).
406 // fills [first2 + (last1 - first1), last2) with x.
|
| stl_algo.h | 678 * @param last2 End of sequence to match.
680 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
681 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
685 * equal value-by-value with the sequence given by @p [first2,last2) and
692 * @p last1-(last2-first2) where @p last2-first2 is the length of the
695 * @p [first1,last1-(last2-first2))
722 * @param last2 End of sequence to match.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
726 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), o
[all...] |
| /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)).
406 // fills [first2 + (last1 - first1), last2) with x.
|
| stl_algo.h | 678 * @param last2 End of sequence to match.
680 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
681 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
685 * equal value-by-value with the sequence given by @p [first2,last2) and
692 * @p last1-(last2-first2) where @p last2-first2 is the length of the
695 * @p [first1,last1-(last2-first2))
722 * @param last2 End of sequence to match.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
726 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), o
[all...] |
| /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)).
406 // fills [first2 + (last1 - first1), last2) with x.
|
| stl_algo.h | 678 * @param last2 End of sequence to match.
680 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
681 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
685 * equal value-by-value with the sequence given by @p [first2,last2) and
692 * @p last1-(last2-first2) where @p last2-first2 is the length of the
695 * @p [first1,last1-(last2-first2))
722 * @param last2 End of sequence to match.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
726 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), o
[all...] |
| /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)).
406 // fills [first2 + (last1 - first1), last2) with x.
|
| stl_algo.h | 678 * @param last2 End of sequence to match.
680 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
681 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
685 * equal value-by-value with the sequence given by @p [first2,last2) and
692 * @p last1-(last2-first2) where @p last2-first2 is the length of the
695 * @p [first1,last1-(last2-first2))
722 * @param last2 End of sequence to match.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
726 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), o
[all...] |
| /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);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_algo.h | 663 * @param last2 End 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))
707 * @param last2 End of sequence to match.
710 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
711 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), o
[all...] |
| 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)).
408 // fills [first2 + (last1 - first1), last2) with x.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_algo.h | 663 * @param last2 End 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))
707 * @param last2 End of sequence to match.
710 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
711 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), o
[all...] |
| 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)).
408 // fills [first2 + (last1 - first1), last2) with x.
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_algo.h | 663 * @param last2 End 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))
707 * @param last2 End of sequence to match.
710 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
711 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), o
[all...] |
| 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)).
408 // fills [first2 + (last1 - first1), last2) with x.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_algo.h | 663 * @param last2 End 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))
707 * @param last2 End of sequence to match.
710 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
711 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), o
[all...] |
| /external/llvm/include/llvm/ADT/ |
| ilist.h | 619 iterator first2 = right.begin(), last2 = right.end(); local
620 while (first1 != last1 && first2 != last2)
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)
689 if (first2 == last2)
692 insert(last1, first2, last2);
|
| /external/llvm/test/Transforms/InstSimplify/ |
| ptr_diff.ll | 26 %last2 = getelementptr inbounds i8* %last1, i32 8
27 %last3 = getelementptr inbounds i8* %last2, i32 -4
|
