TrainPathFinder::findPathWithinSegment(currentSegment, currentNode-> enterDirection, toEnd) & If (currentNode-> type = TrainPathFinderNode::Type::Normal) RailDirection currentLeaveDirection = currentNode-> enterDirection. RailSegment* currentSegment = currentNode-> segment While (TrainPathFinderNode* currentNode = pfData. createNode(segmentWithEnd, RailDirection::Front, nullptr, 0, false /* setSeen */, InChainSignalSection::False) dummy node so when it is destroyed, it will clear hasEnd flag heap, startNodeBack-> costFromStart + startNodeBack-> heuristicCostToEnd) įor ( const RailEnd& toEnd : request. StartNodeBack-> heuristicCostToEnd = heuristic. StartNodeBack-> costFromStart = costFromStart StartNodeBack-> type = TrainPathFinderNode::Type::StartNodeBack createNode(segment, leaveSegmentDirection, nullptr, 0, false /* setSeen */, request.

TrainPathFinderNode* startNodeBack = pfData. RailDirection leaveSegmentDirection = TrainPathFinder::calcLeaveSegmentDirection(request. heap, startNodeFront-> costFromStart + startNodeFront-> heuristicCostToEnd) StartNodeFront-> heuristicCostToEnd = heuristic. StartNodeFront-> costFromStart = costFromStart StartNodeFront-> type = TrainPathFinderNode::Type::StartNodeFront TrainPathFinderNode* startNodeFront = pfData. not setting seen in the first segment, so we can pathfind to the same segment we started in SingleSegmentPathMarker-> insertTo(pfData. SingleSegmentPathMarker-> type = TrainPathFinderNode::Type::SingleSegmentMarker If (bestSingleSegmentPathEnd = nullptr || currentDistance rail-> segment, RailDirection::Front /*dummy */, nullptr, 0, false /* setSeen */, request. If ( TrainPathFinder::findPathWithinSegment(request. If (bestSingleSegmentPathEnd = nullptr || currentDistance segment = request. TrainPathFinder::constructPath(request, toEnd, nullptr, endsFound)) type = TrainPathRequestType::GetAccessibleStateOfAllEnds & RailEnd* bestSingleSegmentPathEnd = nullptr setup special node for single segment solution

TrainPathFinderHeuristic heuristic(request) type = TrainPathRequestType::GetAccessibleStateOfAllEnds) Void TrainPathFinder::findPath(Request& request) TrainPathFinderHeuristic( const TrainPathFinder::Request& request) ĭouble costToEnd( const TrainPathFinderNode* node) const allocate()) TrainPathFinderNode(std::forward(values). Return this-> enterDirection = RailDirection::Front & other. This-> segment-> seenBackwardsInChainSequence = nullptr īool operator segment & other. This-> segment-> seenForwardsInChainSequence = nullptr This-> segment-> seenBackwards = nullptr This-> segment-> setSeen( this-> enterDirection, inChainSignalSection, this)

, inChainSignalSection(inChainSignalSection) , blockDistanceFromStart(blockDistanceFromStart) InChainSignalSection inChainSignalSection) TrainPathFinderNode(RailSegment* segment, TrainPathFinderConstants TrainPathFinder::constants Ĭlass TrainPathFinderNode : public MinHeap::ItemBase

Factorio download failed status code 0