Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

Trim excess capacities

Browse Source
This commit is contained in:
DennisOSRM 2012-04-14 15:28:45 +02:00
parent 0555dc4bc3
commit 80219a31e2
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Contractor/Contractor.h
View File

@ -119,8 +119,9 @@ public:
edge.data.backward = currentEdge.isForward(); edge.data.backward = currentEdge.isForward();
edges.push_back( edge ); edges.push_back( edge );
} }
//remove data from memory //clear input vector and trim the current set of edges with the well-known swap trick
std::vector< InputEdge >().swap( inputEdges ); std::vector< InputEdge >().swap( inputEdges );
sort( edges.begin(), edges.end() ); sort( edges.begin(), edges.end() );
NodeID edge = 0; NodeID edge = 0;
for ( NodeID i = 0; i < edges.size(); ) { for ( NodeID i = 0; i < edges.size(); ) {
@ -170,7 +171,8 @@ public:
} }
std::cout << "ok" << "merged " << edges.size() - edge << " edges out of " << edges.size() << std::endl; std::cout << "ok" << "merged " << edges.size() - edge << " edges out of " << edges.size() << std::endl;
edges.resize( edge ); edges.resize( edge );
edges.swap(edges); std::vector<_ImportEdge>(edges).swap(edges);
_graph.reset( new _DynamicGraph( nodes, edges ) ); _graph.reset( new _DynamicGraph( nodes, edges ) );
std::vector< _ImportEdge >().swap( edges ); std::vector< _ImportEdge >().swap( edges );
// unsigned maxdegree = 0; // unsigned maxdegree = 0;