Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
godotengine
GitHub Repository: godotengine/godot
Path: blob/master/modules/navigation_2d/2d/nav_mesh_queries_2d.h
11353 views
1
/**************************************************************************/
2
/* nav_mesh_queries_2d.h */
3
/**************************************************************************/
4
/* This file is part of: */
5
/* GODOT ENGINE */
6
/* https://godotengine.org */
7
/**************************************************************************/
8
/* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
9
/* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
10
/* */
11
/* Permission is hereby granted, free of charge, to any person obtaining */
12
/* a copy of this software and associated documentation files (the */
13
/* "Software"), to deal in the Software without restriction, including */
14
/* without limitation the rights to use, copy, modify, merge, publish, */
15
/* distribute, sublicense, and/or sell copies of the Software, and to */
16
/* permit persons to whom the Software is furnished to do so, subject to */
17
/* the following conditions: */
18
/* */
19
/* The above copyright notice and this permission notice shall be */
20
/* included in all copies or substantial portions of the Software. */
21
/* */
22
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
23
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
24
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
25
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
26
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
27
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
28
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
29
/**************************************************************************/
30
31
#pragma once
32
33
#include "../nav_utils_2d.h"
34
35
#include "core/templates/a_hash_map.h"
36
37
#include "servers/nav_heap.h"
38
#include "servers/navigation_2d/navigation_constants_2d.h"
39
#include "servers/navigation_2d/navigation_path_query_parameters_2d.h"
40
#include "servers/navigation_2d/navigation_path_query_result_2d.h"
41
42
using namespace NavigationDefaults2D;
43
using namespace NavigationEnums2D;
44
45
class NavMap2D;
46
struct NavMapIteration2D;
47
48
class NavMeshQueries2D {
49
public:
50
struct PathQuerySlot {
51
LocalVector<Nav2D::NavigationPoly> path_corridor;
52
Heap<Nav2D::NavigationPoly *, Nav2D::NavPolyTravelCostGreaterThan, Nav2D::NavPolyHeapIndexer> traversable_polys;
53
bool in_use = false;
54
uint32_t slot_index = 0;
55
AHashMap<const Nav2D::Polygon *, uint32_t> poly_to_id;
56
};
57
58
struct NavMeshPathQueryTask2D {
59
enum TaskStatus {
60
QUERY_STARTED,
61
QUERY_FINISHED,
62
QUERY_FAILED,
63
CALLBACK_DISPATCHED,
64
CALLBACK_FAILED,
65
};
66
67
// Parameters.
68
Vector2 start_position;
69
Vector2 target_position;
70
uint32_t navigation_layers;
71
BitField<PathMetadataFlags> metadata_flags = PathMetadataFlags::PATH_INCLUDE_ALL;
72
PathfindingAlgorithm pathfinding_algorithm = PathfindingAlgorithm::PATHFINDING_ALGORITHM_ASTAR;
73
PathPostProcessing path_postprocessing = PathPostProcessing::PATH_POSTPROCESSING_CORRIDORFUNNEL;
74
bool simplify_path = false;
75
real_t simplify_epsilon = 0.0;
76
77
bool exclude_regions = false;
78
bool include_regions = false;
79
LocalVector<RID> excluded_regions;
80
LocalVector<RID> included_regions;
81
82
float path_return_max_length = 0.0;
83
float path_return_max_radius = 0.0;
84
int path_search_max_polygons = NavigationDefaults2D::path_search_max_polygons;
85
float path_search_max_distance = 0.0;
86
87
// Path building.
88
Vector2 begin_position;
89
Vector2 end_position;
90
const Nav2D::Polygon *begin_polygon = nullptr;
91
const Nav2D::Polygon *end_polygon = nullptr;
92
uint32_t least_cost_id = 0;
93
94
// Map.
95
NavMap2D *map = nullptr;
96
PathQuerySlot *path_query_slot = nullptr;
97
98
// Path points.
99
LocalVector<Vector2> path_points;
100
LocalVector<int32_t> path_meta_point_types;
101
LocalVector<RID> path_meta_point_rids;
102
LocalVector<int64_t> path_meta_point_owners;
103
float path_length = 0.0;
104
105
Ref<NavigationPathQueryParameters2D> query_parameters;
106
Ref<NavigationPathQueryResult2D> query_result;
107
Callable callback;
108
NavMeshPathQueryTask2D::TaskStatus status = NavMeshPathQueryTask2D::TaskStatus::QUERY_STARTED;
109
110
void path_clear() {
111
path_points.clear();
112
path_meta_point_types.clear();
113
path_meta_point_rids.clear();
114
path_meta_point_owners.clear();
115
}
116
117
void path_reverse() {
118
path_points.reverse();
119
path_meta_point_types.reverse();
120
path_meta_point_rids.reverse();
121
path_meta_point_owners.reverse();
122
}
123
};
124
125
static bool emit_callback(const Callable &p_callback);
126
127
static Vector2 polygons_get_random_point(const LocalVector<Nav2D::Polygon> &p_polygons, uint32_t p_navigation_layers, bool p_uniformly);
128
129
static Vector2 polygons_get_closest_point(const LocalVector<Nav2D::Polygon> &p_polygons, const Vector2 &p_point);
130
static Nav2D::ClosestPointQueryResult polygons_get_closest_point_info(const LocalVector<Nav2D::Polygon> &p_polygons, const Vector2 &p_point);
131
static RID polygons_get_closest_point_owner(const LocalVector<Nav2D::Polygon> &p_polygons, const Vector2 &p_point);
132
133
static Vector2 map_iteration_get_closest_point(const NavMapIteration2D &p_map_iteration, const Vector2 &p_point);
134
static RID map_iteration_get_closest_point_owner(const NavMapIteration2D &p_map_iteration, const Vector2 &p_point);
135
static Nav2D::ClosestPointQueryResult map_iteration_get_closest_point_info(const NavMapIteration2D &p_map_iteration, const Vector2 &p_point);
136
static Vector2 map_iteration_get_random_point(const NavMapIteration2D &p_map_iteration, uint32_t p_navigation_layers, bool p_uniformly);
137
138
static void map_query_path(NavMap2D *p_map, const Ref<NavigationPathQueryParameters2D> &p_query_parameters, Ref<NavigationPathQueryResult2D> p_query_result, const Callable &p_callback);
139
140
static void query_task_map_iteration_get_path(NavMeshPathQueryTask2D &p_query_task, const NavMapIteration2D &p_map_iteration);
141
static void _query_task_push_back_point_with_metadata(NavMeshPathQueryTask2D &p_query_task, const Vector2 &p_point, const Nav2D::Polygon *p_point_polygon);
142
static void _query_task_find_start_end_positions(NavMeshPathQueryTask2D &p_query_task, const NavMapIteration2D &p_map_iteration);
143
static void _query_task_build_path_corridor(NavMeshPathQueryTask2D &p_query_task, const NavMapIteration2D &p_map_iteration);
144
static void _query_task_post_process_corridorfunnel(NavMeshPathQueryTask2D &p_query_task);
145
static void _query_task_post_process_edgecentered(NavMeshPathQueryTask2D &p_query_task);
146
static void _query_task_post_process_nopostprocessing(NavMeshPathQueryTask2D &p_query_task);
147
static void _query_task_clip_path(NavMeshPathQueryTask2D &p_query_task, const Nav2D::NavigationPoly *p_from_poly, const Vector2 &p_to_point, const Nav2D::NavigationPoly *p_to_poly);
148
static void _query_task_simplified_path_points(NavMeshPathQueryTask2D &p_query_task);
149
static bool _query_task_is_connection_owner_usable(const NavMeshPathQueryTask2D &p_query_task, const NavBaseIteration2D *p_owner);
150
static void _query_task_process_path_result_limits(NavMeshPathQueryTask2D &p_query_task);
151
152
static void _query_task_search_polygon_connections(NavMeshPathQueryTask2D &p_query_task, const Nav2D::Connection &p_connection, uint32_t p_least_cost_id, const Nav2D::NavigationPoly &p_least_cost_poly, real_t p_poly_enter_cost, const Vector2 &p_end_point);
153
154
static void simplify_path_segment(int p_start_inx, int p_end_inx, const LocalVector<Vector2> &p_points, real_t p_epsilon, LocalVector<uint32_t> &r_simplified_path_indices);
155
static LocalVector<uint32_t> get_simplified_path_indices(const LocalVector<Vector2> &p_path, real_t p_epsilon);
156
157
static float _calculate_path_length(const LocalVector<Vector2> &p_path, uint32_t p_start_index, uint32_t p_end_index);
158
};
159
160