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

remove debug output

Browse Source
This commit is contained in:
Dennis Luxen 2014-03-21 18:27:39 +01:00
parent 87f036e538
commit 9cc49f6ff3
3 changed files with 4 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
DataStructures/StaticGraph.h
View File

@ -101,12 +101,6 @@ public:
_nodes.swap(nodes);
_edges.swap(edges);
for(unsigned i = 0; i < _numNodes; ++i)
{
SimpleLogger().Write(logDEBUG) << "edges of " << i << ": [" << BeginEdges(i) << "," << EndEdges(i) << ")";
}
#ifndef NDEBUG
Percent p(GetNumberOfNodes());
for(unsigned u = 0; u < GetNumberOfNodes(); ++u) {
@ -135,10 +129,6 @@ public:
}
p.printIncrement();
}
for(unsigned i = 0; i < _numNodes; ++i)
{
SimpleLogger().Write(logDEBUG) << "edges of " << i << ": [" << BeginEdges(i) << "," << EndEdges(i) << ")";
}
#endif
}

8
Server/DataStructures/InternalDataFacade.h
View File

@ -173,9 +173,9 @@ private:
sizeof(OriginalEdgeData)
);
m_via_node_list[i] = current_edge_data.via_node;
if(current_edge_data.via_node == 0 && current_edge_data.compressed_geometry) {
SimpleLogger().Write() << "0 at index " << i;
}
// if(current_edge_data.via_node == 0 && current_edge_data.compressed_geometry) {
// SimpleLogger().Write() << "0 at index " << i;
// }
m_name_ID_list[i] = current_edge_data.name_id;
m_turn_instruction_list[i] = current_edge_data.turn_instruction;
@ -184,7 +184,7 @@ private:
++compressed;
}
}
SimpleLogger().Write(logDEBUG) << "compressed: " << compressed;
// SimpleLogger().Write(logDEBUG) << "compressed: " << compressed;
edges_input_stream.close();
}

9
Util/GraphLoader.h
View File

@ -463,15 +463,6 @@ unsigned readHSGRFromStream(
);
hsgr_input_stream.close();
for(unsigned i = 0; i < number_of_nodes; ++i)
{
SimpleLogger().Write(logDEBUG) << "node_list[" << i << "]=" << node_list[i].firstEdge;
}
for(unsigned i = 0; i < number_of_edges; ++i)
{
SimpleLogger().Write(logDEBUG) << "edge_list[" << i << "]=(*," << edge_list[i].target << "), w: " << edge_list[i].data.distance;
}
return number_of_nodes;
}