From e64e45015aa47bb449d1cf3348c850caa460670e Mon Sep 17 00:00:00 2001 From: DennisOSRM Date: Fri, 9 Dec 2011 17:43:50 +0100 Subject: [PATCH] Minor change: Removing dead code --- DataStructures/SearchEngine.h | 14 -------------- 1 file changed, 14 deletions(-) diff --git a/DataStructures/SearchEngine.h b/DataStructures/SearchEngine.h index 8331347fd..a1fbcb8bf 100644 --- a/DataStructures/SearchEngine.h +++ b/DataStructures/SearchEngine.h @@ -75,20 +75,6 @@ public: InitializeThreadLocalStorageIfNecessary(); NodeID middle = ( NodeID ) UINT_MAX; -/* bool stOnSameEdge = false; - //Handling the special case that origin and destination are on same edge and that the order is correct. - if(phantomNodes.PhantomsAreOnSameNodeBasedEdge()){ - if(phantomNodes.startPhantom.isBidirected() && phantomNodes.targetPhantom.isBidirected()) { - int weight = std::abs(phantomNodes.startPhantom.weight1 - phantomNodes.targetPhantom.weight1); - return weight; - } else if(phantomNodes.startPhantom.weight1 <= phantomNodes.targetPhantom.weight1){ - int weight = std::abs(phantomNodes.startPhantom.weight1 - phantomNodes.targetPhantom.weight1); - return weight; - } else { - stOnSameEdge = true; - } - } -*/ //insert start and/or target node of start edge _forwardHeap->Insert(phantomNodes.startPhantom.edgeBasedNode, -phantomNodes.startPhantom.weight1, phantomNodes.startPhantom.edgeBasedNode); // INFO("a) forw insert " << phantomNodes.startPhantom.edgeBasedNode << ", weight: " << -phantomNodes.startPhantom.weight1);