/external/chromium_org/ui/message_center/views/ |
H A D | notification_view_unittest.cc | 76 std::vector<views::View*>::iterator last = current++; local 78 gfx::Point last_point = (*last)->bounds().origin(); 80 (*last), notification_view(), &last_point); 87 last = current++;
|
/external/deqp/framework/delibs/decpp/ |
H A 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) argument 110 for (ndx = 0; first != last; ++first, ++ndx) 126 T Random::choose (InputIter first, InputIter last) argument 129 DE_ASSERT(first != last); 130 choose(first, last, &val, 1); 135 T Random::chooseWeighted (InputIter first, InputIter last, WeightIte argument 166 shuffle(Iterator first, Iterator last) argument [all...] |
/external/dhcpcd/ |
H A D | eloop.c | 65 struct event *e, *last = NULL; local 74 last = e; 87 if (last) 88 last->next = e; 96 struct event *e, *last = NULL; local 100 if (last) 101 last->next = e->next; 108 last = e; 189 struct timeout *t, *tt, *last = NULL; local 203 if (last) 229 struct timeout *t, *tt, *last = NULL; local [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | res_gdt.c | 136 unsigned int grp, last = 0; local 180 if (!gdt_buf[last]) { 183 expect, grp, gdt_blk, last); 185 gdt_buf[last] = expect; 188 } else if (gdt_buf[last] != expect) { 191 gdt_buf[last], expect, gdt_blk, last); 196 last++;
|
/external/elfutils/0.153/libdwfl/ |
H A D | cu.c | 134 /* It might be in the last range. */ 135 const Dwarf_Arange *last local 137 if (addr > last->addr + last->length)
|
/external/fio/lib/ |
H A D | prio_tree.c | 47 *heap = node->last; 78 struct prio_tree_node *first = NULL, *prev, *last = NULL; local 93 last = first; 95 prev = last; 96 last = root->prio_tree_node; 98 INIT_PRIO_TREE_NODE(last); 99 prev->left = last; 100 last->parent = prev; 110 last = node; 113 last [all...] |
/external/freetype/src/base/ |
H A D | ftbbox.c | 39 FT_Vector last; member in struct:TBBox_Rec_ 53 /* in `user->last'; no further computations are necessary since we */ 69 user->last = *to; 162 BBox_Conic_Check( user->last.x, 169 BBox_Conic_Check( user->last.y, 175 user->last = *to; 367 BBox_Cubic_Check( user->last.x, 376 BBox_Cubic_Check( user->last.y, 383 user->last = *to;
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | EmptyContiguousSet.java | 41 @Override public C last() { method in class:EmptyContiguousSet
|
H A D | EmptyImmutableSortedSet.java | 100 public E last() { method in class:EmptyImmutableSortedSet
|
H A D | RegularImmutableSortedSet.java | 195 public E last() { method in class:RegularImmutableSortedSet
|
H A D | SortedMultisets.java | 68 @Override public E last() { method in class:SortedMultisets.ElementSet
|
H A D | StandardRowSortedTable.java | 91 public R last() { method in class:StandardRowSortedTable.RowKeySortedSet
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | EmptyContiguousSet.java | 39 @Override public C last() { method in class:EmptyContiguousSet
|
H A D | RegularContiguousSet.java | 68 final C last = last(); 72 return equalsOrThrow(previous, last) ? null : domain.next(previous); 89 @Override public C last() { method in class:RegularContiguousSet 94 long distance = domain.distance(first(), last()); 135 C upperEndpoint = Ordering.natural().min(this.last(), other.last()); 158 && this.last().equals(that.last());
|
/external/harfbuzz_ng/src/ |
H A D | gen-indic-table.py | 161 last = -100000 variable 168 if u <= last: 178 if start != last + 1: 179 if start - last <= 1+16*3: 180 print_block (None, last+1, start-1, data) 181 last = start-1 variable 183 if last >= 0: 184 ends.append (last + 1) 192 last = end variable 193 ends.append (last [all...] |
H A D | hb-ot-shape-complex-indic-machine.hh | 1538 if (0) fprintf (stderr, "syllable %d..%d %s\n", last, p+1, #syllable_type); \ 1539 for (unsigned int i = last; i < p+1; i++) \ 1541 last = p+1; \ 1567 unsigned int last = 0; local
|
H A D | hb-ot-shape-complex-myanmar-machine.hh | 273 if (0) fprintf (stderr, "syllable %d..%d %s\n", last, p+1, #syllable_type); \ 274 for (unsigned int i = last; i < p+1; i++) \ 276 last = p+1; \ 302 unsigned int last = 0; local
|
H A D | hb-ot-shape-complex-sea-machine.hh | 101 if (0) fprintf (stderr, "syllable %d..%d %s\n", last, p+1, #syllable_type); \ 102 for (unsigned int i = last; i < p+1; i++) \ 104 last = p+1; \ 130 unsigned int last = 0; local
|
H A D | hb-set.cc | 226 * @last: 235 hb_codepoint_t last) 237 set->add_range (first, last); 260 * @last: 269 hb_codepoint_t last) 271 set->del_range (first, last); 456 * @last: (inout): input current last and output last codepoint in the range. 459 * are greater than current value of @last 233 hb_set_add_range(hb_set_t *set, hb_codepoint_t first, hb_codepoint_t last) argument 267 hb_set_del_range(hb_set_t *set, hb_codepoint_t first, hb_codepoint_t last) argument 466 hb_set_next_range(const hb_set_t *set, hb_codepoint_t *first, hb_codepoint_t *last) argument [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | search.cpp | 217 int32_t SearchIterator::last(UErrorCode &status) function in class:SearchIterator
|
/external/iproute2/misc/ |
H A D | lnstat_util.c | 66 static int time_after(struct timeval *last, argument 70 if (now->tv_sec > last->tv_sec + tout->tv_sec) 73 if (now->tv_sec == last->tv_sec + tout->tv_sec) { 74 if (now->tv_usec > last->tv_usec + tout->tv_usec)
|
/external/iptables/extensions/ |
H A D | libxt_NFQUEUE.c | 35 " --queue-balance first:last Balance flows between queues <value> to <value>.\n"); 131 unsigned int last = tinfo->queues_total; local 133 if (last > 1) { 134 last += tinfo->queuenum - 1; 135 printf(" NFQUEUE balance %u:%u", tinfo->queuenum, last); 172 unsigned int last = tinfo->queues_total; local 174 if (last > 1) { 175 last += tinfo->queuenum - 1; 176 printf(" --queue-balance %u:%u", tinfo->queuenum, last);
|
/external/libopus/celt/tests/ |
H A D | test_unit_mathops.c | 101 opus_int32 min_d,max_d,last,chk; local 103 last=min_d=32767; 109 d = last - q; 112 last = q; 125 opus_int32 min_d,max_d,last,chk; local 127 last=min_d=15059; 135 d = last - q; 140 last = q;
|
/external/libsepol/src/ |
H A D | hashtab.c | 108 hashtab_ptr_t cur, last; local 114 last = NULL; 117 last = cur; 124 if (last == NULL) 127 last->next = cur->next; 254 hashtab_ptr_t last, cur, temp; local 260 last = NULL; 265 if (last) { 266 last->next = cur->next; 278 last [all...] |
H A D | sidtab.c | 90 sidtab_node_t *cur, *last; local 96 last = NULL; 99 last = cur; 106 if (last == NULL) 109 last->next = cur->next; 174 sidtab_node_t *last, *cur, *temp; local 180 last = NULL; 185 if (last) { 186 last->next = cur->next; 197 last [all...] |