Searched refs:SortedPos (Results 1 – 1 of 1) sorted by relevance
6132 allnodes_iterator SortedPos = allnodes_begin(); in AssignTopologicalOrder() local6149 if (Q != SortedPos) in AssignTopologicalOrder()6150 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()6151 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()6152 ++SortedPos; in AssignTopologicalOrder()6175 if (P != SortedPos) in AssignTopologicalOrder()6176 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()6177 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()6178 ++SortedPos; in AssignTopologicalOrder()6184 if (I == SortedPos) { in AssignTopologicalOrder()[all …]