refactor the ETA estimation

This commit is contained in:
Sven Czarnian
2021-12-14 11:23:18 +01:00
parent 74b8ec33d5
commit 4fbe9d1060

View File

@@ -50,13 +50,11 @@ class RunwayManager:
arrivalTime = node.ArrivalCandidates[runway].InitialArrivalTime arrivalTime = node.ArrivalCandidates[runway].InitialArrivalTime
if None == constrainedETA: if None == constrainedETA:
return max(arrivalTime, earliestArrivalTime), timedelta(seconds = 0) eta = max(arrivalTime, earliestArrivalTime)
else: else:
eta = max(constrainedETA, earliestArrivalTime) eta = max(constrainedETA, earliestArrivalTime)
if eta < arrivalTime:
return arrivalTime, arrivalTime - eta return eta, eta - arrivalTime
else:
return eta, timedelta(seconds = 0)
def selectShallShouldMayArrivalRunway(self, node : Node, runways, useETA : bool, earliestArrivalTime : datetime): def selectShallShouldMayArrivalRunway(self, node : Node, runways, useETA : bool, earliestArrivalTime : datetime):
candidate = None candidate = None