forked from qiao/PathFinding.js
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathtypes.d.ts
More file actions
177 lines (145 loc) · 6.36 KB
/
types.d.ts
File metadata and controls
177 lines (145 loc) · 6.36 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
// Type definitions for pathfinding
// Project: https://github.com/qiao/PathFinding.js
// Definitions by: BNedry <https://github.com/BNedry>
// Hartley Robertson <https://github.com/hartleyrobertson>
// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
declare module "@icepanel/pathfinding" {
namespace Pathfinding {
export namespace Heuristic {
function manhattan(dx: number, dy: number): number;
function euclidean(dx: number, dy: number): number;
function octile(dx: number, dy: number): number;
function chebyshev(dx: number, dy: number): number;
}
export namespace Util {
function smoothenPath(grid: Grid, path: number[][]): number[][];
function compressPath(path: number[][]): number[][];
function expandPath(path: number[][]): number[][];
}
export enum DiagonalMovement {
Always = 1,
Never = 2,
IfAtMostOneObstacle = 3,
OnlyWhenNoObstacles = 4
}
interface Node {
x: number;
y: number;
walkable: boolean;
}
interface Heuristic {
heuristic?: (dx: number, dy: number) => number;
}
interface FinderOptions extends Heuristic {
diagonalMovement?: DiagonalMovement;
avoidStaircase?: boolean;
turnPenalty?: number;
weight?: number;
}
interface IDAStarFinderOptions extends FinderOptions {
trackRecursion?: boolean;
timeLimit?: number;
}
interface JumpPointFinderBaseOptions extends Heuristic {
trackJumpRecursion?: boolean;
}
interface JumpPointFinderOptions extends Heuristic {
diagonalMovement?: DiagonalMovement;
}
interface BiBreadthFirstFinderOptions {
diagonalMovement?: DiagonalMovement;
}
interface Grid {
new (width: number, height: number): Grid;
new (matrix: number[][]): Grid;
setWalkableAt(x: number, y: number, walkable: boolean): void;
clone(): Grid;
getNodeAt(x: number, y: number): Pathfinding.Node;
getNeighbors(node: Pathfinding.Node, diagonalMovement: DiagonalMovement): Pathfinding.Node[];
isWalkableAt(x: number, y: number): boolean;
isInside(x: number, y: number): boolean;
getWeightAt(x: number, y: number): number;
setWeightAt(x: number, y: number, weight: number): void;
width: number;
height: number;
}
interface Finder {
findPath(startX: number, startY: number, endX: number, endY: number, matrix: Grid): number[][];
}
interface AStarFinder extends Finder {
new (): AStarFinder;
new (opt: FinderOptions): AStarFinder;
}
interface BestFirstFinder extends AStarFinder {
new (): BestFirstFinder;
new (opt: JumpPointFinderOptions): BestFirstFinder;
}
interface BiAStarFinder extends Finder {
new (): BiAStarFinder;
new (opt: JumpPointFinderOptions): BiAStarFinder;
}
interface BiBestFirstFinder extends BiAStarFinder {
new (): BiBestFirstFinder;
new (opt: JumpPointFinderOptions): BiBestFirstFinder;
}
interface BiBreadthFirstFinder extends Finder {
new (): BiBreadthFirstFinder;
new (opt: BiBreadthFirstFinderOptions): BiBreadthFirstFinder;
}
interface BiDijkstraFinder extends BiAStarFinder {
new (): BiDijkstraFinder;
new (opt: BiBreadthFirstFinderOptions): BiDijkstraFinder;
}
interface BreadthFirstFinder extends Finder {
new (): BreadthFirstFinder;
new (opt: BiBreadthFirstFinderOptions): BreadthFirstFinder;
}
interface DijkstraFinder extends AStarFinder {
new (): DijkstraFinder;
new (opt: BiBreadthFirstFinderOptions): DijkstraFinder;
}
interface IDAStarFinder extends Finder {
new (): IDAStarFinder;
new (opt: IDAStarFinderOptions): IDAStarFinder;
}
interface JumpPointFinderBase extends Finder {
new (): JumpPointFinderBase;
new (opt: JumpPointFinderBaseOptions): JumpPointFinderBase;
}
interface JPFAlwaysMoveDiagonally extends JumpPointFinderBase {
new (): JPFAlwaysMoveDiagonally;
new (opt: JumpPointFinderBaseOptions): JPFAlwaysMoveDiagonally;
}
interface JPFMoveDiagonallyIfAtMostOneObstacle extends JumpPointFinderBase {
new (): JPFMoveDiagonallyIfAtMostOneObstacle;
new (opt: JumpPointFinderBaseOptions): JPFMoveDiagonallyIfAtMostOneObstacle;
}
interface JPFMoveDiagonallyIfNoObstacles extends JumpPointFinderBase {
new (): JPFMoveDiagonallyIfNoObstacles;
new (opt: JumpPointFinderBaseOptions): JPFMoveDiagonallyIfNoObstacles;
}
interface JPFNeverMoveDiagonally extends JumpPointFinderBase {
new (): JPFNeverMoveDiagonally;
new (opt: JumpPointFinderBaseOptions): JPFNeverMoveDiagonally;
}
interface JumpPointFinder {
(opt: JumpPointFinderOptions): JPFNeverMoveDiagonally | JPFAlwaysMoveDiagonally | JPFMoveDiagonallyIfNoObstacles | JPFMoveDiagonallyIfAtMostOneObstacle;
}
export var Grid: Grid;
export var AStarFinder: AStarFinder;
export var BestFirstFinder: BestFirstFinder;
export var BiAStarFinder: BiAStarFinder;
export var BiBestFirstFinder: BiBestFirstFinder;
export var BiBreadthFirstFinder: BiBreadthFirstFinder;
export var BiDijkstraFinder: BiDijkstraFinder;
export var BreadthFirstFinder: BreadthFirstFinder;
export var DijkstraFinder: DijkstraFinder;
export var IDAStarFinder: IDAStarFinder;
export var JPFAlwaysMoveDiagonally: JPFAlwaysMoveDiagonally;
export var JPFMoveDiagonallyIfAtMostOneObstacle: JPFMoveDiagonallyIfAtMostOneObstacle;
export var JPFMoveDiagonallyIfNoObstacles: JPFMoveDiagonallyIfNoObstacles;
export var JPFNeverMoveDiagonally: JPFNeverMoveDiagonally;
export var JumpPointFinder: JumpPointFinder;
}
export = Pathfinding;
}