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

remove debug lint

Browse Source
This commit is contained in:
Dennis Luxen 2014-04-18 16:00:51 +02:00
parent 2435fadfbd
commit 09dc21af31
1 changed files with 31 additions and 64 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

47
prepare.cpp
View File

@ -269,10 +269,9 @@ int main (int argc, char *argv[]) {
delete edgeBasedGraphFactory;
double expansionHasFinishedTime = get_timestamp() - startupTime;
/***
* Building grid-like nearest-neighbor data structure
*/
// Building grid-like nearest-neighbor data structure
SimpleLogger().Write() << "building r-tree ...";
StaticRTree<EdgeBasedNode> * rtree =
new StaticRTree<EdgeBasedNode>(
@ -355,20 +354,17 @@ int main (int argc, char *argv[]) {
StaticGraph<EdgeData>::EdgeIterator position = 0;
StaticGraph<EdgeData>::EdgeIterator lastEdge = edge;
for ( StaticGraph<EdgeData>::NodeIterator node = 0; node < max_used_node_id; ++node ) {
for ( StaticGraph<EdgeData>::NodeIterator node = 0; node < max_used_node_id; ++node)
{
lastEdge = edge;
while ( edge < contracted_edge_count && contractedEdgeList[edge].source == node )
while ((edge < contracted_edge_count) && (contractedEdgeList[edge].source == node))
{
++edge;
}
node_array[node].firstEdge = position; //=edge
position += edge - lastEdge; //remove
// SimpleLogger().Write(logDEBUG) << "node: " << node << ", edge: " << edge << ", position: " << position << ", lastEdge: " << lastEdge;
}
// SimpleLogger().Write(logDEBUG) << "contracted_edge_count: " << contracted_edge_count << ", position: " << position << ", lastEdge: " << lastEdge;
// SimpleLogger().Write(logDEBUG) << "marking range [" << max_used_node_id << "," << node_array.size() << ") as dummies";
for (unsigned sentinel_counter = max_used_node_id;
sentinel_counter != node_array.size();
++sentinel_counter
@ -376,23 +372,9 @@ int main (int argc, char *argv[]) {
{
//sentinel element, guarded against underflow
node_array[sentinel_counter].firstEdge = contracted_edge_count;
// SimpleLogger().Write(logDEBUG) << "node_array[" << sentinel_counter << "].firstEdge = " << node_array[sentinel_counter].firstEdge;
}
// node_array.back().firstEdge = contracted_edge_count; //sentinel element
// ++max_used_node_id;
// BOOST_ASSERT_MSG(
// node_array.size() == max_used_node_id,
// "no. of nodes dont match"
// );
// for(unsigned i = 0; i < node_array.size(); ++i)
// {
// SimpleLogger().Write() << "node_array[" << i << "].firstEdge = " << node_array[i].firstEdge;
// }
unsigned node_array_size = node_array.size();
//serialize crc32, aka checksum
hsgr_output_stream.write((char*) &crc32OfNodeBasedEdgeList, sizeof(unsigned));
//serialize number of nodes
@ -407,17 +389,9 @@ int main (int argc, char *argv[]) {
edge = 0;
int usedEdgeCounter = 0;
for(unsigned edge = 0; edge < contractedEdgeList.size(); ++edge)
{
// SimpleLogger().Write(logDEBUG) << ">[" << edge << "] (" << contractedEdgeList[edge].source << "," << contractedEdgeList[edge].target << ")";
}
StaticGraph<EdgeData>::_StrEdge currentEdge;
for (unsigned edge = 0; edge < contractedEdgeList.size(); ++edge)
{
// for ( StaticGraph<EdgeData>::NodeIterator node = 0; node < max_used_node_id; ++node ) {
// for ( StaticGraph<EdgeData>::EdgeIterator i = node_array[node].firstEdge, e = node_array[node+1].firstEdge; i != e; ++i ) {
// BOOST_ASSERT(node == contractedEdgeList[edge].source)
// no eigen loops
BOOST_ASSERT(contractedEdgeList[edge].source != contractedEdgeList[edge].target);
currentEdge.target = contractedEdgeList[edge].target;
@ -436,14 +410,9 @@ int main (int argc, char *argv[]) {
"Failed at adjacency list of node " << contractedEdgeList[edge].source << "/" << node_array.size()-1;
return 1;
}
//Serialize edges
// SimpleLogger().Write(logDEBUG) << "edge[" << edge << "], (" << contractedEdgeList[edge].source << "," << currentEdge.target << "), w: " << currentEdge.data.distance <<
// "shortcut: " << (currentEdge.data.shortcut ? "y" : "n");
hsgr_output_stream.write((char*) &currentEdge, sizeof(StaticGraph<EdgeData>::_StrEdge));
// ++edge;
++usedEdgeCounter;
}
// }
hsgr_output_stream.close();
SimpleLogger().Write() << "Preprocessing : " <<
@ -456,7 +425,6 @@ int main (int argc, char *argv[]) {
(edgeBasedNodeNumber/contraction_duration) << " nodes/sec and " <<
usedEdgeCounter/contraction_duration << " edges/sec";
//cleanedEdgeList.clear();
node_array.clear();
SimpleLogger().Write() << "finished preprocessing";
} catch(boost::program_options::too_many_positional_options_error&) {
@ -466,9 +434,8 @@ int main (int argc, char *argv[]) {
SimpleLogger().Write(logWARNING) << e.what();
return 1;
} catch ( const std::exception &e ) {
SimpleLogger().Write(logWARNING) <<
"Exception occured: " << e.what() << std::endl;
return 1;
SimpleLogger().Write(logWARNING) << "Exception occured: " << e.what() << std::endl;
return -1;
}
return 0;
}