| /external/stlport/src/ |
| D | num_get.cpp | 38 __valid_grouping(const char * first1, const char * last1, in __valid_grouping() argument
40 if (first1 == last1 || first2 == last2) return true; in __valid_grouping()
42 --last1; --last2; in __valid_grouping()
44 while (first1 != last1) { in __valid_grouping()
45 if (*last1 != *first2) in __valid_grouping()
47 --last1; in __valid_grouping()
51 return *last1 <= *first2; in __valid_grouping()
|
| /external/qemu/include/qemu/ |
| D | range.h | 57 uint64_t last1 = range_get_last(first1, len1); in ranges_overlap() local
60 return !(last2 < first1 || last1 < first2); in ranges_overlap()
|
| /external/libcxx/test/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/llvm/include/llvm/ADT/ |
| D | ilist.h | 620 iterator first1 = begin(), last1 = end();
622 while (first1 != last1 && first2 != last2)
630 if (first2 != last2) transfer(last1, right, first2, last2);
687 template<class InIt> void assign(InIt first1, InIt last1) {
689 for ( ; first1 != last1 && first2 != last2; ++first1, ++first2)
692 erase(first1, last1);
694 insert(last1, first2, last2);
|
| /external/llvm/test/Transforms/InstSimplify/ |
| D | ptr_diff.ll | 25 %last1 = getelementptr inbounds i8* %first2, i32 48
26 %last2 = getelementptr inbounds i8* %last1, i32 8
|
| D | compare.ll | 116 %last1 = getelementptr inbounds i8* %first2, i32 48
117 %last2 = getelementptr inbounds i8* %last1, i32 8
134 %last1 = getelementptr inbounds i8* %ptr, i32 48
135 %last2 = getelementptr inbounds i8* %last1, i32 -6
149 %last1 = getelementptr inbounds i8* %ptr, i32 48
150 %last2 = getelementptr inbounds i8* %last1, i32 -6
162 %last1 = getelementptr inbounds i8* %ptr, i32 48
163 %last2 = getelementptr inbounds i8* %last1, i32 -6
|
| /external/chromium_org/net/disk_cache/blockfile/ |
| D | eviction_v3.cc | 488 Rankings::ScopedRankingsBlock last1(rankings_, in ReportListStats() local
497 if (last1.get()) in ReportListStats()
499 Time::FromInternalValue(last1.get()->Data()->last_used)); in ReportListStats()
|
| D | eviction.cc | 579 Rankings::ScopedRankingsBlock last1(rankings_, in ReportListStats() local
588 if (last1.get()) in ReportListStats()
590 Time::FromInternalValue(last1.get()->Data()->last_used)); in ReportListStats()
|
| D | rankings.cc | 802 Addr last1, last2; in CheckList() local
804 int rv = CheckListSection(list, last1, last2, true, // Head to tail. in CheckList()
805 &last1, &last2, &head_items); in CheckList()
|
| /external/libcxx/include/ |
| D | numeric | 30 inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init);
34 inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
|
| D | algorithm | 52 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
57 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
62 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
67 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
88 mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
92 mismatch(InputIterator1 first1, InputIterator1 last1,
97 mismatch(InputIterator1 first1, InputIterator1 last1,
102 mismatch(InputIterator1 first1, InputIterator1 last1,
108 equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
112 equal(InputIterator1 first1, InputIterator1 last1,
[all …]
|
| /external/stlport/test/unit/ |
| D | codecvt_test.cpp | 465 const extern_type* last1, const extern_type*& next1, in do_in() argument
468 for ( next1 = first1, next2 = first2; next1 < last1; next1 += 2 ) { in do_in()
469 if ( (last1 - next1) < 2 || (last2 - next2) < 1 ) in do_in()
|
| /external/jdiff/src/jdiff/ |
| D | Diff.java | 195 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/chromium_org/third_party/icu/source/i18n/ |
| D | ucol.cpp | 1092 int32_t last1 = cp / final3Count; in uprv_uca_getImplicitFromRaw() local
1095 int32_t last2 = last1 / medialCount; in uprv_uca_getImplicitFromRaw()
1096 last1 %= medialCount; in uprv_uca_getImplicitFromRaw()
1099 last1 = minTrail + last1; // offset in uprv_uca_getImplicitFromRaw()
1106 return (last2 << 24) + (last1 << 16) + (last0 << 8); in uprv_uca_getImplicitFromRaw()
1108 int32_t last1 = last0 / final4Count; in uprv_uca_getImplicitFromRaw() local
1111 int32_t last2 = last1 / medialCount; in uprv_uca_getImplicitFromRaw()
1112 last1 %= medialCount; in uprv_uca_getImplicitFromRaw()
1118 last1 = minTrail + last1; // offset in uprv_uca_getImplicitFromRaw()
1126 return (last3 << 24) + (last2 << 16) + (last1 << 8) + last0; in uprv_uca_getImplicitFromRaw()
|