Merge pull request #70496 from Chaosus/astargrid_divide_heuristics
This commit is contained in:
commit
5be4c0b390
3 changed files with 34 additions and 15 deletions
|
@ -134,13 +134,22 @@ AStarGrid2D::DiagonalMode AStarGrid2D::get_diagonal_mode() const {
|
|||
return diagonal_mode;
|
||||
}
|
||||
|
||||
void AStarGrid2D::set_default_heuristic(Heuristic p_heuristic) {
|
||||
void AStarGrid2D::set_default_compute_heuristic(Heuristic p_heuristic) {
|
||||
ERR_FAIL_INDEX((int)p_heuristic, (int)HEURISTIC_MAX);
|
||||
default_heuristic = p_heuristic;
|
||||
default_compute_heuristic = p_heuristic;
|
||||
}
|
||||
|
||||
AStarGrid2D::Heuristic AStarGrid2D::get_default_heuristic() const {
|
||||
return default_heuristic;
|
||||
AStarGrid2D::Heuristic AStarGrid2D::get_default_compute_heuristic() const {
|
||||
return default_compute_heuristic;
|
||||
}
|
||||
|
||||
void AStarGrid2D::set_default_estimate_heuristic(Heuristic p_heuristic) {
|
||||
ERR_FAIL_INDEX((int)p_heuristic, (int)HEURISTIC_MAX);
|
||||
default_estimate_heuristic = p_heuristic;
|
||||
}
|
||||
|
||||
AStarGrid2D::Heuristic AStarGrid2D::get_default_estimate_heuristic() const {
|
||||
return default_estimate_heuristic;
|
||||
}
|
||||
|
||||
void AStarGrid2D::set_point_solid(const Vector2i &p_id, bool p_solid) {
|
||||
|
@ -447,7 +456,7 @@ real_t AStarGrid2D::_estimate_cost(const Vector2i &p_from_id, const Vector2i &p_
|
|||
if (GDVIRTUAL_CALL(_estimate_cost, p_from_id, p_to_id, scost)) {
|
||||
return scost;
|
||||
}
|
||||
return heuristics[default_heuristic](p_from_id, p_to_id);
|
||||
return heuristics[default_estimate_heuristic](p_from_id, p_to_id);
|
||||
}
|
||||
|
||||
real_t AStarGrid2D::_compute_cost(const Vector2i &p_from_id, const Vector2i &p_to_id) {
|
||||
|
@ -455,7 +464,7 @@ real_t AStarGrid2D::_compute_cost(const Vector2i &p_from_id, const Vector2i &p_t
|
|||
if (GDVIRTUAL_CALL(_compute_cost, p_from_id, p_to_id, scost)) {
|
||||
return scost;
|
||||
}
|
||||
return heuristics[default_heuristic](p_from_id, p_to_id);
|
||||
return heuristics[default_compute_heuristic](p_from_id, p_to_id);
|
||||
}
|
||||
|
||||
void AStarGrid2D::clear() {
|
||||
|
@ -578,8 +587,10 @@ void AStarGrid2D::_bind_methods() {
|
|||
ClassDB::bind_method(D_METHOD("is_jumping_enabled"), &AStarGrid2D::is_jumping_enabled);
|
||||
ClassDB::bind_method(D_METHOD("set_diagonal_mode", "mode"), &AStarGrid2D::set_diagonal_mode);
|
||||
ClassDB::bind_method(D_METHOD("get_diagonal_mode"), &AStarGrid2D::get_diagonal_mode);
|
||||
ClassDB::bind_method(D_METHOD("set_default_heuristic", "heuristic"), &AStarGrid2D::set_default_heuristic);
|
||||
ClassDB::bind_method(D_METHOD("get_default_heuristic"), &AStarGrid2D::get_default_heuristic);
|
||||
ClassDB::bind_method(D_METHOD("set_default_compute_heuristic", "heuristic"), &AStarGrid2D::set_default_compute_heuristic);
|
||||
ClassDB::bind_method(D_METHOD("get_default_compute_heuristic"), &AStarGrid2D::get_default_compute_heuristic);
|
||||
ClassDB::bind_method(D_METHOD("set_default_estimate_heuristic", "heuristic"), &AStarGrid2D::set_default_estimate_heuristic);
|
||||
ClassDB::bind_method(D_METHOD("get_default_estimate_heuristic"), &AStarGrid2D::get_default_estimate_heuristic);
|
||||
ClassDB::bind_method(D_METHOD("set_point_solid", "id", "solid"), &AStarGrid2D::set_point_solid, DEFVAL(true));
|
||||
ClassDB::bind_method(D_METHOD("is_point_solid", "id"), &AStarGrid2D::is_point_solid);
|
||||
ClassDB::bind_method(D_METHOD("set_point_weight_scale", "id", "weight_scale"), &AStarGrid2D::set_point_weight_scale);
|
||||
|
@ -598,8 +609,9 @@ void AStarGrid2D::_bind_methods() {
|
|||
ADD_PROPERTY(PropertyInfo(Variant::VECTOR2, "cell_size"), "set_cell_size", "get_cell_size");
|
||||
|
||||
ADD_PROPERTY(PropertyInfo(Variant::BOOL, "jumping_enabled"), "set_jumping_enabled", "is_jumping_enabled");
|
||||
ADD_PROPERTY(PropertyInfo(Variant::INT, "default_heuristic", PROPERTY_HINT_ENUM, "Euclidean,Manhattan,Octile,Chebyshev,Max"), "set_default_heuristic", "get_default_heuristic");
|
||||
ADD_PROPERTY(PropertyInfo(Variant::INT, "diagonal_mode", PROPERTY_HINT_ENUM, "Never,Always,At Least One Walkable,Only If No Obstacles,Max"), "set_diagonal_mode", "get_diagonal_mode");
|
||||
ADD_PROPERTY(PropertyInfo(Variant::INT, "default_compute_heuristic", PROPERTY_HINT_ENUM, "Euclidean,Manhattan,Octile,Chebyshev"), "set_default_compute_heuristic", "get_default_compute_heuristic");
|
||||
ADD_PROPERTY(PropertyInfo(Variant::INT, "default_estimate_heuristic", PROPERTY_HINT_ENUM, "Euclidean,Manhattan,Octile,Chebyshev"), "set_default_estimate_heuristic", "get_default_estimate_heuristic");
|
||||
ADD_PROPERTY(PropertyInfo(Variant::INT, "diagonal_mode", PROPERTY_HINT_ENUM, "Never,Always,At Least One Walkable,Only If No Obstacles"), "set_diagonal_mode", "get_diagonal_mode");
|
||||
|
||||
BIND_ENUM_CONSTANT(HEURISTIC_EUCLIDEAN);
|
||||
BIND_ENUM_CONSTANT(HEURISTIC_MANHATTAN);
|
||||
|
|
|
@ -65,7 +65,8 @@ private:
|
|||
|
||||
bool jumping_enabled = false;
|
||||
DiagonalMode diagonal_mode = DIAGONAL_MODE_ALWAYS;
|
||||
Heuristic default_heuristic = HEURISTIC_EUCLIDEAN;
|
||||
Heuristic default_compute_heuristic = HEURISTIC_EUCLIDEAN;
|
||||
Heuristic default_estimate_heuristic = HEURISTIC_EUCLIDEAN;
|
||||
|
||||
struct Point {
|
||||
Vector2i id;
|
||||
|
@ -161,8 +162,11 @@ public:
|
|||
void set_diagonal_mode(DiagonalMode p_diagonal_mode);
|
||||
DiagonalMode get_diagonal_mode() const;
|
||||
|
||||
void set_default_heuristic(Heuristic p_heuristic);
|
||||
Heuristic get_default_heuristic() const;
|
||||
void set_default_compute_heuristic(Heuristic p_heuristic);
|
||||
Heuristic get_default_compute_heuristic() const;
|
||||
|
||||
void set_default_estimate_heuristic(Heuristic p_heuristic);
|
||||
Heuristic get_default_estimate_heuristic() const;
|
||||
|
||||
void set_point_solid(const Vector2i &p_id, bool p_solid = true);
|
||||
bool is_point_solid(const Vector2i &p_id) const;
|
||||
|
|
|
@ -140,8 +140,11 @@
|
|||
<member name="cell_size" type="Vector2" setter="set_cell_size" getter="get_cell_size" default="Vector2(1, 1)">
|
||||
The size of the point cell which will be applied to calculate the resulting point position returned by [method get_point_path]. If changed, [method update] needs to be called before finding the next path.
|
||||
</member>
|
||||
<member name="default_heuristic" type="int" setter="set_default_heuristic" getter="get_default_heuristic" enum="AStarGrid2D.Heuristic" default="0">
|
||||
The default [enum Heuristic] which will be used to calculate the path if [method _compute_cost] and/or [method _estimate_cost] were not overridden.
|
||||
<member name="default_compute_heuristic" type="int" setter="set_default_compute_heuristic" getter="get_default_compute_heuristic" enum="AStarGrid2D.Heuristic" default="0">
|
||||
The default [enum Heuristic] which will be used to calculate the cost between two points if [method _compute_cost] was not overridden.
|
||||
</member>
|
||||
<member name="default_estimate_heuristic" type="int" setter="set_default_estimate_heuristic" getter="get_default_estimate_heuristic" enum="AStarGrid2D.Heuristic" default="0">
|
||||
The default [enum Heuristic] which will be used to calculate the cost between the point and the end point if [method _estimate_cost] was not overridden.
|
||||
</member>
|
||||
<member name="diagonal_mode" type="int" setter="set_diagonal_mode" getter="get_diagonal_mode" enum="AStarGrid2D.DiagonalMode" default="0">
|
||||
A specific [enum DiagonalMode] mode which will force the path to avoid or accept the specified diagonals.
|
||||
|
|
Loading…
Reference in a new issue