-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathastar.pyi
171 lines (101 loc) · 3.87 KB
/
astar.pyi
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
from typing import Any, overload, TypeVar
from java.lang.annotation import Annotation
from java.lang import Integer
from java.util import ArrayList, Comparator
from java.util.function import Function, ToDoubleFunction, ToIntFunction, ToLongFunction
U = TypeVar('U', default=Any)
T = TypeVar('T', default=Any)
class ASearchNode:
def c(self, arg0: ISearchNode) -> float: ...
def equals(self, arg0: object) -> bool: ...
@overload
def f(self) -> float: ...
@overload
def f(self) -> float: ...
@overload
def g(self) -> float: ...
@overload
def g(self) -> float: ...
@overload
def getDepth(self) -> int: ...
@overload
def getDepth(self) -> int: ...
def getParent(self) -> ISearchNode: ...
def getSuccessors(self, arg0: ArrayList[ISearchNode]) -> None: ...
def h(self) -> float: ...
def hashCode(self) -> int: ...
def keyCode(self) -> Integer: ...
@overload
def setDepth(self, arg0: int) -> None: ...
@overload
def setDepth(self, arg0: int) -> None: ...
@overload
def setG(self, arg0: float) -> None: ...
@overload
def setG(self, arg0: float) -> None: ...
def setParent(self, arg0: ISearchNode) -> None: ...
def __init__(self): ...
class AStar:
def bestNodeAfterSearch(self) -> ISearchNode: ...
def numSearchSteps(self) -> int: ...
def search(self, arg0: ISearchNode, arg1: IGoalNode) -> ISearchNode: ...
def setMaxSteps(self, arg0: int) -> None: ...
def shortestPath(self, arg0: ISearchNode, arg1: IGoalNode) -> ArrayList[ISearchNode]: ...
@staticmethod
def path(arg0: ISearchNode) -> ArrayList[ISearchNode]: ...
def __init__(self):
self.bestnodeaftersearch: ISearchNode
class SearchNodeComparator:
@overload
def compare(self, arg0: ISearchNode, arg1: ISearchNode) -> int: ...
@overload
def compare(self, arg0: object, arg1: object) -> int: ...
@overload
def compare(self, arg0: object, arg1: object) -> int: ...
def equals(self, arg0: object) -> bool: ...
def reversed(self) -> Comparator[T]: ...
@overload
def thenComparing(self, arg0: Comparator[T]) -> Comparator[T]: ...
@overload
def thenComparing(self, arg0: Function[T, U]) -> Comparator[T]: ...
@overload
def thenComparing(self, arg0: Function[T, U], arg1: Comparator[U]) -> Comparator[T]: ...
def thenComparingDouble(self, arg0: ToDoubleFunction[T]) -> Comparator[T]: ...
def thenComparingInt(self, arg0: ToIntFunction[T]) -> Comparator[T]: ...
def thenComparingLong(self, arg0: ToLongFunction[T]) -> Comparator[T]: ...
@staticmethod
@overload
def comparing(arg0: Function[T, U]) -> Comparator[T]: ...
@staticmethod
@overload
def comparing(arg0: Function[T, U], arg1: Comparator[U]) -> Comparator[T]: ...
@staticmethod
def comparingDouble(arg0: ToDoubleFunction[T]) -> Comparator[T]: ...
@staticmethod
def comparingInt(arg0: ToIntFunction[T]) -> Comparator[T]: ...
@staticmethod
def comparingLong(arg0: ToLongFunction[T]) -> Comparator[T]: ...
@staticmethod
def naturalOrder() -> Comparator[T]: ...
@staticmethod
def nullsFirst(arg0: Comparator[T]) -> Comparator[T]: ...
@staticmethod
def nullsLast(arg0: Comparator[T]) -> Comparator[T]: ...
@staticmethod
def reverseOrder() -> Comparator[T]: ...
class IGoalNode:
def inGoal(self, arg0: ISearchNode) -> bool: ...
class ISearchNode:
def c(self, arg0: ISearchNode) -> float: ...
def equals(self, arg0: object) -> bool: ...
def f(self) -> float: ...
def g(self) -> float: ...
def getDepth(self) -> int: ...
def getParent(self) -> ISearchNode: ...
def getSuccessors(self, arg0: ArrayList[ISearchNode]) -> None: ...
def h(self) -> float: ...
def hashCode(self) -> int: ...
def keyCode(self) -> Integer: ...
def setDepth(self, arg0: int) -> None: ...
def setG(self, arg0: float) -> None: ...
def setParent(self, arg0: ISearchNode) -> None: ...