mirror of
https://github.com/verilator/verilator.git
synced 2026-10-06 10:03:44 +02:00
C++11: More range for. No functional change intended.
This commit is contained in:
+1
-4
@@ -505,10 +505,7 @@ void V3Graph::sortEdges() {
|
||||
// We know the vector contains all of the edges that were
|
||||
// there originally (didn't delete or add)
|
||||
vertexp->outUnlink();
|
||||
for (std::vector<V3GraphEdge*>::const_iterator it = edges.begin(); it != edges.end();
|
||||
++it) {
|
||||
(*it)->outPushBack();
|
||||
}
|
||||
for (V3GraphEdge* edgep : edges) edgep->outPushBack();
|
||||
// Prep for next
|
||||
edges.clear();
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user