| /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.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;
|
| /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.
|
| stl_algo.h | 677 * @param first2 Start 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))
721 * @param first2 Start of sequence to match.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @
[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)).
405 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
406 // fills [first2 + (last1 - first1), last2) with x.
|
| stl_algo.h | 677 * @param first2 Start 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))
721 * @param first2 Start of sequence to match.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @
[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)).
405 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
406 // fills [first2 + (last1 - first1), last2) with x.
|
| stl_algo.h | 677 * @param first2 Start 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))
721 * @param first2 Start of sequence to match.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @
[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)).
405 // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
406 // fills [first2 + (last1 - first1), last2) with x.
|
| stl_algo.h | 677 * @param first2 Start 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))
721 * @param first2 Start of sequence to match.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @
[all...] |
| /prebuilts/ndk/8/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.
|
| stl_algo.h | 677 * @param first2 Start 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))
721 * @param first2 Start of sequence to match.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @
[all...] |
| /external/llvm/include/llvm/ADT/ |
| ilist.h | 603 iterator first2 = right.begin(), last2 = right.end(); local
604 while (first1 != last1 && first2 != last2)
605 if (pred(*first2, *first1)) {
606 iterator next = first2;
607 transfer(first1, right, first2, ++next);
608 first2 = next;
612 if (first2 != last2) transfer(last1, right, first2, last2);
670 iterator first2 = this->begin(), last2 = this->end(); local
671 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());
|
| /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...] |
| /external/stlport/stlport/stl/ |
| _uninitialized.h | 366 // copies [first2, last2) into
367 // [result + (last1 - first1), result + (last1 - first1) + (last2 - first2)).
400 // Copies [first1, last1) into [first2, first2 + (last1 - first1)), and
401 // fills [first2 + (last1 - first1), last2) with x.
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _uninitialized.h | 366 // copies [first2, last2) into
367 // [result + (last1 - first1), result + (last1 - first1) + (last2 - first2)).
400 // Copies [first1, last1) into [first2, first2 + (last1 - first1)), and
401 // fills [first2 + (last1 - first1), last2) with x.
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _uninitialized.h | 366 // copies [first2, last2) into
367 // [result + (last1 - first1), result + (last1 - first1) + (last2 - first2)).
400 // Copies [first1, last1) into [first2, first2 + (last1 - first1)), and
401 // fills [first2 + (last1 - first1), last2) with x.
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _uninitialized.h | 366 // copies [first2, last2) into
367 // [result + (last1 - first1), result + (last1 - first1) + (last2 - first2)).
400 // Copies [first1, last1) into [first2, first2 + (last1 - first1)), and
401 // fills [first2 + (last1 - first1), last2) with x.
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _uninitialized.h | 366 // copies [first2, last2) into
367 // [result + (last1 - first1), result + (last1 - first1) + (last2 - first2)).
400 // Copies [first1, last1) into [first2, first2 + (last1 - first1)), and
401 // fills [first2 + (last1 - first1), last2) with x.
|
