Searched refs:SortedPos (Results 1 – 1 of 1) sorted by relevance
10729 allnodes_iterator SortedPos = allnodes_begin(); in AssignTopologicalOrder() local10745 if (Q != SortedPos) in AssignTopologicalOrder()10746 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()10747 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()10748 ++SortedPos; in AssignTopologicalOrder()10769 if (P->getIterator() != SortedPos) in AssignTopologicalOrder()10770 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()10771 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()10772 ++SortedPos; in AssignTopologicalOrder()10778 if (Node.getIterator() == SortedPos) { in AssignTopologicalOrder()[all …]