Searched refs:SortedPos (Results 1 – 1 of 1) sorted by relevance
10469 allnodes_iterator SortedPos = allnodes_begin(); in AssignTopologicalOrder() local10485 if (Q != SortedPos) in AssignTopologicalOrder()10486 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()10487 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()10488 ++SortedPos; in AssignTopologicalOrder()10509 if (P->getIterator() != SortedPos) in AssignTopologicalOrder()10510 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()10511 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()10512 ++SortedPos; in AssignTopologicalOrder()10518 if (Node.getIterator() == SortedPos) { in AssignTopologicalOrder()[all …]