Home
last modified time | relevance | path

Searched refs:last1 (Results 1 – 17 of 17) sorted by relevance

/external/libcxx/fuzzing/
Dfuzzing.cpp114 bool is_permutation(SVIter first1, SVIter last1, SVIter first2) in is_permutation() argument
121 for (; first1 != last1; ++first1, ++first2) in is_permutation()
142 bool is_permutation(Iter1 first1, Iter1 last1, Iter2 first2) in is_permutation() argument
150 for (; first1 != last1; ++first1, ++first2) in is_permutation()
341 static bool compare_unique(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2) in compare_unique() argument
343 assert(first1 != last1 && first2 != last2); in compare_unique()
348 while(first1 != last1 && first2 != last2) in compare_unique()
352 if (++first1 == last1) return false; in compare_unique()
359 if (first1 == last1 && first2 != last2) return false; in compare_unique()
362 while (first1 != last1) in compare_unique()
/external/libcxx/test/std/numerics/numeric.ops/transform.reduce/
Dtransform_reduce_iter_iter_iter_init.pass.cpp27 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) in test() argument
30 decltype(std::transform_reduce(first1, last1, first2, init))> ); in test()
31 assert(std::transform_reduce(first1, last1, first2, init) == x); in test()
Dtransform_reduce_iter_iter_init_bop_uop.pass.cpp45 test(Iter1 first1, Iter1 last1, T init, BOp bOp, UOp uOp, T x) in test() argument
48 decltype(std::transform_reduce(first1, last1, init, bOp, uOp))> ); in test()
49 assert(std::transform_reduce(first1, last1, init, bOp, uOp) == x); in test()
Dtransform_reduce_iter_iter_iter_init_op_op.pass.cpp29 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, Op1 op1, Op2 op2, T x) in test() argument
32 decltype(std::transform_reduce(first1, last1, first2, init, op1, op2))> ); in test()
33 assert(std::transform_reduce(first1, last1, first2, init, op1, op2) == x); in test()
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
Dilist.h602 iterator first1 = begin(), last1 = end();
604 while (first1 != last1 && first2 != last2)
612 if (first2 != last2) transfer(last1, right, first2, last2);
673 template<class InIt> void assign(InIt first1, InIt last1) {
675 for ( ; first1 != last1 && first2 != last2; ++first1, ++first2)
678 erase(first1, last1);
680 insert(last1, first2, last2);
/external/libcxx/test/std/numerics/numeric.ops/inner.product/
Dinner_product_comp.pass.cpp31 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) in test() argument
33 assert(std::inner_product(first1, last1, first2, init, in test()
Dinner_product.pass.cpp29 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) in test() argument
31 assert(std::inner_product(first1, last1, first2, init) == x); in test()
/external/llvm/test/Transforms/InstSimplify/
Dptr_diff.ll26 %last1 = getelementptr inbounds i8, i8* %first2, i32 48
27 %last2 = getelementptr inbounds i8, i8* %last1, i32 8
Dcompare.ll116 %last1 = getelementptr inbounds i8, i8* %first2, i32 48
117 %last2 = getelementptr inbounds i8, i8* %last1, i32 8
134 %last1 = getelementptr inbounds i8, i8* %ptr, i32 48
135 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6
149 %last1 = getelementptr inbounds i8, i8* %ptr, i32 48
150 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6
162 %last1 = getelementptr inbounds i8, i8* %ptr, i32 48
163 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6
/external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/InstSimplify/
Dptr_diff.ll26 %last1 = getelementptr inbounds i8, i8* %first2, i32 48
27 %last2 = getelementptr inbounds i8, i8* %last1, i32 8
Dcompare.ll127 %last1 = getelementptr inbounds i8, i8* %first2, i32 48
128 %last2 = getelementptr inbounds i8, i8* %last1, i32 8
145 %last1 = getelementptr inbounds i8, i8* %ptr, i32 48
146 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6
160 %last1 = getelementptr inbounds i8, i8* %ptr, i32 48
161 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6
173 %last1 = getelementptr inbounds i8, i8* %ptr, i32 48
174 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6
/external/libchrome/base/
Dvalue_iterators_unittest.cc23 InputIterator1 last1, in are_equal() argument
27 for (; first1 != last1 && first2 != last2; ++first1, ++first2) { in are_equal()
31 return first1 == last1 && first2 == last2; in are_equal()
/external/llvm/include/llvm/ADT/
Dilist.h713 template<class InIt> void assign(InIt first1, InIt last1) {
715 for ( ; first1 != last1 && first2 != last2; ++first1, ++first2)
718 erase(first1, last1);
720 insert(last1, first2, last2);
/external/jdiff/src/jdiff/
DDiff.java195 int last1 = hunk.line1 + hunk.inserted - 1; in addDiffs() local
204 System.out.println("last1: " + last1); in addDiffs()
240 for (int i = first1; i <= last1; i++) { in addDiffs()
/external/libcxx/include/
Dnumeric42 inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init);
46 inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
52 transform_reduce(InputIterator1 first1, InputIterator1 last1,
57 transform_reduce(InputIterator1 first1, InputIterator1 last1,
Dalgorithm56 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
61 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
66 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
71 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
92 mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
96 mismatch(InputIterator1 first1, InputIterator1 last1,
101 mismatch(InputIterator1 first1, InputIterator1 last1,
106 mismatch(InputIterator1 first1, InputIterator1 last1,
112 equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
116 equal(InputIterator1 first1, InputIterator1 last1,
[all …]
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/
DTensorReductionCuda.h498 const half last1 = input.m_impl.coeff(row * num_coeffs_to_reduce + col);
499 const half2 val1 = __halves2half2(last1, reducer.initialize());