Searched refs:SortedPos (Results 1 – 1 of 1) sorted by relevance
9378 allnodes_iterator SortedPos = allnodes_begin(); in AssignTopologicalOrder() local9395 if (Q != SortedPos) in AssignTopologicalOrder()9396 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()9397 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()9398 ++SortedPos; in AssignTopologicalOrder()9419 if (P->getIterator() != SortedPos) in AssignTopologicalOrder()9420 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()9421 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()9422 ++SortedPos; in AssignTopologicalOrder()9428 if (Node.getIterator() == SortedPos) { in AssignTopologicalOrder()[all …]