diff --git a/DataStructures/StaticGraph.h b/DataStructures/StaticGraph.h index 4665dd102..e3445c583 100644 --- a/DataStructures/StaticGraph.h +++ b/DataStructures/StaticGraph.h @@ -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 } diff --git a/Server/DataStructures/InternalDataFacade.h b/Server/DataStructures/InternalDataFacade.h index 11f26734d..d04d1dba9 100644 --- a/Server/DataStructures/InternalDataFacade.h +++ b/Server/DataStructures/InternalDataFacade.h @@ -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(); } diff --git a/Util/GraphLoader.h b/Util/GraphLoader.h index 41c6be4d7..dc8d73139 100644 --- a/Util/GraphLoader.h +++ b/Util/GraphLoader.h @@ -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; }