glax/AStar
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

combined warnings #debug

Browse Source
This commit is contained in:
C9Glax 2022-11-17 20:36:08 +01:00
parent cc48016874
commit f1c7ff4b47
1 changed files with 3 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
astar/Astar.cs
View File

@ -50,14 +50,13 @@ namespace astar
return new Route(new List<Step>(), false, float.MaxValue, float.MaxValue); return new Route(new List<Step>(), false, float.MaxValue, float.MaxValue);
} }
#pragma warning disable CS8604, CS8600 // Route was found, so has to have a previous node and edges
List<Node> tempNodes = new(); List<Node> tempNodes = new();
tempNodes.Add(goal); tempNodes.Add(goal);
while(currentNode != start) while(currentNode != start)
{ {
#pragma warning disable CS8604, CS8600 // Route was found, so has to have a previous node
tempNodes.Add(GetPreviousNodeOf(currentNode)); tempNodes.Add(GetPreviousNodeOf(currentNode));
currentNode = GetPreviousNodeOf(currentNode); currentNode = GetPreviousNodeOf(currentNode);
#pragma warning restore CS8604, CS8600
} }
tempNodes.Reverse(); tempNodes.Reverse();
@ -66,10 +65,8 @@ namespace astar
for(int i = 0; i < tempNodes.Count - 1; i++) for(int i = 0; i < tempNodes.Count - 1; i++)
{ {
#pragma warning disable CS8600, CS8604 // Route was found, so has to have an edge
Edge e = tempNodes[i].GetEdgeToNode(tempNodes[i + 1]); Edge e = tempNodes[i].GetEdgeToNode(tempNodes[i + 1]);
steps.Add(new Step(tempNodes[i], e, GetTimeRequiredToReach(tempNodes[i]), GetDistanceToGoal(tempNodes[i]))); steps.Add(new Step(tempNodes[i], e, GetTimeRequiredToReach(tempNodes[i]), GetDistanceToGoal(tempNodes[i])));
#pragma warning restore CS8600, CS8604
totalDistance += e.distance; totalDistance += e.distance;
} }
@ -94,6 +91,7 @@ namespace astar
} }
return _route; return _route;
#pragma warning restore CS8604, CS8600
} }
/* /*