path_2d.cpp 11 KB

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