added Efficiency Nodes ComfyUI

efficiency-nodes-comfyui/.gitignore

@@ -0,0 +1,2 @@
+__pycache__/__init__.cpython-310.pyc
+__pycache__/efficiency_nodes.cpython-310.pyc

efficiency-nodes-comfyui/LICENSE

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ 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.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    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 <https://www.gnu.org/licenses/>.
+
+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:
+
+    <program>  Copyright (C) <year>  <name of author>
+    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
+<https://www.gnu.org/licenses/>.
+
+  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
+<https://www.gnu.org/licenses/why-not-lgpl.html>.

efficiency-nodes-comfyui/README.md

@@ -0,0 +1,43 @@
+Efficiency Nodes for ComfyUI
+=======
+### A collection of <a href="https://github.com/comfyanonymous/ComfyUI" >ComfyUI</a> custom nodes to help streamline workflows and reduce total node count.
+## [Direct Download Link](https://github.com/LucianoCirino/efficiency-nodes-comfyui/releases/download/v1.62/efficiency-nodes-comfyui.zip)
+
+## **Currently Available Nodes:**
+<details><summary>Ksampler (Efficient)</summary><ul>
+• A modded KSampler with the ability to preview/output images and run scripts.<br>
+</ul></details>
+
+<details><summary>Efficient Loader</summary><ul>
+• A combination of common initialization nodes.
+</ul></details>
+
+<details><summary>XY Plotter Nodes</summary><ul>
+• A collection of nodes that allows users to specify parameters for the KSampler (Efficient) to plot on a grid.
+</ul></details>
+
+<details><summary>Image Overlay</summary><ul>
+• Node that allows for flexible image overlaying.
+</ul></details>
+
+<details><summary>SimpleEval Nodes</summary><ul>
+•  A collection of nodes that allows users to write simple Python expressions for a variety of data types using the "<a href="https://github.com/danthedeckie/simpleeval" >simpleeval</a>" library.
+  
+</ul></details>
+
+## **Examples:**
+  
+- HiResFix using the **Efficient Loader** & **Ksampler (Efficient)**
+
+<img src="https://github.com/LucianoCirino/efficiency-nodes-comfyui/blob/main/workflows/HiRes Fix (overview).png" width="720">
+
+- 2D Plotting using the **XY Plot** & **Ksampler (Efficient)** nodes 
+
+<img src="https://github.com/LucianoCirino/efficiency-nodes-comfyui/blob/main/workflows/XYplot/X-Seeds Y-Checkpoints (overview).png" width="720">
+
+- Photobashing using the **Image Overlay** node
+
+<img src="https://github.com/LucianoCirino/efficiency-nodes-comfyui/blob/main/workflows/Image Overlay (overview).png" width="720">
+
+## **Install:**
+To install, drop the "_**efficiency-nodes-comfyui**_" folder into the "_**...\ComfyUI\ComfyUI\custom_nodes**_" directory and restart UI.

efficiency-nodes-comfyui/__init__.py

@@ -0,0 +1,3 @@
+from .efficiency_nodes import NODE_CLASS_MAPPINGS
+
+__all__ = ['NODE_CLASS_MAPPINGS']

efficiency-nodes-comfyui/node_settings.json

@@ -0,0 +1,21 @@
+{
+    "Efficient Loader": {
+        "model_cache": {
+            "ckpt": 1,
+            "vae": 1,
+            "lora": 1
+        }
+    },
+    "KSampler (Efficient)": {
+	"vae_tiled": false
+    },
+    "XY Plot": {
+        "model_cache": {
+            "ckpt": 5,
+            "vae": 5,
+            "lora": 5
+        },
+	"vae_tiled": false
+    }
+}
+

efficiency-nodes-comfyui/requirements.txt

@@ -0,0 +1 @@
+simpleeval

efficiency-nodes-comfyui/tsc_sd.py

