From 3dba770fcc93a4a76c85fcb6a2f16741a50f27bb Mon Sep 17 00:00:00 2001 From: SpaceWarpStudio Date: Tue, 31 Mar 2026 01:06:41 +0200 Subject: [PATCH] Initial commit: ComfyUI Set/Get virtual nodes Made-with: Cursor --- .gitignore | 20 + LICENSE | 695 ++++++++++++++++++ README.md | 76 ++ __init__.py | 24 + web/js/setinputgetoutput.js | 1331 +++++++++++++++++++++++++++++++++++ 5 files changed, 2146 insertions(+) create mode 100644 .gitignore create mode 100644 LICENSE create mode 100644 README.md create mode 100644 __init__.py create mode 100644 web/js/setinputgetoutput.js diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..c906ec6 --- /dev/null +++ b/.gitignore @@ -0,0 +1,20 @@ +# Byte-compiled / cache +__pycache__/ +*.py[cod] +*$py.class +*.so + +# Virtual environments +.venv/ +venv/ +env/ + +# OS / editor noise +.DS_Store +Thumbs.db +*.swp +*~ + +# Optional: local IDE (uncomment if you prefer not to commit machine-specific paths) +# .idea/ +# .vscode/ diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..57ff3b4 --- /dev/null +++ b/LICENSE @@ -0,0 +1,695 @@ +ComfyUI-SetInputGetOutput +Copyright (C) 2026 the ComfyUI-SetInputGetOutput authors + +This program is free software: you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by the +Free Software Foundation; either version 3 of the License, or (at your +option) any later version. + +This program is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +GNU General Public License for more details. + +This project includes material derived from Set/Get functionality in +ComfyUI-KJNodes (https://github.com/kijai/ComfyUI-KJNodes), which is +licensed under the GNU General Public License v3.0. + +The complete GNU General Public License v3.0 text follows. + +================================================================================ + + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/README.md b/README.md new file mode 100644 index 0000000..c915a91 --- /dev/null +++ b/README.md @@ -0,0 +1,76 @@ +# ComfyUI Set Input / Get Output + +Virtual **Set** and **Get** nodes for ComfyUI: name a value on a **Set** node and read it from a **Get** node without long wires. This project was **extracted from [kijai/ComfyUI-KJNodes](https://github.com/kijai/ComfyUI-KJNodes)** (Set/Get idea and JS-style implementation) some time ago and then adapted here. That upstream repository is licensed under **[GNU GPL v3.0](https://github.com/kijai/ComfyUI-KJNodes/blob/main/LICENSE)**. Unlike the usual single-setter pattern, **several Set nodes may share the same name**. The **Get** node always resolves to whichever Set with that name is **active** (not bypassed and not muted), so you can disable whole group sections—e.g. different themes or parameter packs—and the Get follows the group you left on. + +There are **no Python node classes** in this package: behavior lives entirely in [`web/js/setinputgetoutput.js`](web/js/setinputgetoutput.js). Nodes appear under **Utilities → InputOutput** as `SetInputNode` and `GetOutputNode`. + +## How active setter selection works + +- **Set** nodes store an **Input Name** and take one typed input. Duplicate names are allowed. +- **Get** nodes pick a name from a combo populated from all Set names on the graph. +- Resolution uses the **first** Set with that name whose `mode` is not bypass (LiteGraph mode `4`) and not muted/never (`2`). + **Practical rule:** keep **exactly one** non-bypassed Set per name so the source is predictable. If two stay active, order depends on internal graph node order. + +Execution data flows via `getInputInfo` / `getInputLink` on the Get node, which point at the **active** setter’s upstream link—so the backend sees the same graph as if you had wired through the Set. + +## Group / theme switching + +Use parallel branches (e.g. “Theme A”, “Theme B”), each ending in a Set with the **same** name (`prompt`, `style`, etc.). Bypass the branches you don’t want; un-bypass the one you want. Connected Gets update their output type and title from the active Set. + +``` +[Theme A …] → [Set: "theme"] ← bypass when off +[Theme B …] → [Set: "theme"] ← active + ↓ + [Get: "theme"] → rest of workflow +``` + +## Set node + +- Typed input; connects from any compatible output. +- If **Input Name** is empty when you connect, it can auto-fill from the slot type. +- **`Set_`** title when a name is set (prefix can be disabled in JS via `disablePrefix`). + +## Get node + +- Combo **Output Name**; options are unique non-empty names from all Set nodes on the graph. +- Output slot type tracks the **active** Set’s input type; incompatible downstream links may be removed when the type changes. +- Title **`Get_`** when bound to a named setter. + +## UI features + +- **Show / Hide connections**: optional Bézier hints between Set and matching Gets (or Get to active Set). **Hide all connections** clears hints on every Set/Get on the graph. +- **Go to first active Getter** (on Set) / **Go to active setter** (on Get). +- **Convert** Set ↔ Get in place (disconnects links; use when restructuring). **Create … to the right** adds the counterpart node. With multiple nodes selected, **Convert selected Set/Get nodes** runs on the canvas or node menu (ComfyUI context menu API). + +## Installation + +1. Copy or clone this folder into `ComfyUI/custom_nodes/` (e.g. `ComfyUI/custom_nodes/ComfyUI-SetInputGetOutput`). +2. Restart ComfyUI. + +If you use `git clone`, point it at **your** fork or source repository URL for this project. + +## Troubleshooting + +**Get doesn’t match the branch I expect** +Ensure only one Set with that name is non-bypassed (and not muted). Bypass the other groups. + +**Empty or missing combo names** +Add at least one Set with a non-empty Input Name on the graph. + +**Type / link errors after switching** +The Get’s output type follows the active Set. Reconnect or fix downstream nodes if types no longer match; the extension can drop links that are clearly incompatible after a type change. + +**Wrong data** +Confirm the active Set’s input is still wired to the intended upstream node. + +--- + +## License + +This project is licensed under the **GNU General Public License v3.0**. See [`LICENSE`](LICENSE) for the full text. + +Set/Get functionality is derived from **[ComfyUI-KJNodes](https://github.com/kijai/ComfyUI-KJNodes)** (also GPL-3.0). The [`LICENSE`](LICENSE) file includes that attribution and links to their repository. + +--- + +Main implementation file: [`web/js/setinputgetoutput.js`](web/js/setinputgetoutput.js). Loader: [`__init__.py`](__init__.py) (serves `web/` and registers no Python nodes). diff --git a/__init__.py b/__init__.py new file mode 100644 index 0000000..73e78b4 --- /dev/null +++ b/__init__.py @@ -0,0 +1,24 @@ +# __init__.py inside ComfyUI/custom_nodes/MyStandaloneSetGetNodes/ + +# Optional: Import folder_paths if you need it for Python nodes later, +# but it's not strictly required just for loading JS. +# import folder_paths + +# Since these are pure JavaScript nodes, we don't have Python node classes to map. +# If you were adding Python nodes as well, you would define them here. +NODE_CLASS_MAPPINGS = {} + +# Similarly, no Python nodes means no display names to map here. +NODE_DISPLAY_NAME_MAPPINGS = {} + +# This is the crucial part for JavaScript nodes. +# It tells ComfyUI to make the 'web' directory accessible to the frontend. +# ComfyUI will automatically look for JS files within this directory (and its subdirectories). +WEB_DIRECTORY = "./web" # Tells ComfyUI to serve files from the 'web' folder + +# Optional: Standard Python practice to define what the module exports. +__all__ = ['NODE_CLASS_MAPPINGS', 'NODE_DISPLAY_NAME_MAPPINGS', 'WEB_DIRECTORY'] + +print("------------------------------------------") +print("Loaded Standalone Set/Get Nodes") +print("------------------------------------------") diff --git a/web/js/setinputgetoutput.js b/web/js/setinputgetoutput.js new file mode 100644 index 0000000..66ad789 --- /dev/null +++ b/web/js/setinputgetoutput.js @@ -0,0 +1,1331 @@ +// Standalone Set/Get Node Implementation for ComfyUI + +import { app } from "../../../scripts/app.js"; + +// Get LiteGraph instance +const LiteGraph = window.LiteGraph; + +if (!LiteGraph) { + console.error("LiteGraph not found. Cannot register Standalone Set/Get nodes."); +} else { + + // --- Configuration --- + const disablePrefix = false; // Set to true to remove "Set_" and "Get_" prefixes from titles + const DEBUG = false; // Set true for verbose console logging + let isExecutionActive = false; // Pause expensive UI updates during execution + + // --- Helper Functions --- + + function debugLog(...args) { if (DEBUG) console.log(...args); } + function debugWarn(...args) { if (DEBUG) console.warn(...args); } + + // Placeholder/Simple implementation for color setting + // Replace with your actual color logic if needed + function setColorAndBgColor(type) { + // Example: Log the type instead of setting colors + // console.log(`Node ${this.id}: Setting color based on type: ${type}`); + // Default colors or simple logic: + this.color = "#333"; + this.bgcolor = "#555"; + if (type && type !=='*') { + const colorMap = { + "MODEL": { color: "#233", bgcolor: "#355" }, + "CONDITIONING": { color: "#322", bgcolor: "#533" }, + "LATENT": { color: "#223", bgcolor: "#335" }, + "VAE": { color: "#232", bgcolor: "#353" }, + "IMAGE": { color: "#332", bgcolor: "#553" }, + // Add other types as needed + }; + const colors = colorMap[type.toUpperCase()]; + if (colors) { + this.color = colors.color; + this.bgcolor = colors.bgcolor; + } + } + } + + // --- Node Conversion/Creation Helpers --- + function getNodeVarName(node) { + const v = node?.widgets?.[0]?.value; + return (typeof v === "string") ? v : (v == null ? "" : String(v)); + } + + function readVec2(v) { + // Accept Array, Float32Array, etc. + if (v && typeof v === "object" && typeof v.length === "number" && v.length >= 2) { + const x = Number(v[0]); + const y = Number(v[1]); + if (Number.isFinite(x) && Number.isFinite(y)) return [x, y]; + } + return null; + } + + function getNodePos(node) { + return readVec2(node?.pos) || readVec2(node?.position) || null; + } + + function getNodeWidth(node) { + const size = readVec2(node?.size); + if (size) return size[0]; + if (typeof node?.computeSize === "function") { + const s = node.computeSize(); + const cs = readVec2(s); + if (cs) return cs[0]; + } + return 180; // reasonable fallback + } + + function computeSetNames(graph) { + if (!graph || !graph._nodes) return []; + return [...new Set( + graph._nodes + .filter(n => n.type === "SetInputNode" && n.widgets && n.widgets[0]) + .map(n => n.widgets[0].value) + .filter(name => name !== null && name !== undefined && name !== "") + )].sort(); + } + + function updateAllGetterCombos(graph, force = false) { + if (!graph || !graph._nodes) return; + const names = computeSetNames(graph); + const signature = names.join("\u001f"); + + if (!force && graph._setGetNameSignature === signature) return; + graph._setGetNameSignature = signature; + graph._setGetNameList = names; + + const getters = graph._nodes.filter(n => n.type === "GetOutputNode"); + getters.forEach(getter => { + if (getter.setComboValues) { + getter.setComboValues(); + } + }); + } + + function getRootGraph() { + return app?.graph || app?.rootGraph || app?.rootGraphInternal || null; + } + + function flushSetGetUpdates(graph) { + if (!graph || !graph._nodes) return; + + // First run pending Set updates + graph._nodes.forEach(node => { + if (node.type === "SetInputNode" && node._pendingUpdate) { + node._pendingUpdate = false; + node.update?.(); + } + }); + + // Refresh combo list after names settle + updateAllGetterCombos(graph, true); + + // Then run pending Get renames + graph._nodes.forEach(node => { + if (node.type === "GetOutputNode" && node._pendingRename) { + node._pendingRename = false; + node.onRename?.(); + } + }); + + // Redraw once after flush + if (graph.list_of_graphcanvas) { + graph.list_of_graphcanvas.forEach(c => c.setDirty(true, true)); + } + } + + function disconnectAllLinks(node) { + const graph = node?.graph; + if (!graph) return; + + // Remove incoming links + if (Array.isArray(node.inputs)) { + for (const input of node.inputs) { + if (typeof input?.link === "number") { + if (typeof graph.removeLink === "function") { + graph.removeLink(input.link); + } else { + console.warn("Set/Get: graph.removeLink missing; cannot remove link", input.link); + } + } + } + } + + // Remove outgoing links + if (Array.isArray(node.outputs)) { + for (const output of node.outputs) { + if (Array.isArray(output?.links) && output.links.length) { + // copy because removeLink mutates graph.links / links arrays + const links = output.links.slice(); + for (const linkId of links) { + if (typeof graph.removeLink === "function") { + graph.removeLink(linkId); + } else { + console.warn("Set/Get: graph.removeLink missing; cannot remove link", linkId); + } + } + } + } + } + } + + function resolveRegisteredTypeKey(type) { + const reg = LiteGraph?.registered_node_types; + if (!reg || !type) return type; + if (reg[type]) return type; + // Some LiteGraph builds use "category/name" keys; try suffix match. + const suffix1 = `/${type}`; + for (const key of Object.keys(reg)) { + if (key === type) return key; + if (key.endsWith(suffix1)) return key; + } + return type; + } + + function safeCreateNode(type) { + if (!type) return null; + const typeKey = resolveRegisteredTypeKey(type); + + // Most LiteGraph builds + if (typeof LiteGraph?.createNode === "function") { + try { + const n = LiteGraph.createNode(typeKey); + if (n && !n.type) n.type = typeKey; + return n; + } catch (e) { + console.warn(`Set/Get: LiteGraph.createNode("${typeKey}") threw`, e); + } + } + + // Fallback: registry-based construction (varies by LiteGraph version) + const reg = LiteGraph?.registered_node_types?.[typeKey]; + if (!reg) { + console.warn(`Set/Get: Node type "${typeKey}" not found in LiteGraph.registered_node_types`); + return null; + } + + try { + // Some versions store the class directly + if (typeof reg === "function") { + const n = new reg(); + if (!n.type) n.type = typeKey; + return n; + } + // Other versions store an object containing the class + if (typeof reg?.class === "function") { + const n = new reg.class(); + if (!n.type) n.type = typeKey; + return n; + } + } catch (e) { + console.warn(`Set/Get: failed constructing node "${typeKey}" from registry`, e); + } + + console.warn(`Set/Get: unsupported registry entry for node type "${typeKey}"`, reg); + return null; + } + + function safeGraphAddNode(graph, node) { + if (!graph || !node) return false; + try { + if (typeof graph.add === "function") { graph.add(node); return true; } + if (typeof graph.addNode === "function") { graph.addNode(node); return true; } + } catch (e) { + console.warn("Set/Get: graph add failed", e); + return false; + } + console.warn("Set/Get: graph has no add/addNode method"); + return false; + } + + function graphHasNode(graph, node) { + if (!graph || !node) return false; + if (typeof node.id === "number" && graph._nodes_by_id && graph._nodes_by_id[node.id]) return true; + if (Array.isArray(graph._nodes) && graph._nodes.includes(node)) return true; + return false; + } + + function safeGraphRemoveNode(graph, node) { + if (!graph || !node) return false; + try { + if (typeof graph.remove === "function") { graph.remove(node); return true; } + if (typeof graph.removeNode === "function") { graph.removeNode(node); return true; } + if (typeof node.id === "number" && typeof graph.remove === "function") { graph.remove(node.id); return true; } + } catch (e) { + console.warn("Set/Get: graph remove failed", e); + return false; + } + console.warn("Set/Get: graph has no remove/removeNode method"); + return false; + } + + function initConvertedNodeNameAndUI(newNode, name) { + if (!newNode?.widgets?.[0]) return; + newNode.widgets[0].value = name ?? ""; + + // Ensure title/type updates happen + if (newNode.type === "GetOutputNode" && typeof newNode.onRename === "function") { + newNode.onRename(); + } else if (newNode.type === "SetInputNode") { + if (newNode.widgets[0].value !== "") { + newNode.title = (!disablePrefix ? "Set_" : "") + newNode.widgets[0].value; + } else { + newNode.title = "Set (Input)"; + } + if (newNode.properties) { + newNode.properties.previousName = newNode.widgets[0].value; + } + if (typeof newNode.update === "function") { + newNode.update(); + } + } + } + + function selectAndRedraw(node) { + if (app?.canvas) { + app.canvas.selectNode(node, false); + app.canvas.setDirty(true, true); + } + if (node?.graph?.list_of_graphcanvas) { + node.graph.list_of_graphcanvas.forEach(c => c.setDirty(true, true)); + } + } + + function getSelectedNodesFromCanvas(canvas) { + // ComfyUI/LiteGraph variants: + // - Nodes 2.0: canvas.selectedItems is a Set (nodes, groups, etc) + // - Older: canvas.selected_nodes is an object map + let items = []; + try { + if (canvas?.selectedItems && typeof canvas.selectedItems[Symbol.iterator] === "function") { + items = Array.from(canvas.selectedItems); + } else if (canvas?.selected_nodes && typeof canvas.selected_nodes === "object") { + items = Object.values(canvas.selected_nodes); + } else if (app?.canvas?.selected_nodes && typeof app.canvas.selected_nodes === "object") { + items = Object.values(app.canvas.selected_nodes); + } + } catch (_) { + items = []; + } + + // Filter to node-like objects + return items.filter(n => + n && + typeof n === "object" && + typeof n.type === "string" && + n.graph + ); + } + + function convertSelectedSetGetNodes(canvas) { + const selected = getSelectedNodesFromCanvas(canvas) + .filter(n => n.type === "SetInputNode" || n.type === "GetOutputNode"); + if (selected.length === 0) return; + + // Snapshot list to avoid mutation while converting/removing nodes + const toConvert = selected.slice(); + const created = []; + + for (const node of toConvert) { + const targetType = node.type === "SetInputNode" ? "GetOutputNode" : "SetInputNode"; + const newNode = convertNodeInPlace(node, targetType, { select: false }); + if (newNode) created.push(newNode); + } + + // Select one of the new nodes (optional, but avoids ending up with no selection after removal) + const first = created[0]; + if (first) { + const c = canvas || app?.canvas; + if (c?.selectNode) { + try { c.selectNode(first, false); } catch (_) {} + } + } + + // Ensure redraw + if (app?.canvas?.setDirty) app.canvas.setDirty(true, true); + if (first?.graph?.list_of_graphcanvas) { + first.graph.list_of_graphcanvas.forEach(gc => gc.setDirty(true, true)); + } + } + + function createSiblingNodeToRight(sourceNode, targetType) { + const graph = sourceNode?.graph; + if (!graph) return null; + + const name = getNodeVarName(sourceNode); + const newNode = safeCreateNode(targetType); + if (!newNode) { + console.warn("Set/Get: Create sibling failed - could not create node", targetType); + return null; + } + + const sourcePos = getNodePos(sourceNode) || (app?.canvas?.graph_mouse ? readVec2(app.canvas.graph_mouse) : null) || [0, 0]; + const offsetX = getNodeWidth(sourceNode) + 50; + newNode.pos = [sourcePos[0] + offsetX, sourcePos[1]]; + + // Keep mode consistent with source (useful if user is working with bypassed groups) + if (typeof sourceNode.mode === "number") { + newNode.mode = sourceNode.mode; + } + + if (!safeGraphAddNode(graph, newNode)) { + console.warn("Set/Get: Create sibling failed - could not add node to graph", targetType); + return null; + } + if (!graphHasNode(graph, newNode)) { + console.warn("Set/Get: Create sibling warning - graph add returned, but node not found in graph", newNode); + } + initConvertedNodeNameAndUI(newNode, name); + selectAndRedraw(newNode); + return newNode; + } + + function convertNodeInPlace(sourceNode, targetType, options = {}) { + const graph = sourceNode?.graph; + if (!graph) return null; + + const name = getNodeVarName(sourceNode); + const pos = getNodePos(sourceNode) || (app?.canvas?.graph_mouse ? readVec2(app.canvas.graph_mouse) : null) || [0, 0]; + const mode = (typeof sourceNode.mode === "number") ? sourceNode.mode : undefined; + + // User requested: no confirmation, just disconnect anything active. + disconnectAllLinks(sourceNode); + + const newNode = safeCreateNode(targetType); + if (!newNode) { + console.warn("Set/Get: Convert failed - could not create node", targetType); + return null; + } + + newNode.pos = [pos[0], pos[1]]; + if (typeof mode === "number") newNode.mode = mode; + + if (!safeGraphAddNode(graph, newNode)) { + console.warn("Set/Get: Convert failed - could not add new node to graph", targetType); + return null; + } + if (!graphHasNode(graph, newNode)) { + console.warn("Set/Get: Convert aborted - new node not found in graph, not deleting original", newNode); + return null; + } + initConvertedNodeNameAndUI(newNode, name); + + const removed = safeGraphRemoveNode(graph, sourceNode); + if (!removed) { + console.warn("Set/Get: Convert warning - failed to remove original node", sourceNode); + } + if (options.select !== false) { + selectAndRedraw(newNode); + } else { + // Avoid viewport/selection churn for batch operations; still redraw. + if (app?.canvas?.setDirty) app.canvas.setDirty(true, true); + if (newNode?.graph?.list_of_graphcanvas) { + newNode.graph.list_of_graphcanvas.forEach(c => c.setDirty(true, true)); + } + } + return newNode; + } + + // --- Main Extension --- + + app.registerExtension({ + name: "Standalone.SetGetNodes", // Keep the extension name or change if desired + /** + * ComfyUI (new) context menu API (Nodes 2.0+): + * Prefer this over node.getExtraMenuOptions(), which is deprecated. + * Docs: https://docs.comfy.org/custom-nodes/js/context-menu-migration + */ + getNodeMenuItems(node) { + try { + if (!node) return []; + const t = node.type; + + // If multiple nodes are selected, offer a bulk convert right from the node menu too. + const selected = getSelectedNodesFromCanvas(app?.canvas); + const selectedSetGet = selected.filter(n => n.type === "SetInputNode" || n.type === "GetOutputNode"); + const bulkItems = (selectedSetGet.length > 1) + ? [ + null, + { + content: `Convert selected Set/Get nodes (${selectedSetGet.length})`, + callback: () => { convertSelectedSetGetNodes(app?.canvas); }, + }, + ] + : []; + + if (t === "SetInputNode") { + return [ + ...bulkItems, + null, + { + content: "Convert to Get (Output)", + callback: () => { + convertNodeInPlace(node, "GetOutputNode"); + }, + }, + { + content: "Create Get (Output) to the right", + callback: () => { + createSiblingNodeToRight(node, "GetOutputNode"); + }, + }, + ]; + } + + if (t === "GetOutputNode") { + return [ + ...bulkItems, + null, + { + content: "Convert to Set (Input)", + callback: () => { + convertNodeInPlace(node, "SetInputNode"); + }, + }, + { + content: "Create Set (Input) to the right", + callback: () => { + createSiblingNodeToRight(node, "SetInputNode"); + }, + }, + ]; + } + + return []; + } catch (e) { + console.error("[SetInputGetOutput] getNodeMenuItems error", e); + return []; + } + }, + /** + * Canvas context menu (recommended API): + * Adds a bulk action when selection contains Set/Get nodes. + */ + getCanvasMenuItems(canvas) { + const selected = getSelectedNodesFromCanvas(canvas); + const hasAny = selected.some(n => n.type === "SetInputNode" || n.type === "GetOutputNode"); + if (!hasAny) return []; + return [ + null, + { + content: "Convert selected Set/Get nodes", + callback: () => { convertSelectedSetGetNodes(canvas); }, + }, + ]; + }, + // Pause expensive UI updates during execution + onExecutionStart() { + isExecutionActive = true; + }, + onExecutionEnd() { + isExecutionActive = false; + const graph = getRootGraph(); + if (graph) { + flushSetGetUpdates(graph); + } + }, + onExecutionError() { + isExecutionActive = false; + const graph = getRootGraph(); + if (graph) { + flushSetGetUpdates(graph); + } + }, + registerCustomNodes() { + + // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + // ~~ SET NODE -> SetInputNode ~~ + // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + class SetInputNode extends LGraphNode { + defaultVisibility = true; + serialize_widgets = true; + drawConnection = false; + currentGetters = null; + slotColor = "#FFF"; // Default link color + canvas = app.canvas; + menuEntry = "Show connections"; + + constructor(title) { + super(title || "Set (Input)"); + if (!this.properties) { + this.properties = { "previousName": "" }; + } + this.properties.showOutputText = SetInputNode.defaultVisibility; + this._updateScheduled = false; + this._lastName = ""; + this._lastInputType = ""; + this._pendingUpdate = false; + + const node = this; + + this.addWidget( + "text", + "Input Name", + '', // Initial value + (value, widget, evt) => { // Widget callback + // No validation needed here anymore for duplicates + if (node.widgets[0].value !== '') { + node.title = (!disablePrefix ? "Set_" : "") + node.widgets[0].value; + } else { + node.title = "Set (Input)" // Reset title if name is cleared + } + node.properties.previousName = node.widgets[0].value; // Store for update checks + node.requestUpdate(); // Trigger updates (debounced) + }, + {} + ); + + this.addInput("*", "*"); // Default input + + // --- Connection Handling --- + this.onConnectionsChange = function( + slotType, slot, isChangeConnect, link_info, output + ) { + // On Disconnect Input + if (slotType === LiteGraph.INPUT && !isChangeConnect) { + // If the link is removed, reset the input type if it's the primary input + if(slot === 0) { + this.inputs[0].type = '*'; + this.inputs[0].name = '*'; + // Optionally reset title if name wasn't manually set + if (this.widgets[0].value === '') { + this.title = "Set (Input)"; + } + setColorAndBgColor.call(this, '*'); // Reset color + } + } + + // On Connect Input + if (link_info && node.graph && slotType === LiteGraph.INPUT && isChangeConnect && slot === 0) { + const fromNode = node.graph.getNodeById(link_info.origin_id); + if (fromNode && fromNode.outputs && fromNode.outputs[link_info.origin_slot]) { + const type = fromNode.outputs[link_info.origin_slot].type || '*'; + + // Update input type and name + this.inputs[0].type = type; + this.inputs[0].name = type; + + // Auto-name based on type if widget name is empty/default + if (this.widgets[0].value === '' || this.widgets[0].value === '*') { + this.widgets[0].value = type; + this.title = (!disablePrefix ? "Set_" : "") + type; + this.properties.previousName = type; + } + + setColorAndBgColor.call(this, type); + } else { + console.warn("SetInputNode: Connected input node or slot not found.", link_info); + } + } + + // Update getters regardless of connection change type + this.requestUpdate(); + }; // End onConnectionsChange + + // --- Name Validation (Removed Duplicate Check) --- + this.validateName = function(graph) { + // Name validation logic for duplicates is removed + this.requestUpdate(); // Ensure update is called + }; + + // --- Cloning --- + this.clone = function () { + const cloned = SetInputNode.prototype.clone.apply(this); + if (cloned.inputs && cloned.inputs[0]) { + cloned.inputs[0].name = '*'; + cloned.inputs[0].type = '*'; + } + cloned.properties.previousName = ''; // Reset previous name on clone + // Keep the widget value on clone if desired, or clear it: + // if(cloned.widgets && cloned.widgets[0]) cloned.widgets[0].value = ''; + cloned.size = cloned.computeSize(); + return cloned; + }; + + // --- Node Lifecycle Callbacks --- + this.onAdded = function(graph) { + this.validateName(graph); // Calls update + updateAllGetterCombos(graph, true); + }; + + this.onRemoved = function() { + if (!this.graph) return; + // Update combo boxes on removal + setTimeout(() => { if (this.graph) updateAllGetterCombos(this.graph, true); }, 0); + }; + + // Override onModeChange to trigger update + const originalOnModeChange = this.onModeChange; + this.onModeChange = function(mode) { + if (originalOnModeChange) { + originalOnModeChange.apply(this, arguments); + } + // When mode changes (bypass), trigger update after a short delay + // LiteGraph.BYPASS == 4 + debugLog(`SetInputNode ${this.id} (${this.widgets[0].value}) mode changed to: ${mode}`); + setTimeout(() => { if (this.requestUpdate) this.requestUpdate(); }, 50); + }; + + + // --- Core Update Logic --- + this.requestUpdate = function() { + if (isExecutionActive) { + this._pendingUpdate = true; + return; + } + if (this._updateScheduled) return; + this._updateScheduled = true; + requestAnimationFrame(() => { + this._updateScheduled = false; + if (this.update) this.update(); + }); + }; + + this.update = function() { + const node = this; // Use 'node' reference for safety in callbacks/timeouts + if (!node.graph) { return; } + if (isExecutionActive) { + node._pendingUpdate = true; + return; + } + + const currentName = node.widgets[0].value; + const inputType = (node.inputs && node.inputs[0]) ? node.inputs[0].type : '*'; + const inputTypeChanged = inputType !== node._lastInputType; + if (inputTypeChanged) { + node._lastInputType = inputType; + } + + // Find Getters linked to current name and tell them to update + const currentGetters = this.findGetters(node.graph, false); + currentGetters.forEach(getter => { + if (getter.onRename) { + // Use timeout to allow graph state to update before getter reacts + setTimeout(() => { if (getter.graph) getter.onRename(); }, 0); + } else if (inputTypeChanged && getter.setType && getter.outputs[0].type !== inputType) { + // Fallback if onRename is unavailable + setTimeout(() => { if (getter.graph) getter.setType(inputType); }, 0); + } + }); + + // Handle Getters linked to a previous name (if name changed) + if (node.properties.previousName && currentName !== node.properties.previousName) { + debugLog(`SetInputNode ${node.id} name changed from ${node.properties.previousName} to ${currentName}`); + const previousGetters = this.findGetters(node.graph, true); + previousGetters.forEach(getter => { + // Check if the getter is still potentially linked by the old name in its widget + if (getter.onRename && getter.widgets[0].value === node.properties.previousName) { + debugLog(`Updating previous getter ${getter.id} (was linked to ${node.properties.previousName})`); + setTimeout(() => { if (getter.graph) getter.onRename(); }, 0); + } + }); + node.properties.previousName = ''; // Clear previous name after handling + } + + // Only rebuild combo list if the set names actually changed + if (currentName !== node._lastName) { + node._lastName = currentName; + updateAllGetterCombos(node.graph); + } + + // Redraw only if we're actively drawing virtual connections + if (node.drawConnection && node.graph && node.graph.list_of_graphcanvas) { + node.graph.list_of_graphcanvas.forEach(canvas => canvas.setDirty(true, true)); + } + }; + + // --- Helper: Find Linked Getters --- + // findGetters - Ensure bypass check uses mode 4 for the GetNode + this.findGetters = function(graph, checkForPreviousName) { + const name = checkForPreviousName ? this.properties.previousName : this.widgets[0].value; + if (!graph || name === '') return []; + + return graph._nodes.filter(otherNode => + otherNode.type === 'GetOutputNode' && // Check for GetOutputNode + otherNode.widgets && otherNode.widgets[0] && + otherNode.widgets[0].value === name //&& + // We don't check the GetNode's bypass status here, Set should update all regardless + // otherNode.mode !== 4 // Check if the GetNode itself is bypassed + ); + }; + + // Node is virtual (doesn't execute on backend) + this.isVirtualNode = true; + + } // End constructor + + // --- Context Menu --- + getExtraMenuOptions(_, options) { + this.menuEntry = this.drawConnection ? "Hide connections" : "Show connections"; + options.unshift( + { + content: "Convert to Get (Output)", + callback: () => { + convertNodeInPlace(this, "GetOutputNode"); + }, + }, + { + content: "Create Get (Output) to the right", + callback: () => { + createSiblingNodeToRight(this, "GetOutputNode"); + }, + }, + { + content: this.menuEntry, + callback: () => { + // Need graph context + if (!this.graph) return; + this.currentGetters = this.findGetters(this.graph); + if (!this.currentGetters || this.currentGetters.length === 0) return; + + // Determine color from the first active getter found or default + let activeGetter = this.currentGetters.find(g => g.mode !== 4 && g.mode !== 2); + let linkType = activeGetter ? (activeGetter.outputs[0].type || '*') : (this.inputs[0].type || '*'); + + // Use default connection color from canvas based on type + this.slotColor = this.canvas?.default_connection_color_byType?.[linkType] || "#FFF"; + + this.drawConnection = !this.drawConnection; + this.menuEntry = this.drawConnection ? "Hide connections" : "Show connections"; // Update label + this.canvas?.setDirty(true, true); + }, + }, + { + content: "Hide all connections", + callback: () => { + if (!this.graph) return; + const allSetGet = this.graph._nodes.filter(otherNode => + otherNode.type === "GetOutputNode" || otherNode.type === "SetInputNode" + ); + allSetGet.forEach(node => { node.drawConnection = false; }); + this.canvas?.setDirty(true, true); + }, + }, + { + content: "Go to first active Getter", + callback: () => { + if (!this.graph) return; + const firstActiveGetter = this.findGetters(this.graph) + .find(getter => getter.mode !== 4 && getter.mode !== 2); // Find first non-bypassed, non-muted + if (firstActiveGetter && this.canvas) { + this.canvas.centerOnNode(firstActiveGetter); + this.canvas.selectNode(firstActiveGetter, false); + } else { + debugLog("No active GetOutput nodes found for this SetInput node."); + } + }, + } + ); + } + + // --- Drawing Connections --- + onDrawForeground(ctx, graphcanvas) { + if (this.flags.collapsed || !this.drawConnection) { + return; + } + + this.currentGetters = this.findGetters(this.graph); + if (!this.currentGetters || this.currentGetters.length === 0) return; + + const lGraphCanvas = graphcanvas || app.canvas; // Use passed canvas or global fallback + if (!lGraphCanvas) return; // Need canvas to draw + + ctx.save(); + ctx.lineWidth = 1; // Thinner line for virtual connections + ctx.strokeStyle = this.slotColor || "#FFF"; + + const startPos = this.localToGlobal([this.size[0], LiteGraph.NODE_SLOT_HEIGHT / 2]); + + for (const getter of this.currentGetters) { + // Only draw lines to non-bypassed, non-muted Getters + if (getter.mode === 4 || getter.mode === 2) continue; // LiteGraph.BYPASS == 4, LiteGraph.NEVER == 2 + + if (!getter.isVisibleOnCanvas(lGraphCanvas)) continue; // Don't draw if offscreen + + const endPos = getter.localToGlobal([0, LiteGraph.NODE_SLOT_HEIGHT / 2]); + + ctx.beginPath(); + ctx.moveTo(startPos[0], startPos[1]); + // Simple bezier curve + ctx.bezierCurveTo( + startPos[0] + 100, startPos[1], + endPos[0] - 100, endPos[1], + endPos[0], endPos[1] + ); + ctx.stroke(); + } + ctx.restore(); + } + + } // End SetInputNode Class + + // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + // ~~ GET NODE -> GetOutputNode ~~ + // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + class GetOutputNode extends LGraphNode { + defaultVisibility = true; + serialize_widgets = true; + drawConnection = false; + slotColor = "#FFF"; + currentSetter = null; + canvas = app.canvas; + + constructor(title) { + super(title || "Get (Output)"); + if (!this.properties) { this.properties = {}; } + this.properties.showOutputText = GetOutputNode.defaultVisibility; + this._validateScheduled = false; + this._pendingRename = false; + + const node = this; + + this.addWidget( + "combo", + "Output Name", + "", // Initial value + (value, widget, event) => { // Widget callback + this.onRename(); // Trigger update when combo value changes + }, + { // Combo options + values: () => { // Function to populate the combo box + if (!node.graph) return []; + const setterNodes = node.graph._nodes.filter((otherNode) => + otherNode.type == 'SetInputNode' // Look for SetInputNode + ); + // Get unique names and sort them + const uniqueNames = [...new Set( + setterNodes + .map((otherNode) => otherNode.widgets && otherNode.widgets[0] ? otherNode.widgets[0].value : null) + .filter(name => name !== null && name !== '') // Filter out null/empty names + )].sort(); + return uniqueNames; + } + } + ); + + this.addOutput("*", '*'); // Default output + + // --- Connection Validation --- + this.onConnectionsChange = function( + slotType, slot, isChangeConnect, link_info, output + ) { + // Only validate on output connections (not input) + // Delay validation to ensure connection is fully established + if (slotType === LiteGraph.OUTPUT && slot === 0 && this.graph) { + setTimeout(() => { + if (this.graph && this.validateLinks) { + this.validateLinks(); + } + }, 50); + } + }; + + // --- Name/Type Update Logic --- + this.setName = function(name) { + if (this.widgets && this.widgets[0]) { + this.widgets[0].value = name; + this.onRename(); + // Note: Serialization might happen automatically depending on widget config + // If manual serialization needed: LiteGraph.doSerialize(this); + } + }; + + this.onRename = function() { + if (!this.graph) { return; } // Ensure graph context + if (isExecutionActive) { + this._pendingRename = true; + return; + } + + const setter = this.findSetter(this.graph); // Finds the first *active* setter + let linkType = '*'; + let titleName = (this.widgets && this.widgets[0] ? this.widgets[0].value : null) || "unset"; + + if (setter && setter.inputs && setter.inputs[0]) { + linkType = setter.inputs[0].type || '*'; // Get type from active setter's input + titleName = setter.widgets[0].value; // Use setter's name for title + } else { + // If no active setter found, keep widget value but use '*' type + linkType = '*'; + } + + // --- Critical: Update Output Type --- + const desiredTitle = (!disablePrefix ? "Get_" : "") + titleName; + const output = this.outputs && this.outputs[0] ? this.outputs[0] : null; + const typeChanged = output ? output.type !== linkType : true; + const titleChanged = this.title !== desiredTitle; + + if (!typeChanged && !titleChanged) { + return; + } + + if (this.outputs && this.outputs[0]) { + if (typeChanged) { + debugLog(`GetOutputNode ${this.id} (${titleName}): Updating output type from ${this.outputs[0].type} to ${linkType}`); + this.outputs[0].type = linkType; + this.outputs[0].name = linkType; // Keep name and type consistent + // Important: Notify LiteGraph that connections may need revalidation + this.graph.links_dirty = true; + // Delay validation to ensure type change is processed and connections are established + if (!this._validateScheduled) { + this._validateScheduled = true; + setTimeout(() => { + this._validateScheduled = false; + if (this.graph && this.validateLinks) { + this.validateLinks(); + } + }, 100); + } + } + } else if (!this.outputs || this.outputs.length === 0) { + this.addOutput("output", linkType); // Safety add output + this.graph.links_dirty = true; + } + // --- End Critical Section --- + + this.title = desiredTitle; + + if (typeChanged) { + setColorAndBgColor.call(this, linkType); // Update color + } + + // Redraw the node + if ((typeChanged || titleChanged) && this.graph && this.graph.list_of_graphcanvas) { + this.graph.list_of_graphcanvas.forEach(canvas => canvas.setDirty(true, true)); + } + }; + + // Method called by SetNode to update combo box options + this.setComboValues = function() { + if (this.widgets && this.widgets[0] && this.widgets[0].type === 'combo' && this.graph) { + const comboWidget = this.widgets[0]; + const uniqueNames = this.graph._setGetNameList || computeSetNames(this.graph); + // Check if options actually changed before updating + if (JSON.stringify(comboWidget.options.values) !== JSON.stringify(uniqueNames)) { + comboWidget.options.values = uniqueNames; + // Ensure current value still exists, if not, maybe clear or default? + if (!uniqueNames.includes(comboWidget.value) && comboWidget.value !== '') { + // console.log(`GetOutputNode ${this.id}: Current value "${comboWidget.value}" no longer exists. Clearing.`); + // comboWidget.value = ''; // Optionally clear if linked SetNode removed + // this.onRename(); // Trigger update if value changed + } + } + } + }; + + // --- Cloning --- + this.clone = function () { + const cloned = GetOutputNode.prototype.clone.apply(this); + cloned.size = cloned.computeSize(); + // Ensure combo value is preserved on clone + if (this.widgets && this.widgets[0] && cloned.widgets && cloned.widgets[0]) { + cloned.widgets[0].value = this.widgets[0].value; + } + // Trigger rename on cloned node after adding to graph (onAdded might be better) + setTimeout(() => { if(cloned.graph) cloned.onRename(); }, 0); + return cloned; + }; + + this.onAdded = function(graph) { + // Ensure the node updates its type/title when added to the graph + // Delay to allow graph to finish loading connections + setTimeout(() => { + if (this.graph && this.onRename) { + this.onRename(); + } + }, 100); + } + + // Override onModeChange to trigger update (e.g., if GetNode itself is bypassed) + const originalOnModeChange = this.onModeChange; + this.onModeChange = function(mode) { + if (originalOnModeChange) { + originalOnModeChange.apply(this, arguments); + } + // LiteGraph.BYPASS == 4 + debugLog(`GetOutputNode ${this.id} (${this.widgets[0].value}) mode changed to: ${mode}`); + // Trigger rename to re-evaluate connections/drawing + setTimeout(() => { if (this.onRename) this.onRename(); }, 50); + }; + + // --- Link Validation --- + this.validateLinks = function() { + if (!this.graph || !this.outputs || !this.outputs[0] || !this.outputs[0].links) { + return; + } + + const outputType = this.outputs[0].type; + const nodeName = (this.widgets && this.widgets[0]) ? this.widgets[0].value : 'unnamed'; + + // Don't validate if output type is generic/wildcard + if (!outputType || outputType === '*' || outputType === '') { + debugLog(`GetOutputNode ${this.id} (${nodeName}): Skipping validation - output type is wildcard (${outputType})`); + return; + } + + debugLog(`GetOutputNode ${this.id} (${nodeName}): Validating ${this.outputs[0].links.length} links with output type "${outputType}"`); + + const linksToRemove = []; + for (const linkId of this.outputs[0].links) { + const link = this.graph.links[linkId]; + if (link) { + const targetNode = this.graph.getNodeById(link.target_id); + if (targetNode && targetNode.inputs && targetNode.inputs[link.target_slot]) { + const targetType = targetNode.inputs[link.target_slot].type; + const targetNodeType = targetNode.type || 'unknown'; + + // Normalize types for comparison (case-insensitive, handle common variations) + const normalizedOutputType = (outputType || '').toUpperCase().trim(); + const normalizedTargetType = (targetType || '').toUpperCase().trim(); + + // Only remove links if there's a CLEAR incompatibility: + // - Target type must be explicitly defined (not undefined/null/empty/'*') + // - Target type must NOT match output type (case-insensitive) + // - Treat undefined/null/empty/'*' as wildcards (compatible with anything) + if (targetType && + normalizedTargetType !== '*' && + normalizedTargetType !== '' && + normalizedOutputType !== normalizedTargetType) { + console.warn(`GetOutputNode ${this.id} (${nodeName}): Removing incompatible link ${linkId} to ${targetNodeType} (Output: "${outputType}", Target: "${targetType}")`); + linksToRemove.push(linkId); + } else { + debugLog(`GetOutputNode ${this.id} (${nodeName}): Link ${linkId} to ${targetNodeType} is compatible (Output: "${outputType}", Target: "${targetType || '*'}")`); + } + } else { + debugWarn(`GetOutputNode ${this.id} (${nodeName}): Link ${linkId} - target node or input slot not found`); + } + } + } + + if (linksToRemove.length > 0) { + console.warn(`GetOutputNode ${this.id} (${nodeName}): Removing ${linksToRemove.length} incompatible link(s)`); + linksToRemove.forEach(linkId => this.graph.removeLink(linkId)); + } else { + debugLog(`GetOutputNode ${this.id} (${nodeName}): All links validated successfully`); + } + }; + + // --- Set Output Type --- + this.setType = function(type) { + if (this.outputs && this.outputs[0]) { + if (this.outputs[0].type !== type) { + this.outputs[0].name = type; + this.outputs[0].type = type; + this.validateLinks(); // Validate after type change + this.graph.links_dirty = true; // Notify graph + } + } + }; + + // --- Helper: Find Active Setter --- + this.findSetter = function(graph) { + if (!graph) return null; + const name = (this.widgets && this.widgets[0]) ? this.widgets[0].value : null; + if (!name || name === '') return null; + + const matchingSetters = graph._nodes.filter(otherNode => + otherNode.type === 'SetInputNode' && // Look for SetInputNode + otherNode.widgets && otherNode.widgets[0] && + otherNode.widgets[0].value === name + ); + + // LiteGraph.BYPASS is mode 4, LiteGraph.NEVER (muted) is mode 2 + const activeSetter = matchingSetters.find(setter => + setter.mode !== 4 && setter.mode !== 2 + ); + return activeSetter || null; // Return the first non-bypassed, non-muted or null + }; + + // --- Navigation --- + this.goToSetter = function() { + if (!this.graph || !this.canvas) return; + const setter = this.findSetter(this.graph); + if (setter) { + this.canvas.centerOnNode(setter); + this.canvas.selectNode(setter, false); + } else { + debugLog("GetOutputNode: No active SetInput node found to go to."); + } + }; + + // Node is virtual + this.isVirtualNode = true; + + } // End constructor + + // --- Get Input Info (for Backend Execution) --- + // This tells LiteGraph where the data actually comes from. + getInputInfo(slot) { + // Ensure graph context + if (!this.graph) { + return null; + } + // Find the active (non-bypassed) setter node linked by name + const setter = this.findSetter(this.graph); + + // Check if setter exists, has an input, and that input is connected + if (!setter || !setter.inputs || !setter.inputs[0] || setter.inputs[0].link === null) { + // console.log(`GetOutputNode ${this.id} (${this.widgets[0].value}): getInputInfo - No active setter or setter input link found.`); + return null; // No active linked input found + } + + // Get the ID of the link connected to the setter's input + const linkId = setter.inputs[0].link; + const link = this.graph.links[linkId]; + + if (!link) { + console.error(`GetOutputNode ${this.id}: getInputInfo - Link with ID ${linkId} not found in graph.`); + return null; // Link not found (shouldn't happen in a consistent graph) + } + + // Find the actual source node connected to the setter + const originNode = this.graph.getNodeById(link.origin_id); + if (!originNode) { + console.error(`GetOutputNode ${this.id}: getInputInfo - Origin node with ID ${link.origin_id} not found.`); + return null; + } + + // Determine the output slot index and type from the origin node + const originSlotIndex = link.origin_slot; + const originOutputType = (originNode.outputs && originNode.outputs[originSlotIndex]) + ? originNode.outputs[originSlotIndex].type + : '*'; + + // Return the information about the actual data source + // console.log(`GetOutputNode ${this.id} (${this.widgets[0].value}): Providing input info from Setter ${setter.id} -> Origin Node ${originNode.id}, Slot ${originSlotIndex} (Type: ${originOutputType})`); + return { + node_id: originNode.id, + slot: originSlotIndex, + type: originOutputType + }; + } + + // --- Get Input Link (for internal LiteGraph/ComfyUI connection logic) --- + // This function might be queried by the execution logic to find the + // link object providing data *to* the node connected *from* this GetNode. + getInputLink(slot) { + // This node provides output on slot 0. If queried for other slots, return null. + if (slot !== 0) return null; + + // Ensure graph context + if (!this.graph) { + return null; + } + + // Find the active (non-bypassed) setter node linked by name + const setter = this.findSetter(this.graph); + + // Check if setter exists, has an input, and that input is connected + if (!setter || !setter.inputs || !setter.inputs[0] || typeof setter.inputs[0].link !== 'number') { + // console.log(`GetOutputNode ${this.id} (${this.widgets[0].value}): getInputLink - No active setter or setter input link found.`); + return null; // No active linked input found + } + + // Get the ID of the link connected to the setter's input + const linkId = setter.inputs[0].link; + const link = this.graph.links[linkId]; + + if (!link) { + console.error(`GetOutputNode ${this.id}: getInputLink - Link with ID ${linkId} not found in graph.`); + return null; + } + + // Return the actual link object originating from the node connected to the SetNode. + // The execution logic might trace this link's origin_id/origin_slot. + // console.log(`GetOutputNode ${this.id} (${this.widgets[0].value}): getInputLink returning link ${linkId} (Origin: ${link.origin_id}, Slot: ${link.origin_slot})`); + return link; + } + + // --- Context Menu --- + getExtraMenuOptions(_, options) { + let menuEntry = this.drawConnection ? "Hide connections" : "Show connections"; + options.unshift( + { + content: "Convert to Set (Input)", + callback: () => { + convertNodeInPlace(this, "SetInputNode"); + }, + }, + { + content: "Create Set (Input) to the right", + callback: () => { + createSiblingNodeToRight(this, "SetInputNode"); + }, + }, + { + content: "Go to active setter", + callback: () => { this.goToSetter(); }, + }, + { + content: menuEntry, + callback: () => { + if (!this.graph) return; + this.currentSetter = this.findSetter(this.graph); + if (!this.currentSetter) return; // Only toggle if active setter found + + let linkType = (this.currentSetter.inputs[0].type || '*'); + this.slotColor = this.canvas?.default_connection_color_byType?.[linkType] || "#FFF"; + this.drawConnection = !this.drawConnection; + menuEntry = this.drawConnection ? "Hide connections" : "Show connections"; // Update label + this.canvas?.setDirty(true, true); + }, + } + ); + } + + // --- Drawing Connections --- + onDrawForeground(ctx, graphcanvas) { + if (this.flags.collapsed || !this.drawConnection || this.mode === 4 /* Bypassed */ || this.mode === 2 /* Muted */) { + return; + } + + this.currentSetter = this.findSetter(this.graph); + if (!this.currentSetter) { + // Optional: Turn off drawing if no active setter found? + // this.drawConnection = false; + return; + } + + if (!this.currentSetter.isVisibleOnCanvas(graphcanvas)) return; // Don't draw if offscreen + + const lGraphCanvas = graphcanvas || app.canvas; + if (!lGraphCanvas) return; + + ctx.save(); + ctx.lineWidth = 1; + ctx.strokeStyle = this.slotColor || "#FFF"; + + // Start from the Get node's output + const startPos = this.localToGlobal([this.size[0], LiteGraph.NODE_SLOT_HEIGHT / 2]); + // End at the Set node's input + const endPos = this.currentSetter.localToGlobal([0, LiteGraph.NODE_SLOT_HEIGHT / 2]); + + ctx.beginPath(); + ctx.moveTo(startPos[0], startPos[1]); + ctx.bezierCurveTo( + startPos[0] + 100, startPos[1], + endPos[0] - 100, endPos[1], + endPos[0], endPos[1] + ); + ctx.stroke(); + + ctx.restore(); + } + + + } // End GetOutputNode Class + + // --- Register Nodes with LiteGraph --- + LiteGraph.registerNodeType("SetInputNode", SetInputNode); + LiteGraph.registerNodeType("GetOutputNode", GetOutputNode); + + // Set category for node menu organization + SetInputNode.category = "Utilities/InputOutput"; + GetOutputNode.category = "Utilities/InputOutput"; + + debugLog("Input/Output Nodes Registered"); + + } // End registerCustomNodes + }); // End app.registerExtension + +} // End else (LiteGraph found) \ No newline at end of file