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

Use iterator pair taking parallel_sort, old TBB versions have no range overload.

Browse Source
This commit is contained in:
Daniel J. Hofmann 2015-09-10 11:04:50 +02:00
parent f10fb77a81
commit 4fa9022932
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
contractor/processing_chain.cpp
View File

@ -230,7 +230,7 @@ std::size_t Prepare::WriteContractedGraph(unsigned max_node_id,
const unsigned crc32_value = CalculateEdgeChecksum(node_based_edge_list); const unsigned crc32_value = CalculateEdgeChecksum(node_based_edge_list);
// Sorting contracted edges in a way that the static query graph can read some in in-place. // Sorting contracted edges in a way that the static query graph can read some in in-place.
tbb::parallel_sort(contracted_edge_list); tbb::parallel_sort(contracted_edge_list.begin(), contracted_edge_list.end());
const unsigned contracted_edge_count = contracted_edge_list.size(); const unsigned contracted_edge_count = contracted_edge_list.size();
SimpleLogger().Write() << "Serializing compacted graph of " << contracted_edge_count SimpleLogger().Write() << "Serializing compacted graph of " << contracted_edge_count
<< " edges"; << " edges";