Reverting some externalizations
This commit is contained in:
		
							parent
							
								
									8c2bd8bd88
								
							
						
					
					
						commit
						0b83310100
					
				| @ -143,8 +143,6 @@ public: | |||||||
|             forwardEdge.target = backwardEdge.target = target; |             forwardEdge.target = backwardEdge.target = target; | ||||||
|             forwardEdge.data.forward = backwardEdge.data.backward = true; |             forwardEdge.data.forward = backwardEdge.data.backward = true; | ||||||
|             forwardEdge.data.backward = backwardEdge.data.forward = false; |             forwardEdge.data.backward = backwardEdge.data.forward = false; | ||||||
| //            forwardEdge.data.turnInstruction = backwardEdge.data.turnInstruction = turnType;
 |  | ||||||
| //            forwardEdge.data.nameID = backwardEdge.data.nameID = edges[i].data.nameID;
 |  | ||||||
|             forwardEdge.data.shortcut = backwardEdge.data.shortcut = false; |             forwardEdge.data.shortcut = backwardEdge.data.shortcut = false; | ||||||
|             forwardEdge.data.id = backwardEdge.data.id = id; |             forwardEdge.data.id = backwardEdge.data.id = id; | ||||||
|             forwardEdge.data.originalEdges = backwardEdge.data.originalEdges = 1; |             forwardEdge.data.originalEdges = backwardEdge.data.originalEdges = 1; | ||||||
|  | |||||||
| @ -129,7 +129,7 @@ EdgeBasedGraphFactory::EdgeBasedGraphFactory(int nodes, std::vector<NodeBasedEdg | |||||||
|     _nodeBasedGraph.reset(new _NodeBasedDynamicGraph( nodes, edges )); |     _nodeBasedGraph.reset(new _NodeBasedDynamicGraph( nodes, edges )); | ||||||
| } | } | ||||||
| 
 | 
 | ||||||
| void EdgeBasedGraphFactory::GetEdgeBasedEdges(stxxl::vector< EdgeBasedEdge >& outputEdgeList ) { | void EdgeBasedGraphFactory::GetEdgeBasedEdges(std::vector< EdgeBasedEdge >& outputEdgeList ) { | ||||||
|     GUARANTEE(0 == outputEdgeList.size(), "Vector passed to EdgeBasedGraphFactory::GetEdgeBasedEdges(..) is not empty"); |     GUARANTEE(0 == outputEdgeList.size(), "Vector passed to EdgeBasedGraphFactory::GetEdgeBasedEdges(..) is not empty"); | ||||||
|     GUARANTEE(0 != edgeBasedEdges.size(), "No edges in edge based graph"); |     GUARANTEE(0 != edgeBasedEdges.size(), "No edges in edge based graph"); | ||||||
| 
 | 
 | ||||||
|  | |||||||
| @ -103,7 +103,7 @@ private: | |||||||
|     RestrictionMap _restrictionMap; |     RestrictionMap _restrictionMap; | ||||||
| 
 | 
 | ||||||
| 
 | 
 | ||||||
|     stxxl::vector<EdgeBasedEdge>      edgeBasedEdges; |     std::vector<EdgeBasedEdge>      edgeBasedEdges; | ||||||
|     std::vector<EdgeBasedNode>      edgeBasedNodes; |     std::vector<EdgeBasedNode>      edgeBasedNodes; | ||||||
|     std::vector<OriginalEdgeData>   originalEdgeData; |     std::vector<OriginalEdgeData>   originalEdgeData; | ||||||
|     std::vector<NodeInfo>           inputNodeInfoList; |     std::vector<NodeInfo>           inputNodeInfoList; | ||||||
| @ -127,7 +127,7 @@ public: | |||||||
|     explicit EdgeBasedGraphFactory(int nodes, std::vector<InputEdgeT> & inputEdges, std::vector<NodeID> & _bollardNodes, std::vector<NodeID> & trafficLights, std::vector<_Restriction> & inputRestrictions, std::vector<NodeInfo> & nI, boost::property_tree::ptree speedProfile, std::string & srtm); |     explicit EdgeBasedGraphFactory(int nodes, std::vector<InputEdgeT> & inputEdges, std::vector<NodeID> & _bollardNodes, std::vector<NodeID> & trafficLights, std::vector<_Restriction> & inputRestrictions, std::vector<NodeInfo> & nI, boost::property_tree::ptree speedProfile, std::string & srtm); | ||||||
| 
 | 
 | ||||||
|     void Run(); |     void Run(); | ||||||
|     void GetEdgeBasedEdges( stxxl::vector< EdgeBasedEdge >& edges ); |     void GetEdgeBasedEdges( std::vector< EdgeBasedEdge >& edges ); | ||||||
|     void GetEdgeBasedNodes( std::vector< EdgeBasedNode> & nodes); |     void GetEdgeBasedNodes( std::vector< EdgeBasedNode> & nodes); | ||||||
|     void GetOriginalEdgeData( std::vector< OriginalEdgeData> & originalEdgeData); |     void GetOriginalEdgeData( std::vector< OriginalEdgeData> & originalEdgeData); | ||||||
|     short AnalyzeTurn(const NodeID u, const NodeID v, const NodeID w) const; |     short AnalyzeTurn(const NodeID u, const NodeID v, const NodeID w) const; | ||||||
|  | |||||||
		Loading…
	
		Reference in New Issue
	
	Block a user