Goal<T> class
abstract
interface
Pathfinding
Represents a goal in a pathfinding algorithm.
A goal is a condition that, when met, signals the end of a pathfinding algorithm. For example, a goal could be a specific node in a graph, or a condition that a node must meet to be considered a goal, such as a certain value or property.
Constructors
- Goal.always()
-
Creates a goal that always matches any node.
constfactory
-
Goal.any(List<
Goal< goals)T> > -
Creates a goal that matches any of the goals in
goals.constfactory -
Goal.every(List<
Goal< goals)T> > -
Creates a goal that matches all of the goals in
goals.constfactory - Goal.never()
-
Creates a goal that never matches any node.
constfactory
- Goal.node(T node)
-
Creates a goal that matches a specific node.
constfactory
- Goal.test(bool success(T node))
-
Creates a goal with an arbitrary condition that a node must meet.
constfactory
Properties
- hashCode → int
-
The hash code for this object.
no setterinherited
- runtimeType → Type
-
A representation of the runtime type of the object.
no setterinherited
Methods
-
noSuchMethod(
Invocation invocation) → dynamic -
Invoked when a nonexistent method or property is accessed.
inherited
-
success(
T node) → bool -
Returns
trueifnodeis a goal,falseotherwise. -
toString(
) → String -
A string representation of this object.
inherited
Operators
-
operator ==(
Object other) → bool -
The equality operator.
inherited