| /external/libdivsufsort/lib/ |
| D | trsort.c | 79 tr_insertionsort(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_insertionsort()
101 saidx_t c, d, e; in tr_fixdown() local
167 tr_pivot(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_pivot()
223 saidx_t *first, saidx_t *middle, saidx_t *last, in tr_partition()
225 saidx_t *a, *b, *c, *d, *e, *f; in tr_partition() local
265 saidx_t *first, saidx_t *a, saidx_t *b, saidx_t *last, in tr_copy()
269 saidx_t *c, *d, *e; in tr_copy() local
290 saidx_t *first, saidx_t *a, saidx_t *b, saidx_t *last, in tr_partialcopy()
292 saidx_t *c, *d, *e; in tr_partialcopy() local
328 saidx_t *SA, saidx_t *first, saidx_t *last, in tr_introsort()
[all …]
|
| D | sssort.c | 109 saidx_t y, e; in ss_isqrt() local
168 saidx_t *first, saidx_t *last, saidx_t depth) { in ss_insertionsort()
196 saint_t c, d, e; in ss_fixdown() local
263 ss_pivot(const sauchar_t *Td, const saidx_t *PA, saidx_t *first, saidx_t *last) { in ss_pivot()
292 saidx_t *first, saidx_t *last, saidx_t depth) { in ss_partition()
311 saidx_t *first, saidx_t *last, in ss_mintrosort()
316 saidx_t *a, *b, *c, *d, *e, *f; in ss_mintrosort() local
461 ss_rotate(saidx_t *first, saidx_t *middle, saidx_t *last) { in ss_rotate()
503 saidx_t *first, saidx_t *middle, saidx_t *last, in ss_inplacemerge()
546 saidx_t *first, saidx_t *middle, saidx_t *last, in ss_mergeforward()
[all …]
|
| /external/libcxx/test/std/containers/sequences/vector/vector.cons/ |
| D | construct_iter_iter.pass.cpp | 26 test(Iterator first, Iterator last) in test()
32 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) in test() local
|
| D | construct_iter_iter_alloc.pass.cpp | 27 test(Iterator first, Iterator last, const A& a) in test()
33 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) in test() local
|
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| D | construct_iter_iter.pass.cpp | 25 test(Iterator first, Iterator last) in test()
30 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) in test() local
|
| D | construct_iter_iter_alloc.pass.cpp | 26 test(Iterator first, Iterator last, const typename C::allocator_type& a) in test()
31 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) in test() local
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| D | binary_search.pass.cpp | 27 test(Iter first, Iter last, const T& value, bool x) in test()
56 for (int* e = d; e <= d+4; ++e) in main() local
|
| D | binary_search_comp.pass.cpp | 28 test(Iter first, Iter last, const T& value, bool x) in test()
57 for (int* e = d; e <= d+4; ++e) in main() local
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
| D | lower_bound.pass.cpp | 26 test(Iter first, Iter last, const T& value) in test()
57 for (int* e = d; e <= d+4; ++e) in main() local
|
| D | lower_bound_comp.pass.cpp | 27 test(Iter first, Iter last, const T& value) in test()
58 for (int* e = d; e <= d+4; ++e) in main() local
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| D | upper_bound.pass.cpp | 26 test(Iter first, Iter last, const T& value) in test()
57 for (int* e = d; e <= d+4; ++e) in main() local
|
| D | upper_bound_comp.pass.cpp | 27 test(Iter first, Iter last, const T& value) in test()
58 for (int* e = d; e <= d+4; ++e) in main() local
|
| /external/libvorbis/lib/ |
| D | envelope.c | 32 void _ve_envelope_init(envelope_lookup *e,vorbis_info *vi){ in _ve_envelope_init()
76 void _ve_envelope_clear(envelope_lookup *e){ in _ve_envelope_clear()
224 int last=v->pcm_current/ve->searchstep-VE_WIN; in _ve_envelope_search() local
348 long last=endW/ve->searchstep; in _ve_envelope_mark() local
356 void _ve_envelope_shift(envelope_lookup *e,long shift){ in _ve_envelope_shift()
|
| /external/libevent/ |
| D | minheap-internal.h | 66 void min_heap_elem_init(struct event* e) { e->ev_timeout_pos.min_heap_idx = -1; } in min_heap_elem_init()
71 int min_heap_push(min_heap_t* s, struct event* e) in min_heap_push()
83 struct event* e = *s->p; in min_heap_pop() local
91 int min_heap_elt_is_top(const struct event *e) in min_heap_elt_is_top()
96 int min_heap_erase(min_heap_t* s, struct event* e) in min_heap_erase()
100 struct event *last = s->p[--s->n]; in min_heap_erase() local
133 void min_heap_shift_up_(min_heap_t* s, unsigned hole_index, struct event* e) in min_heap_shift_up_()
145 void min_heap_shift_down_(min_heap_t* s, unsigned hole_index, struct event* e) in min_heap_shift_down_()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| D | equal_range.pass.cpp | 27 test(Iter first, Iter last, const T& value) in test()
62 for (int* e = d; e <= d+4; ++e) in main() local
|
| D | equal_range_comp.pass.cpp | 28 test(Iter first, Iter last, const T& value) in test()
63 for (int* e = d; e <= d+4; ++e) in main() local
|
| /external/selinux/checkpolicy/ |
| D | queue.c | 26 int queue_insert(queue_t q, queue_element_t e) in queue_insert()
50 int queue_push(queue_t q, queue_element_t e) in queue_push()
77 queue_element_t e; in queue_remove() local
147 queue_node_ptr_t p, last, temp; in queue_map_remove_on_error() local
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | SortedMultisets.java | 80 @Override public E last() { in last() method in SortedMultisets.ElementSet
95 public E lower(E e) { in lower()
100 public E floor(E e) { in floor()
105 public E ceiling(E e) { in ceiling()
110 public E higher(E e) { in higher()
|
| /external/autotest/client/profilers/cpistat/ |
| D | cpistat | 55 last = {} variable
67 e = events[i] variable
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | SynchronizedNavigableSetTest.java | 66 @Override public E ceiling(E e) { in ceiling()
80 @Override public E floor(E e) { in floor()
94 @Override public E higher(E e) { in higher()
99 @Override public E lower(E e) { in lower()
143 @Override public E last() { in last() method in SynchronizedNavigableSetTest.TestSet
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| D | SafeTreeSet.java | 77 @Override public E ceiling(E e) { in ceiling()
114 @Override public E floor(E e) { in floor()
127 @Override public E higher(E e) { in higher()
139 @Override public E last() { in last() method in SafeTreeSet
143 @Override public E lower(E e) { in lower()
201 E e = (E) t; in checkValid() local
|
| /external/libcxxabi/src/ |
| D | cxa_demangle.cpp | 106 print_state(const char* msg, const char* first, const char* last, const C& db) in print_state()
118 parse_number(const char* first, const char* last) in parse_number()
184 parse_floating_number(const char* first, const char* last, C& db) in parse_floating_number()
196 char* e = buf; in parse_floating_number() local
228 parse_source_name(const char* first, const char* last, C& db) in parse_source_name()
270 parse_substitution(const char* first, const char* last, C& db) in parse_substitution()
378 parse_builtin_type(const char* first, const char* last, C& db) in parse_builtin_type()
527 parse_cv_qualifiers(const char* first, const char* last, unsigned& cv) in parse_cv_qualifiers()
556 parse_template_param(const char* first, const char* last, C& db) in parse_template_param()
613 parse_const_cast_expr(const char* first, const char* last, C& db) in parse_const_cast_expr()
[all …]
|
| /external/volley/src/main/java/com/android/volley/ |
| D | VolleyLog.java | 63 public static void e(String format, Object... args) { in e() method in VolleyLog
67 public static void e(Throwable tr, String format, Object... args) { in e() method in VolleyLog
177 long last = mMarkers.get(mMarkers.size() - 1).time; in getTotalDuration() local
|
| /external/syslinux/com32/lua/src/ |
| D | ltablib.c | 42 int e = aux_getn(L, 1) + 1; /* first empty element */ in tinsert() local
96 int i, last; in tconcat() local
137 int i, e, n; in unpack() local
|
| /external/skia/third_party/lua/src/ |
| D | ltablib.c | 42 int e = aux_getn(L, 1) + 1; /* first empty element */ in tinsert() local
96 int i, last; in tconcat() local
137 int i, e, n; in unpack() local
|