| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _uninitialized.h | 365 // Copies [first1, last1) into [result, result + (last1 - first1)), and
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.
|
| /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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.equal/ |
| equal.pass.cpp | 15 // equal(Iter1 first1, Iter1 last1, Iter2 first2);
|
| /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);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/mismatch/ |
| mismatch.pass.cpp | 15 // mismatch(Iter1 first1, Iter1 last1, Iter2 first2);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_algobase.h | 147 * @param first1 A forward iterator.
150 * @return An iterator equal to @p first2+(last1-first1).
152 * Swaps each element in the range @p [first1,last1) with the
153 * corresponding element in the range @p [first2,(last1-first1)).
941 * @param first1 An input iterator.
970 * @param first1 An input iterator
[all...] |
| stl_algo.h | 675 * @param first1 Start of range to search.
680 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
684 * Searches the range @p [first1,last1) for a sub-sequence that compares
691 * @p [first1,last1) it must start at a position less than
695 * @p [first1,last1-(last2-first2))
719 * @param first1 Start of range to search.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
729 * Searches the range @p [first1,last1) for a sub-sequence that compares
737 * @p [first1,last1) it must start at a position less than
741 * @p [first1,last1-(last2-first2)
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_algobase.h | 148 * @param first1 A forward iterator.
151 * @return An iterator equal to @p first2+(last1-first1).
153 * Swaps each element in the range @p [first1,last1) with the
154 * corresponding element in the range @p [first2,(last1-first1)).
[all...] |
| stl_algo.h | 660 * @param first1 Start of range to search.
665 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
669 * Searches the range @p [first1,last1) for a sub-sequence that compares
676 * @p [first1,last1) it must start at a position less than
680 * @p [first1,last1-(last2-first2))
704 * @param first1 Start of range to search.
710 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
714 * Searches the range @p [first1,last1) for a sub-sequence that compares
722 * @p [first1,last1) it must start at a position less than
726 * @p [first1,last1-(last2-first2)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_algobase.h | 148 * @param first1 A forward iterator.
151 * @return An iterator equal to @p first2+(last1-first1).
153 * Swaps each element in the range @p [first1,last1) with the
154 * corresponding element in the range @p [first2,(last1-first1)).
[all...] |
| stl_algo.h | 660 * @param first1 Start of range to search.
665 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
669 * Searches the range @p [first1,last1) for a sub-sequence that compares
676 * @p [first1,last1) it must start at a position less than
680 * @p [first1,last1-(last2-first2))
704 * @param first1 Start of range to search.
710 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
714 * Searches the range @p [first1,last1) for a sub-sequence that compares
722 * @p [first1,last1) it must start at a position less than
726 * @p [first1,last1-(last2-first2)
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algobase.h | 147 * @param first1 A forward iterator.
150 * @return An iterator equal to @p first2+(last1-first1).
152 * Swaps each element in the range @p [first1,last1) with the
153 * corresponding element in the range @p [first2,(last1-first1)).
941 * @param first1 An input iterator.
970 * @param first1 An input iterator
[all...] |
| stl_algo.h | 675 * @param first1 Start of range to search.
680 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
684 * Searches the range @p [first1,last1) for a sub-sequence that compares
691 * @p [first1,last1) it must start at a position less than
695 * @p [first1,last1-(last2-first2))
719 * @param first1 Start of range to search.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
729 * Searches the range @p [first1,last1) for a sub-sequence that compares
737 * @p [first1,last1) it must start at a position less than
741 * @p [first1,last1-(last2-first2)
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algobase.h | 147 * @param first1 A forward iterator.
150 * @return An iterator equal to @p first2+(last1-first1).
152 * Swaps each element in the range @p [first1,last1) with the
153 * corresponding element in the range @p [first2,(last1-first1)).
941 * @param first1 An input iterator.
970 * @param first1 An input iterator
[all...] |
| stl_algo.h | 675 * @param first1 Start of range to search.
680 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
684 * Searches the range @p [first1,last1) for a sub-sequence that compares
691 * @p [first1,last1) it must start at a position less than
695 * @p [first1,last1-(last2-first2))
719 * @param first1 Start of range to search.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
729 * Searches the range @p [first1,last1) for a sub-sequence that compares
737 * @p [first1,last1) it must start at a position less than
741 * @p [first1,last1-(last2-first2)
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algobase.h | 147 * @param first1 A forward iterator.
150 * @return An iterator equal to @p first2+(last1-first1).
152 * Swaps each element in the range @p [first1,last1) with the
153 * corresponding element in the range @p [first2,(last1-first1)).
941 * @param first1 An input iterator.
970 * @param first1 An input iterator
[all...] |
| stl_algo.h | 675 * @param first1 Start of range to search.
680 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
684 * Searches the range @p [first1,last1) for a sub-sequence that compares
691 * @p [first1,last1) it must start at a position less than
695 * @p [first1,last1-(last2-first2))
719 * @param first1 Start of range to search.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
729 * Searches the range @p [first1,last1) for a sub-sequence that compares
737 * @p [first1,last1) it must start at a position less than
741 * @p [first1,last1-(last2-first2)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| stl_algobase.h | 147 * @param first1 A forward iterator.
150 * @return An iterator equal to @p first2+(last1-first1).
152 * Swaps each element in the range @p [first1,last1) with the
153 * corresponding element in the range @p [first2,(last1-first1)).
941 * @param first1 An input iterator.
970 * @param first1 An input iterator
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_algobase.h | 148 * @param first1 A forward iterator.
151 * @return An iterator equal to @p first2+(last1-first1).
153 * Swaps each element in the range @p [first1,last1) with the
154 * corresponding element in the range @p [first2,(last1-first1)).
[all...] |
| stl_algo.h | 660 * @param first1 Start of range to search.
665 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
669 * Searches the range @p [first1,last1) for a sub-sequence that compares
676 * @p [first1,last1) it must start at a position less than
680 * @p [first1,last1-(last2-first2))
704 * @param first1 Start of range to search.
710 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
714 * Searches the range @p [first1,last1) for a sub-sequence that compares
722 * @p [first1,last1) it must start at a position less than
726 * @p [first1,last1-(last2-first2)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_algobase.h | 148 * @param first1 A forward iterator.
151 * @return An iterator equal to @p first2+(last1-first1).
153 * Swaps each element in the range @p [first1,last1) with the
154 * corresponding element in the range @p [first2,(last1-first1)).
[all...] |
| stl_algo.h | 660 * @param first1 Start of range to search.
665 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
669 * Searches the range @p [first1,last1) for a sub-sequence that compares
676 * @p [first1,last1) it must start at a position less than
680 * @p [first1,last1-(last2-first2))
704 * @param first1 Start of range to search.
710 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
714 * Searches the range @p [first1,last1) for a sub-sequence that compares
722 * @p [first1,last1) it must start at a position less than
726 * @p [first1,last1-(last2-first2)
[all...] |
| /external/llvm/test/Transforms/InstSimplify/ |
| ptr_diff.ll | 21 %first1 = getelementptr inbounds i8* %ptr, i32 0
22 %first2 = getelementptr inbounds i8* %first1, i32 1
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| numeric | 30 inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init);
34 inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
|