@@ -0,0 +1,308 @@
+import os
+import sys
+
+# Get the absolute path of the parent directory of the current script
+my_dir = os.path.dirname(os.path.abspath(__file__))
+
+# Add the My directory path to the sys.path list
+sys.path.append(my_dir)
+
+# Construct the absolute path to the ComfyUI directory
+comfy_dir = os.path.abspath(os.path.join(my_dir, '..', '..'))
+
+# Add the ComfyUI directory path to the sys.path list
+sys.path.append(comfy_dir)
+
+# Import functions from ComfyUI
+from comfy.sd import *
+from comfy import utils
+
+LORA_CLIP_MAP = {
+    "mlp.fc1": "mlp_fc1",
+    "mlp.fc2": "mlp_fc2",
+    "self_attn.k_proj": "self_attn_k_proj",
+    "self_attn.q_proj": "self_attn_q_proj",
+    "self_attn.v_proj": "self_attn_v_proj",
+    "self_attn.out_proj": "self_attn_out_proj",
+}
+
+LORA_UNET_MAP_ATTENTIONS = {
+    "proj_in": "proj_in",
+    "proj_out": "proj_out",
+    "transformer_blocks.0.attn1.to_q": "transformer_blocks_0_attn1_to_q",
+    "transformer_blocks.0.attn1.to_k": "transformer_blocks_0_attn1_to_k",
+    "transformer_blocks.0.attn1.to_v": "transformer_blocks_0_attn1_to_v",
+    "transformer_blocks.0.attn1.to_out.0": "transformer_blocks_0_attn1_to_out_0",
+    "transformer_blocks.0.attn2.to_q": "transformer_blocks_0_attn2_to_q",
+    "transformer_blocks.0.attn2.to_k": "transformer_blocks_0_attn2_to_k",
+    "transformer_blocks.0.attn2.to_v": "transformer_blocks_0_attn2_to_v",
+    "transformer_blocks.0.attn2.to_out.0": "transformer_blocks_0_attn2_to_out_0",
+    "transformer_blocks.0.ff.net.0.proj": "transformer_blocks_0_ff_net_0_proj",
+    "transformer_blocks.0.ff.net.2": "transformer_blocks_0_ff_net_2",
+}
+
+LORA_UNET_MAP_RESNET = {
+    "in_layers.2": "resnets_{}_conv1",
+    "emb_layers.1": "resnets_{}_time_emb_proj",
+    "out_layers.3": "resnets_{}_conv2",
+    "skip_connection": "resnets_{}_conv_shortcut"
+}
+
+def load_lora_tsc(path, to_load):
+    lora = utils.load_torch_file(path)
+    patch_dict = {}
+    loaded_keys = set()
+    for x in to_load:
+        alpha_name = "{}.alpha".format(x)
+        alpha = None
+        if alpha_name in lora.keys():
+            alpha = lora[alpha_name].item()
+            loaded_keys.add(alpha_name)
+
+        A_name = "{}.lora_up.weight".format(x)
+        B_name = "{}.lora_down.weight".format(x)
+        mid_name = "{}.lora_mid.weight".format(x)
+
+        if A_name in lora.keys():
+            mid = None
+            if mid_name in lora.keys():
+                mid = lora[mid_name]
+                loaded_keys.add(mid_name)
+            patch_dict[to_load[x]] = (lora[A_name], lora[B_name], alpha, mid)
+            loaded_keys.add(A_name)
+            loaded_keys.add(B_name)
+
+
+        ######## loha
+        hada_w1_a_name = "{}.hada_w1_a".format(x)
+        hada_w1_b_name = "{}.hada_w1_b".format(x)
+        hada_w2_a_name = "{}.hada_w2_a".format(x)
+        hada_w2_b_name = "{}.hada_w2_b".format(x)
+        hada_t1_name = "{}.hada_t1".format(x)
+        hada_t2_name = "{}.hada_t2".format(x)
+        if hada_w1_a_name in lora.keys():
+            hada_t1 = None
+            hada_t2 = None
+            if hada_t1_name in lora.keys():
+                hada_t1 = lora[hada_t1_name]
+                hada_t2 = lora[hada_t2_name]
+                loaded_keys.add(hada_t1_name)
+                loaded_keys.add(hada_t2_name)
+
+            patch_dict[to_load[x]] = (lora[hada_w1_a_name], lora[hada_w1_b_name], alpha, lora[hada_w2_a_name], lora[hada_w2_b_name], hada_t1, hada_t2)
+            loaded_keys.add(hada_w1_a_name)
+            loaded_keys.add(hada_w1_b_name)
+            loaded_keys.add(hada_w2_a_name)
+            loaded_keys.add(hada_w2_b_name)
+
+
+        ######## lokr
+        lokr_w1_name = "{}.lokr_w1".format(x)
+        lokr_w2_name = "{}.lokr_w2".format(x)
+        lokr_w1_a_name = "{}.lokr_w1_a".format(x)
+        lokr_w1_b_name = "{}.lokr_w1_b".format(x)
+        lokr_t2_name = "{}.lokr_t2".format(x)
+        lokr_w2_a_name = "{}.lokr_w2_a".format(x)
+        lokr_w2_b_name = "{}.lokr_w2_b".format(x)
+
+        lokr_w1 = None
+        if lokr_w1_name in lora.keys():
+            lokr_w1 = lora[lokr_w1_name]
+            loaded_keys.add(lokr_w1_name)
+
+        lokr_w2 = None
+        if lokr_w2_name in lora.keys():
+            lokr_w2 = lora[lokr_w2_name]
+            loaded_keys.add(lokr_w2_name)
+
+        lokr_w1_a = None
+        if lokr_w1_a_name in lora.keys():
+            lokr_w1_a = lora[lokr_w1_a_name]
+            loaded_keys.add(lokr_w1_a_name)
+
+        lokr_w1_b = None
+        if lokr_w1_b_name in lora.keys():
+            lokr_w1_b = lora[lokr_w1_b_name]
+            loaded_keys.add(lokr_w1_b_name)
+
+        lokr_w2_a = None
+        if lokr_w2_a_name in lora.keys():
+            lokr_w2_a = lora[lokr_w2_a_name]
+            loaded_keys.add(lokr_w2_a_name)
+
+        lokr_w2_b = None
+        if lokr_w2_b_name in lora.keys():
+            lokr_w2_b = lora[lokr_w2_b_name]
+            loaded_keys.add(lokr_w2_b_name)
+
+        lokr_t2 = None
+        if lokr_t2_name in lora.keys():
+            lokr_t2 = lora[lokr_t2_name]
+            loaded_keys.add(lokr_t2_name)
+
+        if (lokr_w1 is not None) or (lokr_w2 is not None) or (lokr_w1_a is not None) or (lokr_w2_a is not None):
+            patch_dict[to_load[x]] = (lokr_w1, lokr_w2, alpha, lokr_w1_a, lokr_w1_b, lokr_w2_a, lokr_w2_b, lokr_t2)
+
+    for x in lora.keys():
+        if x not in loaded_keys:
+            print("lora key not loaded", x)
+    return patch_dict
+
+def model_lora_keys(model, key_map={}):
+    sdk = model.state_dict().keys()
+
+    counter = 0
+    for b in range(12):
+        tk = "diffusion_model.input_blocks.{}.1".format(b)
+        up_counter = 0
+        for c in LORA_UNET_MAP_ATTENTIONS:
+            k = "{}.{}.weight".format(tk, c)
+            if k in sdk:
+                lora_key = "lora_unet_down_blocks_{}_attentions_{}_{}".format(counter // 2, counter % 2, LORA_UNET_MAP_ATTENTIONS[c])
+                key_map[lora_key] = k
+                up_counter += 1
+        if up_counter >= 4:
+            counter += 1
+    for c in LORA_UNET_MAP_ATTENTIONS:
+        k = "diffusion_model.middle_block.1.{}.weight".format(c)
+        if k in sdk:
+            lora_key = "lora_unet_mid_block_attentions_0_{}".format(LORA_UNET_MAP_ATTENTIONS[c])
+            key_map[lora_key] = k
+    counter = 3
+    for b in range(12):
+        tk = "diffusion_model.output_blocks.{}.1".format(b)
+        up_counter = 0
+        for c in LORA_UNET_MAP_ATTENTIONS:
+            k = "{}.{}.weight".format(tk, c)
+            if k in sdk:
+                lora_key = "lora_unet_up_blocks_{}_attentions_{}_{}".format(counter // 3, counter % 3, LORA_UNET_MAP_ATTENTIONS[c])
+                key_map[lora_key] = k
+                up_counter += 1
+        if up_counter >= 4:
+            counter += 1
+    counter = 0
+    text_model_lora_key = "lora_te_text_model_encoder_layers_{}_{}"
+    for b in range(24):
+        for c in LORA_CLIP_MAP:
+            k = "transformer.text_model.encoder.layers.{}.{}.weight".format(b, c)
+            if k in sdk:
+                lora_key = text_model_lora_key.format(b, LORA_CLIP_MAP[c])
+                key_map[lora_key] = k
+
+
+    #Locon stuff
+    ds_counter = 0
+    counter = 0
+    for b in range(12):
+        tk = "diffusion_model.input_blocks.{}.0".format(b)
+        key_in = False
+        for c in LORA_UNET_MAP_RESNET:
+            k = "{}.{}.weight".format(tk, c)
+            if k in sdk:
+                lora_key = "lora_unet_down_blocks_{}_{}".format(counter // 2, LORA_UNET_MAP_RESNET[c].format(counter % 2))
+                key_map[lora_key] = k
+                key_in = True
+        for bb in range(3):
+            k = "{}.{}.op.weight".format(tk[:-2], bb)
+            if k in sdk:
+                lora_key = "lora_unet_down_blocks_{}_downsamplers_0_conv".format(ds_counter)
+                key_map[lora_key] = k
+                ds_counter += 1
+        if key_in:
+            counter += 1
+
+    counter = 0
+    for b in range(3):
+        tk = "diffusion_model.middle_block.{}".format(b)
+        key_in = False
+        for c in LORA_UNET_MAP_RESNET:
+            k = "{}.{}.weight".format(tk, c)
+            if k in sdk:
+                lora_key = "lora_unet_mid_block_{}".format(LORA_UNET_MAP_RESNET[c].format(counter))
+                key_map[lora_key] = k
+                key_in = True
+        if key_in:
+            counter += 1
+
+    counter = 0
+    us_counter = 0
+    for b in range(12):
+        tk = "diffusion_model.output_blocks.{}.0".format(b)
+        key_in = False
+        for c in LORA_UNET_MAP_RESNET:
+            k = "{}.{}.weight".format(tk, c)
+            if k in sdk:
+                lora_key = "lora_unet_up_blocks_{}_{}".format(counter // 3, LORA_UNET_MAP_RESNET[c].format(counter % 3))
+                key_map[lora_key] = k
+                key_in = True
+        for bb in range(3):
+            k = "{}.{}.conv.weight".format(tk[:-2], bb)
+            if k in sdk:
+                lora_key = "lora_unet_up_blocks_{}_upsamplers_0_conv".format(us_counter)
+                key_map[lora_key] = k
+                us_counter += 1
+        if key_in:
+            counter += 1
+
+    return key_map
+
+def load_lora_for_models_tsc(model, clip, lora_path, strength_model, strength_clip):
+    key_map = model_lora_keys(model.model)
+    key_map = model_lora_keys(clip.cond_stage_model, key_map)
+    loaded = load_lora_tsc(lora_path, key_map)
+    new_modelpatcher = model.clone()
+    k = new_modelpatcher.add_patches(loaded, strength_model)
+    new_clip = clip.clone()
+    k1 = new_clip.add_patches(loaded, strength_clip)
+    k = set(k)
+    k1 = set(k1)
+    for x in loaded:
+        if (x not in k) and (x not in k1):
+            print("NOT LOADED", x)
+
+    return (new_modelpatcher, new_clip)
+
+def load_checkpoint_guess_config_tsc(ckpt_path, output_vae=True, output_clip=True, output_clipvision=False, embedding_directory=None):
+    sd = utils.load_torch_file(ckpt_path)
+    sd_keys = sd.keys()
+    clip = None
+    clipvision = None
+    vae = None
+    model = None
+    clip_target = None
+
+    parameters = calculate_parameters(sd, "model.diffusion_model.")
+    fp16 = model_management.should_use_fp16(model_params=parameters)
+
+    class WeightsLoader(torch.nn.Module):
+        pass
+
+    model_config = model_detection.model_config_from_unet(sd, "model.diffusion_model.", fp16)
+    if model_config is None:
+        raise RuntimeError("ERROR: Could not detect model type of: {}".format(ckpt_path))
+
+    if model_config.clip_vision_prefix is not None:
+        if output_clipvision:
+            clipvision = clip_vision.load_clipvision_from_sd(sd, model_config.clip_vision_prefix, True)
+
+    offload_device = model_management.unet_offload_device()
+    model = model_config.get_model(sd, "model.diffusion_model.")
+    model = model.to(offload_device)
+    model.load_model_weights(sd, "model.diffusion_model.")
+
+    if output_vae:
+        vae = VAE()
+        w = WeightsLoader()
+        w.first_stage_model = vae.first_stage_model
+        load_model_weights(w, sd)
+
+    if output_clip:
+        w = WeightsLoader()
+        clip_target = model_config.clip_target()
+        clip = CLIP(clip_target, embedding_directory=embedding_directory)
+        w.cond_stage_model = clip.cond_stage_model
+        sd = model_config.process_clip_state_dict(sd)
+        load_model_weights(w, sd)
+
+    return (ModelPatcher(model, load_device=model_management.get_torch_device(), offload_device=offload_device), clip, vae, clipvision)
+

efficiency-nodes-comfyui/tsc_utils.py

@@ -0,0 +1,427 @@
+# Efficiency Nodes Utility functions
+
+from torch import Tensor
+import torch
+from PIL import Image
+import numpy as np
+
+import os
+import sys
+import json
+import folder_paths
+
+# Get the absolute path of the parent directory of the current script
+my_dir = os.path.dirname(os.path.abspath(__file__))
+
+# Add the My directory path to the sys.path list
+sys.path.append(my_dir)
+
+# Construct the absolute path to the ComfyUI directory
+comfy_dir = os.path.abspath(os.path.join(my_dir, '..', '..'))
+
+# Add the ComfyUI directory path to the sys.path list
+sys.path.append(comfy_dir)
+
+# Import functions from ComfyUI
+import comfy.sd
+
+# Load my version of Comfy functions
+from tsc_sd import *
+
+# Cache for Efficiency Node models
+loaded_objects = {
+    "ckpt": [], # (ckpt_name, ckpt_model, clip, bvae, [id])
+    "vae": [],  # (vae_name, vae, [id])
+    "lora": []  # ([(lora_name, strength_model, strength_clip)], ckpt_name, lora_model, clip_lora, [id])
+}
+
+# Cache for Ksampler (Efficient) Outputs
+last_helds: dict[str, list] = {
+    "results": [],      # (results, id) # Preview Images, stored as a pil image list
+    "latent": [],       # (latent, id)  # Latent outputs, stored as a latent tensor list
+    "images": [],       # (images, id)  # Image outputs, stored as an image tensor list
+    "vae_decode": [],   # (vae_decode, id) # Used to track wether to vae-decode or not
+}
+
+# Tensor to PIL (grabbed from WAS Suite)
+def tensor2pil(image: torch.Tensor) -> Image.Image:
+    return Image.fromarray(np.clip(255. * image.cpu().numpy().squeeze(), 0, 255).astype(np.uint8))
+
+# Convert PIL to Tensor (grabbed from WAS Suite)
+def pil2tensor(image: Image.Image) -> torch.Tensor:
+    return torch.from_numpy(np.array(image).astype(np.float32) / 255.0).unsqueeze(0)
+
+def extract_node_info(prompt, id, indirect_key=None):
+    # Convert ID to string
+    id = str(id)
+    node_id = None
+
+    # If an indirect_key (like 'script') is provided, perform a two-step lookup
+    if indirect_key:
+        # Ensure the id exists in the prompt and has an 'inputs' entry with the indirect_key
+        if id in prompt and 'inputs' in prompt[id] and indirect_key in prompt[id]['inputs']:
+            # Extract the indirect_id
+            indirect_id = prompt[id]['inputs'][indirect_key][0]
+
+            # Ensure the indirect_id exists in the prompt
+            if indirect_id in prompt:
+                node_id = indirect_id
+                return prompt[indirect_id].get('class_type', None), node_id
+
+        # If indirect_key is not found within the prompt
+        return None, None
+
+    # If no indirect_key is provided, perform a direct lookup
+    return prompt.get(id, {}).get('class_type', None), node_id
+
+def extract_node_value(prompt, id, key):
+    # If ID is in data, return its 'inputs' value for a given key. Otherwise, return None.
+    return prompt.get(str(id), {}).get('inputs', {}).get(key, None)
+
+def print_loaded_objects_entries(id=None, prompt=None, show_id=False):
+    print("-" * 40)  # Print an empty line followed by a separator line
+    if id is not None:
+        id = str(id)  # Convert ID to string
+    if prompt is not None and id is not None:
+        node_name, _ = extract_node_info(prompt, id)
+        if show_id:
+            print(f"\033[36m{node_name} Models Cache: (node_id:{int(id)})\033[0m")
+        else:
+            print(f"\033[36m{node_name} Models Cache:\033[0m")
+    elif id is None:
+        print(f"\033[36mGlobal Models Cache:\033[0m")
+    else:
+        print(f"\033[36mModels Cache: \nnode_id:{int(id)}\033[0m")
+    entries_found = False
+    for key in ["ckpt", "vae", "lora"]:
+        entries_with_id = loaded_objects[key] if id is None else [entry for entry in loaded_objects[key] if id in entry[-1]]
+        if not entries_with_id:  # If no entries with the chosen ID, print None and skip this key
+            continue
+        entries_found = True
+        print(f"{key.capitalize()}:")
+        for i, entry in enumerate(entries_with_id, 1):  # Start numbering from 1
+            if key == "lora":
+                lora_models_info = ', '.join(f"{os.path.splitext(os.path.basename(name))[0]}({round(strength_model, 2)},{round(strength_clip, 2)})" for name, strength_model, strength_clip in entry[0])
+                base_ckpt_name = os.path.splitext(os.path.basename(entry[1]))[0]  # Split logic for base_ckpt
+                if id is None:
+                    associated_ids = ', '.join(map(str, entry[-1]))  # Gather all associated ids
+                    print(f"  [{i}] base_ckpt: {base_ckpt_name}, lora(mod,clip): {lora_models_info} (ids: {associated_ids})")
+                else:
+                    print(f"  [{i}] base_ckpt: {base_ckpt_name}, lora(mod,clip): {lora_models_info}")
+            else:
+                name_without_ext = os.path.splitext(os.path.basename(entry[0]))[0]
+                if id is None:
+                    associated_ids = ', '.join(map(str, entry[-1]))  # Gather all associated ids
+                    print(f"  [{i}] {name_without_ext} (ids: {associated_ids})")
+                else:
+                    print(f"  [{i}] {name_without_ext}")
+    if not entries_found:
+        print("-")
+
+
+# This function cleans global variables associated with nodes that are no longer detected on UI
+def globals_cleanup(prompt):
+    global loaded_objects
+    global last_helds
+
+    # Step 1: Clean up last_helds
+    for key in list(last_helds.keys()):
+        original_length = len(last_helds[key])
+        last_helds[key] = [(value, id) for value, id in last_helds[key] if str(id) in prompt.keys()]
+        ###if original_length != len(last_helds[key]):
+            ###print(f'Updated {key} in last_helds: {last_helds[key]}')
+
+    # Step 2: Clean up loaded_objects
+    for key in list(loaded_objects.keys()):
+        for i, tup in enumerate(list(loaded_objects[key])):
+            # Remove ids from id array in each tuple that don't exist in prompt
+            id_array = [id for id in tup[-1] if str(id) in prompt.keys()]
+            if len(id_array) != len(tup[-1]):
+                if id_array:
+                    loaded_objects[key][i] = tup[:-1] + (id_array,)
+                    ###print(f'Updated tuple at index {i} in {key} in loaded_objects: {loaded_objects[key][i]}')
+                else:
+                    # If id array becomes empty, delete the corresponding tuple
+                    loaded_objects[key].remove(tup)
+                    ###print(f'Deleted tuple at index {i} in {key} in loaded_objects because its id array became empty.')
+
+def load_checkpoint(ckpt_name, id, output_vae=True, cache=None, cache_overwrite=False):
+    """
+    Searches for tuple index that contains ckpt_name in "ckpt" array of loaded_objects.
+    If found, extracts the model, clip, and vae from the loaded_objects.
+    If not found, loads the checkpoint, extracts the model, clip, and vae.
+    The id parameter represents the node ID and is used for caching models for the XY Plot node.
+    If the cache limit is reached for a specific id, clears the cache and returns the loaded model, clip, and vae without adding a new entry.
+    If there is cache space, adds the id to the ids list if it's not already there.
+    If there is cache space and the checkpoint was not found in loaded_objects, adds a new entry to loaded_objects.
+
+    Parameters:
+    - ckpt_name: name of the checkpoint to load.
+    - id: an identifier for caching models for specific nodes.
+    - output_vae: boolean, if True loads the VAE too.
+    - cache (optional): an integer that specifies how many checkpoint entries with a given id can exist in loaded_objects. Defaults to None.
+    """
+    global loaded_objects
+
+    for entry in loaded_objects["ckpt"]:
+        if entry[0] == ckpt_name:
+            _, model, clip, vae, ids = entry
+            cache_full = cache and len([entry for entry in loaded_objects["ckpt"] if id in entry[-1]]) >= cache
+
+            if cache_full:
+                clear_cache(id, cache, "ckpt")
+            elif id not in ids:
+                ids.append(id)
+
+            return model, clip, vae
+
+    ckpt_path = folder_paths.get_full_path("checkpoints", ckpt_name)
+    out = load_checkpoint_guess_config_tsc(ckpt_path, output_vae, output_clip=True,
+                                                embedding_directory=folder_paths.get_folder_paths("embeddings"))
+    model = out[0]
+    clip = out[1]
+    vae = out[2]  # bvae
+
+    if cache:
+        if len([entry for entry in loaded_objects["ckpt"] if id in entry[-1]]) < cache:
+            loaded_objects["ckpt"].append((ckpt_name, model, clip, vae, [id]))
+        else:
+            clear_cache(id, cache, "ckpt")
+            if cache_overwrite:
+                # Find the first entry with the id, remove the id from the entry's id list
+                for e in loaded_objects["ckpt"]:
+                    if id in e[-1]:
+                        e[-1].remove(id)
+                        # If the id list becomes empty, remove the entry from the "ckpt" list
+                        if not e[-1]:
+                            loaded_objects["ckpt"].remove(e)
+                        break
+                loaded_objects["ckpt"].append((ckpt_name, model, clip, vae, [id]))
+
+    return model, clip, vae
+
+def get_bvae_by_ckpt_name(ckpt_name):
+    for ckpt in loaded_objects["ckpt"]:
+        if ckpt[0] == ckpt_name:
+            return ckpt[3]  # return 'bvae' variable
+    return None  # return None if no match is found
+
+def load_vae(vae_name, id, cache=None, cache_overwrite=False):
+    """
+    Extracts the vae with a given name from the "vae" array in loaded_objects.
+    If the vae is not found, creates a new VAE object with the given name and adds it to the "vae" array.
+    Also stores the id parameter, which is used for caching models specifically for nodes with the given ID.
+    If the cache limit is reached for a specific id, returns the loaded vae without adding id or making a new entry in loaded_objects.
+    If there is cache space, and the id is not in the ids list, adds the id to the ids list.
+    If there is cache space, and the vae was not found in loaded_objects, adds a new entry to the loaded_objects.
+
+    Parameters:
+    - vae_name: name of the VAE to load.
+    - id (optional): an identifier for caching models for specific nodes. Defaults to None.
+    - cache (optional): an integer that specifies how many vae entries with a given id can exist in loaded_objects. Defaults to None.
+    """
+    global loaded_objects
+
+    for i, entry in enumerate(loaded_objects["vae"]):
+        if entry[0] == vae_name:
+            vae, ids = entry[1], entry[2]
+            if id not in ids:
+                if cache and len([entry for entry in loaded_objects["vae"] if id in entry[-1]]) >= cache:
+                    return vae
+                ids.append(id)
+            if cache:
+                clear_cache(id, cache, "vae")
+            return vae
+
+    vae_path = folder_paths.get_full_path("vae", vae_name)
+    vae = comfy.sd.VAE(ckpt_path=vae_path)
+
+    if cache:
+        if len([entry for entry in loaded_objects["vae"] if id in entry[-1]]) < cache:
+            loaded_objects["vae"].append((vae_name, vae, [id]))
+        else:
+            clear_cache(id, cache, "vae")
+            if cache_overwrite:
+                # Find the first entry with the id, remove the id from the entry's id list
+                for e in loaded_objects["vae"]:
+                    if id in e[-1]:
+                        e[-1].remove(id)
+                        # If the id list becomes empty, remove the entry from the "vae" list
+                        if not e[-1]:
+                            loaded_objects["vae"].remove(e)
+                        break
+                loaded_objects["vae"].append((vae_name, vae, [id]))
+
+    return vae
+
+def load_lora(lora_params, ckpt_name, id, cache=None, ckpt_cache=None, cache_overwrite=False):
+    """
+    Extracts the Lora model with a given name from the "lora" array in loaded_objects.
+    If the Lora model is not found or strength values changed or model changed, creates a new Lora object with the given name and adds it to the "lora" array.
+    Also stores the id parameter, which is used for caching models specifically for nodes with the given ID.
+    If the cache limit is reached for a specific id, clears the cache and returns the loaded Lora model and clip without adding a new entry.
+    If there is cache space, adds the id to the ids list if it's not already there.
+    If there is cache space and the Lora model was not found in loaded_objects, adds a new entry to loaded_objects.
+
+    Parameters:
+    - lora_params: A list of tuples, where each tuple contains lora_name, strength_model, strength_clip.
+    - ckpt_name: name of the checkpoint from which the Lora model is created.
+    - id: an identifier for caching models for specific nodes.
+    - cache (optional): an integer that specifies how many Lora entries with a given id can exist in loaded_objects. Defaults to None.
+    """
+    global loaded_objects
+
+    for entry in loaded_objects["lora"]:
+        # Convert to sets and compare
+        if set(entry[0]) == set(lora_params) and entry[1] == ckpt_name:
+
+            _, _, lora_model, lora_clip, ids = entry
+            cache_full = cache and len([entry for entry in loaded_objects["lora"] if id in entry[-1]]) >= cache
+
+            if cache_full:
+                clear_cache(id, cache, "lora")
+            elif id not in ids:
+                ids.append(id)
+
+            # Additional cache handling for 'ckpt' just like in 'load_checkpoint' function
+            for ckpt_entry in loaded_objects["ckpt"]:
+                if ckpt_entry[0] == ckpt_name:
+                    _, _, _, _, ckpt_ids = ckpt_entry
+                    ckpt_cache_full = ckpt_cache and len(
+                        [ckpt_entry for ckpt_entry in loaded_objects["ckpt"] if id in ckpt_entry[-1]]) >= ckpt_cache
+
+                    if ckpt_cache_full:
+                        clear_cache(id, ckpt_cache, "ckpt")
+                    elif id not in ckpt_ids:
+                        ckpt_ids.append(id)
+
+            return lora_model, lora_clip
+
+    def recursive_load_lora(lora_params, ckpt, clip, id, ckpt_cache, cache_overwrite, folder_paths):
+        if len(lora_params) == 0:
+            return ckpt, clip
+
+        lora_name, strength_model, strength_clip = lora_params[0]
+        lora_path = folder_paths.get_full_path("loras", lora_name)
+        lora_model, lora_clip = load_lora_for_models_tsc(ckpt, clip, lora_path, strength_model, strength_clip)
+
+        # Call the function again with the new lora_model and lora_clip and the remaining tuples
+        return recursive_load_lora(lora_params[1:], lora_model, lora_clip, id, ckpt_cache, cache_overwrite, folder_paths)
+
+    # Unpack lora parameters from the first element of the list for now
+    lora_name, strength_model, strength_clip = lora_params[0]
+    ckpt, clip, _ = load_checkpoint(ckpt_name, id, cache=ckpt_cache, cache_overwrite=cache_overwrite)
+
+    lora_model, lora_clip = recursive_load_lora(lora_params, ckpt, clip, id, ckpt_cache, cache_overwrite, folder_paths)
+
+    if cache:
+        if len([entry for entry in loaded_objects["lora"] if id in entry[-1]]) < cache:
+            loaded_objects["lora"].append((lora_params, ckpt_name, lora_model, lora_clip, [id]))
+        else:
+            clear_cache(id, cache, "lora")
+            if cache_overwrite:
+                # Find the first entry with the id, remove the id from the entry's id list
+                for e in loaded_objects["lora"]:
+                    if id in e[-1]:
+                        e[-1].remove(id)
+                        # If the id list becomes empty, remove the entry from the "lora" list
+                        if not e[-1]:
+                            loaded_objects["lora"].remove(e)
+                        break
+                loaded_objects["lora"].append((lora_params, ckpt_name, lora_model, lora_clip, [id]))
+
+    return lora_model, lora_clip
+
+def clear_cache(id, cache, dict_name):
+    """
+    Clear the cache for a specific id in a specific dictionary (either "ckpt" or "vae").
+    If the cache limit is reached for a specific id, deletes the id from the oldest entry.
+    If the id array of the entry becomes empty, deletes the entry.
+    """
+    # Get all entries associated with the id_element
+    id_associated_entries = [entry for entry in loaded_objects[dict_name] if id in entry[-1]]
+    while len(id_associated_entries) > cache:
+        # Identify an older entry (but not necessarily the oldest) containing id
+        older_entry = id_associated_entries[0]
+        # Remove the id_element from the older entry
+        older_entry[-1].remove(id)
+        # If the id array of the older entry becomes empty after this, delete the entry
+        if not older_entry[-1]:
+            loaded_objects[dict_name].remove(older_entry)
+        # Update the id_associated_entries
+        id_associated_entries = [entry for entry in loaded_objects[dict_name] if id in entry[-1]]
+
+def clear_cache_by_exception(node_id, vae_dict=None, ckpt_dict=None, lora_dict=None):
+    global loaded_objects
+
+    dict_mapping = {
+        "vae_dict": "vae",
+        "ckpt_dict": "ckpt",
+        "lora_dict": "lora"
+    }
+
+    for arg_name, arg_val in {"vae_dict": vae_dict, "ckpt_dict": ckpt_dict, "lora_dict": lora_dict}.items():
+        if arg_val is None:
+            continue
+
+        dict_name = dict_mapping[arg_name]
+
+        for tuple_idx, tuple_item in enumerate(loaded_objects[dict_name].copy()):
+            if arg_name == "lora_dict":
+                # Iterate over the tuples (lora_params, ckpt_name) in arg_val
+                for lora_params, ckpt_name in arg_val:
+                    # Compare lists of tuples considering order inside tuples, but not order of tuples
+                    if set(lora_params) == set(tuple_item[0]) and ckpt_name == tuple_item[1]:
+                        break
+                else:  # If no match was found in lora_dict, remove the tuple from loaded_objects
+                    if node_id in tuple_item[-1]:
+                        tuple_item[-1].remove(node_id)
+                        if not tuple_item[-1]:
+                            loaded_objects[dict_name].remove(tuple_item)
+                    continue
+            elif tuple_item[0] not in arg_val:  # Only remove the tuple if it's not in arg_val
+                if node_id in tuple_item[-1]:
+                    tuple_item[-1].remove(node_id)
+                    if not tuple_item[-1]:
+                        loaded_objects[dict_name].remove(tuple_item)
+
+
+# Retrieve the cache number from 'node_settings' json file
+def get_cache_numbers(node_name):
+    # Get the directory path of the current file
+    my_dir = os.path.dirname(os.path.abspath(__file__))
+    # Construct the file path for node_settings.json
+    settings_file = os.path.join(my_dir, 'node_settings.json')
+    # Load the settings from the JSON file
+    with open(settings_file, 'r') as file:
+        node_settings = json.load(file)
+    # Retrieve the cache numbers for the given node
+    model_cache_settings = node_settings.get(node_name, {}).get('model_cache', {})
+    vae_cache = int(model_cache_settings.get('vae', 1))
+    ckpt_cache = int(model_cache_settings.get('ckpt', 1))
+    lora_cache = int(model_cache_settings.get('lora', 1))
+    return vae_cache, ckpt_cache, lora_cache
+
+def print_last_helds(id=None):
+    print("\n" + "-" * 40)  # Print an empty line followed by a separator line
+    if id is not None:
+        id = str(id)  # Convert ID to string
+        print(f"Node-specific Last Helds (node_id:{int(id)})")
+    else:
+        print(f"Global Last Helds:")
+    for key in ["results", "latent", "images", "vae_decode"]:
+        entries_with_id = last_helds[key] if id is None else [entry for entry in last_helds[key] if id == entry[-1]]
+        if not entries_with_id:  # If no entries with the chosen ID, print None and skip this key
+            continue
+        print(f"{key.capitalize()}:")
+        for i, entry in enumerate(entries_with_id, 1):  # Start numbering from 1
+            if isinstance(entry[0], bool):  # Special handling for boolean types
+                output = entry[0]
+            else:
+                output = len(entry[0])
+            if id is None:
+                print(f"  [{i}] Output: {output} (id: {entry[-1]})")
+            else:
+                print(f"  [{i}] Output: {output}")
+    print("-" * 40)  # Print a separator line
+    print("\n")  # Print an empty line

efficiency-nodes-comfyui/workflows/SimpleEval_Node_Examples.txt

@@ -0,0 +1,56 @@
+The Evaluate Integers, Floats, and Strings nodes 
+now employ the SimpleEval library, enabling secure 
+creation and execution of custom Python expressions.
+
+(https://github.com/danthedeckie/simpleeval)
+
+Below is a short list of what is possible.
+______________________________________________
+
+"EVALUATE INTEGERS/FLOATS" NODE EXPRESSION EXAMPLES:
+
+Addition: a + b + c
+Subtraction: a - b - c
+Multiplication: a * b * c
+Division: a / b / c
+Modulo: a % b % c
+Exponentiation: a ** b ** c
+Floor Division: a // b // c
+Absolute Value: abs(a) + abs(b) + abs(c)
+Maximum: max(a, b, c)
+Minimum: min(a, b, c)
+Sum of Squares: a**2 + b**2 + c**2
+Bitwise And: a & b & c
+Bitwise Or: a | b | c
+Bitwise Xor: a ^ b ^ c
+Left Shift: a << 1 + b << 1 + c << 1
+Right Shift: a >> 1 + b >> 1 + c >> 1
+Greater Than Comparison: a > b > c
+Less Than Comparison: a < b < c
+Equal To Comparison: a == b == c
+Not Equal To Comparison: a != b != c
+______________________________________________
+
+"EVALUATE STRINGS" NODE EXPRESSION EXAMPLES:
+
+Concatenate: a + b + c
+Format: f'{a} {b} {c}'
+Length: len(a) + len(b) + len(c)
+Uppercase: a.upper() + b.upper() + c.upper()
+Lowercase: a.lower() + b.lower() + c.lower()
+Capitalize: a.capitalize() + b.capitalize() + c.capitalize()
+Title Case: a.title() + b.title() + c.title()
+Strip: a.strip() + b.strip() + c.strip()
+Find Substring: a.find('sub') + b.find('sub') + c.find('sub')
+Replace Substring: a.replace('old', 'new') + b.replace('old', 'new') + c.replace('old', 'new')
+Count Substring: a.count('sub') + b.count('sub') + c.count('sub')
+Check Numeric: a.isnumeric() + b.isnumeric() + c.isnumeric()
+Check Alphabetic: a.isalpha() + b.isalpha() + c.isalpha()
+Check Alphanumeric: a.isalnum() + b.isalnum() + c.isalnum()
+Check Start: a.startswith('prefix') + b.startswith('prefix') + c.startswith('prefix')
+Check End: a.endswith('suffix') + b.endswith('suffix') + c.endswith('suffix')
+Split: a.split(' ') + b.split(' ') + c.split(' ')
+Zero Fill: a.zfill(5) + b.zfill(5) + c.zfill(5)
+Slice: a[:5] + b[:5] + c[:5]
+Reverse: a[::-1] + b[::-1] + c[::-1]
+______________________________________________

efficiency-nodes-comfyui/workflows/XYplot/Manual Entry Notes.txt

@@ -0,0 +1,43 @@
+EFFICIENCY NODES - XY Plot Manual Entry Syntax Notes
+______________________________________________
+Type: Sampler
+
+if not defined by X/Y_value syntax, the default_scheduler = Ksampler (Efficient)'s Scheduler
+
+1. sampler_1;sampler_2 					= sampler_1(default_scheduler), sampler_2(default_scheduler)
+2. sampler_1,scheduler_1;sampler_2; 			= sampler_1(scheduler_1), sampler_2(default_scheduler)
+3. sampler_1;sampler_2;,default_scheduler		= sampler_1(default_scheduler), sampler_2(default_scheduler)
+4. sampler_1;sampler_2,scheduler_2;,default_scheduler	= sampler_1(default_scheduler), sampler_2(scheduler_2)	
+
+______________________________________________
+Type: Checkpoint
+
+if not defined by X/Y_value syntax, the default_clip_skip = Efficient Loader's Clip Skip
+
+1. ckpt_1;ckpt_2 					= ckpt_1(default_clip_skip), ckpt_2(default_clip_skip)
+2. ckpt_1_1,clip_skip_1;ckpt_2; 			= ckpt_1(clip_skip_1), ckpt_2(default_clip_skip)
+3. ckpt_1;ckpt_2;,default_clip_skip			= ckpt_1(default_clip_skip), ckpt_2(default_clip_skip)
+4. ckpt_1;ckpt_2,clip_skip_2;,default_clip_skip		= ckpt_1(default_clip_skip), ckpt_2(clip_skip_2)
+
+______________________________________________
+
+Type: LoRA
+
+if not defined by X/Y_value syntax, the default_lora_model_str = default_lora_clip_str = 1
+
+def_mod_str = default_lora_model_str
+def_clip_str =  default_lora_clip_str
+
+1. lora_1;lora_2 					= lora_1(default_clip_skip), lora_2(default_clip_skip)
+2. lora_1,mod_str_1;lora_2; 				= lora_1(mod_str_1,1), lora_2(1,1)
+3. lora_1;lora_2;,def_mod_str				= lora_1(def_mod_str,1), lora_2(def_mod_str,1)
+4. lora_1;lora_2,mod_str_2;,def_mod_str,def_clip_str	= lora_1(def_mod_str,def_clip_str), lora_2(mod_str_2,def_clip_str)
+
+______________________________________________
+
+Notes:
+- Trailing semicolons, new entry lines, and spaces are removed when parsing input strings.
+- Any parameter not defined by the XY Plot's inputs are defined by the Efficient Loader and Ksampler (Efficient).
+  For example, if the scheduler isn't specified when plotting Samplers, the script will use
+  the scheduler set by the Ksampler (Efficient).
+- LoRA stacking through the XY Plot Manual Entry node is currently not supported.