Lines Matching refs:next
91 virtual void next() = 0;
106 // WARNING: do not use a->prev/next for __item or __list
110 (__item)->prev->next = (__item)->next; \
111 (__item)->next->prev = (__item)->prev; \
112 (__item)->next = (__item); \
118 (__item)->next = (__list); \
120 (__list)->prev->next = (__item); \
127 (__item)->next = (__list)->next; \
128 (__list)->next->prev = (__item); \
129 (__list)->next = (__item); \
135 (__listA)->prev->next = (__listB); \
136 (__listB)->prev->next = (__listA); \
141 #define DLLIST_EMPTY(__list) ((__list)->next == (__list))
144 for (DLList::Iterator it = (list)->iterator(); !(it).end(); (it).next())
152 Item(void *priv) : next(this), prev(this), data(priv) { }
155 Item *next;
170 item->next = head.next;
171 head.next->prev = item;
172 head.next = item;
191 Iterator(Item *head, bool r) : rev(r), pos(r ? head->prev : head->next),
194 virtual void next() { if (!end()) pos = rev ? pos->prev : pos->next; }
198 // caution: if you're at end-2 and erase it, then do next, you're at end
391 void next() { if (pos < size) { ++pos; nextValid(); } }
447 Range(int a, int b) : next(0), bgn(a), end(b) { }
449 Range *next;
457 while (next && end >= next->bgn) {
458 assert(bgn <= next->bgn);
459 rnn = next->next;
460 end = MAX2(end, next->end);
461 delete next;
462 next = rnn;
464 if (!next)
579 while (r->next)
580 r = r->next;