Lines Matching defs:next
40 for (IteratorRef it = safeIteratorDFS(); !it->end(); it->next())
56 prev[0]->next[0] = next[0];
57 next[0]->prev[0] = prev[0];
59 origin->out = (next[0] == this) ? NULL : next[0];
64 prev[1]->next[1] = next[1];
65 next[1]->prev[1] = prev[1];
67 target->in = (next[1] == this) ? NULL : next[1];
101 edge->next[0] = this->out;
103 edge->prev[0]->next[0] = edge;
109 edge->next[1] = node->in;
111 edge->prev[1]->next[1] = edge;
132 for (; !ei.end(); ei.next())
164 next[0] = next[1] = this;
186 for (EdgeIterator ei = pos->outgoing(); !ei.end(); ei.next()) {
225 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next())
234 virtual void next() { if (pos < count) ++pos; }
265 for (IteratorRef it = graph->iteratorDFS(); !it->end(); it->next())
280 virtual void next() { if (pos < count) ++pos; }
300 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
352 for (IteratorRef it = iteratorDFS(true); !it->end(); it->next()) {
371 for (edge = curr->out; edge; edge = edge->next[0]) {
385 for (edge = curr->in; edge; edge = edge->next[1]) {
413 for (EdgeIterator ei = c->outgoing(); !ei.end(); ei.next()) {
423 Node *next = NULL;
426 if (!next || path[(*n)->tag] < path[next->tag])
427 next = *n;
434 c = next;