Searched refs:SortedPos (Results 1 – 1 of 1) sorted by relevance
11714 allnodes_iterator SortedPos = allnodes_begin(); in AssignTopologicalOrder() local11730 if (Q != SortedPos) in AssignTopologicalOrder()11731 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()11732 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()11733 ++SortedPos; in AssignTopologicalOrder()11754 if (P->getIterator() != SortedPos) in AssignTopologicalOrder()11755 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()11756 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()11757 ++SortedPos; in AssignTopologicalOrder()11763 if (Node.getIterator() == SortedPos) { in AssignTopologicalOrder()[all …]