path_2d.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433
  1. /*************************************************************************/
  2. /* path_2d.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2021 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2021 Godot Engine contributors (cf. AUTHORS.md). */
  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. #include "path_2d.h"
  31. #include "core/engine.h"
  32. #include "scene/scene_string_names.h"
  33. #ifdef TOOLS_ENABLED
  34. #include "editor/editor_scale.h"
  35. #endif
  36. #ifdef TOOLS_ENABLED
  37. Rect2 Path2D::_edit_get_rect() const {
  38. if (!curve.is_valid() || curve->get_point_count() == 0)
  39. return Rect2(0, 0, 0, 0);
  40. Rect2 aabb = Rect2(curve->get_point_position(0), Vector2(0, 0));
  41. for (int i = 0; i < curve->get_point_count(); i++) {
  42. for (int j = 0; j <= 8; j++) {
  43. real_t frac = j / 8.0;
  44. Vector2 p = curve->interpolate(i, frac);
  45. aabb.expand_to(p);
  46. }
  47. }
  48. return aabb;
  49. }
  50. bool Path2D::_edit_use_rect() const {
  51. return curve.is_valid() && curve->get_point_count() != 0;
  52. }
  53. bool Path2D::_edit_is_selected_on_click(const Point2 &p_point, double p_tolerance) const {
  54. if (curve.is_null()) {
  55. return false;
  56. }
  57. for (int i = 0; i < curve->get_point_count(); i++) {
  58. Vector2 s[2];
  59. s[0] = curve->get_point_position(i);
  60. for (int j = 1; j <= 8; j++) {
  61. real_t frac = j / 8.0;
  62. s[1] = curve->interpolate(i, frac);
  63. Vector2 p = Geometry::get_closest_point_to_segment_2d(p_point, s);
  64. if (p.distance_to(p_point) <= p_tolerance)
  65. return true;
  66. s[0] = s[1];
  67. }
  68. }
  69. return false;
  70. }
  71. #endif
  72. void Path2D::_notification(int p_what) {
  73. if (p_what == NOTIFICATION_DRAW && curve.is_valid()) {
  74. //draw the curve!!
  75. if (!Engine::get_singleton()->is_editor_hint() && !get_tree()->is_debugging_navigation_hint()) {
  76. return;
  77. }
  78. #ifdef TOOLS_ENABLED
  79. const float line_width = 2 * EDSCALE;
  80. #else
  81. const float line_width = 2;
  82. #endif
  83. const Color color = Color(1.0, 1.0, 1.0, 1.0);
  84. for (int i = 0; i < curve->get_point_count(); i++) {
  85. Vector2 prev_p = curve->get_point_position(i);
  86. for (int j = 1; j <= 8; j++) {
  87. real_t frac = j / 8.0;
  88. Vector2 p = curve->interpolate(i, frac);
  89. draw_line(prev_p, p, color, line_width, true);
  90. prev_p = p;
  91. }
  92. }
  93. }
  94. }
  95. void Path2D::_curve_changed() {
  96. if (!is_inside_tree()) {
  97. return;
  98. }
  99. if (!Engine::get_singleton()->is_editor_hint() && !get_tree()->is_debugging_navigation_hint()) {
  100. return;
  101. }
  102. update();
  103. }
  104. void Path2D::set_curve(const Ref<Curve2D> &p_curve) {
  105. if (curve.is_valid()) {
  106. curve->disconnect("changed", this, "_curve_changed");
  107. }
  108. curve = p_curve;
  109. if (curve.is_valid()) {
  110. curve->connect("changed", this, "_curve_changed");
  111. }
  112. _curve_changed();
  113. }
  114. Ref<Curve2D> Path2D::get_curve() const {
  115. return curve;
  116. }
  117. void Path2D::_bind_methods() {
  118. ClassDB::bind_method(D_METHOD("set_curve", "curve"), &Path2D::set_curve);
  119. ClassDB::bind_method(D_METHOD("get_curve"), &Path2D::get_curve);
  120. ClassDB::bind_method(D_METHOD("_curve_changed"), &Path2D::_curve_changed);
  121. ADD_PROPERTY(PropertyInfo(Variant::OBJECT, "curve", PROPERTY_HINT_RESOURCE_TYPE, "Curve2D"), "set_curve", "get_curve");
  122. }
  123. Path2D::Path2D() {
  124. set_curve(Ref<Curve2D>(memnew(Curve2D))); //create one by default
  125. set_self_modulate(Color(0.5, 0.6, 1.0, 0.7));
  126. }
  127. /////////////////////////////////////////////////////////////////////////////////
  128. void PathFollow2D::_update_transform() {
  129. if (!path)
  130. return;
  131. Ref<Curve2D> c = path->get_curve();
  132. if (!c.is_valid())
  133. return;
  134. float path_length = c->get_baked_length();
  135. if (path_length == 0) {
  136. return;
  137. }
  138. Vector2 pos = c->interpolate_baked(offset, cubic);
  139. if (rotate) {
  140. float ahead = offset + lookahead;
  141. if (loop && ahead >= path_length) {
  142. // If our lookahead will loop, we need to check if the path is closed.
  143. int point_count = c->get_point_count();
  144. if (point_count > 0) {
  145. Vector2 start_point = c->get_point_position(0);
  146. Vector2 end_point = c->get_point_position(point_count - 1);
  147. if (start_point == end_point) {
  148. // Since the path is closed we want to 'smooth off'
  149. // the corner at the start/end.
  150. // So we wrap the lookahead back round.
  151. ahead = Math::fmod(ahead, path_length);
  152. }
  153. }
  154. }
  155. Vector2 ahead_pos = c->interpolate_baked(ahead, cubic);
  156. Vector2 tangent_to_curve;
  157. if (ahead_pos == pos) {
  158. // This will happen at the end of non-looping or non-closed paths.
  159. // We'll try a look behind instead, in order to get a meaningful angle.
  160. tangent_to_curve =
  161. (pos - c->interpolate_baked(offset - lookahead, cubic)).normalized();
  162. } else {
  163. tangent_to_curve = (ahead_pos - pos).normalized();
  164. }
  165. Vector2 normal_of_curve = -tangent_to_curve.tangent();
  166. pos += tangent_to_curve * h_offset;
  167. pos += normal_of_curve * v_offset;
  168. set_rotation(tangent_to_curve.angle());
  169. } else {
  170. pos.x += h_offset;
  171. pos.y += v_offset;
  172. }
  173. set_position(pos);
  174. }
  175. void PathFollow2D::_notification(int p_what) {
  176. switch (p_what) {
  177. case NOTIFICATION_ENTER_TREE: {
  178. path = Object::cast_to<Path2D>(get_parent());
  179. if (path) {
  180. _update_transform();
  181. }
  182. } break;
  183. case NOTIFICATION_EXIT_TREE: {
  184. path = NULL;
  185. } break;
  186. }
  187. }
  188. void PathFollow2D::set_cubic_interpolation(bool p_enable) {
  189. cubic = p_enable;
  190. }
  191. bool PathFollow2D::get_cubic_interpolation() const {
  192. return cubic;
  193. }
  194. void PathFollow2D::_validate_property(PropertyInfo &property) const {
  195. if (property.name == "offset") {
  196. float max = 10000;
  197. if (path && path->get_curve().is_valid())
  198. max = path->get_curve()->get_baked_length();
  199. property.hint_string = "0," + rtos(max) + ",0.01,or_lesser,or_greater";
  200. }
  201. }
  202. String PathFollow2D::get_configuration_warning() const {
  203. if (!is_visible_in_tree() || !is_inside_tree())
  204. return String();
  205. String warning = Node2D::get_configuration_warning();
  206. if (!Object::cast_to<Path2D>(get_parent())) {
  207. if (warning != String()) {
  208. warning += "\n\n";
  209. }
  210. warning += TTR("PathFollow2D only works when set as a child of a Path2D node.");
  211. }
  212. return warning;
  213. }
  214. void PathFollow2D::_bind_methods() {
  215. ClassDB::bind_method(D_METHOD("set_offset", "offset"), &PathFollow2D::set_offset);
  216. ClassDB::bind_method(D_METHOD("get_offset"), &PathFollow2D::get_offset);
  217. ClassDB::bind_method(D_METHOD("set_h_offset", "h_offset"), &PathFollow2D::set_h_offset);
  218. ClassDB::bind_method(D_METHOD("get_h_offset"), &PathFollow2D::get_h_offset);
  219. ClassDB::bind_method(D_METHOD("set_v_offset", "v_offset"), &PathFollow2D::set_v_offset);
  220. ClassDB::bind_method(D_METHOD("get_v_offset"), &PathFollow2D::get_v_offset);
  221. ClassDB::bind_method(D_METHOD("set_unit_offset", "unit_offset"), &PathFollow2D::set_unit_offset);
  222. ClassDB::bind_method(D_METHOD("get_unit_offset"), &PathFollow2D::get_unit_offset);
  223. ClassDB::bind_method(D_METHOD("set_rotate", "enable"), &PathFollow2D::set_rotate);
  224. ClassDB::bind_method(D_METHOD("is_rotating"), &PathFollow2D::is_rotating);
  225. ClassDB::bind_method(D_METHOD("set_cubic_interpolation", "enable"), &PathFollow2D::set_cubic_interpolation);
  226. ClassDB::bind_method(D_METHOD("get_cubic_interpolation"), &PathFollow2D::get_cubic_interpolation);
  227. ClassDB::bind_method(D_METHOD("set_loop", "loop"), &PathFollow2D::set_loop);
  228. ClassDB::bind_method(D_METHOD("has_loop"), &PathFollow2D::has_loop);
  229. ClassDB::bind_method(D_METHOD("set_lookahead", "lookahead"), &PathFollow2D::set_lookahead);
  230. ClassDB::bind_method(D_METHOD("get_lookahead"), &PathFollow2D::get_lookahead);
  231. ADD_PROPERTY(PropertyInfo(Variant::REAL, "offset", PROPERTY_HINT_RANGE, "0,10000,0.01,or_lesser,or_greater"), "set_offset", "get_offset");
  232. ADD_PROPERTY(PropertyInfo(Variant::REAL, "unit_offset", PROPERTY_HINT_RANGE, "0,1,0.0001,or_lesser,or_greater", PROPERTY_USAGE_EDITOR), "set_unit_offset", "get_unit_offset");
  233. ADD_PROPERTY(PropertyInfo(Variant::REAL, "h_offset"), "set_h_offset", "get_h_offset");
  234. ADD_PROPERTY(PropertyInfo(Variant::REAL, "v_offset"), "set_v_offset", "get_v_offset");
  235. ADD_PROPERTY(PropertyInfo(Variant::BOOL, "rotate"), "set_rotate", "is_rotating");
  236. ADD_PROPERTY(PropertyInfo(Variant::BOOL, "cubic_interp"), "set_cubic_interpolation", "get_cubic_interpolation");
  237. ADD_PROPERTY(PropertyInfo(Variant::BOOL, "loop"), "set_loop", "has_loop");
  238. ADD_PROPERTY(PropertyInfo(Variant::REAL, "lookahead", PROPERTY_HINT_RANGE, "0.001,1024.0,0.001"), "set_lookahead", "get_lookahead");
  239. }
  240. void PathFollow2D::set_offset(float p_offset) {
  241. offset = p_offset;
  242. if (path) {
  243. if (path->get_curve().is_valid()) {
  244. float path_length = path->get_curve()->get_baked_length();
  245. if (loop) {
  246. offset = Math::fposmod(offset, path_length);
  247. if (!Math::is_zero_approx(p_offset) && Math::is_zero_approx(offset)) {
  248. offset = path_length;
  249. }
  250. } else {
  251. offset = CLAMP(offset, 0, path_length);
  252. }
  253. }
  254. _update_transform();
  255. }
  256. _change_notify("offset");
  257. _change_notify("unit_offset");
  258. }
  259. void PathFollow2D::set_h_offset(float p_h_offset) {
  260. h_offset = p_h_offset;
  261. if (path)
  262. _update_transform();
  263. }
  264. float PathFollow2D::get_h_offset() const {
  265. return h_offset;
  266. }
  267. void PathFollow2D::set_v_offset(float p_v_offset) {
  268. v_offset = p_v_offset;
  269. if (path)
  270. _update_transform();
  271. }
  272. float PathFollow2D::get_v_offset() const {
  273. return v_offset;
  274. }
  275. float PathFollow2D::get_offset() const {
  276. return offset;
  277. }
  278. void PathFollow2D::set_unit_offset(float p_unit_offset) {
  279. if (path && path->get_curve().is_valid() && path->get_curve()->get_baked_length())
  280. set_offset(p_unit_offset * path->get_curve()->get_baked_length());
  281. }
  282. float PathFollow2D::get_unit_offset() const {
  283. if (path && path->get_curve().is_valid() && path->get_curve()->get_baked_length())
  284. return get_offset() / path->get_curve()->get_baked_length();
  285. else
  286. return 0;
  287. }
  288. void PathFollow2D::set_lookahead(float p_lookahead) {
  289. lookahead = p_lookahead;
  290. }
  291. float PathFollow2D::get_lookahead() const {
  292. return lookahead;
  293. }
  294. void PathFollow2D::set_rotate(bool p_rotate) {
  295. rotate = p_rotate;
  296. _update_transform();
  297. }
  298. bool PathFollow2D::is_rotating() const {
  299. return rotate;
  300. }
  301. void PathFollow2D::set_loop(bool p_loop) {
  302. loop = p_loop;
  303. }
  304. bool PathFollow2D::has_loop() const {
  305. return loop;
  306. }
  307. PathFollow2D::PathFollow2D() {
  308. offset = 0;
  309. h_offset = 0;
  310. v_offset = 0;
  311. path = NULL;
  312. rotate = true;
  313. cubic = true;
  314. loop = true;
  315. lookahead = 4;
  316. }