| /external/libcxx/fuzzing/ |
| D | fuzzing.cpp | 114 bool is_permutation(SVIter first1, SVIter last1, SVIter first2) in is_permutation() argument
121 for (; first1 != last1; ++first1, ++first2) in is_permutation()
123 xBuckets [first1->key]++; in is_permutation()
124 xPayloads[first1->key] += first1->payload; 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()
152 xBuckets [*first1]++; in is_permutation()
328 static bool compare_unique(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2) in compare_unique() argument
330 assert(first1 != last1 && first2 != last2); in compare_unique()
331 if (*first1 != *first2) return false; in compare_unique()
[all …]
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | ilist.h | 602 iterator first1 = begin(), last1 = end();
604 while (first1 != last1 && first2 != last2)
605 if (pred(*first2, *first1)) {
607 transfer(first1, right, first2, ++next);
610 ++first1;
673 template<class InIt> void assign(InIt first1, InIt last1) {
675 for ( ; first1 != last1 && first2 != last2; ++first1, ++first2)
676 *first1 = *first2;
678 erase(first1, last1);
|
| /external/libcxx/test/std/numerics/numeric.ops/transform.reduce/ |
| D | transform_reduce_iter_iter_iter_init.pass.cpp | 27 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()
|
| D | transform_reduce_iter_iter_init_bop_uop.pass.cpp | 45 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()
|
| D | transform_reduce_iter_iter_iter_init_op_op.pass.cpp | 29 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/libcxx/test/std/numerics/numeric.ops/inner.product/ |
| D | inner_product.pass.cpp | 29 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()
|
| D | inner_product_comp.pass.cpp | 31 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()
|
| /external/jdiff/src/jdiff/ |
| D | Diff.java | 136 int first1 = hunk.line1; // Index of first inserted word in mergeDiffs() local
139 newDocWords[first1 - 1].compareTo(" ") == 0 && in mergeDiffs()
141 first1 == lasthunk.line1 + lasthunk.inserted + 1) { in mergeDiffs()
193 int first1 = hunk.line1; // Index of first inserted word in addDiffs() local
203 System.out.println("first1: " + first1); in addDiffs()
240 for (int i = first1; i <= last1; i++) { in addDiffs()
|
| /external/testng/src/test/java/test/classgroup/ |
| D | First.java | 11 public void first1() { in first1() method in First
|
| /external/llvm/include/llvm/ADT/ |
| D | ilist.h | 713 template<class InIt> void assign(InIt first1, InIt last1) {
715 for ( ; first1 != last1 && first2 != last2; ++first1, ++first2)
716 *first1 = *first2;
718 erase(first1, last1);
|
| /external/llvm/test/Transforms/InstSimplify/ |
| D | ptr_diff.ll | 22 %first1 = getelementptr inbounds i8, i8* %ptr, i32 0
23 %first2 = getelementptr inbounds i8, i8* %first1, i32 1
|
| D | compare.ll | 112 %first1 = getelementptr inbounds i8, i8* %ptr, i32 0
113 %first2 = getelementptr inbounds i8, i8* %first1, i32 1
132 %first1 = getelementptr inbounds i8, i8* %ptr, i32 -2
133 %first2 = getelementptr inbounds i8, i8* %first1, i32 44
148 %first1 = getelementptr inbounds i8, i8* %ptr, i32 -2
151 %cmp = icmp ult i8* %first1, %last2
161 %first1 = getelementptr inbounds i8, i8* %ptr, i32 -2
164 %cmp = icmp slt i8* %first1, %last2
|
| /external/libcxx/include/ |
| D | numeric | 42 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,
|
| D | algorithm | 56 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/e2fsprogs/lib/et/ |
| D | texinfo.tex | 1418 \else\ifx\first1\adn1 \else\ifx\first2\adn2 \else\ifx\first3\adn3
|
| /external/e2fsprogs/doc/ |
| D | texinfo.tex | 1418 \else\ifx\first1\adn1 \else\ifx\first2\adn2 \else\ifx\first3\adn3
|
| /external/python/cpython3/Modules/_ctypes/libffi/ |
| D | texinfo.tex | 1414 \else\ifx\first1\adn1 \else\ifx\first2\adn2 \else\ifx\first3\adn3
|
| /external/python/cpython2/Modules/_ctypes/libffi/ |
| D | texinfo.tex | 1414 \else\ifx\first1\adn1 \else\ifx\first2\adn2 \else\ifx\first3\adn3
|
| /external/libffi/ |
| D | texinfo.tex | 1414 \else\ifx\first1\adn1 \else\ifx\first2\adn2 \else\ifx\first3\adn3
|
| /external/libmicrohttpd/doc/ |
| D | texinfo.tex | 1414 \else\ifx\first1\adn1 \else\ifx\first2\adn2 \else\ifx\first3\adn3
|