2
0

graph_edit.cpp 78 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402
  1. /*************************************************************************/
  2. /* graph_edit.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 "graph_edit.h"
  31. #include "core/input/input.h"
  32. #include "core/math/math_funcs.h"
  33. #include "core/os/keyboard.h"
  34. #include "scene/gui/box_container.h"
  35. #include "scene/gui/button.h"
  36. #ifdef TOOLS_ENABLED
  37. #include "editor/editor_scale.h"
  38. #endif
  39. constexpr int MINIMAP_OFFSET = 12;
  40. constexpr int MINIMAP_PADDING = 5;
  41. bool GraphEditFilter::has_point(const Point2 &p_point) const {
  42. return ge->_filter_input(p_point);
  43. }
  44. GraphEditFilter::GraphEditFilter(GraphEdit *p_edit) {
  45. ge = p_edit;
  46. }
  47. void GraphEditMinimap::_bind_methods() {
  48. ClassDB::bind_method(D_METHOD("_gui_input"), &GraphEditMinimap::_gui_input);
  49. }
  50. GraphEditMinimap::GraphEditMinimap(GraphEdit *p_edit) {
  51. ge = p_edit;
  52. graph_proportions = Vector2(1, 1);
  53. graph_padding = Vector2(0, 0);
  54. camera_position = Vector2(100, 50);
  55. camera_size = Vector2(200, 200);
  56. minimap_padding = Vector2(MINIMAP_PADDING, MINIMAP_PADDING);
  57. minimap_offset = minimap_padding + _convert_from_graph_position(graph_padding);
  58. is_pressing = false;
  59. is_resizing = false;
  60. }
  61. void GraphEditMinimap::update_minimap() {
  62. Vector2 graph_offset = _get_graph_offset();
  63. Vector2 graph_size = _get_graph_size();
  64. camera_position = ge->get_scroll_ofs() - graph_offset;
  65. camera_size = ge->get_size();
  66. Vector2 render_size = _get_render_size();
  67. float target_ratio = render_size.x / render_size.y;
  68. float graph_ratio = graph_size.x / graph_size.y;
  69. graph_proportions = graph_size;
  70. graph_padding = Vector2(0, 0);
  71. if (graph_ratio > target_ratio) {
  72. graph_proportions.x = graph_size.x;
  73. graph_proportions.y = graph_size.x / target_ratio;
  74. graph_padding.y = Math::abs(graph_size.y - graph_proportions.y) / 2;
  75. } else {
  76. graph_proportions.x = graph_size.y * target_ratio;
  77. graph_proportions.y = graph_size.y;
  78. graph_padding.x = Math::abs(graph_size.x - graph_proportions.x) / 2;
  79. }
  80. // This centers minimap inside the minimap rectangle.
  81. minimap_offset = minimap_padding + _convert_from_graph_position(graph_padding);
  82. }
  83. Rect2 GraphEditMinimap::get_camera_rect() {
  84. Vector2 camera_center = _convert_from_graph_position(camera_position + camera_size / 2) + minimap_offset;
  85. Vector2 camera_viewport = _convert_from_graph_position(camera_size);
  86. Vector2 camera_position = (camera_center - camera_viewport / 2);
  87. return Rect2(camera_position, camera_viewport);
  88. }
  89. Vector2 GraphEditMinimap::_get_render_size() {
  90. if (!is_inside_tree()) {
  91. return Vector2(0, 0);
  92. }
  93. return get_size() - 2 * minimap_padding;
  94. }
  95. Vector2 GraphEditMinimap::_get_graph_offset() {
  96. return Vector2(ge->h_scroll->get_min(), ge->v_scroll->get_min());
  97. }
  98. Vector2 GraphEditMinimap::_get_graph_size() {
  99. Vector2 graph_size = Vector2(ge->h_scroll->get_max(), ge->v_scroll->get_max()) - Vector2(ge->h_scroll->get_min(), ge->v_scroll->get_min());
  100. if (graph_size.x == 0) {
  101. graph_size.x = 1;
  102. }
  103. if (graph_size.y == 0) {
  104. graph_size.y = 1;
  105. }
  106. return graph_size;
  107. }
  108. Vector2 GraphEditMinimap::_convert_from_graph_position(const Vector2 &p_position) {
  109. Vector2 map_position = Vector2(0, 0);
  110. Vector2 render_size = _get_render_size();
  111. map_position.x = p_position.x * render_size.x / graph_proportions.x;
  112. map_position.y = p_position.y * render_size.y / graph_proportions.y;
  113. return map_position;
  114. }
  115. Vector2 GraphEditMinimap::_convert_to_graph_position(const Vector2 &p_position) {
  116. Vector2 graph_position = Vector2(0, 0);
  117. Vector2 render_size = _get_render_size();
  118. graph_position.x = p_position.x * graph_proportions.x / render_size.x;
  119. graph_position.y = p_position.y * graph_proportions.y / render_size.y;
  120. return graph_position;
  121. }
  122. void GraphEditMinimap::_gui_input(const Ref<InputEvent> &p_ev) {
  123. ERR_FAIL_COND(p_ev.is_null());
  124. if (!ge->is_minimap_enabled()) {
  125. return;
  126. }
  127. Ref<InputEventMouseButton> mb = p_ev;
  128. Ref<InputEventMouseMotion> mm = p_ev;
  129. if (mb.is_valid() && mb->get_button_index() == MOUSE_BUTTON_LEFT) {
  130. if (mb->is_pressed()) {
  131. is_pressing = true;
  132. Ref<Texture2D> resizer = get_theme_icon(SNAME("resizer"));
  133. Rect2 resizer_hitbox = Rect2(Point2(), resizer->get_size());
  134. if (resizer_hitbox.has_point(mb->get_position())) {
  135. is_resizing = true;
  136. } else {
  137. Vector2 click_position = _convert_to_graph_position(mb->get_position() - minimap_padding) - graph_padding;
  138. _adjust_graph_scroll(click_position);
  139. }
  140. } else {
  141. is_pressing = false;
  142. is_resizing = false;
  143. }
  144. accept_event();
  145. } else if (mm.is_valid() && is_pressing) {
  146. if (is_resizing) {
  147. // Prevent setting minimap wider than GraphEdit
  148. Vector2 new_minimap_size;
  149. new_minimap_size.x = MIN(get_size().x - mm->get_relative().x, ge->get_size().x - 2.0 * minimap_padding.x);
  150. new_minimap_size.y = MIN(get_size().y - mm->get_relative().y, ge->get_size().y - 2.0 * minimap_padding.y);
  151. ge->set_minimap_size(new_minimap_size);
  152. update();
  153. } else {
  154. Vector2 click_position = _convert_to_graph_position(mm->get_position() - minimap_padding) - graph_padding;
  155. _adjust_graph_scroll(click_position);
  156. }
  157. accept_event();
  158. }
  159. }
  160. void GraphEditMinimap::_adjust_graph_scroll(const Vector2 &p_offset) {
  161. Vector2 graph_offset = _get_graph_offset();
  162. ge->set_scroll_ofs(p_offset + graph_offset - camera_size / 2);
  163. }
  164. Error GraphEdit::connect_node(const StringName &p_from, int p_from_port, const StringName &p_to, int p_to_port) {
  165. if (is_node_connected(p_from, p_from_port, p_to, p_to_port)) {
  166. return OK;
  167. }
  168. Connection c;
  169. c.from = p_from;
  170. c.from_port = p_from_port;
  171. c.to = p_to;
  172. c.to_port = p_to_port;
  173. c.activity = 0;
  174. connections.push_back(c);
  175. top_layer->update();
  176. minimap->update();
  177. update();
  178. connections_layer->update();
  179. return OK;
  180. }
  181. bool GraphEdit::is_node_connected(const StringName &p_from, int p_from_port, const StringName &p_to, int p_to_port) {
  182. for (const Connection &E : connections) {
  183. if (E.from == p_from && E.from_port == p_from_port && E.to == p_to && E.to_port == p_to_port) {
  184. return true;
  185. }
  186. }
  187. return false;
  188. }
  189. void GraphEdit::disconnect_node(const StringName &p_from, int p_from_port, const StringName &p_to, int p_to_port) {
  190. for (const List<Connection>::Element *E = connections.front(); E; E = E->next()) {
  191. if (E->get().from == p_from && E->get().from_port == p_from_port && E->get().to == p_to && E->get().to_port == p_to_port) {
  192. connections.erase(E);
  193. top_layer->update();
  194. minimap->update();
  195. update();
  196. connections_layer->update();
  197. return;
  198. }
  199. }
  200. }
  201. void GraphEdit::get_connection_list(List<Connection> *r_connections) const {
  202. *r_connections = connections;
  203. }
  204. void GraphEdit::set_scroll_ofs(const Vector2 &p_ofs) {
  205. setting_scroll_ofs = true;
  206. h_scroll->set_value(p_ofs.x);
  207. v_scroll->set_value(p_ofs.y);
  208. _update_scroll();
  209. setting_scroll_ofs = false;
  210. }
  211. Vector2 GraphEdit::get_scroll_ofs() const {
  212. return Vector2(h_scroll->get_value(), v_scroll->get_value());
  213. }
  214. void GraphEdit::_scroll_moved(double) {
  215. if (!awaiting_scroll_offset_update) {
  216. call_deferred(SNAME("_update_scroll_offset"));
  217. awaiting_scroll_offset_update = true;
  218. }
  219. top_layer->update();
  220. minimap->update();
  221. update();
  222. if (!setting_scroll_ofs) { //in godot, signals on change value are avoided as a convention
  223. emit_signal(SNAME("scroll_offset_changed"), get_scroll_ofs());
  224. }
  225. }
  226. void GraphEdit::_update_scroll_offset() {
  227. set_block_minimum_size_adjust(true);
  228. for (int i = 0; i < get_child_count(); i++) {
  229. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  230. if (!gn) {
  231. continue;
  232. }
  233. Point2 pos = gn->get_position_offset() * zoom;
  234. pos -= Point2(h_scroll->get_value(), v_scroll->get_value());
  235. gn->set_position(pos);
  236. if (gn->get_scale() != Vector2(zoom, zoom)) {
  237. gn->set_scale(Vector2(zoom, zoom));
  238. }
  239. }
  240. connections_layer->set_position(-Point2(h_scroll->get_value(), v_scroll->get_value()));
  241. set_block_minimum_size_adjust(false);
  242. awaiting_scroll_offset_update = false;
  243. }
  244. void GraphEdit::_update_scroll() {
  245. if (updating) {
  246. return;
  247. }
  248. updating = true;
  249. set_block_minimum_size_adjust(true);
  250. Rect2 screen;
  251. for (int i = 0; i < get_child_count(); i++) {
  252. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  253. if (!gn) {
  254. continue;
  255. }
  256. Rect2 r;
  257. r.position = gn->get_position_offset() * zoom;
  258. r.size = gn->get_size() * zoom;
  259. screen = screen.merge(r);
  260. }
  261. screen.position -= get_size();
  262. screen.size += get_size() * 2.0;
  263. h_scroll->set_min(screen.position.x);
  264. h_scroll->set_max(screen.position.x + screen.size.x);
  265. h_scroll->set_page(get_size().x);
  266. if (h_scroll->get_max() - h_scroll->get_min() <= h_scroll->get_page()) {
  267. h_scroll->hide();
  268. } else {
  269. h_scroll->show();
  270. }
  271. v_scroll->set_min(screen.position.y);
  272. v_scroll->set_max(screen.position.y + screen.size.y);
  273. v_scroll->set_page(get_size().y);
  274. if (v_scroll->get_max() - v_scroll->get_min() <= v_scroll->get_page()) {
  275. v_scroll->hide();
  276. } else {
  277. v_scroll->show();
  278. }
  279. Size2 hmin = h_scroll->get_combined_minimum_size();
  280. Size2 vmin = v_scroll->get_combined_minimum_size();
  281. // Avoid scrollbar overlapping.
  282. h_scroll->set_anchor_and_offset(SIDE_RIGHT, ANCHOR_END, v_scroll->is_visible() ? -vmin.width : 0);
  283. v_scroll->set_anchor_and_offset(SIDE_BOTTOM, ANCHOR_END, h_scroll->is_visible() ? -hmin.height : 0);
  284. set_block_minimum_size_adjust(false);
  285. if (!awaiting_scroll_offset_update) {
  286. call_deferred(SNAME("_update_scroll_offset"));
  287. awaiting_scroll_offset_update = true;
  288. }
  289. updating = false;
  290. }
  291. void GraphEdit::_graph_node_raised(Node *p_gn) {
  292. GraphNode *gn = Object::cast_to<GraphNode>(p_gn);
  293. ERR_FAIL_COND(!gn);
  294. if (gn->is_comment()) {
  295. move_child(gn, 0);
  296. } else {
  297. gn->raise();
  298. }
  299. int first_not_comment = 0;
  300. for (int i = 0; i < get_child_count(); i++) {
  301. GraphNode *gn2 = Object::cast_to<GraphNode>(get_child(i));
  302. if (gn2 && !gn2->is_comment()) {
  303. first_not_comment = i;
  304. break;
  305. }
  306. }
  307. move_child(connections_layer, first_not_comment);
  308. top_layer->raise();
  309. emit_signal(SNAME("node_selected"), p_gn);
  310. }
  311. void GraphEdit::_graph_node_moved(Node *p_gn) {
  312. GraphNode *gn = Object::cast_to<GraphNode>(p_gn);
  313. ERR_FAIL_COND(!gn);
  314. top_layer->update();
  315. minimap->update();
  316. update();
  317. connections_layer->update();
  318. }
  319. void GraphEdit::_graph_node_slot_updated(int p_index, Node *p_gn) {
  320. GraphNode *gn = Object::cast_to<GraphNode>(p_gn);
  321. ERR_FAIL_COND(!gn);
  322. top_layer->update();
  323. minimap->update();
  324. update();
  325. connections_layer->update();
  326. }
  327. void GraphEdit::add_child_notify(Node *p_child) {
  328. Control::add_child_notify(p_child);
  329. top_layer->call_deferred(SNAME("raise")); // Top layer always on top!
  330. GraphNode *gn = Object::cast_to<GraphNode>(p_child);
  331. if (gn) {
  332. gn->set_scale(Vector2(zoom, zoom));
  333. gn->connect("position_offset_changed", callable_mp(this, &GraphEdit::_graph_node_moved), varray(gn));
  334. gn->connect("slot_updated", callable_mp(this, &GraphEdit::_graph_node_slot_updated), varray(gn));
  335. gn->connect("raise_request", callable_mp(this, &GraphEdit::_graph_node_raised), varray(gn));
  336. gn->connect("item_rect_changed", callable_mp((CanvasItem *)connections_layer, &CanvasItem::update));
  337. gn->connect("item_rect_changed", callable_mp((CanvasItem *)minimap, &GraphEditMinimap::update));
  338. _graph_node_moved(gn);
  339. gn->set_mouse_filter(MOUSE_FILTER_PASS);
  340. }
  341. }
  342. void GraphEdit::remove_child_notify(Node *p_child) {
  343. Control::remove_child_notify(p_child);
  344. if (p_child == top_layer) {
  345. top_layer = nullptr;
  346. minimap = nullptr;
  347. } else if (p_child == connections_layer) {
  348. connections_layer = nullptr;
  349. }
  350. if (top_layer != nullptr && is_inside_tree()) {
  351. top_layer->call_deferred(SNAME("raise")); // Top layer always on top!
  352. }
  353. GraphNode *gn = Object::cast_to<GraphNode>(p_child);
  354. if (gn) {
  355. gn->disconnect("position_offset_changed", callable_mp(this, &GraphEdit::_graph_node_moved));
  356. gn->disconnect("slot_updated", callable_mp(this, &GraphEdit::_graph_node_slot_updated));
  357. gn->disconnect("raise_request", callable_mp(this, &GraphEdit::_graph_node_raised));
  358. // In case of the whole GraphEdit being destroyed these references can already be freed.
  359. if (connections_layer != nullptr && connections_layer->is_inside_tree()) {
  360. gn->disconnect("item_rect_changed", callable_mp((CanvasItem *)connections_layer, &CanvasItem::update));
  361. }
  362. if (minimap != nullptr && minimap->is_inside_tree()) {
  363. gn->disconnect("item_rect_changed", callable_mp((CanvasItem *)minimap, &GraphEditMinimap::update));
  364. }
  365. }
  366. }
  367. void GraphEdit::_notification(int p_what) {
  368. if (p_what == NOTIFICATION_ENTER_TREE || p_what == NOTIFICATION_THEME_CHANGED) {
  369. port_grab_distance_horizontal = get_theme_constant(SNAME("port_grab_distance_horizontal"));
  370. port_grab_distance_vertical = get_theme_constant(SNAME("port_grab_distance_vertical"));
  371. zoom_minus->set_icon(get_theme_icon(SNAME("minus")));
  372. zoom_reset->set_icon(get_theme_icon(SNAME("reset")));
  373. zoom_plus->set_icon(get_theme_icon(SNAME("more")));
  374. snap_button->set_icon(get_theme_icon(SNAME("snap")));
  375. minimap_button->set_icon(get_theme_icon(SNAME("minimap")));
  376. layout_button->set_icon(get_theme_icon(SNAME("layout")));
  377. }
  378. if (p_what == NOTIFICATION_READY) {
  379. Size2 hmin = h_scroll->get_combined_minimum_size();
  380. Size2 vmin = v_scroll->get_combined_minimum_size();
  381. h_scroll->set_anchor_and_offset(SIDE_LEFT, ANCHOR_BEGIN, 0);
  382. h_scroll->set_anchor_and_offset(SIDE_RIGHT, ANCHOR_END, 0);
  383. h_scroll->set_anchor_and_offset(SIDE_TOP, ANCHOR_END, -hmin.height);
  384. h_scroll->set_anchor_and_offset(SIDE_BOTTOM, ANCHOR_END, 0);
  385. v_scroll->set_anchor_and_offset(SIDE_LEFT, ANCHOR_END, -vmin.width);
  386. v_scroll->set_anchor_and_offset(SIDE_RIGHT, ANCHOR_END, 0);
  387. v_scroll->set_anchor_and_offset(SIDE_TOP, ANCHOR_BEGIN, 0);
  388. v_scroll->set_anchor_and_offset(SIDE_BOTTOM, ANCHOR_END, 0);
  389. }
  390. if (p_what == NOTIFICATION_DRAW) {
  391. draw_style_box(get_theme_stylebox(SNAME("bg")), Rect2(Point2(), get_size()));
  392. if (is_using_snap()) {
  393. //draw grid
  394. int snap = get_snap();
  395. Vector2 offset = get_scroll_ofs() / zoom;
  396. Size2 size = get_size() / zoom;
  397. Point2i from = (offset / float(snap)).floor();
  398. Point2i len = (size / float(snap)).floor() + Vector2(1, 1);
  399. Color grid_minor = get_theme_color(SNAME("grid_minor"));
  400. Color grid_major = get_theme_color(SNAME("grid_major"));
  401. for (int i = from.x; i < from.x + len.x; i++) {
  402. Color color;
  403. if (ABS(i) % 10 == 0) {
  404. color = grid_major;
  405. } else {
  406. color = grid_minor;
  407. }
  408. float base_ofs = i * snap * zoom - offset.x * zoom;
  409. draw_line(Vector2(base_ofs, 0), Vector2(base_ofs, get_size().height), color);
  410. }
  411. for (int i = from.y; i < from.y + len.y; i++) {
  412. Color color;
  413. if (ABS(i) % 10 == 0) {
  414. color = grid_major;
  415. } else {
  416. color = grid_minor;
  417. }
  418. float base_ofs = i * snap * zoom - offset.y * zoom;
  419. draw_line(Vector2(0, base_ofs), Vector2(get_size().width, base_ofs), color);
  420. }
  421. }
  422. }
  423. if (p_what == NOTIFICATION_RESIZED) {
  424. _update_scroll();
  425. top_layer->update();
  426. minimap->update();
  427. }
  428. }
  429. bool GraphEdit::_filter_input(const Point2 &p_point) {
  430. Ref<Texture2D> port = get_theme_icon(SNAME("port"), SNAME("GraphNode"));
  431. Vector2i port_size = Vector2i(port->get_width(), port->get_height());
  432. for (int i = get_child_count() - 1; i >= 0; i--) {
  433. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  434. if (!gn) {
  435. continue;
  436. }
  437. for (int j = 0; j < gn->get_connection_output_count(); j++) {
  438. Vector2 pos = gn->get_connection_output_position(j) + gn->get_position();
  439. if (is_in_hot_zone(pos / zoom, p_point / zoom, port_size, false)) {
  440. return true;
  441. }
  442. }
  443. for (int j = 0; j < gn->get_connection_input_count(); j++) {
  444. Vector2 pos = gn->get_connection_input_position(j) + gn->get_position();
  445. if (is_in_hot_zone(pos / zoom, p_point / zoom, port_size, true)) {
  446. return true;
  447. }
  448. }
  449. }
  450. return false;
  451. }
  452. void GraphEdit::_top_layer_input(const Ref<InputEvent> &p_ev) {
  453. Ref<InputEventMouseButton> mb = p_ev;
  454. if (mb.is_valid() && mb->get_button_index() == MOUSE_BUTTON_LEFT && mb->is_pressed()) {
  455. Ref<Texture2D> port = get_theme_icon(SNAME("port"), SNAME("GraphNode"));
  456. Vector2i port_size = Vector2i(port->get_width(), port->get_height());
  457. connecting_valid = false;
  458. click_pos = mb->get_position() / zoom;
  459. for (int i = get_child_count() - 1; i >= 0; i--) {
  460. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  461. if (!gn) {
  462. continue;
  463. }
  464. for (int j = 0; j < gn->get_connection_output_count(); j++) {
  465. Vector2 pos = gn->get_connection_output_position(j) + gn->get_position();
  466. if (is_in_hot_zone(pos / zoom, click_pos, port_size, false)) {
  467. if (valid_left_disconnect_types.has(gn->get_connection_output_type(j))) {
  468. //check disconnect
  469. for (const Connection &E : connections) {
  470. if (E.from == gn->get_name() && E.from_port == j) {
  471. Node *to = get_node(String(E.to));
  472. if (Object::cast_to<GraphNode>(to)) {
  473. connecting_from = E.to;
  474. connecting_index = E.to_port;
  475. connecting_out = false;
  476. connecting_type = Object::cast_to<GraphNode>(to)->get_connection_input_type(E.to_port);
  477. connecting_color = Object::cast_to<GraphNode>(to)->get_connection_input_color(E.to_port);
  478. connecting_target = false;
  479. connecting_to = pos;
  480. just_disconnected = true;
  481. emit_signal(SNAME("disconnection_request"), E.from, E.from_port, E.to, E.to_port);
  482. to = get_node(String(connecting_from)); //maybe it was erased
  483. if (Object::cast_to<GraphNode>(to)) {
  484. connecting = true;
  485. }
  486. return;
  487. }
  488. }
  489. }
  490. }
  491. connecting = true;
  492. connecting_from = gn->get_name();
  493. connecting_index = j;
  494. connecting_out = true;
  495. connecting_type = gn->get_connection_output_type(j);
  496. connecting_color = gn->get_connection_output_color(j);
  497. connecting_target = false;
  498. connecting_to = pos;
  499. just_disconnected = false;
  500. return;
  501. }
  502. }
  503. for (int j = 0; j < gn->get_connection_input_count(); j++) {
  504. Vector2 pos = gn->get_connection_input_position(j) + gn->get_position();
  505. if (is_in_hot_zone(pos / zoom, click_pos, port_size, true)) {
  506. if (right_disconnects || valid_right_disconnect_types.has(gn->get_connection_input_type(j))) {
  507. //check disconnect
  508. for (const Connection &E : connections) {
  509. if (E.to == gn->get_name() && E.to_port == j) {
  510. Node *fr = get_node(String(E.from));
  511. if (Object::cast_to<GraphNode>(fr)) {
  512. connecting_from = E.from;
  513. connecting_index = E.from_port;
  514. connecting_out = true;
  515. connecting_type = Object::cast_to<GraphNode>(fr)->get_connection_output_type(E.from_port);
  516. connecting_color = Object::cast_to<GraphNode>(fr)->get_connection_output_color(E.from_port);
  517. connecting_target = false;
  518. connecting_to = pos;
  519. just_disconnected = true;
  520. emit_signal(SNAME("disconnection_request"), E.from, E.from_port, E.to, E.to_port);
  521. fr = get_node(String(connecting_from)); //maybe it was erased
  522. if (Object::cast_to<GraphNode>(fr)) {
  523. connecting = true;
  524. }
  525. return;
  526. }
  527. }
  528. }
  529. }
  530. connecting = true;
  531. connecting_from = gn->get_name();
  532. connecting_index = j;
  533. connecting_out = false;
  534. connecting_type = gn->get_connection_input_type(j);
  535. connecting_color = gn->get_connection_input_color(j);
  536. connecting_target = false;
  537. connecting_to = pos;
  538. just_disconnected = false;
  539. return;
  540. }
  541. }
  542. }
  543. }
  544. Ref<InputEventMouseMotion> mm = p_ev;
  545. if (mm.is_valid() && connecting) {
  546. connecting_to = mm->get_position();
  547. connecting_target = false;
  548. top_layer->update();
  549. minimap->update();
  550. connecting_valid = just_disconnected || click_pos.distance_to(connecting_to / zoom) > 20.0;
  551. if (connecting_valid) {
  552. Ref<Texture2D> port = get_theme_icon(SNAME("port"), SNAME("GraphNode"));
  553. Vector2i port_size = Vector2i(port->get_width(), port->get_height());
  554. Vector2 mpos = mm->get_position() / zoom;
  555. for (int i = get_child_count() - 1; i >= 0; i--) {
  556. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  557. if (!gn) {
  558. continue;
  559. }
  560. if (!connecting_out) {
  561. for (int j = 0; j < gn->get_connection_output_count(); j++) {
  562. Vector2 pos = gn->get_connection_output_position(j) + gn->get_position();
  563. int type = gn->get_connection_output_type(j);
  564. if ((type == connecting_type || valid_connection_types.has(ConnType(type, connecting_type))) && is_in_hot_zone(pos / zoom, mpos, port_size, false)) {
  565. connecting_target = true;
  566. connecting_to = pos;
  567. connecting_target_to = gn->get_name();
  568. connecting_target_index = j;
  569. return;
  570. }
  571. }
  572. } else {
  573. for (int j = 0; j < gn->get_connection_input_count(); j++) {
  574. Vector2 pos = gn->get_connection_input_position(j) + gn->get_position();
  575. int type = gn->get_connection_input_type(j);
  576. if ((type == connecting_type || valid_connection_types.has(ConnType(type, connecting_type))) && is_in_hot_zone(pos / zoom, mpos, port_size, true)) {
  577. connecting_target = true;
  578. connecting_to = pos;
  579. connecting_target_to = gn->get_name();
  580. connecting_target_index = j;
  581. return;
  582. }
  583. }
  584. }
  585. }
  586. }
  587. }
  588. if (mb.is_valid() && mb->get_button_index() == MOUSE_BUTTON_LEFT && !mb->is_pressed()) {
  589. if (connecting_valid) {
  590. if (connecting && connecting_target) {
  591. String from = connecting_from;
  592. int from_slot = connecting_index;
  593. String to = connecting_target_to;
  594. int to_slot = connecting_target_index;
  595. if (!connecting_out) {
  596. SWAP(from, to);
  597. SWAP(from_slot, to_slot);
  598. }
  599. emit_signal(SNAME("connection_request"), from, from_slot, to, to_slot);
  600. } else if (!just_disconnected) {
  601. String from = connecting_from;
  602. int from_slot = connecting_index;
  603. Vector2 ofs = Vector2(mb->get_position().x, mb->get_position().y);
  604. if (!connecting_out) {
  605. emit_signal(SNAME("connection_from_empty"), from, from_slot, ofs);
  606. } else {
  607. emit_signal(SNAME("connection_to_empty"), from, from_slot, ofs);
  608. }
  609. }
  610. }
  611. connecting = false;
  612. top_layer->update();
  613. minimap->update();
  614. update();
  615. connections_layer->update();
  616. }
  617. }
  618. bool GraphEdit::_check_clickable_control(Control *p_control, const Vector2 &pos) {
  619. if (p_control->is_set_as_top_level() || !p_control->is_visible()) {
  620. return false;
  621. }
  622. if (!p_control->has_point(pos) || p_control->get_mouse_filter() == MOUSE_FILTER_IGNORE) {
  623. //test children
  624. for (int i = 0; i < p_control->get_child_count(); i++) {
  625. Control *subchild = Object::cast_to<Control>(p_control->get_child(i));
  626. if (!subchild) {
  627. continue;
  628. }
  629. if (_check_clickable_control(subchild, pos - subchild->get_position())) {
  630. return true;
  631. }
  632. }
  633. return false;
  634. } else {
  635. return true;
  636. }
  637. }
  638. bool GraphEdit::is_in_hot_zone(const Vector2 &pos, const Vector2 &p_mouse_pos, const Vector2i &p_port_size, bool p_left) {
  639. if (p_left) {
  640. if (!Rect2(
  641. pos.x - p_port_size.x / 2 - port_grab_distance_horizontal,
  642. pos.y - p_port_size.y / 2 - port_grab_distance_vertical / 2,
  643. p_port_size.x + port_grab_distance_horizontal,
  644. p_port_size.y + port_grab_distance_vertical)
  645. .has_point(p_mouse_pos)) {
  646. return false;
  647. }
  648. } else {
  649. if (!Rect2(
  650. pos.x - p_port_size.x / 2,
  651. pos.y - p_port_size.y / 2 - port_grab_distance_vertical / 2,
  652. p_port_size.x + port_grab_distance_horizontal,
  653. p_port_size.y + port_grab_distance_vertical)
  654. .has_point(p_mouse_pos)) {
  655. return false;
  656. }
  657. }
  658. for (int i = 0; i < get_child_count(); i++) {
  659. Control *child = Object::cast_to<Control>(get_child(i));
  660. if (!child) {
  661. continue;
  662. }
  663. Rect2 rect = child->get_rect();
  664. // To prevent intersections with other nodes.
  665. rect.position *= zoom;
  666. rect.size *= zoom;
  667. if (rect.has_point(p_mouse_pos)) {
  668. //check sub-controls
  669. Vector2 subpos = p_mouse_pos - rect.position;
  670. for (int j = 0; j < child->get_child_count(); j++) {
  671. Control *subchild = Object::cast_to<Control>(child->get_child(j));
  672. if (!subchild) {
  673. continue;
  674. }
  675. if (_check_clickable_control(subchild, subpos - subchild->get_position())) {
  676. return false;
  677. }
  678. }
  679. }
  680. }
  681. return true;
  682. }
  683. template <class Vector2>
  684. static _FORCE_INLINE_ Vector2 _bezier_interp(real_t t, Vector2 start, Vector2 control_1, Vector2 control_2, Vector2 end) {
  685. /* Formula from Wikipedia article on Bezier curves. */
  686. real_t omt = (1.0 - t);
  687. real_t omt2 = omt * omt;
  688. real_t omt3 = omt2 * omt;
  689. real_t t2 = t * t;
  690. real_t t3 = t2 * t;
  691. return start * omt3 + control_1 * omt2 * t * 3.0 + control_2 * omt * t2 * 3.0 + end * t3;
  692. }
  693. void GraphEdit::_bake_segment2d(Vector<Vector2> &points, Vector<Color> &colors, float p_begin, float p_end, const Vector2 &p_a, const Vector2 &p_out, const Vector2 &p_b, const Vector2 &p_in, int p_depth, int p_min_depth, int p_max_depth, float p_tol, const Color &p_color, const Color &p_to_color, int &lines) const {
  694. float mp = p_begin + (p_end - p_begin) * 0.5;
  695. Vector2 beg = _bezier_interp(p_begin, p_a, p_a + p_out, p_b + p_in, p_b);
  696. Vector2 mid = _bezier_interp(mp, p_a, p_a + p_out, p_b + p_in, p_b);
  697. Vector2 end = _bezier_interp(p_end, p_a, p_a + p_out, p_b + p_in, p_b);
  698. Vector2 na = (mid - beg).normalized();
  699. Vector2 nb = (end - mid).normalized();
  700. float dp = Math::rad2deg(Math::acos(na.dot(nb)));
  701. if (p_depth >= p_min_depth && (dp < p_tol || p_depth >= p_max_depth)) {
  702. points.push_back((beg + end) * 0.5);
  703. colors.push_back(p_color.lerp(p_to_color, mp));
  704. lines++;
  705. } else {
  706. _bake_segment2d(points, colors, p_begin, mp, p_a, p_out, p_b, p_in, p_depth + 1, p_min_depth, p_max_depth, p_tol, p_color, p_to_color, lines);
  707. _bake_segment2d(points, colors, mp, p_end, p_a, p_out, p_b, p_in, p_depth + 1, p_min_depth, p_max_depth, p_tol, p_color, p_to_color, lines);
  708. }
  709. }
  710. void GraphEdit::_draw_cos_line(CanvasItem *p_where, const Vector2 &p_from, const Vector2 &p_to, const Color &p_color, const Color &p_to_color, float p_width, float p_bezier_ratio) {
  711. //cubic bezier code
  712. float diff = p_to.x - p_from.x;
  713. float cp_offset;
  714. int cp_len = get_theme_constant(SNAME("bezier_len_pos")) * p_bezier_ratio;
  715. int cp_neg_len = get_theme_constant(SNAME("bezier_len_neg")) * p_bezier_ratio;
  716. if (diff > 0) {
  717. cp_offset = MIN(cp_len, diff * 0.5);
  718. } else {
  719. cp_offset = MAX(MIN(cp_len - diff, cp_neg_len), -diff * 0.5);
  720. }
  721. Vector2 c1 = Vector2(cp_offset * zoom, 0);
  722. Vector2 c2 = Vector2(-cp_offset * zoom, 0);
  723. int lines = 0;
  724. Vector<Point2> points;
  725. Vector<Color> colors;
  726. points.push_back(p_from);
  727. colors.push_back(p_color);
  728. _bake_segment2d(points, colors, 0, 1, p_from, c1, p_to, c2, 0, 3, 9, 3, p_color, p_to_color, lines);
  729. points.push_back(p_to);
  730. colors.push_back(p_to_color);
  731. #ifdef TOOLS_ENABLED
  732. p_where->draw_polyline_colors(points, colors, Math::floor(p_width * EDSCALE), lines_antialiased);
  733. #else
  734. p_where->draw_polyline_colors(points, colors, p_width, lines_antialiased);
  735. #endif
  736. }
  737. void GraphEdit::_connections_layer_draw() {
  738. Color activity_color = get_theme_color(SNAME("activity"));
  739. //draw connections
  740. List<List<Connection>::Element *> to_erase;
  741. for (List<Connection>::Element *E = connections.front(); E; E = E->next()) {
  742. NodePath fromnp(E->get().from);
  743. Node *from = get_node(fromnp);
  744. if (!from) {
  745. to_erase.push_back(E);
  746. continue;
  747. }
  748. GraphNode *gfrom = Object::cast_to<GraphNode>(from);
  749. if (!gfrom) {
  750. to_erase.push_back(E);
  751. continue;
  752. }
  753. NodePath tonp(E->get().to);
  754. Node *to = get_node(tonp);
  755. if (!to) {
  756. to_erase.push_back(E);
  757. continue;
  758. }
  759. GraphNode *gto = Object::cast_to<GraphNode>(to);
  760. if (!gto) {
  761. to_erase.push_back(E);
  762. continue;
  763. }
  764. Vector2 frompos = gfrom->get_connection_output_position(E->get().from_port) + gfrom->get_position_offset() * zoom;
  765. Color color = gfrom->get_connection_output_color(E->get().from_port);
  766. Vector2 topos = gto->get_connection_input_position(E->get().to_port) + gto->get_position_offset() * zoom;
  767. Color tocolor = gto->get_connection_input_color(E->get().to_port);
  768. if (E->get().activity > 0) {
  769. color = color.lerp(activity_color, E->get().activity);
  770. tocolor = tocolor.lerp(activity_color, E->get().activity);
  771. }
  772. _draw_cos_line(connections_layer, frompos, topos, color, tocolor, lines_thickness);
  773. }
  774. while (to_erase.size()) {
  775. connections.erase(to_erase.front()->get());
  776. to_erase.pop_front();
  777. }
  778. }
  779. void GraphEdit::_top_layer_draw() {
  780. _update_scroll();
  781. if (connecting) {
  782. Node *fromn = get_node(connecting_from);
  783. ERR_FAIL_COND(!fromn);
  784. GraphNode *from = Object::cast_to<GraphNode>(fromn);
  785. ERR_FAIL_COND(!from);
  786. Vector2 pos;
  787. if (connecting_out) {
  788. pos = from->get_connection_output_position(connecting_index);
  789. } else {
  790. pos = from->get_connection_input_position(connecting_index);
  791. }
  792. pos += from->get_position();
  793. Vector2 topos;
  794. topos = connecting_to;
  795. Color col = connecting_color;
  796. if (connecting_target) {
  797. col.r += 0.4;
  798. col.g += 0.4;
  799. col.b += 0.4;
  800. }
  801. if (!connecting_out) {
  802. SWAP(pos, topos);
  803. }
  804. _draw_cos_line(top_layer, pos, topos, col, col, lines_thickness);
  805. }
  806. if (box_selecting) {
  807. top_layer->draw_rect(box_selecting_rect, get_theme_color(SNAME("selection_fill")));
  808. top_layer->draw_rect(box_selecting_rect, get_theme_color(SNAME("selection_stroke")), false);
  809. }
  810. }
  811. void GraphEdit::_minimap_draw() {
  812. if (!is_minimap_enabled()) {
  813. return;
  814. }
  815. minimap->update_minimap();
  816. // Draw the minimap background.
  817. Rect2 minimap_rect = Rect2(Point2(), minimap->get_size());
  818. minimap->draw_style_box(minimap->get_theme_stylebox(SNAME("bg")), minimap_rect);
  819. Vector2 graph_offset = minimap->_get_graph_offset();
  820. Vector2 minimap_offset = minimap->minimap_offset;
  821. // Draw comment graph nodes.
  822. for (int i = get_child_count() - 1; i >= 0; i--) {
  823. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  824. if (!gn || !gn->is_comment()) {
  825. continue;
  826. }
  827. Vector2 node_position = minimap->_convert_from_graph_position(gn->get_position_offset() * zoom - graph_offset) + minimap_offset;
  828. Vector2 node_size = minimap->_convert_from_graph_position(gn->get_size() * zoom);
  829. Rect2 node_rect = Rect2(node_position, node_size);
  830. Ref<StyleBoxFlat> sb_minimap = minimap->get_theme_stylebox(SNAME("node"))->duplicate();
  831. // Override default values with colors provided by the GraphNode's stylebox, if possible.
  832. Ref<StyleBoxFlat> sbf = gn->get_theme_stylebox(gn->is_selected() ? "commentfocus" : "comment");
  833. if (sbf.is_valid()) {
  834. Color node_color = sbf->get_bg_color();
  835. sb_minimap->set_bg_color(node_color);
  836. }
  837. minimap->draw_style_box(sb_minimap, node_rect);
  838. }
  839. // Draw regular graph nodes.
  840. for (int i = get_child_count() - 1; i >= 0; i--) {
  841. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  842. if (!gn || gn->is_comment()) {
  843. continue;
  844. }
  845. Vector2 node_position = minimap->_convert_from_graph_position(gn->get_position_offset() * zoom - graph_offset) + minimap_offset;
  846. Vector2 node_size = minimap->_convert_from_graph_position(gn->get_size() * zoom);
  847. Rect2 node_rect = Rect2(node_position, node_size);
  848. Ref<StyleBoxFlat> sb_minimap = minimap->get_theme_stylebox(SNAME("node"))->duplicate();
  849. // Override default values with colors provided by the GraphNode's stylebox, if possible.
  850. Ref<StyleBoxFlat> sbf = gn->get_theme_stylebox(gn->is_selected() ? "selectedframe" : "frame");
  851. if (sbf.is_valid()) {
  852. Color node_color = sbf->get_border_color();
  853. sb_minimap->set_bg_color(node_color);
  854. }
  855. minimap->draw_style_box(sb_minimap, node_rect);
  856. }
  857. // Draw node connections.
  858. Color activity_color = get_theme_color(SNAME("activity"));
  859. for (const Connection &E : connections) {
  860. NodePath fromnp(E.from);
  861. Node *from = get_node(fromnp);
  862. if (!from) {
  863. continue;
  864. }
  865. GraphNode *gfrom = Object::cast_to<GraphNode>(from);
  866. if (!gfrom) {
  867. continue;
  868. }
  869. NodePath tonp(E.to);
  870. Node *to = get_node(tonp);
  871. if (!to) {
  872. continue;
  873. }
  874. GraphNode *gto = Object::cast_to<GraphNode>(to);
  875. if (!gto) {
  876. continue;
  877. }
  878. Vector2 from_slot_position = gfrom->get_position_offset() * zoom + gfrom->get_connection_output_position(E.from_port);
  879. Vector2 from_position = minimap->_convert_from_graph_position(from_slot_position - graph_offset) + minimap_offset;
  880. Color from_color = gfrom->get_connection_output_color(E.from_port);
  881. Vector2 to_slot_position = gto->get_position_offset() * zoom + gto->get_connection_input_position(E.to_port);
  882. Vector2 to_position = minimap->_convert_from_graph_position(to_slot_position - graph_offset) + minimap_offset;
  883. Color to_color = gto->get_connection_input_color(E.to_port);
  884. if (E.activity > 0) {
  885. from_color = from_color.lerp(activity_color, E.activity);
  886. to_color = to_color.lerp(activity_color, E.activity);
  887. }
  888. _draw_cos_line(minimap, from_position, to_position, from_color, to_color, 1.0, 0.5);
  889. }
  890. // Draw the "camera" viewport.
  891. Rect2 camera_rect = minimap->get_camera_rect();
  892. minimap->draw_style_box(minimap->get_theme_stylebox(SNAME("camera")), camera_rect);
  893. // Draw the resizer control.
  894. Ref<Texture2D> resizer = minimap->get_theme_icon(SNAME("resizer"));
  895. Color resizer_color = minimap->get_theme_color(SNAME("resizer_color"));
  896. minimap->draw_texture(resizer, Point2(), resizer_color);
  897. }
  898. void GraphEdit::set_selected(Node *p_child) {
  899. for (int i = get_child_count() - 1; i >= 0; i--) {
  900. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  901. if (!gn) {
  902. continue;
  903. }
  904. gn->set_selected(gn == p_child);
  905. }
  906. }
  907. void GraphEdit::_gui_input(const Ref<InputEvent> &p_ev) {
  908. ERR_FAIL_COND(p_ev.is_null());
  909. Ref<InputEventMouseMotion> mm = p_ev;
  910. if (mm.is_valid() && (mm->get_button_mask() & MOUSE_BUTTON_MASK_MIDDLE || (mm->get_button_mask() & MOUSE_BUTTON_MASK_LEFT && Input::get_singleton()->is_key_pressed(KEY_SPACE)))) {
  911. Vector2i relative = Input::get_singleton()->warp_mouse_motion(mm, get_global_rect());
  912. h_scroll->set_value(h_scroll->get_value() - relative.x);
  913. v_scroll->set_value(v_scroll->get_value() - relative.y);
  914. }
  915. if (mm.is_valid() && dragging) {
  916. if (!moving_selection) {
  917. emit_signal(SNAME("begin_node_move"));
  918. moving_selection = true;
  919. }
  920. just_selected = true;
  921. drag_accum += mm->get_relative();
  922. for (int i = get_child_count() - 1; i >= 0; i--) {
  923. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  924. if (gn && gn->is_selected()) {
  925. Vector2 pos = (gn->get_drag_from() * zoom + drag_accum) / zoom;
  926. // Snapping can be toggled temporarily by holding down Ctrl.
  927. // This is done here as to not toggle the grid when holding down Ctrl.
  928. if (is_using_snap() ^ Input::get_singleton()->is_key_pressed(KEY_CTRL)) {
  929. const int snap = get_snap();
  930. pos = pos.snapped(Vector2(snap, snap));
  931. }
  932. gn->set_position_offset(pos);
  933. }
  934. }
  935. }
  936. if (mm.is_valid() && box_selecting) {
  937. box_selecting_to = mm->get_position();
  938. box_selecting_rect = Rect2(MIN(box_selecting_from.x, box_selecting_to.x),
  939. MIN(box_selecting_from.y, box_selecting_to.y),
  940. ABS(box_selecting_from.x - box_selecting_to.x),
  941. ABS(box_selecting_from.y - box_selecting_to.y));
  942. for (int i = get_child_count() - 1; i >= 0; i--) {
  943. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  944. if (!gn) {
  945. continue;
  946. }
  947. Rect2 r = gn->get_rect();
  948. r.size *= zoom;
  949. bool in_box = r.intersects(box_selecting_rect);
  950. if (in_box) {
  951. if (!gn->is_selected() && box_selection_mode_additive) {
  952. emit_signal(SNAME("node_selected"), gn);
  953. } else if (gn->is_selected() && !box_selection_mode_additive) {
  954. emit_signal(SNAME("node_deselected"), gn);
  955. }
  956. gn->set_selected(box_selection_mode_additive);
  957. } else {
  958. bool select = (previous_selected.find(gn) != nullptr);
  959. if (gn->is_selected() && !select) {
  960. emit_signal(SNAME("node_deselected"), gn);
  961. } else if (!gn->is_selected() && select) {
  962. emit_signal(SNAME("node_selected"), gn);
  963. }
  964. gn->set_selected(select);
  965. }
  966. }
  967. top_layer->update();
  968. minimap->update();
  969. }
  970. Ref<InputEventMouseButton> b = p_ev;
  971. if (b.is_valid()) {
  972. if (b->get_button_index() == MOUSE_BUTTON_RIGHT && b->is_pressed()) {
  973. if (box_selecting) {
  974. box_selecting = false;
  975. for (int i = get_child_count() - 1; i >= 0; i--) {
  976. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  977. if (!gn) {
  978. continue;
  979. }
  980. bool select = (previous_selected.find(gn) != nullptr);
  981. if (gn->is_selected() && !select) {
  982. emit_signal(SNAME("node_deselected"), gn);
  983. } else if (!gn->is_selected() && select) {
  984. emit_signal(SNAME("node_selected"), gn);
  985. }
  986. gn->set_selected(select);
  987. }
  988. top_layer->update();
  989. minimap->update();
  990. } else {
  991. if (connecting) {
  992. connecting = false;
  993. top_layer->update();
  994. minimap->update();
  995. } else {
  996. emit_signal(SNAME("popup_request"), b->get_global_position());
  997. }
  998. }
  999. }
  1000. if (b->get_button_index() == MOUSE_BUTTON_LEFT && !b->is_pressed() && dragging) {
  1001. if (!just_selected && drag_accum == Vector2() && Input::get_singleton()->is_key_pressed(KEY_CTRL)) {
  1002. //deselect current node
  1003. for (int i = get_child_count() - 1; i >= 0; i--) {
  1004. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  1005. if (gn) {
  1006. Rect2 r = gn->get_rect();
  1007. r.size *= zoom;
  1008. if (r.has_point(b->get_position())) {
  1009. emit_signal(SNAME("node_deselected"), gn);
  1010. gn->set_selected(false);
  1011. }
  1012. }
  1013. }
  1014. }
  1015. if (drag_accum != Vector2()) {
  1016. for (int i = get_child_count() - 1; i >= 0; i--) {
  1017. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  1018. if (gn && gn->is_selected()) {
  1019. gn->set_drag(false);
  1020. }
  1021. }
  1022. }
  1023. if (moving_selection) {
  1024. emit_signal(SNAME("end_node_move"));
  1025. moving_selection = false;
  1026. }
  1027. dragging = false;
  1028. top_layer->update();
  1029. minimap->update();
  1030. update();
  1031. connections_layer->update();
  1032. }
  1033. if (b->get_button_index() == MOUSE_BUTTON_LEFT && b->is_pressed()) {
  1034. GraphNode *gn = nullptr;
  1035. for (int i = get_child_count() - 1; i >= 0; i--) {
  1036. GraphNode *gn_selected = Object::cast_to<GraphNode>(get_child(i));
  1037. if (gn_selected) {
  1038. if (gn_selected->is_resizing()) {
  1039. continue;
  1040. }
  1041. if (gn_selected->has_point((b->get_position() - gn_selected->get_position()) / zoom)) {
  1042. gn = gn_selected;
  1043. break;
  1044. }
  1045. }
  1046. }
  1047. if (gn) {
  1048. if (_filter_input(b->get_position())) {
  1049. return;
  1050. }
  1051. dragging = true;
  1052. drag_accum = Vector2();
  1053. just_selected = !gn->is_selected();
  1054. if (!gn->is_selected() && !Input::get_singleton()->is_key_pressed(KEY_CTRL)) {
  1055. for (int i = 0; i < get_child_count(); i++) {
  1056. GraphNode *o_gn = Object::cast_to<GraphNode>(get_child(i));
  1057. if (o_gn) {
  1058. if (o_gn == gn) {
  1059. o_gn->set_selected(true);
  1060. } else {
  1061. if (o_gn->is_selected()) {
  1062. emit_signal(SNAME("node_deselected"), o_gn);
  1063. }
  1064. o_gn->set_selected(false);
  1065. }
  1066. }
  1067. }
  1068. }
  1069. gn->set_selected(true);
  1070. for (int i = 0; i < get_child_count(); i++) {
  1071. GraphNode *o_gn = Object::cast_to<GraphNode>(get_child(i));
  1072. if (!o_gn) {
  1073. continue;
  1074. }
  1075. if (o_gn->is_selected()) {
  1076. o_gn->set_drag(true);
  1077. }
  1078. }
  1079. } else {
  1080. if (_filter_input(b->get_position())) {
  1081. return;
  1082. }
  1083. if (Input::get_singleton()->is_key_pressed(KEY_SPACE)) {
  1084. return;
  1085. }
  1086. box_selecting = true;
  1087. box_selecting_from = b->get_position();
  1088. if (b->is_ctrl_pressed()) {
  1089. box_selection_mode_additive = true;
  1090. previous_selected.clear();
  1091. for (int i = get_child_count() - 1; i >= 0; i--) {
  1092. GraphNode *gn2 = Object::cast_to<GraphNode>(get_child(i));
  1093. if (!gn2 || !gn2->is_selected()) {
  1094. continue;
  1095. }
  1096. previous_selected.push_back(gn2);
  1097. }
  1098. } else if (b->is_shift_pressed()) {
  1099. box_selection_mode_additive = false;
  1100. previous_selected.clear();
  1101. for (int i = get_child_count() - 1; i >= 0; i--) {
  1102. GraphNode *gn2 = Object::cast_to<GraphNode>(get_child(i));
  1103. if (!gn2 || !gn2->is_selected()) {
  1104. continue;
  1105. }
  1106. previous_selected.push_back(gn2);
  1107. }
  1108. } else {
  1109. box_selection_mode_additive = true;
  1110. previous_selected.clear();
  1111. for (int i = get_child_count() - 1; i >= 0; i--) {
  1112. GraphNode *gn2 = Object::cast_to<GraphNode>(get_child(i));
  1113. if (!gn2) {
  1114. continue;
  1115. }
  1116. if (gn2->is_selected()) {
  1117. emit_signal(SNAME("node_deselected"), gn2);
  1118. }
  1119. gn2->set_selected(false);
  1120. }
  1121. }
  1122. }
  1123. }
  1124. if (b->get_button_index() == MOUSE_BUTTON_LEFT && !b->is_pressed() && box_selecting) {
  1125. box_selecting = false;
  1126. box_selecting_rect = Rect2();
  1127. previous_selected.clear();
  1128. top_layer->update();
  1129. minimap->update();
  1130. }
  1131. int scroll_direction = (b->get_button_index() == MOUSE_BUTTON_WHEEL_DOWN) - (b->get_button_index() == MOUSE_BUTTON_WHEEL_UP);
  1132. if (scroll_direction != 0) {
  1133. if (b->is_ctrl_pressed()) {
  1134. if (b->is_shift_pressed()) {
  1135. // Horizontal scrolling.
  1136. h_scroll->set_value(h_scroll->get_value() + (h_scroll->get_page() * b->get_factor() / 8) * scroll_direction);
  1137. } else {
  1138. // Vertical scrolling.
  1139. v_scroll->set_value(v_scroll->get_value() + (v_scroll->get_page() * b->get_factor() / 8) * scroll_direction);
  1140. }
  1141. } else {
  1142. // Zooming.
  1143. set_zoom_custom(scroll_direction < 0 ? zoom * zoom_step : zoom / zoom_step, b->get_position());
  1144. }
  1145. }
  1146. }
  1147. if (p_ev->is_pressed()) {
  1148. if (p_ev->is_action("ui_graph_duplicate")) {
  1149. emit_signal(SNAME("duplicate_nodes_request"));
  1150. accept_event();
  1151. } else if (p_ev->is_action("ui_copy")) {
  1152. emit_signal(SNAME("copy_nodes_request"));
  1153. accept_event();
  1154. } else if (p_ev->is_action("ui_paste")) {
  1155. emit_signal(SNAME("paste_nodes_request"));
  1156. accept_event();
  1157. } else if (p_ev->is_action("ui_graph_delete")) {
  1158. emit_signal(SNAME("delete_nodes_request"));
  1159. accept_event();
  1160. }
  1161. }
  1162. Ref<InputEventMagnifyGesture> magnify_gesture = p_ev;
  1163. if (magnify_gesture.is_valid()) {
  1164. set_zoom_custom(zoom * magnify_gesture->get_factor(), magnify_gesture->get_position());
  1165. }
  1166. Ref<InputEventPanGesture> pan_gesture = p_ev;
  1167. if (pan_gesture.is_valid()) {
  1168. h_scroll->set_value(h_scroll->get_value() + h_scroll->get_page() * pan_gesture->get_delta().x / 8);
  1169. v_scroll->set_value(v_scroll->get_value() + v_scroll->get_page() * pan_gesture->get_delta().y / 8);
  1170. }
  1171. }
  1172. void GraphEdit::set_connection_activity(const StringName &p_from, int p_from_port, const StringName &p_to, int p_to_port, float p_activity) {
  1173. for (Connection &E : connections) {
  1174. if (E.from == p_from && E.from_port == p_from_port && E.to == p_to && E.to_port == p_to_port) {
  1175. if (Math::is_equal_approx(E.activity, p_activity)) {
  1176. //update only if changed
  1177. top_layer->update();
  1178. minimap->update();
  1179. connections_layer->update();
  1180. }
  1181. E.activity = p_activity;
  1182. return;
  1183. }
  1184. }
  1185. }
  1186. void GraphEdit::clear_connections() {
  1187. connections.clear();
  1188. minimap->update();
  1189. update();
  1190. connections_layer->update();
  1191. }
  1192. void GraphEdit::set_zoom(float p_zoom) {
  1193. set_zoom_custom(p_zoom, get_size() / 2);
  1194. }
  1195. void GraphEdit::set_zoom_custom(float p_zoom, const Vector2 &p_center) {
  1196. p_zoom = CLAMP(p_zoom, zoom_min, zoom_max);
  1197. if (zoom == p_zoom) {
  1198. return;
  1199. }
  1200. Vector2 sbofs = (Vector2(h_scroll->get_value(), v_scroll->get_value()) + p_center) / zoom;
  1201. zoom = p_zoom;
  1202. top_layer->update();
  1203. zoom_minus->set_disabled(zoom == zoom_min);
  1204. zoom_plus->set_disabled(zoom == zoom_max);
  1205. _update_scroll();
  1206. minimap->update();
  1207. connections_layer->update();
  1208. if (is_visible_in_tree()) {
  1209. Vector2 ofs = sbofs * zoom - p_center;
  1210. h_scroll->set_value(ofs.x);
  1211. v_scroll->set_value(ofs.y);
  1212. }
  1213. _update_zoom_label();
  1214. update();
  1215. }
  1216. float GraphEdit::get_zoom() const {
  1217. return zoom;
  1218. }
  1219. void GraphEdit::set_zoom_step(float p_zoom_step) {
  1220. p_zoom_step = abs(p_zoom_step);
  1221. if (zoom_step == p_zoom_step) {
  1222. return;
  1223. }
  1224. zoom_step = p_zoom_step;
  1225. }
  1226. float GraphEdit::get_zoom_step() const {
  1227. return zoom_step;
  1228. }
  1229. void GraphEdit::set_zoom_min(float p_zoom_min) {
  1230. ERR_FAIL_COND_MSG(p_zoom_min > zoom_max, "Cannot set min zoom level greater than max zoom level.");
  1231. if (zoom_min == p_zoom_min) {
  1232. return;
  1233. }
  1234. zoom_min = p_zoom_min;
  1235. set_zoom(zoom);
  1236. }
  1237. float GraphEdit::get_zoom_min() const {
  1238. return zoom_min;
  1239. }
  1240. void GraphEdit::set_zoom_max(float p_zoom_max) {
  1241. ERR_FAIL_COND_MSG(p_zoom_max < zoom_min, "Cannot set max zoom level lesser than min zoom level.");
  1242. if (zoom_max == p_zoom_max) {
  1243. return;
  1244. }
  1245. zoom_max = p_zoom_max;
  1246. set_zoom(zoom);
  1247. }
  1248. float GraphEdit::get_zoom_max() const {
  1249. return zoom_max;
  1250. }
  1251. void GraphEdit::set_show_zoom_label(bool p_enable) {
  1252. if (zoom_label->is_visible() == p_enable) {
  1253. return;
  1254. }
  1255. zoom_label->set_visible(p_enable);
  1256. }
  1257. bool GraphEdit::is_showing_zoom_label() const {
  1258. return zoom_label->is_visible();
  1259. }
  1260. void GraphEdit::set_right_disconnects(bool p_enable) {
  1261. right_disconnects = p_enable;
  1262. }
  1263. bool GraphEdit::is_right_disconnects_enabled() const {
  1264. return right_disconnects;
  1265. }
  1266. void GraphEdit::add_valid_right_disconnect_type(int p_type) {
  1267. valid_right_disconnect_types.insert(p_type);
  1268. }
  1269. void GraphEdit::remove_valid_right_disconnect_type(int p_type) {
  1270. valid_right_disconnect_types.erase(p_type);
  1271. }
  1272. void GraphEdit::add_valid_left_disconnect_type(int p_type) {
  1273. valid_left_disconnect_types.insert(p_type);
  1274. }
  1275. void GraphEdit::remove_valid_left_disconnect_type(int p_type) {
  1276. valid_left_disconnect_types.erase(p_type);
  1277. }
  1278. Array GraphEdit::_get_connection_list() const {
  1279. List<Connection> conns;
  1280. get_connection_list(&conns);
  1281. Array arr;
  1282. for (const Connection &E : conns) {
  1283. Dictionary d;
  1284. d["from"] = E.from;
  1285. d["from_port"] = E.from_port;
  1286. d["to"] = E.to;
  1287. d["to_port"] = E.to_port;
  1288. arr.push_back(d);
  1289. }
  1290. return arr;
  1291. }
  1292. void GraphEdit::_zoom_minus() {
  1293. set_zoom(zoom / zoom_step);
  1294. }
  1295. void GraphEdit::_zoom_reset() {
  1296. set_zoom(1);
  1297. }
  1298. void GraphEdit::_zoom_plus() {
  1299. set_zoom(zoom * zoom_step);
  1300. }
  1301. void GraphEdit::_update_zoom_label() {
  1302. int zoom_percent = static_cast<int>(Math::round(zoom * 100));
  1303. String zoom_text = itos(zoom_percent) + "%";
  1304. zoom_label->set_text(zoom_text);
  1305. }
  1306. void GraphEdit::add_valid_connection_type(int p_type, int p_with_type) {
  1307. ConnType ct;
  1308. ct.type_a = p_type;
  1309. ct.type_b = p_with_type;
  1310. valid_connection_types.insert(ct);
  1311. }
  1312. void GraphEdit::remove_valid_connection_type(int p_type, int p_with_type) {
  1313. ConnType ct;
  1314. ct.type_a = p_type;
  1315. ct.type_b = p_with_type;
  1316. valid_connection_types.erase(ct);
  1317. }
  1318. bool GraphEdit::is_valid_connection_type(int p_type, int p_with_type) const {
  1319. ConnType ct;
  1320. ct.type_a = p_type;
  1321. ct.type_b = p_with_type;
  1322. return valid_connection_types.has(ct);
  1323. }
  1324. void GraphEdit::set_use_snap(bool p_enable) {
  1325. snap_button->set_pressed(p_enable);
  1326. update();
  1327. }
  1328. bool GraphEdit::is_using_snap() const {
  1329. return snap_button->is_pressed();
  1330. }
  1331. int GraphEdit::get_snap() const {
  1332. return snap_amount->get_value();
  1333. }
  1334. void GraphEdit::set_snap(int p_snap) {
  1335. ERR_FAIL_COND(p_snap < 5);
  1336. snap_amount->set_value(p_snap);
  1337. update();
  1338. }
  1339. void GraphEdit::_snap_toggled() {
  1340. update();
  1341. }
  1342. void GraphEdit::_snap_value_changed(double) {
  1343. update();
  1344. }
  1345. void GraphEdit::set_minimap_size(Vector2 p_size) {
  1346. minimap->set_size(p_size);
  1347. Vector2 minimap_size = minimap->get_size(); // The size might've been adjusted by the minimum size.
  1348. minimap->set_anchors_preset(Control::PRESET_BOTTOM_RIGHT);
  1349. minimap->set_offset(Side::SIDE_LEFT, -minimap_size.x - MINIMAP_OFFSET);
  1350. minimap->set_offset(Side::SIDE_TOP, -minimap_size.y - MINIMAP_OFFSET);
  1351. minimap->set_offset(Side::SIDE_RIGHT, -MINIMAP_OFFSET);
  1352. minimap->set_offset(Side::SIDE_BOTTOM, -MINIMAP_OFFSET);
  1353. minimap->update();
  1354. }
  1355. Vector2 GraphEdit::get_minimap_size() const {
  1356. return minimap->get_size();
  1357. }
  1358. void GraphEdit::set_minimap_opacity(float p_opacity) {
  1359. minimap->set_modulate(Color(1, 1, 1, p_opacity));
  1360. minimap->update();
  1361. }
  1362. float GraphEdit::get_minimap_opacity() const {
  1363. Color minimap_modulate = minimap->get_modulate();
  1364. return minimap_modulate.a;
  1365. }
  1366. void GraphEdit::set_minimap_enabled(bool p_enable) {
  1367. minimap_button->set_pressed(p_enable);
  1368. minimap->update();
  1369. }
  1370. bool GraphEdit::is_minimap_enabled() const {
  1371. return minimap_button->is_pressed();
  1372. }
  1373. void GraphEdit::_minimap_toggled() {
  1374. if (is_minimap_enabled()) {
  1375. minimap->set_visible(true);
  1376. minimap->update();
  1377. } else {
  1378. minimap->set_visible(false);
  1379. }
  1380. }
  1381. void GraphEdit::set_connection_lines_thickness(float p_thickness) {
  1382. lines_thickness = p_thickness;
  1383. update();
  1384. }
  1385. float GraphEdit::get_connection_lines_thickness() const {
  1386. return lines_thickness;
  1387. }
  1388. void GraphEdit::set_connection_lines_antialiased(bool p_antialiased) {
  1389. lines_antialiased = p_antialiased;
  1390. update();
  1391. }
  1392. bool GraphEdit::is_connection_lines_antialiased() const {
  1393. return lines_antialiased;
  1394. }
  1395. HBoxContainer *GraphEdit::get_zoom_hbox() {
  1396. return zoom_hb;
  1397. }
  1398. int GraphEdit::_set_operations(SET_OPERATIONS p_operation, Set<StringName> &r_u, const Set<StringName> &r_v) {
  1399. switch (p_operation) {
  1400. case GraphEdit::IS_EQUAL: {
  1401. for (Set<StringName>::Element *E = r_u.front(); E; E = E->next()) {
  1402. if (!r_v.has(E->get()))
  1403. return 0;
  1404. }
  1405. return r_u.size() == r_v.size();
  1406. } break;
  1407. case GraphEdit::IS_SUBSET: {
  1408. if (r_u.size() == r_v.size() && !r_u.size()) {
  1409. return 1;
  1410. }
  1411. for (Set<StringName>::Element *E = r_u.front(); E; E = E->next()) {
  1412. if (!r_v.has(E->get()))
  1413. return 0;
  1414. }
  1415. return 1;
  1416. } break;
  1417. case GraphEdit::DIFFERENCE: {
  1418. for (Set<StringName>::Element *E = r_u.front(); E; E = E->next()) {
  1419. if (r_v.has(E->get())) {
  1420. r_u.erase(E->get());
  1421. }
  1422. }
  1423. return r_u.size();
  1424. } break;
  1425. case GraphEdit::UNION: {
  1426. for (Set<StringName>::Element *E = r_v.front(); E; E = E->next()) {
  1427. if (!r_u.has(E->get())) {
  1428. r_u.insert(E->get());
  1429. }
  1430. }
  1431. return r_v.size();
  1432. } break;
  1433. default:
  1434. break;
  1435. }
  1436. return -1;
  1437. }
  1438. HashMap<int, Vector<StringName>> GraphEdit::_layering(const Set<StringName> &r_selected_nodes, const HashMap<StringName, Set<StringName>> &r_upper_neighbours) {
  1439. HashMap<int, Vector<StringName>> l;
  1440. Set<StringName> p = r_selected_nodes, q = r_selected_nodes, u, z;
  1441. int current_layer = 0;
  1442. bool selected = false;
  1443. while (!_set_operations(GraphEdit::IS_EQUAL, q, u)) {
  1444. _set_operations(GraphEdit::DIFFERENCE, p, u);
  1445. for (const Set<StringName>::Element *E = p.front(); E; E = E->next()) {
  1446. Set<StringName> n = r_upper_neighbours[E->get()];
  1447. if (_set_operations(GraphEdit::IS_SUBSET, n, z)) {
  1448. Vector<StringName> t;
  1449. t.push_back(E->get());
  1450. if (!l.has(current_layer)) {
  1451. l.set(current_layer, Vector<StringName>{});
  1452. }
  1453. selected = true;
  1454. t.append_array(l[current_layer]);
  1455. l.set(current_layer, t);
  1456. Set<StringName> V;
  1457. V.insert(E->get());
  1458. _set_operations(GraphEdit::UNION, u, V);
  1459. }
  1460. }
  1461. if (!selected) {
  1462. current_layer++;
  1463. _set_operations(GraphEdit::UNION, z, u);
  1464. }
  1465. selected = false;
  1466. }
  1467. return l;
  1468. }
  1469. Vector<StringName> GraphEdit::_split(const Vector<StringName> &r_layer, const HashMap<StringName, Dictionary> &r_crossings) {
  1470. if (!r_layer.size()) {
  1471. return Vector<StringName>();
  1472. }
  1473. StringName p = r_layer[Math::random(0, r_layer.size() - 1)];
  1474. Vector<StringName> left;
  1475. Vector<StringName> right;
  1476. for (int i = 0; i < r_layer.size(); i++) {
  1477. if (p != r_layer[i]) {
  1478. StringName q = r_layer[i];
  1479. int cross_pq = r_crossings[p][q];
  1480. int cross_qp = r_crossings[q][p];
  1481. if (cross_pq > cross_qp) {
  1482. left.push_back(q);
  1483. } else {
  1484. right.push_back(q);
  1485. }
  1486. }
  1487. }
  1488. left.push_back(p);
  1489. left.append_array(right);
  1490. return left;
  1491. }
  1492. void GraphEdit::_horizontal_alignment(Dictionary &r_root, Dictionary &r_align, const HashMap<int, Vector<StringName>> &r_layers, const HashMap<StringName, Set<StringName>> &r_upper_neighbours, const Set<StringName> &r_selected_nodes) {
  1493. for (const Set<StringName>::Element *E = r_selected_nodes.front(); E; E = E->next()) {
  1494. r_root[E->get()] = E->get();
  1495. r_align[E->get()] = E->get();
  1496. }
  1497. if (r_layers.size() == 1) {
  1498. return;
  1499. }
  1500. for (unsigned int i = 1; i < r_layers.size(); i++) {
  1501. Vector<StringName> lower_layer = r_layers[i];
  1502. Vector<StringName> upper_layer = r_layers[i - 1];
  1503. int r = -1;
  1504. for (int j = 0; j < lower_layer.size(); j++) {
  1505. Vector<Pair<int, StringName>> up;
  1506. StringName current_node = lower_layer[j];
  1507. for (int k = 0; k < upper_layer.size(); k++) {
  1508. StringName adjacent_neighbour = upper_layer[k];
  1509. if (r_upper_neighbours[current_node].has(adjacent_neighbour)) {
  1510. up.push_back(Pair<int, StringName>(k, adjacent_neighbour));
  1511. }
  1512. }
  1513. int start = up.size() / 2;
  1514. int end = up.size() % 2 ? start : start + 1;
  1515. for (int p = start; p <= end; p++) {
  1516. StringName Align = r_align[current_node];
  1517. if (Align == current_node && r < up[p].first) {
  1518. r_align[up[p].second] = lower_layer[j];
  1519. r_root[current_node] = r_root[up[p].second];
  1520. r_align[current_node] = r_root[up[p].second];
  1521. r = up[p].first;
  1522. }
  1523. }
  1524. }
  1525. }
  1526. }
  1527. void GraphEdit::_crossing_minimisation(HashMap<int, Vector<StringName>> &r_layers, const HashMap<StringName, Set<StringName>> &r_upper_neighbours) {
  1528. if (r_layers.size() == 1) {
  1529. return;
  1530. }
  1531. for (unsigned int i = 1; i < r_layers.size(); i++) {
  1532. Vector<StringName> upper_layer = r_layers[i - 1];
  1533. Vector<StringName> lower_layer = r_layers[i];
  1534. HashMap<StringName, Dictionary> c;
  1535. for (int j = 0; j < lower_layer.size(); j++) {
  1536. StringName p = lower_layer[j];
  1537. Dictionary d;
  1538. for (int k = 0; k < lower_layer.size(); k++) {
  1539. unsigned int crossings = 0;
  1540. StringName q = lower_layer[k];
  1541. if (j != k) {
  1542. for (int h = 1; h < upper_layer.size(); h++) {
  1543. if (r_upper_neighbours[p].has(upper_layer[h])) {
  1544. for (int g = 0; g < h; g++) {
  1545. if (r_upper_neighbours[q].has(upper_layer[g])) {
  1546. crossings++;
  1547. }
  1548. }
  1549. }
  1550. }
  1551. }
  1552. d[q] = crossings;
  1553. }
  1554. c.set(p, d);
  1555. }
  1556. r_layers.set(i, _split(lower_layer, c));
  1557. }
  1558. }
  1559. void GraphEdit::_calculate_inner_shifts(Dictionary &r_inner_shifts, const Dictionary &r_root, const Dictionary &r_node_names, const Dictionary &r_align, const Set<StringName> &r_block_heads, const HashMap<StringName, Pair<int, int>> &r_port_info) {
  1560. for (const Set<StringName>::Element *E = r_block_heads.front(); E; E = E->next()) {
  1561. real_t left = 0;
  1562. StringName u = E->get();
  1563. StringName v = r_align[u];
  1564. while (u != v && (StringName)r_root[u] != v) {
  1565. String _connection = String(u) + " " + String(v);
  1566. GraphNode *gfrom = Object::cast_to<GraphNode>(r_node_names[u]);
  1567. GraphNode *gto = Object::cast_to<GraphNode>(r_node_names[v]);
  1568. Pair<int, int> ports = r_port_info[_connection];
  1569. int pfrom = ports.first;
  1570. int pto = ports.second;
  1571. Vector2 frompos = gfrom->get_connection_output_position(pfrom);
  1572. Vector2 topos = gto->get_connection_input_position(pto);
  1573. real_t s = (real_t)r_inner_shifts[u] + (frompos.y - topos.y) / zoom;
  1574. r_inner_shifts[v] = s;
  1575. left = MIN(left, s);
  1576. u = v;
  1577. v = (StringName)r_align[v];
  1578. }
  1579. u = E->get();
  1580. do {
  1581. r_inner_shifts[u] = (real_t)r_inner_shifts[u] - left;
  1582. u = (StringName)r_align[u];
  1583. } while (u != E->get());
  1584. }
  1585. }
  1586. float GraphEdit::_calculate_threshold(StringName p_v, StringName p_w, const Dictionary &r_node_names, const HashMap<int, Vector<StringName>> &r_layers, const Dictionary &r_root, const Dictionary &r_align, const Dictionary &r_inner_shift, real_t p_current_threshold, const HashMap<StringName, Vector2> &r_node_positions) {
  1587. #define MAX_ORDER 2147483647
  1588. #define ORDER(node, layers) \
  1589. for (unsigned int i = 0; i < layers.size(); i++) { \
  1590. int index = layers[i].find(node); \
  1591. if (index > 0) { \
  1592. order = index; \
  1593. break; \
  1594. } \
  1595. order = MAX_ORDER; \
  1596. }
  1597. int order = MAX_ORDER;
  1598. float threshold = p_current_threshold;
  1599. if (p_v == p_w) {
  1600. int min_order = MAX_ORDER;
  1601. Connection incoming;
  1602. for (List<Connection>::Element *E = connections.front(); E; E = E->next()) {
  1603. if (E->get().to == p_w) {
  1604. ORDER(E->get().from, r_layers);
  1605. if (min_order > order) {
  1606. min_order = order;
  1607. incoming = E->get();
  1608. }
  1609. }
  1610. }
  1611. if (incoming.from != StringName()) {
  1612. GraphNode *gfrom = Object::cast_to<GraphNode>(r_node_names[incoming.from]);
  1613. GraphNode *gto = Object::cast_to<GraphNode>(r_node_names[p_w]);
  1614. Vector2 frompos = gfrom->get_connection_output_position(incoming.from_port);
  1615. Vector2 topos = gto->get_connection_input_position(incoming.to_port);
  1616. //If connected block node is selected, calculate thershold or add current block to list
  1617. if (gfrom->is_selected()) {
  1618. Vector2 connected_block_pos = r_node_positions[r_root[incoming.from]];
  1619. if (connected_block_pos.y != FLT_MAX) {
  1620. //Connected block is placed. Calculate threshold
  1621. threshold = connected_block_pos.y + (real_t)r_inner_shift[incoming.from] - (real_t)r_inner_shift[p_w] + frompos.y - topos.y;
  1622. }
  1623. }
  1624. }
  1625. }
  1626. if (threshold == FLT_MIN && (StringName)r_align[p_w] == p_v) {
  1627. //This time, pick an outgoing edge and repeat as above!
  1628. int min_order = MAX_ORDER;
  1629. Connection outgoing;
  1630. for (List<Connection>::Element *E = connections.front(); E; E = E->next()) {
  1631. if (E->get().from == p_w) {
  1632. ORDER(E->get().to, r_layers);
  1633. if (min_order > order) {
  1634. min_order = order;
  1635. outgoing = E->get();
  1636. }
  1637. }
  1638. }
  1639. if (outgoing.to != StringName()) {
  1640. GraphNode *gfrom = Object::cast_to<GraphNode>(r_node_names[p_w]);
  1641. GraphNode *gto = Object::cast_to<GraphNode>(r_node_names[outgoing.to]);
  1642. Vector2 frompos = gfrom->get_connection_output_position(outgoing.from_port);
  1643. Vector2 topos = gto->get_connection_input_position(outgoing.to_port);
  1644. //If connected block node is selected, calculate thershold or add current block to list
  1645. if (gto->is_selected()) {
  1646. Vector2 connected_block_pos = r_node_positions[r_root[outgoing.to]];
  1647. if (connected_block_pos.y != FLT_MAX) {
  1648. //Connected block is placed. Calculate threshold
  1649. threshold = connected_block_pos.y + (real_t)r_inner_shift[outgoing.to] - (real_t)r_inner_shift[p_w] + frompos.y - topos.y;
  1650. }
  1651. }
  1652. }
  1653. }
  1654. #undef MAX_ORDER
  1655. #undef ORDER
  1656. return threshold;
  1657. }
  1658. void GraphEdit::_place_block(StringName p_v, float p_delta, const HashMap<int, Vector<StringName>> &r_layers, const Dictionary &r_root, const Dictionary &r_align, const Dictionary &r_node_name, const Dictionary &r_inner_shift, Dictionary &r_sink, Dictionary &r_shift, HashMap<StringName, Vector2> &r_node_positions) {
  1659. #define PRED(node, layers) \
  1660. for (unsigned int i = 0; i < layers.size(); i++) { \
  1661. int index = layers[i].find(node); \
  1662. if (index > 0) { \
  1663. predecessor = layers[i][index - 1]; \
  1664. break; \
  1665. } \
  1666. predecessor = StringName(); \
  1667. }
  1668. StringName predecessor;
  1669. StringName successor;
  1670. Vector2 pos = r_node_positions[p_v];
  1671. if (pos.y == FLT_MAX) {
  1672. pos.y = 0;
  1673. bool initial = false;
  1674. StringName w = p_v;
  1675. real_t threshold = FLT_MIN;
  1676. do {
  1677. PRED(w, r_layers);
  1678. if (predecessor != StringName()) {
  1679. StringName u = r_root[predecessor];
  1680. _place_block(u, p_delta, r_layers, r_root, r_align, r_node_name, r_inner_shift, r_sink, r_shift, r_node_positions);
  1681. threshold = _calculate_threshold(p_v, w, r_node_name, r_layers, r_root, r_align, r_inner_shift, threshold, r_node_positions);
  1682. if ((StringName)r_sink[p_v] == p_v) {
  1683. r_sink[p_v] = r_sink[u];
  1684. }
  1685. Vector2 predecessor_root_pos = r_node_positions[u];
  1686. Vector2 predecessor_node_size = Object::cast_to<GraphNode>(r_node_name[predecessor])->get_size();
  1687. if (r_sink[p_v] != r_sink[u]) {
  1688. real_t sc = pos.y + (real_t)r_inner_shift[w] - predecessor_root_pos.y - (real_t)r_inner_shift[predecessor] - predecessor_node_size.y - p_delta;
  1689. r_shift[r_sink[u]] = MIN(sc, (real_t)r_shift[r_sink[u]]);
  1690. } else {
  1691. real_t sb = predecessor_root_pos.y + (real_t)r_inner_shift[predecessor] + predecessor_node_size.y - (real_t)r_inner_shift[w] + p_delta;
  1692. sb = MAX(sb, threshold);
  1693. if (initial) {
  1694. pos.y = sb;
  1695. } else {
  1696. pos.y = MAX(pos.y, sb);
  1697. }
  1698. initial = false;
  1699. }
  1700. }
  1701. threshold = _calculate_threshold(p_v, w, r_node_name, r_layers, r_root, r_align, r_inner_shift, threshold, r_node_positions);
  1702. w = r_align[w];
  1703. } while (w != p_v);
  1704. r_node_positions.set(p_v, pos);
  1705. }
  1706. #undef PRED
  1707. }
  1708. void GraphEdit::arrange_nodes() {
  1709. if (!arranging_graph) {
  1710. arranging_graph = true;
  1711. } else {
  1712. return;
  1713. }
  1714. Dictionary node_names;
  1715. Set<StringName> selected_nodes;
  1716. for (int i = get_child_count() - 1; i >= 0; i--) {
  1717. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  1718. if (!gn) {
  1719. continue;
  1720. }
  1721. node_names[gn->get_name()] = gn;
  1722. }
  1723. HashMap<StringName, Set<StringName>> upper_neighbours;
  1724. HashMap<StringName, Pair<int, int>> port_info;
  1725. Vector2 origin(FLT_MAX, FLT_MAX);
  1726. float gap_v = 100.0f;
  1727. float gap_h = 100.0f;
  1728. for (int i = get_child_count() - 1; i >= 0; i--) {
  1729. GraphNode *gn = Object::cast_to<GraphNode>(get_child(i));
  1730. if (!gn) {
  1731. continue;
  1732. }
  1733. if (gn->is_selected()) {
  1734. selected_nodes.insert(gn->get_name());
  1735. Set<StringName> s;
  1736. for (List<Connection>::Element *E = connections.front(); E; E = E->next()) {
  1737. GraphNode *p_from = Object::cast_to<GraphNode>(node_names[E->get().from]);
  1738. if (E->get().to == gn->get_name() && p_from->is_selected()) {
  1739. if (!s.has(p_from->get_name())) {
  1740. s.insert(p_from->get_name());
  1741. }
  1742. String s_connection = String(p_from->get_name()) + " " + String(E->get().to);
  1743. StringName _connection(s_connection);
  1744. Pair<int, int> ports(E->get().from_port, E->get().to_port);
  1745. if (port_info.has(_connection)) {
  1746. Pair<int, int> p_ports = port_info[_connection];
  1747. if (p_ports.first < ports.first) {
  1748. ports = p_ports;
  1749. }
  1750. }
  1751. port_info.set(_connection, ports);
  1752. }
  1753. }
  1754. upper_neighbours.set(gn->get_name(), s);
  1755. }
  1756. }
  1757. if (!selected_nodes.size()) {
  1758. arranging_graph = false;
  1759. return;
  1760. }
  1761. HashMap<int, Vector<StringName>> layers = _layering(selected_nodes, upper_neighbours);
  1762. _crossing_minimisation(layers, upper_neighbours);
  1763. Dictionary root, align, sink, shift;
  1764. _horizontal_alignment(root, align, layers, upper_neighbours, selected_nodes);
  1765. HashMap<StringName, Vector2> new_positions;
  1766. Vector2 default_position(FLT_MAX, FLT_MAX);
  1767. Dictionary inner_shift;
  1768. Set<StringName> block_heads;
  1769. for (const Set<StringName>::Element *E = selected_nodes.front(); E; E = E->next()) {
  1770. inner_shift[E->get()] = 0.0f;
  1771. sink[E->get()] = E->get();
  1772. shift[E->get()] = FLT_MAX;
  1773. new_positions.set(E->get(), default_position);
  1774. if ((StringName)root[E->get()] == E->get()) {
  1775. block_heads.insert(E->get());
  1776. }
  1777. }
  1778. _calculate_inner_shifts(inner_shift, root, node_names, align, block_heads, port_info);
  1779. for (const Set<StringName>::Element *E = block_heads.front(); E; E = E->next()) {
  1780. _place_block(E->get(), gap_v, layers, root, align, node_names, inner_shift, sink, shift, new_positions);
  1781. }
  1782. origin.y = Object::cast_to<GraphNode>(node_names[layers[0][0]])->get_position_offset().y - (new_positions[layers[0][0]].y + (float)inner_shift[layers[0][0]]);
  1783. origin.x = Object::cast_to<GraphNode>(node_names[layers[0][0]])->get_position_offset().x;
  1784. for (const Set<StringName>::Element *E = block_heads.front(); E; E = E->next()) {
  1785. StringName u = E->get();
  1786. float start_from = origin.y + new_positions[E->get()].y;
  1787. do {
  1788. Vector2 cal_pos;
  1789. cal_pos.y = start_from + (real_t)inner_shift[u];
  1790. new_positions.set(u, cal_pos);
  1791. u = align[u];
  1792. } while (u != E->get());
  1793. }
  1794. //Compute horizontal co-ordinates individually for layers to get uniform gap
  1795. float start_from = origin.x;
  1796. float largest_node_size = 0.0f;
  1797. for (unsigned int i = 0; i < layers.size(); i++) {
  1798. Vector<StringName> layer = layers[i];
  1799. for (int j = 0; j < layer.size(); j++) {
  1800. float current_node_size = Object::cast_to<GraphNode>(node_names[layer[j]])->get_size().x;
  1801. largest_node_size = MAX(largest_node_size, current_node_size);
  1802. }
  1803. for (int j = 0; j < layer.size(); j++) {
  1804. float current_node_size = Object::cast_to<GraphNode>(node_names[layer[j]])->get_size().x;
  1805. Vector2 cal_pos = new_positions[layer[j]];
  1806. if (current_node_size == largest_node_size) {
  1807. cal_pos.x = start_from;
  1808. } else {
  1809. float current_node_start_pos = start_from;
  1810. if (current_node_size < largest_node_size / 2) {
  1811. if (!(i || j)) {
  1812. start_from -= (largest_node_size - current_node_size);
  1813. }
  1814. current_node_start_pos = start_from + largest_node_size - current_node_size;
  1815. }
  1816. cal_pos.x = current_node_start_pos;
  1817. }
  1818. new_positions.set(layer[j], cal_pos);
  1819. }
  1820. start_from += largest_node_size + gap_h;
  1821. largest_node_size = 0.0f;
  1822. }
  1823. emit_signal("begin_node_move");
  1824. for (const Set<StringName>::Element *E = selected_nodes.front(); E; E = E->next()) {
  1825. GraphNode *gn = Object::cast_to<GraphNode>(node_names[E->get()]);
  1826. gn->set_drag(true);
  1827. Vector2 pos = (new_positions[E->get()]);
  1828. if (is_using_snap()) {
  1829. const int snap = get_snap();
  1830. pos = pos.snapped(Vector2(snap, snap));
  1831. }
  1832. gn->set_position_offset(pos);
  1833. gn->set_drag(false);
  1834. }
  1835. emit_signal("end_node_move");
  1836. arranging_graph = false;
  1837. }
  1838. void GraphEdit::_bind_methods() {
  1839. ClassDB::bind_method(D_METHOD("connect_node", "from", "from_port", "to", "to_port"), &GraphEdit::connect_node);
  1840. ClassDB::bind_method(D_METHOD("is_node_connected", "from", "from_port", "to", "to_port"), &GraphEdit::is_node_connected);
  1841. ClassDB::bind_method(D_METHOD("disconnect_node", "from", "from_port", "to", "to_port"), &GraphEdit::disconnect_node);
  1842. ClassDB::bind_method(D_METHOD("set_connection_activity", "from", "from_port", "to", "to_port", "amount"), &GraphEdit::set_connection_activity);
  1843. ClassDB::bind_method(D_METHOD("get_connection_list"), &GraphEdit::_get_connection_list);
  1844. ClassDB::bind_method(D_METHOD("clear_connections"), &GraphEdit::clear_connections);
  1845. ClassDB::bind_method(D_METHOD("get_scroll_ofs"), &GraphEdit::get_scroll_ofs);
  1846. ClassDB::bind_method(D_METHOD("set_scroll_ofs", "ofs"), &GraphEdit::set_scroll_ofs);
  1847. ClassDB::bind_method(D_METHOD("add_valid_right_disconnect_type", "type"), &GraphEdit::add_valid_right_disconnect_type);
  1848. ClassDB::bind_method(D_METHOD("remove_valid_right_disconnect_type", "type"), &GraphEdit::remove_valid_right_disconnect_type);
  1849. ClassDB::bind_method(D_METHOD("add_valid_left_disconnect_type", "type"), &GraphEdit::add_valid_left_disconnect_type);
  1850. ClassDB::bind_method(D_METHOD("remove_valid_left_disconnect_type", "type"), &GraphEdit::remove_valid_left_disconnect_type);
  1851. ClassDB::bind_method(D_METHOD("add_valid_connection_type", "from_type", "to_type"), &GraphEdit::add_valid_connection_type);
  1852. ClassDB::bind_method(D_METHOD("remove_valid_connection_type", "from_type", "to_type"), &GraphEdit::remove_valid_connection_type);
  1853. ClassDB::bind_method(D_METHOD("is_valid_connection_type", "from_type", "to_type"), &GraphEdit::is_valid_connection_type);
  1854. ClassDB::bind_method(D_METHOD("set_zoom", "zoom"), &GraphEdit::set_zoom);
  1855. ClassDB::bind_method(D_METHOD("get_zoom"), &GraphEdit::get_zoom);
  1856. ClassDB::bind_method(D_METHOD("set_zoom_min", "zoom_min"), &GraphEdit::set_zoom_min);
  1857. ClassDB::bind_method(D_METHOD("get_zoom_min"), &GraphEdit::get_zoom_min);
  1858. ClassDB::bind_method(D_METHOD("set_zoom_max", "zoom_max"), &GraphEdit::set_zoom_max);
  1859. ClassDB::bind_method(D_METHOD("get_zoom_max"), &GraphEdit::get_zoom_max);
  1860. ClassDB::bind_method(D_METHOD("set_zoom_step", "zoom_step"), &GraphEdit::set_zoom_step);
  1861. ClassDB::bind_method(D_METHOD("get_zoom_step"), &GraphEdit::get_zoom_step);
  1862. ClassDB::bind_method(D_METHOD("set_show_zoom_label", "enable"), &GraphEdit::set_show_zoom_label);
  1863. ClassDB::bind_method(D_METHOD("is_showing_zoom_label"), &GraphEdit::is_showing_zoom_label);
  1864. ClassDB::bind_method(D_METHOD("set_snap", "pixels"), &GraphEdit::set_snap);
  1865. ClassDB::bind_method(D_METHOD("get_snap"), &GraphEdit::get_snap);
  1866. ClassDB::bind_method(D_METHOD("set_use_snap", "enable"), &GraphEdit::set_use_snap);
  1867. ClassDB::bind_method(D_METHOD("is_using_snap"), &GraphEdit::is_using_snap);
  1868. ClassDB::bind_method(D_METHOD("set_connection_lines_thickness", "pixels"), &GraphEdit::set_connection_lines_thickness);
  1869. ClassDB::bind_method(D_METHOD("get_connection_lines_thickness"), &GraphEdit::get_connection_lines_thickness);
  1870. ClassDB::bind_method(D_METHOD("set_connection_lines_antialiased", "pixels"), &GraphEdit::set_connection_lines_antialiased);
  1871. ClassDB::bind_method(D_METHOD("is_connection_lines_antialiased"), &GraphEdit::is_connection_lines_antialiased);
  1872. ClassDB::bind_method(D_METHOD("set_minimap_size", "size"), &GraphEdit::set_minimap_size);
  1873. ClassDB::bind_method(D_METHOD("get_minimap_size"), &GraphEdit::get_minimap_size);
  1874. ClassDB::bind_method(D_METHOD("set_minimap_opacity", "opacity"), &GraphEdit::set_minimap_opacity);
  1875. ClassDB::bind_method(D_METHOD("get_minimap_opacity"), &GraphEdit::get_minimap_opacity);
  1876. ClassDB::bind_method(D_METHOD("set_minimap_enabled", "enable"), &GraphEdit::set_minimap_enabled);
  1877. ClassDB::bind_method(D_METHOD("is_minimap_enabled"), &GraphEdit::is_minimap_enabled);
  1878. ClassDB::bind_method(D_METHOD("set_right_disconnects", "enable"), &GraphEdit::set_right_disconnects);
  1879. ClassDB::bind_method(D_METHOD("is_right_disconnects_enabled"), &GraphEdit::is_right_disconnects_enabled);
  1880. ClassDB::bind_method(D_METHOD("_gui_input"), &GraphEdit::_gui_input);
  1881. ClassDB::bind_method(D_METHOD("_update_scroll_offset"), &GraphEdit::_update_scroll_offset);
  1882. ClassDB::bind_method(D_METHOD("get_zoom_hbox"), &GraphEdit::get_zoom_hbox);
  1883. ClassDB::bind_method(D_METHOD("arrange_nodes"), &GraphEdit::arrange_nodes);
  1884. ClassDB::bind_method(D_METHOD("set_selected", "node"), &GraphEdit::set_selected);
  1885. ADD_PROPERTY(PropertyInfo(Variant::BOOL, "right_disconnects"), "set_right_disconnects", "is_right_disconnects_enabled");
  1886. ADD_PROPERTY(PropertyInfo(Variant::VECTOR2, "scroll_offset"), "set_scroll_ofs", "get_scroll_ofs");
  1887. ADD_PROPERTY(PropertyInfo(Variant::INT, "snap_distance"), "set_snap", "get_snap");
  1888. ADD_PROPERTY(PropertyInfo(Variant::BOOL, "use_snap"), "set_use_snap", "is_using_snap");
  1889. ADD_GROUP("Connection Lines", "connection_lines");
  1890. ADD_PROPERTY(PropertyInfo(Variant::FLOAT, "connection_lines_thickness"), "set_connection_lines_thickness", "get_connection_lines_thickness");
  1891. ADD_PROPERTY(PropertyInfo(Variant::BOOL, "connection_lines_antialiased"), "set_connection_lines_antialiased", "is_connection_lines_antialiased");
  1892. ADD_GROUP("Zoom", "");
  1893. ADD_PROPERTY(PropertyInfo(Variant::FLOAT, "zoom"), "set_zoom", "get_zoom");
  1894. ADD_PROPERTY(PropertyInfo(Variant::FLOAT, "zoom_min"), "set_zoom_min", "get_zoom_min");
  1895. ADD_PROPERTY(PropertyInfo(Variant::FLOAT, "zoom_max"), "set_zoom_max", "get_zoom_max");
  1896. ADD_PROPERTY(PropertyInfo(Variant::FLOAT, "zoom_step"), "set_zoom_step", "get_zoom_step");
  1897. ADD_PROPERTY(PropertyInfo(Variant::BOOL, "show_zoom_label"), "set_show_zoom_label", "is_showing_zoom_label");
  1898. ADD_GROUP("Minimap", "minimap");
  1899. ADD_PROPERTY(PropertyInfo(Variant::BOOL, "minimap_enabled"), "set_minimap_enabled", "is_minimap_enabled");
  1900. ADD_PROPERTY(PropertyInfo(Variant::VECTOR2, "minimap_size"), "set_minimap_size", "get_minimap_size");
  1901. ADD_PROPERTY(PropertyInfo(Variant::FLOAT, "minimap_opacity"), "set_minimap_opacity", "get_minimap_opacity");
  1902. ADD_SIGNAL(MethodInfo("connection_request", PropertyInfo(Variant::STRING_NAME, "from"), PropertyInfo(Variant::INT, "from_slot"), PropertyInfo(Variant::STRING_NAME, "to"), PropertyInfo(Variant::INT, "to_slot")));
  1903. ADD_SIGNAL(MethodInfo("disconnection_request", PropertyInfo(Variant::STRING_NAME, "from"), PropertyInfo(Variant::INT, "from_slot"), PropertyInfo(Variant::STRING_NAME, "to"), PropertyInfo(Variant::INT, "to_slot")));
  1904. ADD_SIGNAL(MethodInfo("popup_request", PropertyInfo(Variant::VECTOR2, "position")));
  1905. ADD_SIGNAL(MethodInfo("duplicate_nodes_request"));
  1906. ADD_SIGNAL(MethodInfo("copy_nodes_request"));
  1907. ADD_SIGNAL(MethodInfo("paste_nodes_request"));
  1908. ADD_SIGNAL(MethodInfo("node_selected", PropertyInfo(Variant::OBJECT, "node", PROPERTY_HINT_RESOURCE_TYPE, "Node")));
  1909. ADD_SIGNAL(MethodInfo("node_deselected", PropertyInfo(Variant::OBJECT, "node", PROPERTY_HINT_RESOURCE_TYPE, "Node")));
  1910. ADD_SIGNAL(MethodInfo("connection_to_empty", PropertyInfo(Variant::STRING_NAME, "from"), PropertyInfo(Variant::INT, "from_slot"), PropertyInfo(Variant::VECTOR2, "release_position")));
  1911. ADD_SIGNAL(MethodInfo("connection_from_empty", PropertyInfo(Variant::STRING_NAME, "to"), PropertyInfo(Variant::INT, "to_slot"), PropertyInfo(Variant::VECTOR2, "release_position")));
  1912. ADD_SIGNAL(MethodInfo("delete_nodes_request"));
  1913. ADD_SIGNAL(MethodInfo("begin_node_move"));
  1914. ADD_SIGNAL(MethodInfo("end_node_move"));
  1915. ADD_SIGNAL(MethodInfo("scroll_offset_changed", PropertyInfo(Variant::VECTOR2, "ofs")));
  1916. }
  1917. GraphEdit::GraphEdit() {
  1918. set_focus_mode(FOCUS_ALL);
  1919. // Allow dezooming 8 times from the default zoom level.
  1920. // At low zoom levels, text is unreadable due to its small size and poor filtering,
  1921. // but this is still useful for previewing and navigation.
  1922. zoom_min = (1 / Math::pow(zoom_step, 8));
  1923. // Allow zooming 4 times from the default zoom level.
  1924. zoom_max = (1 * Math::pow(zoom_step, 4));
  1925. top_layer = memnew(GraphEditFilter(this));
  1926. add_child(top_layer);
  1927. top_layer->set_mouse_filter(MOUSE_FILTER_PASS);
  1928. top_layer->set_anchors_and_offsets_preset(Control::PRESET_WIDE);
  1929. top_layer->connect("draw", callable_mp(this, &GraphEdit::_top_layer_draw));
  1930. top_layer->connect("gui_input", callable_mp(this, &GraphEdit::_top_layer_input));
  1931. connections_layer = memnew(Control);
  1932. add_child(connections_layer);
  1933. connections_layer->connect("draw", callable_mp(this, &GraphEdit::_connections_layer_draw));
  1934. connections_layer->set_name("CLAYER");
  1935. connections_layer->set_disable_visibility_clip(true); // so it can draw freely and be offset
  1936. connections_layer->set_mouse_filter(MOUSE_FILTER_IGNORE);
  1937. h_scroll = memnew(HScrollBar);
  1938. h_scroll->set_name("_h_scroll");
  1939. top_layer->add_child(h_scroll);
  1940. v_scroll = memnew(VScrollBar);
  1941. v_scroll->set_name("_v_scroll");
  1942. top_layer->add_child(v_scroll);
  1943. //set large minmax so it can scroll even if not resized yet
  1944. h_scroll->set_min(-10000);
  1945. h_scroll->set_max(10000);
  1946. v_scroll->set_min(-10000);
  1947. v_scroll->set_max(10000);
  1948. h_scroll->connect("value_changed", callable_mp(this, &GraphEdit::_scroll_moved));
  1949. v_scroll->connect("value_changed", callable_mp(this, &GraphEdit::_scroll_moved));
  1950. zoom_hb = memnew(HBoxContainer);
  1951. top_layer->add_child(zoom_hb);
  1952. zoom_hb->set_position(Vector2(10, 10));
  1953. zoom_label = memnew(Label);
  1954. zoom_hb->add_child(zoom_label);
  1955. zoom_label->set_visible(false);
  1956. zoom_label->set_v_size_flags(Control::SIZE_SHRINK_CENTER);
  1957. zoom_label->set_align(Label::ALIGN_CENTER);
  1958. #ifdef TOOLS_ENABLED
  1959. zoom_label->set_custom_minimum_size(Size2(48, 0) * EDSCALE);
  1960. #else
  1961. zoom_label->set_custom_minimum_size(Size2(48, 0));
  1962. #endif
  1963. _update_zoom_label();
  1964. zoom_minus = memnew(Button);
  1965. zoom_minus->set_flat(true);
  1966. zoom_hb->add_child(zoom_minus);
  1967. zoom_minus->set_tooltip(RTR("Zoom Out"));
  1968. zoom_minus->connect("pressed", callable_mp(this, &GraphEdit::_zoom_minus));
  1969. zoom_minus->set_focus_mode(FOCUS_NONE);
  1970. zoom_reset = memnew(Button);
  1971. zoom_reset->set_flat(true);
  1972. zoom_hb->add_child(zoom_reset);
  1973. zoom_reset->set_tooltip(RTR("Zoom Reset"));
  1974. zoom_reset->connect("pressed", callable_mp(this, &GraphEdit::_zoom_reset));
  1975. zoom_reset->set_focus_mode(FOCUS_NONE);
  1976. zoom_plus = memnew(Button);
  1977. zoom_plus->set_flat(true);
  1978. zoom_hb->add_child(zoom_plus);
  1979. zoom_plus->set_tooltip(RTR("Zoom In"));
  1980. zoom_plus->connect("pressed", callable_mp(this, &GraphEdit::_zoom_plus));
  1981. zoom_plus->set_focus_mode(FOCUS_NONE);
  1982. snap_button = memnew(Button);
  1983. snap_button->set_flat(true);
  1984. snap_button->set_toggle_mode(true);
  1985. snap_button->set_tooltip(RTR("Enable snap and show grid."));
  1986. snap_button->connect("pressed", callable_mp(this, &GraphEdit::_snap_toggled));
  1987. snap_button->set_pressed(true);
  1988. snap_button->set_focus_mode(FOCUS_NONE);
  1989. zoom_hb->add_child(snap_button);
  1990. snap_amount = memnew(SpinBox);
  1991. snap_amount->set_min(5);
  1992. snap_amount->set_max(100);
  1993. snap_amount->set_step(1);
  1994. snap_amount->set_value(20);
  1995. snap_amount->connect("value_changed", callable_mp(this, &GraphEdit::_snap_value_changed));
  1996. zoom_hb->add_child(snap_amount);
  1997. minimap_button = memnew(Button);
  1998. minimap_button->set_flat(true);
  1999. minimap_button->set_toggle_mode(true);
  2000. minimap_button->set_tooltip(RTR("Enable grid minimap."));
  2001. minimap_button->connect("pressed", callable_mp(this, &GraphEdit::_minimap_toggled));
  2002. minimap_button->set_pressed(true);
  2003. minimap_button->set_focus_mode(FOCUS_NONE);
  2004. zoom_hb->add_child(minimap_button);
  2005. layout_button = memnew(Button);
  2006. layout_button->set_flat(true);
  2007. zoom_hb->add_child(layout_button);
  2008. layout_button->set_tooltip(RTR("Arrange nodes."));
  2009. layout_button->connect("pressed", callable_mp(this, &GraphEdit::arrange_nodes));
  2010. layout_button->set_focus_mode(FOCUS_NONE);
  2011. Vector2 minimap_size = Vector2(240, 160);
  2012. float minimap_opacity = 0.65;
  2013. minimap = memnew(GraphEditMinimap(this));
  2014. top_layer->add_child(minimap);
  2015. minimap->set_name("_minimap");
  2016. minimap->set_modulate(Color(1, 1, 1, minimap_opacity));
  2017. minimap->set_mouse_filter(MOUSE_FILTER_PASS);
  2018. minimap->set_custom_minimum_size(Vector2(50, 50));
  2019. minimap->set_size(minimap_size);
  2020. minimap->set_anchors_preset(Control::PRESET_BOTTOM_RIGHT);
  2021. minimap->set_offset(Side::SIDE_LEFT, -minimap_size.x - MINIMAP_OFFSET);
  2022. minimap->set_offset(Side::SIDE_TOP, -minimap_size.y - MINIMAP_OFFSET);
  2023. minimap->set_offset(Side::SIDE_RIGHT, -MINIMAP_OFFSET);
  2024. minimap->set_offset(Side::SIDE_BOTTOM, -MINIMAP_OFFSET);
  2025. minimap->connect("draw", callable_mp(this, &GraphEdit::_minimap_draw));
  2026. set_clip_contents(true);
  2027. }