| /external/libcxxabi/src/ |
| D | cxa_demangle.cpp | 37 const char* parse_type(const char* first, const char* last, C& db);
39 const char* parse_encoding(const char* first, const char* last, C& db);
41 const char* parse_name(const char* first, const char* last, C& db,
44 const char* parse_expression(const char* first, const char* last, C& db);
46 const char* parse_template_args(const char* first, const char* last, C& db);
48 const char* parse_operator_name(const char* first, const char* last, C& db);
50 const char* parse_unqualified_name(const char* first, const char* last, C& db);
52 const char* parse_decltype(const char* first, const char* last, C& db);
97 print_state(const char* msg, const char* first, const char* last, const C& db) in print_state() argument
100 for (; first != last; ++first) in print_state()
[all …]
|
| /external/libdivsufsort/lib/ |
| D | trsort.c | 79 tr_insertionsort(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_insertionsort() argument
83 for(a = first + 1; a < last; ++a) { in tr_insertionsort()
167 tr_pivot(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_pivot() argument
171 t = last - first; in tr_pivot()
176 return tr_median3(ISAd, first, middle, last - 1); in tr_pivot()
179 return tr_median5(ISAd, first, first + t, middle, last - 1 - t, last - 1); in tr_pivot()
185 last = tr_median3(ISAd, last - 1 - (t << 1), last - 1 - t, last - 1); in tr_pivot()
186 return tr_median3(ISAd, first, middle, last); in tr_pivot()
223 saidx_t *first, saidx_t *middle, saidx_t *last, in tr_partition() argument
229 for(b = middle - 1; (++b < last) && ((x = ISAd[*b]) == v);) { } in tr_partition()
[all …]
|
| D | sssort.c | 168 saidx_t *first, saidx_t *last, saidx_t depth) { in ss_insertionsort() argument
173 for(i = last - 2; first <= i; --i) { in ss_insertionsort()
175 do { *(j - 1) = *j; } while((++j < last) && (*j < 0)); in ss_insertionsort()
176 if(last <= j) { break; } in ss_insertionsort()
263 ss_pivot(const sauchar_t *Td, const saidx_t *PA, saidx_t *first, saidx_t *last) { in ss_pivot() argument
267 t = last - first; in ss_pivot()
272 return ss_median3(Td, PA, first, middle, last - 1); in ss_pivot()
275 return ss_median5(Td, PA, first, first + t, middle, last - 1 - t, last - 1); in ss_pivot()
281 last = ss_median3(Td, PA, last - 1 - (t << 1), last - 1 - t, last - 1); in ss_pivot()
282 return ss_median3(Td, PA, first, middle, last); in ss_pivot()
[all …]
|
| /external/skia/src/core/ |
| D | SkDeque.cpp | 118 Block* last = fBackBlock; in push_back() local
121 if (nullptr == last->fBegin) { in push_back()
123 last->fBegin = last->start(); in push_back()
124 end = last->fBegin + fElemSize; in push_back()
126 end = last->fEnd + fElemSize; in push_back()
127 if (end > last->fStop) { // no more room in this chunk in push_back()
129 last = this->allocateBlock(fAllocCount); in push_back()
130 last->fPrev = fBackBlock; in push_back()
131 fBackBlock->fNext = last; in push_back()
132 fBackBlock = last; in push_back()
[all …]
|
| D | SkEdgeBuilder.cpp | 25 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) { in CombineVertical() argument
26 if (last->fCurveCount || last->fDX || edge->fX != last->fX) { in CombineVertical()
29 if (edge->fWinding == last->fWinding) { in CombineVertical()
30 if (edge->fLastY + 1 == last->fFirstY) { in CombineVertical()
31 last->fFirstY = edge->fFirstY; in CombineVertical()
34 if (edge->fFirstY == last->fLastY + 1) { in CombineVertical()
35 last->fLastY = edge->fLastY; in CombineVertical()
40 if (edge->fFirstY == last->fFirstY) { in CombineVertical()
41 if (edge->fLastY == last->fLastY) { in CombineVertical()
44 if (edge->fLastY < last->fLastY) { in CombineVertical()
[all …]
|
| /external/webrtc/webrtc/system_wrappers/source/spreadsortlib/ |
| D | spreadsort.hpp | 65 …find_extremes(RandomAccessIter current, RandomAccessIter last, RandomAccessIter & max, RandomAcces… in find_extremes() argument
69 while(++current < last) { in find_extremes()
80 …find_extremes(RandomAccessIter current, RandomAccessIter last, RandomAccessIter & max, RandomAcces… in find_extremes() argument
83 while(++current < last) { in find_extremes()
130 …spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_… in spread_sort_rec() argument
136 find_extremes(first, last, max, min); in spread_sort_rec()
141 …unsigned log_divisor = get_log_divisor(last - first, rough_log_2_size((size_t)(*max >> 0) - (*min … in spread_sort_rec()
149 for (RandomAccessIter current = first; current != last;) in spread_sort_rec()
185 bins[bin_count - 1] = last; in spread_sort_rec()
192 size_t max_count = get_max_count(log_divisor, last - first); in spread_sort_rec()
[all …]
|
| /external/google-breakpad/src/common/linux/ |
| D | linux_libc_support_unittest.cc | 171 const char* last; in TEST() local
173 last = my_read_hex_ptr(&result, ""); in TEST()
175 ASSERT_EQ(*last, 0); in TEST()
177 last = my_read_hex_ptr(&result, "0"); in TEST()
179 ASSERT_EQ(*last, 0); in TEST()
181 last = my_read_hex_ptr(&result, "0123"); in TEST()
183 ASSERT_EQ(*last, 0); in TEST()
185 last = my_read_hex_ptr(&result, "0123a"); in TEST()
187 ASSERT_EQ(*last, 0); in TEST()
189 last = my_read_hex_ptr(&result, "0123a-"); in TEST()
[all …]
|
| /external/v8/test/mjsunit/ |
| D | cyrillic.js | 36 last: "\u044f", // ya property
51 last: "\u03c9", // omega property
71 var last = lc ? chars.last : chars.LAST; variable
74 var last_other_case = lc ? chars.LAST : chars.last;
76 assertTrue(Range(first, last).test(first), 1);
77 assertTrue(Range(first, last).test(middle), 2);
78 assertTrue(Range(first, last).test(last), 3);
80 assertFalse(Range(first, last).test(first_other_case), 4);
81 assertFalse(Range(first, last).test(middle_other_case), 5);
82 assertFalse(Range(first, last).test(last_other_case), 6);
[all …]
|
| /external/jetty/src/java/org/eclipse/jetty/server/ |
| D | InclusiveByteRange.java | 55 long last = 0; field in InclusiveByteRange
57 public InclusiveByteRange(long first, long last) in InclusiveByteRange() argument
60 this.last = last; in InclusiveByteRange()
70 return last; in getLast()
102 long last = -1; in satisfiableRanges() local
114 last = Long.parseLong(t.substring(d + 1).trim()); in satisfiableRanges()
124 last = Long.parseLong(t.substring(d + 1).trim()); in satisfiableRanges()
129 if (first == -1 && last == -1) in satisfiableRanges()
132 if (first != -1 && last != -1 && (first > last)) in satisfiableRanges()
137 InclusiveByteRange range = new InclusiveByteRange(first,last); in satisfiableRanges()
[all …]
|
| /external/deqp/framework/delibs/decpp/ |
| D | deRandom.hpp | 58 void choose (InputIter first, InputIter last, OutputIter result, int numItems);
61 T choose (InputIter first, InputIter last);
65 T chooseWeighted (InputIter first, InputIter last, WeightIter weight);
68 void shuffle (Iterator first, Iterator last);
103 void Random::choose (InputIter first, InputIter last, OutputIter result, int numItems) in choose() argument
110 for (ndx = 0; first != last; ++first, ++ndx) in choose()
126 T Random::choose (InputIter first, InputIter last) in choose() argument
129 DE_ASSERT(first != last); in choose()
130 choose(first, last, &val, 1); in choose()
135 T Random::chooseWeighted (InputIter first, InputIter last, WeightIter weight) in chooseWeighted() argument
[all …]
|
| /external/opencv/cv/src/ |
| D | _cvkdtree.hpp | 84 int dimension_of_highest_variance(__instype * first, __instype * last, in dimension_of_highest_variance() argument
86 assert(last - first > 0); in dimension_of_highest_variance()
92 for (__instype * k = first; k < last; ++k) in dimension_of_highest_variance()
94 mean /= last - first; in dimension_of_highest_variance()
96 for (__instype * k = first; k < last; ++k) { in dimension_of_highest_variance()
100 var /= last - first; in dimension_of_highest_variance()
117 __instype * median_partition(__instype * first, __instype * last, in median_partition() argument
119 assert(last - first > 0); in median_partition()
120 __instype *k = first + (last - first) / 2; in median_partition()
121 median_partition(first, last, k, dim, ctor); in median_partition()
[all …]
|
| /external/opencv3/3rdparty/openexr/IlmImf/ |
| D | ImfChannelList.cpp | 237 Iterator &last) in channelsInLayer() argument
239 channelsWithPrefix (layerName + '.', first, last); in channelsInLayer()
246 ConstIterator &last) const in channelsInLayer()
248 channelsWithPrefix (layerName + '.', first, last); in channelsInLayer()
255 Iterator &last) in channelsWithPrefix() argument
257 first = last = _map.lower_bound (prefix); in channelsWithPrefix()
260 while (last != Iterator (_map.end()) && in channelsWithPrefix()
261 strncmp (last.name(), prefix, n) <= 0) in channelsWithPrefix()
263 ++last; in channelsWithPrefix()
271 ConstIterator &last) const in channelsWithPrefix()
[all …]
|
| /external/snakeyaml/src/test/resources/pyyaml/ |
| D | test_mark.marks | 3 The last line.
6 The last line.
9 The last line.
12 *The last line.
15 The last*line.
18 The last line.*
22 The last line.
26 The last line.
30 The last line.
|
| /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
| D | InsnList.java | 65 private AbstractInsnNode last; field in InsnList
99 return last; in getLast()
230 last = insn; in set()
264 if (last == null) { in add()
266 last = insn; in add()
268 last.next = insn; in add()
269 insn.prev = last; in add()
271 last = insn; in add()
291 if (last == null) { in add()
293 last = insns.last; in add()
[all …]
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/util/ |
| D | Visitor.java | 65 Object last = null; in doAt() local
72 doBetween(c, last, item); in doAt()
74 doAt(last=item); in doAt()
76 doAfter(c, last); in doAt()
87 Object last = null; in doAt() local
97 cpr = last == cpr0 ? cpr1 : cpr0; // make sure we don't override last in doAt()
106 doBetween(c, last, item); in doAt()
108 doAt(last = item); in doAt()
110 doAfter(c, last); in doAt()
115 Object last = null; in doAt() local
[all …]
|
| /external/llvm/bindings/python/llvm/ |
| D | object.py | 132 last = None
137 last = Section(sections)
139 last.cache()
141 yield last
144 last.expire()
146 if last is not None:
147 last.expire()
160 last = None
165 last = Symbol(symbols, self)
167 last.cache()
[all …]
|
| /external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/ |
| D | Visitor.java | 64 Object last = null; in doAt() local
71 doBetween(c, last, item); in doAt()
73 doAt(last=item); in doAt()
75 doAfter(c, last); in doAt()
86 Object last = null; in doAt() local
96 cpr = last == cpr0 ? cpr1 : cpr0; // make sure we don't override last in doAt()
105 doBetween(c, last, item); in doAt()
107 doAt(last = item); in doAt()
109 doAfter(c, last); in doAt()
114 Object last = null; in doAt() local
[all …]
|
| /external/parameter-framework/asio-1.10.6/include/asio/detail/ |
| D | hash_map.hpp | 107 iterator end_it = buckets_[bucket].last; in find()
128 const_iterator end_it = buckets_[bucket].last; in find()
149 buckets_[bucket].first = buckets_[bucket].last = in insert()
152 return std::pair<iterator, bool>(buckets_[bucket].last, true); in insert()
154 iterator end_it = buckets_[bucket].last; in insert()
162 buckets_[bucket].last = values_insert(end_it, v); in insert()
164 return std::pair<iterator, bool>(buckets_[bucket].last, true); in insert()
175 bool is_last = (it == buckets_[bucket].last); in erase()
177 buckets_[bucket].first = buckets_[bucket].last = values_.end(); in erase()
181 --buckets_[bucket].last; in erase()
[all …]
|
| /external/bison/examples/calc++/ |
| D | location.hh | 163 position last = loc.end - 1; in operator <<() local
165 if (last.filename in operator <<()
167 || *loc.begin.filename != *last.filename)) in operator <<()
168 ostr << '-' << last; in operator <<()
169 else if (loc.begin.line != last.line) in operator <<()
170 ostr << '-' << last.line << '.' << last.column; in operator <<()
171 else if (loc.begin.column != last.column) in operator <<()
172 ostr << '-' << last.column; in operator <<()
|
| /external/zlib/src/examples/ |
| D | gun.c | 156 last = have ? (have--, (int)(*next++)) : -1)
203 int last; /* last byte read by NEXT(), or -1 if EOF */ in lunpipe() local
227 if (last == -1) in lunpipe()
251 final = prev = (unsigned)last; /* low 8 bits of code */ in lunpipe()
254 if (last & 1) { /* code must be < 256 */ in lunpipe()
258 rem = (unsigned)last >> 1; /* remaining 7 bits */ in lunpipe()
287 code += (unsigned)last << left; /* middle (or high) bits of code */ in lunpipe()
293 code += (unsigned)last << left; /* high bits of code */ in lunpipe()
299 rem = (unsigned)last >> (8 - left); /* unused bits from last byte */ in lunpipe()
385 int ret, first, last; in gunpipe() local
[all …]
|
| D | gzjoin.c | 284 int last; /* true if processing the last block */ in gzcopy() local
313 last = start[0] & 1; in gzcopy()
314 if (last && clr) in gzcopy()
343 if (last) in gzcopy()
353 last = strm.next_in[-1] & pos; in gzcopy()
354 if (last && clr) in gzcopy()
366 last = strm.next_in[0] & 1; in gzcopy()
367 if (last && clr) in gzcopy()
380 last = in->next[-1]; in gzcopy()
383 putc(last, out); in gzcopy()
[all …]
|
| /external/valgrind/coregrind/ |
| D | m_options.c | 337 HChar const* last = VG_(clo_trace_children_skip); in VG_() local
339 while (*last) { in VG_()
342 HChar const* first = consume_commas(last); in VG_()
343 last = consume_field(first); in VG_()
344 if (first == last) in VG_()
346 vg_assert(last > first); in VG_()
349 patt = VG_(calloc)("m_options.swttc.1", last - first + 1, 1); in VG_()
350 VG_(memcpy)(patt, first, last - first); in VG_()
351 vg_assert(patt[last-first] == 0); in VG_()
362 HChar const* last = VG_(clo_trace_children_skip_by_arg); in VG_() local
[all …]
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| D | util.rb | 154 range.exclude_end? ? last >= range.last : last > range.last
156 range.exclude_end? ? last.succ >= range.last : last >= range.last
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
| D | MultidimensionalCounter.java | 65 private final int last; field in MultidimensionalCounter
85 counter[last] = -1; in Iterator()
105 for (int i = last; i >= 0; i--) { in next()
170 last = dimension - 1; in MultidimensionalCounter()
171 int tS = size[last]; in MultidimensionalCounter()
172 for (int i = 0; i < last; i++) { in MultidimensionalCounter()
180 uniCounterOffset[last] = 0; in MultidimensionalCounter()
224 for (int i = 0; i < last; i++) { in getCounts()
242 indices[last] = idx; in getCounts()
271 return count + c[last]; in getCount()
|
| /external/pdfium/third_party/freetype/src/base/ |
| D | ftoutln.c | 89 FT_Int last; /* index of last point in contour */ in FT_Outline_Decompose() local
94 last = outline->contours[n]; in FT_Outline_Decompose()
95 if ( last < 0 ) in FT_Outline_Decompose()
97 limit = outline->points + last; in FT_Outline_Decompose()
103 v_last = outline->points[last]; in FT_Outline_Decompose()
121 if ( FT_CURVE_TAG( outline->tags[last] ) == FT_CURVE_TAG_ON ) in FT_Outline_Decompose()
283 first = (FT_UInt)last + 1; in FT_Outline_Decompose()
553 FT_Int first, last; in FT_Outline_Reverse() local
563 last = outline->contours[n]; in FT_Outline_Reverse()
568 FT_Vector* q = outline->points + last; in FT_Outline_Reverse()
[all …]
|