Searched refs:curNode (Results 1 – 2 of 2) sorted by relevance
122 ReductionNode *curNode = smallestNode; in findOptimal() local123 trace.push_back(curNode); in findOptimal()124 while (curNode != root) { in findOptimal()125 curNode = curNode->getParent(); in findOptimal()126 trace.push_back(curNode); in findOptimal()
744 T &operator*() const { return curNode(); } in operator *()747 N = curNode().Previous; in operator ++()758 T &curNode() const { return W->Paths[*N]; } in curNode() function