CocosPlugin/esengine
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

优化寻路速度

Browse Source
This commit is contained in:
yhh
2020-09-14 17:54:17 +08:00
parent 700d0194be
commit 24a463b85b
7 changed files with 46 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
source/src/AI/Pathfinding/AStar/AStarPathfinder.ts
View File

@@ -24,7 +24,10 @@ module es {
while (frontier.count > 0) {
let current = frontier.dequeue();
if (JSON.stringify(current.data) == JSON.stringify(goal)) {
if (current.data instanceof Vector2 && goal instanceof Vector2 && current.data.equals(goal)) {
foundPath = true;
break;
} else if (current.data == goal){
foundPath = true;
break;
}
@@ -68,7 +71,9 @@ module es {
let iterator = map.keys();
let r: IteratorResult<T>;
while (r = iterator.next() , !r.done) {
if (JSON.stringify(r.value) == JSON.stringify(compareKey))
if (r.value instanceof Vector2 && compareKey instanceof Vector2 && r.value.equals(compareKey))
return true;
else if (r.value == compareKey)
return true;
}
@@ -81,7 +86,9 @@ module es {
let r: IteratorResult<T>;
let v: IteratorResult<T>;
while (r = iterator.next(), v = valueIterator.next(), !r.done) {
if (JSON.stringify(r.value) == JSON.stringify(compareKey))
if (r.value instanceof Vector2 && compareKey instanceof Vector2 && r.value.equals(compareKey))
return v.value;
else if (r.value == compareKey)
return v.value;
}

4
source/src/AI/Pathfinding/AStar/AstarGridGraph.ts
View File

@@ -38,7 +38,7 @@ module es {
* @param node
*/
public isNodePassable(node: Vector2): boolean {
return !this.walls.firstOrDefault(wall => JSON.stringify(wall) == JSON.stringify(node));
return !this.walls.firstOrDefault(wall => wall.equals(node));
}
/**
@@ -63,7 +63,7 @@ module es {
}
public cost(from: Vector2, to: Vector2): number {
return this.weightedNodes.find((p) => JSON.stringify(p) == JSON.stringify(to)) ? this.weightedNodeWeight : this.defaultWeight;
return this.weightedNodes.find((p) => p.equals(to)) ? this.weightedNodeWeight : this.defaultWeight;
}
public heuristic(node: Vector2, goal: Vector2) {