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

use range based for w/ integer ranges where possible

Browse Source
This commit is contained in:
Dennis Luxen 2014-07-04 17:23:45 +02:00
parent 72d709ae6c
commit e17a2e79a0
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
DataStructures/StaticGraph.h
View File

@ -90,7 +90,7 @@ template <typename EdgeDataT, bool UseSharedMemory = false> class StaticGraph
node_array.resize(number_of_nodes + 1); node_array.resize(number_of_nodes + 1);
EdgeIterator edge = 0; EdgeIterator edge = 0;
EdgeIterator position = 0; EdgeIterator position = 0;
for (NodeIterator node = 0; node <= number_of_nodes; ++node) for (const auto node : boost::irange(0u, number_of_nodes+1))
{ {
EdgeIterator last_edge = edge; EdgeIterator last_edge = edge;
while (edge < number_of_edges && graph[edge].source == node) while (edge < number_of_edges && graph[edge].source == node)
@ -102,7 +102,7 @@ template <typename EdgeDataT, bool UseSharedMemory = false> class StaticGraph
} }
edge_array.resize(position); //(edge) edge_array.resize(position); //(edge)
edge = 0; edge = 0;
for (NodeIterator node = 0; node < number_of_nodes; ++node) for (const auto node : boost::irange(0u, number_of_nodes))
{ {
EdgeIterator e = node_array[node + 1].first_edge; EdgeIterator e = node_array[node + 1].first_edge;
for (EdgeIterator i = node_array[node].first_edge; i != e; ++i) for (EdgeIterator i = node_array[node].first_edge; i != e; ++i)
@ -126,7 +126,7 @@ template <typename EdgeDataT, bool UseSharedMemory = false> class StaticGraph
#ifndef NDEBUG #ifndef NDEBUG
Percent p(GetNumberOfNodes()); Percent p(GetNumberOfNodes());
for (unsigned u = 0; u < GetNumberOfNodes(); ++u) for (const auto u : boost::irange(0u, GetNumberOfEdges()))
{ {
for (auto eid : GetAdjacentEdgeRange(u)) for (auto eid : GetAdjacentEdgeRange(u))
{ {