diff options
Diffstat (limited to 'scene/resources/polygon_path_finder.h')
-rw-r--r-- | scene/resources/polygon_path_finder.h | 38 |
1 files changed, 18 insertions, 20 deletions
diff --git a/scene/resources/polygon_path_finder.h b/scene/resources/polygon_path_finder.h index 58b8023843..cd2fea87d4 100644 --- a/scene/resources/polygon_path_finder.h +++ b/scene/resources/polygon_path_finder.h @@ -33,7 +33,7 @@ class PolygonPathFinder : public Resource { - GDCLASS(PolygonPathFinder,Resource); + GDCLASS(PolygonPathFinder, Resource); struct Point { Vector2 pos; @@ -47,18 +47,18 @@ class PolygonPathFinder : public Resource { int points[2]; - _FORCE_INLINE_ bool operator<(const Edge& p_edge) const { + _FORCE_INLINE_ bool operator<(const Edge &p_edge) const { - if (points[0]==p_edge.points[0]) - return points[1]<p_edge.points[1]; + if (points[0] == p_edge.points[0]) + return points[1] < p_edge.points[1]; else - return points[0]<p_edge.points[0]; + return points[0] < p_edge.points[0]; } - Edge(int a=0, int b=0) { + Edge(int a = 0, int b = 0) { - if (a>b) { - SWAP(a,b); + if (a > b) { + SWAP(a, b); } points[0] = a; points[1] = b; @@ -71,28 +71,26 @@ class PolygonPathFinder : public Resource { Vector<Point> points; Set<Edge> edges; - bool _is_point_inside(const Vector2& p_point) const; + bool _is_point_inside(const Vector2 &p_point) const; - void _set_data(const Dictionary& p_data); + void _set_data(const Dictionary &p_data); Dictionary _get_data() const; -protected: +protected: static void _bind_methods(); -public: +public: + void setup(const Vector<Vector2> &p_points, const Vector<int> &p_connections); + Vector<Vector2> find_path(const Vector2 &p_from, const Vector2 &p_to); - void setup(const Vector<Vector2>& p_points, const Vector<int>& p_connections); - Vector<Vector2> find_path(const Vector2& p_from, const Vector2& p_to); - - void set_point_penalty(int p_point,float p_penalty); + void set_point_penalty(int p_point, float p_penalty); float get_point_penalty(int p_point) const; - bool is_point_inside(const Vector2& p_point) const; - Vector2 get_closest_point(const Vector2& p_point) const; - Vector<Vector2> get_intersections(const Vector2& p_from, const Vector2& p_to) const; + bool is_point_inside(const Vector2 &p_point) const; + Vector2 get_closest_point(const Vector2 &p_point) const; + Vector<Vector2> get_intersections(const Vector2 &p_from, const Vector2 &p_to) const; Rect2 get_bounds() const; - PolygonPathFinder(); }; |