├── .gitignore ├── LICENSE ├── README.md ├── __init__.py ├── model └── node_relax_props.py ├── operators ├── node_relax_arrange.py ├── node_relax_brush.py └── utils.py └── panels ├── node_relax_arrange.py └── node_relax_brush.py /.gitignore: -------------------------------------------------------------------------------- 1 | __pycache__ 2 | .idea 3 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # NodeRelax-Blender-Addon 2 | 3 | ![demo GIF](https://media.giphy.com/media/v1.Y2lkPTc5MGI3NjExNnFleHE4djd2NjFnZnY2NzR4dDdoZXlhZWZmdG93NzMxMGxoN3A4ZCZlcD12MV9pbnRlcm5hbF9naWZfYnlfaWQmY3Q9Zw/CqGyJl0CTl8GWuDNqU/giphy.gif) 4 | 5 | Relax brush for nodes, helps to arrange nodes easier. 6 | Shortcut: Shift+R 7 | 8 | Watch the video for demo: 9 | https://youtu.be/QvNz3ON6e1I 10 | 11 | ## How to use the brush 12 | Controls: 13 | - Shift + R: invoke relax brush 14 | - Left click: smooth nodes 15 | - Hold Shift: move nodes individually 16 | - Right click or Escape key: finish 17 | - `[` to decrease brush size, `]` to increase it 18 | 19 | 20 | 21 | ### aknowledgements 22 | - Code refactored by [Spencer Magnusson](https://github.com/semagnum) 23 | -------------------------------------------------------------------------------- /__init__.py: -------------------------------------------------------------------------------- 1 | # This program is free software; you can redistribute it and/or modify 2 | # it under the terms of the GNU General Public License as published by 3 | # the Free Software Foundation; either version 3 of the License, or 4 | # (at your option) any later version. 5 | # 6 | # This program is distributed in the hope that it will be useful, but 7 | # WITHOUT ANY WARRANTY; without even the implied warranty of 8 | # MERCHANTIBILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 9 | # General Public License for more details. 10 | # 11 | # You should have received a copy of the GNU General Public License 12 | # along with this program. If not, see . 13 | from .model.node_relax_props import NodeRelaxProps 14 | from .operators.node_relax_arrange import NodeRelaxArrange 15 | from .operators.node_relax_brush import NodeRelaxBrush 16 | from .panels.node_relax_arrange import NodeRelaxArrangePanel 17 | from .panels.node_relax_brush import NodeRelaxBrushPanel 18 | 19 | bl_info = { 20 | "name": "Node Relax", 21 | "author": "Shahzod Boyhonov (Specoolar)", 22 | "description": "Tool for arranging nodes easier", 23 | "blender": (2, 92, 0), 24 | "version": (1, 0, 0), 25 | "location": "Node Editor > Properties > Node Relax. Shortcut: Shift R", 26 | "category": "Node", 27 | } 28 | 29 | import bpy 30 | 31 | addon_keymaps = [] 32 | 33 | 34 | def register(): 35 | wm = bpy.context.window_manager 36 | kc = wm.keyconfigs.addon 37 | if kc: 38 | km = kc.keymaps.new(name='Node Editor', space_type='NODE_EDITOR') 39 | kmi = km.keymap_items.new("node_relax.brush", 'R', 'PRESS', shift=True) 40 | 41 | addon_keymaps.append((km, kmi)) 42 | 43 | bpy.utils.register_class(NodeRelaxBrush) 44 | bpy.utils.register_class(NodeRelaxBrushPanel) 45 | bpy.utils.register_class(NodeRelaxArrange) 46 | bpy.utils.register_class(NodeRelaxArrangePanel) 47 | bpy.utils.register_class(NodeRelaxProps) 48 | 49 | bpy.types.Scene.NodeRelax_props = bpy.props.PointerProperty(type=NodeRelaxProps) 50 | 51 | 52 | def unregister(): 53 | for km, kmi in addon_keymaps: 54 | km.keymap_items.remove(kmi) 55 | addon_keymaps.clear() 56 | 57 | bpy.utils.unregister_class(NodeRelaxBrush) 58 | bpy.utils.unregister_class(NodeRelaxBrushPanel) 59 | bpy.utils.unregister_class(NodeRelaxArrange) 60 | bpy.utils.unregister_class(NodeRelaxArrangePanel) 61 | bpy.utils.unregister_class(NodeRelaxProps) 62 | del bpy.types.Scene.NodeRelax_props 63 | 64 | 65 | if __name__ == "__main__": 66 | register() 67 | -------------------------------------------------------------------------------- /model/node_relax_props.py: -------------------------------------------------------------------------------- 1 | import bpy 2 | 3 | 4 | class NodeRelaxProps(bpy.types.PropertyGroup): 5 | #### Brush settings 6 | 7 | IsRunning: bpy.props.BoolProperty(default=False) 8 | BrushSize: bpy.props.FloatProperty(default=150) 9 | Distance: bpy.props.FloatProperty( 10 | name="Distance", 11 | description="Target distance between nodes", 12 | default=80) 13 | RelaxPower: bpy.props.FloatProperty( 14 | name="Relax power", 15 | min=0, 16 | soft_max=0.2, 17 | max=1, 18 | default=0.1) 19 | SlidePower: bpy.props.FloatProperty( 20 | name="Slide power", 21 | min=0, 22 | max=1, 23 | default=0.6) 24 | CollisionPower: bpy.props.FloatProperty( 25 | name="Collision power", 26 | min=0, 27 | max=1, 28 | default=0.9) 29 | 30 | #### Arrange settings 31 | 32 | ArrangeOnlySelected: bpy.props.BoolProperty( 33 | name="Only Selected", 34 | default=False) 35 | Iterations_S1: bpy.props.IntProperty( 36 | name="Step 1", 37 | min=0, 38 | default=200) 39 | Iterations_S2: bpy.props.IntProperty( 40 | name="Step 2", 41 | min=0, 42 | default=200) 43 | Iterations_S3: bpy.props.IntProperty( 44 | name="Step 3", 45 | min=0, 46 | default=200) 47 | Iterations_S4: bpy.props.IntProperty( 48 | name="Step 4", 49 | min=0, 50 | default=200) 51 | AdaptiveIters: bpy.props.BoolProperty( 52 | name="Adaptive Iterations", 53 | default=True) 54 | BackgroundIterations: bpy.props.IntProperty( 55 | name="Background Iterations", 56 | min=0, 57 | max=10, 58 | default=2) 59 | ArrangeState: bpy.props.StringProperty(default="") 60 | -------------------------------------------------------------------------------- /operators/node_relax_arrange.py: -------------------------------------------------------------------------------- 1 | import bpy 2 | import mathutils 3 | 4 | from .utils import arrange_relax, global_loc, calc_collision_y, calc_node 5 | 6 | 7 | def step(step_num, iter_num, nodes, props, root_center, iter_func): 8 | iter_cnt = 0 9 | for i in range(iter_num): 10 | new_center = mathutils.Vector((0, 0)) 11 | node_cnt = 0 12 | changed = False 13 | for node in nodes: 14 | if node.type == 'FRAME': 15 | continue 16 | if props.ArrangeOnlySelected and not node.select: 17 | continue 18 | t = i / iter_num 19 | if iter_func(node, t): 20 | changed = True 21 | new_center += global_loc(node) 22 | node_cnt += 1 23 | 24 | if not changed and props.AdaptiveIters: 25 | break 26 | if not props.ArrangeOnlySelected: 27 | new_center /= node_cnt 28 | slide = root_center - new_center # Keep Center 29 | for node in nodes: 30 | if node.type == 'FRAME': 31 | continue 32 | node.location += slide 33 | iter_cnt += 1 34 | if iter_cnt > props.BackgroundIterations: 35 | iter_cnt = 0 36 | props.ArrangeState = str(i) + "/" + str(iter_num) + " " + str(step_num) + "/4" 37 | yield 1 38 | 39 | 40 | class NodeRelaxArrange(bpy.types.Operator): 41 | """Arrange Nodes""" 42 | bl_idname = "node_relax.arrange" 43 | bl_label = "Arrange Nodes" 44 | 45 | bl_options = {"UNDO", "REGISTER"} 46 | 47 | _timer = None 48 | 49 | @classmethod 50 | def poll(cls, context): 51 | space = context.space_data 52 | if space.type == 'NODE_EDITOR' and space.node_tree is not None: 53 | return True 54 | return False 55 | 56 | def main_routine(self, context): 57 | yield 1 58 | nodes = self.tree.nodes 59 | props = context.scene.NodeRelax_props 60 | root_center = mathutils.Vector((0, 0)) # Original Center 61 | 62 | if not props.ArrangeOnlySelected: 63 | node_cnt = 0 64 | for node in nodes: 65 | if node.type == 'FRAME': 66 | continue 67 | root_center += global_loc(node) 68 | node_cnt += 1 69 | root_center /= node_cnt 70 | 71 | yield from step(1, props.Iterations_S1, nodes, props, root_center, 72 | lambda curr_node, e: arrange_relax(curr_node, 1, 1, props.Distance, False)) 73 | 74 | yield from step(2, props.Iterations_S2, nodes, props, root_center, 75 | lambda curr_node, e: arrange_relax(curr_node, 1, 1, props.Distance, True)) 76 | 77 | dist = mathutils.Vector((0, props.Distance)) 78 | yield from step(3, props.Iterations_S3, nodes, props, root_center, 79 | lambda curr_node, e: calc_collision_y(curr_node, nodes, e, dist)) 80 | 81 | dist = mathutils.Vector((props.Distance, props.Distance)) 82 | zero_vec = mathutils.Vector((0, 0)) 83 | yield from step(4, props.Iterations_S4, nodes, props, root_center, 84 | lambda curr_node, e: calc_node(curr_node, nodes, min(1, e * 2), zero_vec, 0.2, 1, dist, True)) 85 | 86 | yield 0 87 | 88 | def finish(self, context): 89 | wm = context.window_manager 90 | wm.event_timer_remove(self._timer) 91 | props = context.scene.NodeRelax_props 92 | props.ArrangeState = "" 93 | 94 | def modal(self, context, event): 95 | if event.type == 'TIMER': 96 | state = next(self.main_coroutine) 97 | if state == 0: 98 | self.finish(context) 99 | return {'FINISHED'} 100 | 101 | if event.type in {'ESC'}: 102 | self.finish(context) 103 | return {'FINISHED'} 104 | 105 | return {'RUNNING_MODAL'} 106 | 107 | def invoke(self, context, event): 108 | self.tree = context.space_data.edit_tree 109 | 110 | wm = context.window_manager 111 | self.main_coroutine = self.main_routine(context) 112 | self._timer = wm.event_timer_add(0.01, window=context.window) 113 | wm.modal_handler_add(self) 114 | return {'RUNNING_MODAL'} 115 | -------------------------------------------------------------------------------- /operators/node_relax_brush.py: -------------------------------------------------------------------------------- 1 | import bpy 2 | import mathutils 3 | 4 | from .utils import global_loc, calc_node 5 | import gpu 6 | from gpu_extras.presets import draw_circle_2d 7 | from gpu_extras.batch import batch_for_shader 8 | 9 | DRAW_COLOR = (1, 1, 1, 0.5) 10 | DRAW_RADIUS = 10 11 | 12 | 13 | def draw_callback(self): 14 | if self.drag_mode: 15 | if self.dragging_node: 16 | node = self.dragging_node 17 | loc = global_loc(node) 18 | 19 | x1, y1 = loc[0] - DRAW_RADIUS, loc[1] + DRAW_RADIUS 20 | x2, y2 = loc[0] + node.dimensions[0] + DRAW_RADIUS, loc[1] - node.dimensions[1] - DRAW_RADIUS 21 | 22 | shader = gpu.shader.from_builtin('2D_SMOOTH_COLOR') 23 | 24 | vertices = ((x1, y1), (x2, y1), (x2, y2), (x1, y2), (x1, y1)) 25 | vertex_colors = (DRAW_COLOR, DRAW_COLOR, DRAW_COLOR, DRAW_COLOR, DRAW_COLOR) 26 | 27 | batch = batch_for_shader(shader, 'LINE_STRIP', {"pos": vertices, "color": vertex_colors}) 28 | 29 | shader.bind() 30 | batch.draw(shader) 31 | else: 32 | draw_circle_2d(self.cursor_pos, DRAW_COLOR, self.radius) 33 | 34 | 35 | class NodeRelaxBrush(bpy.types.Operator): 36 | """Relax Nodes""" 37 | bl_idname = "node_relax.brush" 38 | bl_label = "Relax Nodes" 39 | 40 | bl_options = {"UNDO", "REGISTER"} 41 | 42 | def __init__(self): 43 | self.radius = 100 44 | self.lmb = False 45 | self.delta = mathutils.Vector((0, 0)) 46 | self.cursor_pos = mathutils.Vector((0, 0)) 47 | self.cursor_prev_pos = mathutils.Vector((0, 0)) 48 | self.slide_vec = mathutils.Vector((0, 0)) 49 | self. drag_mode = False 50 | self.is_dragging = False 51 | self.dragging_node = None 52 | 53 | @classmethod 54 | def poll(cls, context): 55 | space = context.space_data 56 | return space.type == 'NODE_EDITOR' and space.node_tree is not None 57 | 58 | def update_cursor_pos(self, context, event): 59 | self.cursor_prev_pos = self.cursor_pos 60 | self.cursor_pos = mathutils.Vector( 61 | context.region.view2d.region_to_view(event.mouse_region_x, event.mouse_region_y)) 62 | 63 | def update_radius(self, context, original_radius): 64 | radiusM = context.region.view2d.region_to_view(original_radius, 0) 65 | radius0 = context.region.view2d.region_to_view(0, 0) 66 | self.radius = radiusM[0] - radius0[0] 67 | 68 | def get_brush_influence(self, loc, size): 69 | self.delta.x = self.cursor_pos.x - min(max(self.cursor_pos.x, loc.x), loc.x + size.x) 70 | self.delta.y = self.cursor_pos.y - max(min(self.cursor_pos.y, loc.y), loc.y - size.y) 71 | 72 | dist_sqr = self.delta.x * self.delta.x + self.delta.y * self.delta.y 73 | 74 | return 1 - (dist_sqr / (self.radius * self.radius)) 75 | 76 | def main_operation(self, context): 77 | nodes = self.tree.nodes 78 | props = context.scene.NodeRelax_props 79 | 80 | self.slide_vec = self.cursor_pos - self.cursor_prev_pos 81 | context.area.tag_redraw() 82 | 83 | if self.drag_mode: 84 | if self.is_dragging: 85 | if self.dragging_node: 86 | self.dragging_node.location += self.slide_vec 87 | else: 88 | self.update_dragging_node(nodes) 89 | else: 90 | if self.lmb: 91 | dist = mathutils.Vector((props.Distance, props.Distance)) 92 | for node in nodes: 93 | if node.type == 'FRAME': 94 | continue 95 | # Brush 96 | loc = global_loc(node) 97 | size = node.dimensions 98 | infl = self.get_brush_influence(loc, size) 99 | if infl <= 0: 100 | continue 101 | 102 | # Calculate physics 103 | calc_node(node, nodes, infl, self.slide_vec * props.SlidePower, props.RelaxPower, 104 | props.CollisionPower, dist, False) 105 | 106 | def update_dragging_node(self, nodes): 107 | self.dragging_node = None 108 | nearest = 0 109 | for node in nodes: 110 | if node.type == 'FRAME': 111 | continue 112 | loc = global_loc(node) 113 | pos = mathutils.Vector((loc.x, loc.y)) 114 | pos.x += node.dimensions.x / 2 115 | pos.y -= node.dimensions.y / 2 116 | pos -= self.cursor_pos 117 | dist = pos.x * pos.x + pos.y * pos.y # Squared length 118 | if self.dragging_node is None or dist < nearest: 119 | self.dragging_node = node 120 | nearest = dist 121 | 122 | def finish(self, context, props): 123 | st = bpy.types.SpaceNodeEditor 124 | st.draw_handler_remove(self.draw_handler, 'WINDOW') 125 | props.IsRunning = False 126 | 127 | def modal(self, context, event): 128 | props = context.scene.NodeRelax_props 129 | 130 | if event.type in {'MIDDLEMOUSE', 'WHEELUPMOUSE', 'WHEELDOWNMOUSE'}: # allow navigation shortcuts 131 | return {'PASS_THROUGH'} 132 | 133 | if event.type == 'LEFT_SHIFT' or event.type == 'RIGHT_SHIFT': # drag individual node 134 | if event.value == 'PRESS': 135 | self.drag_mode = True 136 | if event.value == 'RELEASE': 137 | self.drag_mode = False 138 | self.is_dragging = False 139 | self.update_dragging_node(self.tree.nodes) 140 | context.area.tag_redraw() 141 | 142 | if event.type == 'MOUSEMOVE': 143 | self.update_cursor_pos(context, event) 144 | self.update_radius(context, props.BrushSize) 145 | self.main_operation(context) 146 | 147 | if event.type == 'WHEELUPMOUSE' or event.type == 'WHEELDOWNMOUSE': 148 | self.update_cursor_pos(context, event) 149 | self.update_radius(context, props.BrushSize) 150 | context.area.tag_redraw() 151 | 152 | elif event.type == 'LEFTMOUSE': 153 | if event.value == 'PRESS': 154 | self.lmb = True 155 | if self.drag_mode: 156 | self.is_dragging = True 157 | else: 158 | self.update_cursor_pos(context, event) 159 | self.cursor_prev_pos = self.cursor_pos # No sliding 160 | self.main_operation(context) 161 | if event.value == 'RELEASE': 162 | self.lmb = False 163 | if self.drag_mode: 164 | self.is_dragging = False 165 | 166 | elif event.type in {'RIGHTMOUSE', 'ESC'}: 167 | self.finish(context, props) 168 | context.area.tag_redraw() 169 | return {'FINISHED'} 170 | 171 | if event.type == "LEFT_BRACKET": 172 | props.BrushSize -= 10 173 | props.BrushSize = max(props.BrushSize, 10) 174 | self.update_radius(context, props.BrushSize) 175 | context.area.tag_redraw() 176 | 177 | elif event.type == "RIGHT_BRACKET": 178 | props.BrushSize += 10 179 | props.BrushSize = min(props.BrushSize, 1000) 180 | self.update_radius(context, props.BrushSize) 181 | context.area.tag_redraw() 182 | 183 | return {'RUNNING_MODAL'} 184 | 185 | def invoke(self, context, event): 186 | props = context.scene.NodeRelax_props 187 | if props.IsRunning: 188 | return {'CANCELLED'} 189 | 190 | self.tree = context.space_data.edit_tree 191 | context.window_manager.modal_handler_add(self) 192 | st = bpy.types.SpaceNodeEditor 193 | self.draw_handler = st.draw_handler_add(draw_callback, (self,), 'WINDOW', 'POST_VIEW') 194 | 195 | self.lmb = False 196 | props.IsRunning = True 197 | self.update_cursor_pos(context, event) 198 | self.update_radius(context, props.BrushSize) 199 | 200 | context.area.tag_redraw() 201 | return {'RUNNING_MODAL'} 202 | -------------------------------------------------------------------------------- /operators/utils.py: -------------------------------------------------------------------------------- 1 | import mathutils 2 | 3 | MOVE_UNIT = 1 4 | 5 | 6 | def global_loc(node): 7 | if node.parent: 8 | return global_loc(node.parent) + node.location 9 | else: 10 | return node.location 11 | 12 | 13 | def calc_node(node, nodes, influence, slide_vec, relax_power, collide_power, collide_dist, pull_non_siblings): 14 | if node.type == 'FRAME': 15 | return False 16 | 17 | loc = global_loc(node) 18 | size = node.dimensions 19 | 20 | offset = mathutils.Vector(slide_vec) 21 | 22 | if relax_power > 0: 23 | # Relax 24 | tar_y = 0 25 | link_cnt = 0 26 | tar_x_in = loc.x 27 | has_input = False 28 | for socket in node.inputs: # Input links 29 | for link in socket.links: 30 | other = link.from_node 31 | if not pull_non_siblings and node.parent != other.parent: 32 | continue 33 | loc_other = global_loc(other) 34 | size_other = other.dimensions 35 | 36 | x = loc_other.x + size_other.x + collide_dist.x 37 | if has_input > 0: 38 | tar_x_in = max(tar_x_in, x) 39 | else: 40 | tar_x_in = x 41 | has_input = True 42 | 43 | tar_y += loc_other.y - size_other.y / 2 44 | link_cnt += 1 45 | 46 | tar_x_out = loc.x 47 | has_output = False 48 | for socket in node.outputs: # Output links 49 | for link in socket.links: 50 | other = link.to_node 51 | if not pull_non_siblings and node.parent != other.parent: 52 | continue 53 | loc_other = global_loc(other) 54 | size_other = other.dimensions 55 | 56 | x = loc_other.x - size.x - collide_dist.x 57 | if has_output > 0: 58 | tar_x_out = min(tar_x_out, x) 59 | else: 60 | tar_x_out = x 61 | has_output = True 62 | 63 | tar_y += loc_other.y - size_other.y / 2 64 | link_cnt += 1 65 | 66 | if link_cnt > 0: 67 | tar_x = tar_x_in * int(has_input) + tar_x_out * int(has_output) 68 | tar_x /= int(has_input) + int(has_output) 69 | tar_y /= link_cnt 70 | tar_y += size.y / 2 71 | offset.x += (tar_x - loc.x) * relax_power 72 | offset.y += (tar_y - loc.y) * relax_power 73 | 74 | if collide_power > 0: 75 | # Collision 76 | for other in nodes: 77 | if other == node: 78 | continue 79 | if other.type == 'FRAME': 80 | continue 81 | collide(loc, global_loc(other), size, other.dimensions, 82 | offset, collide_power, collide_dist) 83 | 84 | if abs(offset.x) > MOVE_UNIT or abs(offset.y) > MOVE_UNIT: 85 | node.location += offset * influence 86 | return True 87 | else: 88 | return False 89 | 90 | 91 | def socket_pos(socket, sockets, size): 92 | i = 0 93 | sockets_filtered = [] 94 | for s in sockets: 95 | if len(s.links) > 0: 96 | sockets_filtered.append(s) 97 | 98 | for s in sockets_filtered: 99 | if s == socket: 100 | return (i / len(sockets_filtered)) * size 101 | 102 | i += 1 103 | return size / 2 104 | 105 | 106 | def calc_collision_y(node, nodes, collide_power, collide_dist): 107 | if node.type == 'FRAME': 108 | return False 109 | 110 | loc = global_loc(node) 111 | size = node.dimensions 112 | 113 | offset = mathutils.Vector((0, 0)) 114 | 115 | # Collision 116 | for other in nodes: 117 | if other == node: 118 | continue 119 | if other.type == 'FRAME': 120 | continue 121 | collide(loc, global_loc(other), size, other.dimensions, 122 | offset, 1, collide_dist, True) 123 | 124 | if abs(offset.y) > MOVE_UNIT: 125 | node.location += offset * collide_power 126 | return True 127 | else: 128 | return False 129 | 130 | 131 | def arrange_relax(node, influence, relax_power, distance, clamped_pull): 132 | if node.type == 'FRAME': 133 | return False 134 | 135 | loc = global_loc(node) 136 | size = node.dimensions 137 | 138 | offset = mathutils.Vector((0, 0)) 139 | 140 | # Relax 141 | tar_y = 0 142 | tar_x_in = loc.x if clamped_pull else 0 143 | link_cnt = 0 144 | has_input = False 145 | for socket in node.inputs: # Input links 146 | for link in socket.links: 147 | other = link.from_node 148 | # if node.parent != other.parent: continue 149 | loc_other = global_loc(other) 150 | size_other = other.dimensions 151 | 152 | x = loc_other.x + size_other.x + distance 153 | if clamped_pull: 154 | if has_input > 0: 155 | tar_x_in = max(tar_x_in, x) 156 | else: 157 | tar_x_in = x 158 | else: 159 | tar_x_in += x 160 | has_input = True 161 | 162 | tar_y += loc_other.y + socket_pos(socket, node.inputs, size.y) - socket_pos(link.from_socket, other.outputs, 163 | size_other.y) 164 | link_cnt += 1 165 | 166 | tar_x_out = loc.x if clamped_pull else 0 167 | has_output = False 168 | for socket in node.outputs: # Output links 169 | for link in socket.links: 170 | other = link.to_node 171 | # if node.parent != other.parent: continue 172 | loc_other = global_loc(other) 173 | size_other = other.dimensions 174 | 175 | x = loc_other.x - size.x - distance 176 | if clamped_pull: 177 | if has_output > 0: 178 | tar_x_out = min(tar_x_out, x) 179 | else: 180 | tar_x_out = x 181 | else: 182 | tar_x_out += x 183 | has_output = True 184 | 185 | tar_y += loc_other.y + socket_pos(socket, node.outputs, size.y) - socket_pos(link.to_socket, other.inputs, 186 | size_other.y) 187 | link_cnt += 1 188 | 189 | if link_cnt > 0: 190 | if clamped_pull: 191 | tar_x = tar_x_in * int(has_input) + tar_x_out * int(has_output) 192 | tar_x /= int(has_input) + int(has_output) 193 | else: 194 | tar_x = (tar_x_in + tar_x_out) / link_cnt 195 | tar_y /= link_cnt 196 | offset.x += (tar_x - loc.x) * relax_power 197 | offset.y += (tar_y - loc.y) * relax_power 198 | 199 | if abs(offset.x) > MOVE_UNIT or abs(offset.y) > MOVE_UNIT: 200 | node.location += offset * influence 201 | return True 202 | else: 203 | return False 204 | 205 | 206 | def collide(loc0, loc1, size0, size1, offset, power, dist, only_y=False): 207 | pos0 = loc0 + size0 / 2 208 | pos1 = loc1 + size1 / 2 209 | pos0.y -= size0.y 210 | pos1.y -= size1.y 211 | 212 | size = (size0 + size1) / 2 + dist 213 | delta = pos1 - pos0 214 | inters = size - mathutils.Vector((abs(delta.x), abs(delta.y))) 215 | 216 | if inters.x > 0 and inters.y > 0: 217 | if inters.y < inters.x or only_y: 218 | if delta.y > 0: 219 | inters.y *= -1 220 | offset.y += inters.y / 2 * power 221 | else: 222 | if delta.x > 0: 223 | inters.x *= -1 224 | offset.x += inters.x / 2 * power -------------------------------------------------------------------------------- /panels/node_relax_arrange.py: -------------------------------------------------------------------------------- 1 | from bpy.types import Panel 2 | 3 | 4 | class NodeRelaxArrangePanel(Panel): 5 | """Node Arrange Panel""" 6 | bl_label = "Node Arrange" 7 | bl_idname = "NODE_RELAX_PT_arrange_menu" 8 | bl_space_type = 'NODE_EDITOR' 9 | bl_region_type = 'UI' 10 | bl_category = 'Node Relax' 11 | 12 | def draw(self, context): 13 | layout = self.layout 14 | props = context.scene.NodeRelax_props 15 | layout.operator("node_relax.arrange") 16 | if len(props.ArrangeState) > 0: 17 | layout.label(text=props.ArrangeState) 18 | layout.prop(props, "ArrangeOnlySelected") 19 | layout.separator() 20 | layout.label(text="Max Iterations:") 21 | box = layout.box() 22 | box.prop(props, "Iterations_S1") 23 | box.prop(props, "Iterations_S2") 24 | box.prop(props, "Iterations_S3") 25 | box.prop(props, "Iterations_S4") 26 | box.prop(props, "AdaptiveIters") 27 | # layout.separator() 28 | # layout.prop(props, "BackgroundIterations") 29 | -------------------------------------------------------------------------------- /panels/node_relax_brush.py: -------------------------------------------------------------------------------- 1 | from bpy.types import Panel 2 | 3 | 4 | class NodeRelaxBrushPanel(Panel): 5 | """Node Relax Panel""" 6 | bl_label = "Node Relax Brush" 7 | bl_idname = "NODE_RELAX_PT_brush_menu" 8 | bl_space_type = 'NODE_EDITOR' 9 | bl_region_type = 'UI' 10 | bl_category = 'Node Relax' 11 | 12 | def draw(self, context): 13 | layout = self.layout 14 | props = context.scene.NodeRelax_props 15 | layout.operator("node_relax.brush", text="Relax Brush") 16 | layout.label(text = "Shortcut: Shift R") 17 | layout.separator() 18 | layout.prop(props, "BrushSize") 19 | layout.prop(props, "Distance") 20 | layout.separator() 21 | box = layout.box() 22 | box.prop(props, "RelaxPower") 23 | box.prop(props, "SlidePower") 24 | box.prop(props, "CollisionPower") --------------------------------------------------------------------------------