Lines Matching defs:DONE
54 int prevIndex; // Index into DONE for the previous ANode.
391 // position in the DONE vector. At completion, this order is written into
406 std::vector<ANode> DONE; // insertions/deletions at back,
449 Node.inf, DONE, BestNode.prevIndex);
458 // Point parent to last BestNode (pushed onto DONE)
459 Node.prevIndex = DONE.size() - 1;
466 DONE.push_back(BestNode);
511 // Push the BestNode onto DONE
512 DONE.push_back(BestNode);
515 DONE[BestNode.prevIndex].inf : NULL;
537 curr = DONE[curr.prevIndex])
561 curr = DONE[curr.prevIndex])
585 int currIndex = DONE.size() - 1;
587 curr = DONE[curr.prevIndex])
590 curr.inf->pathNext = DONE[curr.prevIndex].inf;
596 curr.inf->pathNext = DONE[curr.prevIndex].inf;
618 // this ANode through (the last BestNode pushed onto DONE).
619 Node.prevIndex = DONE.size() - 1;
628 DONE[BestNode.prevIndex].inf : NULL;
655 Node.inf, DONE, BestNode.prevIndex);
678 (DONE[Node.prevIndex].inf == DONE[ati.prevIndex].inf))
693 // Check to see if already on DONE
694 for (unsigned int i = 0; i < DONE.size(); i++)
696 ANode& ati = DONE.at(i);
698 (DONE[Node.prevIndex].inf == DONE[ati.prevIndex].inf))
700 // If on DONE, Which has lower gone?
703 DONE[i] = Node;
711 if (!bNodeFound ) // If Node NOT found on PENDING or DONE
720 // Display PENDING and DONE containers (For Debugging)
728 cout << "DONE: ";
729 for (unsigned int i = 0; i < DONE.size(); i++)
731 cout << DONE.at(i).g << "," << DONE.at(i).h << ",";
732 cout << DONE.at(i).inf << "," << DONE.at(i).pp << " ";