├── .gitignore ├── LICENSE ├── README.md ├── __init__.py ├── format_prompt.py ├── install.py ├── qwen_node.py └── qwen_workflow.json /.gitignore: -------------------------------------------------------------------------------- 1 | # Byte-compiled / optimized / DLL files 2 | __pycache__/ 3 | *.py[cod] 4 | *$py.class 5 | 6 | # C extensions 7 | *.so 8 | 9 | # Distribution / packaging 10 | .Python 11 | build/ 12 | develop-eggs/ 13 | dist/ 14 | downloads/ 15 | eggs/ 16 | .eggs/ 17 | lib/ 18 | lib64/ 19 | parts/ 20 | sdist/ 21 | var/ 22 | wheels/ 23 | share/python-wheels/ 24 | *.egg-info/ 25 | .installed.cfg 26 | *.egg 27 | MANIFEST 28 | 29 | # PyInstaller 30 | # Usually these files are written by a python script from a template 31 | # before PyInstaller builds the exe, so as to inject date/other infos into it. 32 | *.manifest 33 | *.spec 34 | 35 | # Installer logs 36 | pip-log.txt 37 | pip-delete-this-directory.txt 38 | 39 | # Unit test / coverage reports 40 | htmlcov/ 41 | .tox/ 42 | .nox/ 43 | .coverage 44 | .coverage.* 45 | .cache 46 | nosetests.xml 47 | coverage.xml 48 | *.cover 49 | *.py,cover 50 | .hypothesis/ 51 | .pytest_cache/ 52 | cover/ 53 | 54 | # Translations 55 | *.mo 56 | *.pot 57 | 58 | # Django stuff: 59 | *.log 60 | local_settings.py 61 | db.sqlite3 62 | db.sqlite3-journal 63 | 64 | # Flask stuff: 65 | instance/ 66 | .webassets-cache 67 | 68 | # Scrapy stuff: 69 | .scrapy 70 | 71 | # Sphinx documentation 72 | docs/_build/ 73 | 74 | # PyBuilder 75 | .pybuilder/ 76 | target/ 77 | 78 | # Jupyter Notebook 79 | .ipynb_checkpoints 80 | 81 | # IPython 82 | profile_default/ 83 | ipython_config.py 84 | 85 | # pyenv 86 | # For a library or package, you might want to ignore these files since the code is 87 | # intended to run in multiple environments; otherwise, check them in: 88 | # .python-version 89 | 90 | # pipenv 91 | # According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control. 92 | # However, in case of collaboration, if having platform-specific dependencies or dependencies 93 | # having no cross-platform support, pipenv may install dependencies that don't work, or not 94 | # install all needed dependencies. 95 | #Pipfile.lock 96 | 97 | # poetry 98 | # Similar to Pipfile.lock, it is generally recommended to include poetry.lock in version control. 99 | # This is especially recommended for binary packages to ensure reproducibility, and is more 100 | # commonly ignored for libraries. 101 | # https://python-poetry.org/docs/basic-usage/#commit-your-poetrylock-file-to-version-control 102 | #poetry.lock 103 | 104 | # pdm 105 | # Similar to Pipfile.lock, it is generally recommended to include pdm.lock in version control. 106 | #pdm.lock 107 | # pdm stores project-wide configurations in .pdm.toml, but it is recommended to not include it 108 | # in version control. 109 | # https://pdm.fming.dev/#use-with-ide 110 | .pdm.toml 111 | 112 | # PEP 582; used by e.g. github.com/David-OConnor/pyflow and github.com/pdm-project/pdm 113 | __pypackages__/ 114 | 115 | # Celery stuff 116 | celerybeat-schedule 117 | celerybeat.pid 118 | 119 | # SageMath parsed files 120 | *.sage.py 121 | 122 | # Environments 123 | .env 124 | .venv 125 | env/ 126 | venv/ 127 | ENV/ 128 | env.bak/ 129 | venv.bak/ 130 | 131 | # Spyder project settings 132 | .spyderproject 133 | .spyproject 134 | 135 | # Rope project settings 136 | .ropeproject 137 | 138 | # mkdocs documentation 139 | /site 140 | 141 | # mypy 142 | .mypy_cache/ 143 | .dmypy.json 144 | dmypy.json 145 | 146 | # Pyre type checker 147 | .pyre/ 148 | 149 | # pytype static type analyzer 150 | .pytype/ 151 | 152 | # Cython debug symbols 153 | cython_debug/ 154 | 155 | # PyCharm 156 | # JetBrains specific template is maintained in a separate JetBrains.gitignore that can 157 | # be found at https://github.com/github/gitignore/blob/main/Global/JetBrains.gitignore 158 | # and can be added to the global gitignore or merged into this file. For a more nuclear 159 | # option (not recommended) you can uncomment the following to ignore the entire idea folder. 160 | #.idea/ 161 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | ## 安装ComfyUI Qwen Prompt插件指南 2 | 3 | ### 第1步：下载模型 4 | 5 | 首先，请从以下链接下载Qwen-1.8B稳定扩散提示GGUF模型：https://huggingface.co/hahahafofo/Qwen-1_8B-Stable-Diffusion-Prompt-GGUF/tree/main 6 | 7 | 您需要将`ggml-model-q4_0.gguf`文件保存到系统上的`models/GPTcheckpoints`目录中。 8 | 9 | 10 | 可以使用镜像，请在终端中执行以下命令： 11 | 12 | ``` 13 | export HF_ENDPOINT=https://hf-mirror.com 14 | huggingface-cli download --resume-download hahahafofo/Qwen-1_8B-Stable-Diffusion-Prompt-GGUF --local-dir GPTcheckpoints 15 | ``` 16 | 17 | ### 第2步：安装llama-cpp-python 18 | 19 | 接下来，从此链接下载适合版本的llama-cpp-python文件：https://github.com/abetlen/llama-cpp-python/releases 20 | 21 | 下载正确的轮子文件后，使用pip进行安装。例如： 22 | 23 | ``` 24 | pip install llama_cpp_python-0.2.33-xxx.whl 25 | ``` 26 | 27 | 请确保您安装的版本是v0.2.33或更高。 28 | 29 | ### 第3步：安装插件 30 | 31 | 最后，将ComfyUI Qwen Prompt存储库克隆到您的ComfyUI custom_nodes目录中。使用以下命令克隆存储库： 32 | 33 | ``` 34 | git clone https://github.com/zhongpei/Comfyui-Qwen-Prompt 35 | ``` 36 | 37 | 按照这些步骤操作，您应该已经成功安装了ComfyUI Qwen Prompt插件。 38 | 39 | 40 | 41 | 42 | # English 43 | 44 | ## Installation Instructions for the ComfyUI Qwen Prompt Plugin 45 | 46 | ### Step 1: Download the Model 47 | 48 | To begin, download the Qwen-1.8B Stable Diffusion Prompt GGUF model from the following URL: https://huggingface.co/hahahafofo/Qwen-1_8B-Stable-Diffusion-Prompt-GGUF/tree/main 49 | 50 | You need to save the `ggml-model-q4_0.gguf` file into the `models/GPTcheckpoints` directory on your system. 51 | 52 | ### Step 2: Install llama-cpp-python 53 | 54 | Next, download the appropriate version of the llama-cpp-python wheel file from this link: https://github.com/abetlen/llama-cpp-python/releases 55 | 56 | Once you have the correct wheel file, install it using pip. For example: 57 | 58 | ``` 59 | pip install llama_cpp_python-0.2.33-xxx.whl 60 | ``` 61 | 62 | Ensure that the version you install is v0.2.33 or higher. 63 | 64 | ### Step 3: Install the Plugin 65 | 66 | Finally, clone the ComfyUI Qwen Prompt repository into your ComfyUI custom_nodes directory. Use the following command to clone the repository: 67 | 68 | ``` 69 | git clone https://github.com/zhongpei/Comfyui-Qwen-Prompt 70 | ``` 71 | 72 | With these steps, you should have successfully installed the ComfyUI Qwen Prompt plugin. -------------------------------------------------------------------------------- /__init__.py: -------------------------------------------------------------------------------- 1 | # code based on pysssss repo 2 | import importlib.util 3 | import glob 4 | import os 5 | import sys 6 | from .install import get_ext_dir,check_and_install 7 | import folder_paths 8 | import traceback 9 | from .qwen_node import NODE_CLASS_MAPPINGS as NODE_CLASS_MAPPINGS_QWEN, NODE_DISPLAY_NAME_MAPPINGS as NODE_DISPLAY_NAME_MAPPINGS_QWEN 10 | from .format_prompt import NODE_CLASS_MAPPINGS as NODE_CLASS_MAPPINGS_FORMAT_PROMPT, NODE_DISPLAY_NAME_MAPPINGS as NODE_DISPLAY_NAME_MAPPINGS_FORMAT_PROMPT 11 | 12 | NODE_CLASS_MAPPINGS = {} 13 | NODE_CLASS_MAPPINGS.update(NODE_CLASS_MAPPINGS_QWEN) 14 | NODE_CLASS_MAPPINGS.update(NODE_CLASS_MAPPINGS_FORMAT_PROMPT) 15 | # A dictionary that contains the friendly/humanly readable titles for the nodes 16 | NODE_DISPLAY_NAME_MAPPINGS = {} 17 | NODE_DISPLAY_NAME_MAPPINGS.update(NODE_DISPLAY_NAME_MAPPINGS_QWEN) 18 | NODE_DISPLAY_NAME_MAPPINGS.update(NODE_DISPLAY_NAME_MAPPINGS_FORMAT_PROMPT) 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | #LLAMA DEPENTENCIES 28 | check_and_install('packaging') 29 | check_and_install('py-cpuinfo',"cpuinfo") 30 | check_and_install('scikit-build',"skbuild") 31 | check_and_install('typing') 32 | check_and_install('diskcache') 33 | check_and_install('llama_cpp') 34 | 35 | 36 | 37 | 38 | 39 | __all__ = ["NODE_CLASS_MAPPINGS", "NODE_DISPLAY_NAME_MAPPINGS"] -------------------------------------------------------------------------------- /format_prompt.py: -------------------------------------------------------------------------------- 1 | import regex as re 2 | import unicodedata 3 | 4 | brackets_opening = '([{<' 5 | brackets_closing = ')]}>' 6 | 7 | # base = r'(?:\\[()\[\]{}<>]|[^,(){}\[\]{}<>])+' 8 | # paren = r'\(+' + base + r'\)+' 9 | # square = r'\[+' + base + r'\]+' 10 | # curly = r'{+' + base + r'}+' 11 | # angle = r'<+' + base + r'>+' 12 | 13 | 14 | # re_tokenize = re.compile('|'.join([base, paren, square, curly, angle])) 15 | re_tokenize = re.compile(r',') 16 | re_brackets_fix_whitespace = re.compile(r'([\(\[{<])\s*|\s*([\)\]}>}])') 17 | re_opposing_brackets = re.compile(r'([)\]}>])([([{<])') 18 | re_networks = re.compile(r'<.+?>') 19 | re_bracket_open = re.compile(r'[(\[]') 20 | re_brackets_open = re.compile(r'\(+|\[+') 21 | re_brackets_closing = re.compile(r'\)+|\]+') 22 | # re_colon_spacing_composite = re.compile(r'(?P[^:]*?)\s*?(?P:)\s*?(?P\S*)(?P\s*)(?(S)\s*?)(?PAND)') 23 | re_colon_spacing_composite = re.compile(r'\s*(:)\s*(?=\d*?\.?\d*?\s*?AND)') 24 | re_colon_spacing = re.compile(r'\s*(:)\s*') 25 | # re_colon_spacing = re.compile(r'(?P[^:]*?)\s*?(?P:)\s*?(?P\S+)(?P\s*)(?(S)\s*?)') 26 | re_colon_spacing_comp_end = re.compile(r'(?<=AND[^:]*?)(:)(?=[^:]*$)') 27 | re_comma_spacing = re.compile(r',+') 28 | re_paren_weights_exist = re.compile(r'\(.*(?{}])') 201 | 202 | # pos = 0 203 | # while pos < len(prompt): 204 | # match = re_dividers.search(prompt, pos) 205 | # # we know we're at the end of the string when we can't match 206 | # if match is None: 207 | # substring = prompt[pos:].strip() 208 | # if substring: 209 | # result.append(substring) 210 | # break 211 | 212 | # # add up to the previous token up to excluding our matched position 213 | # substring = prompt[pos:match.start()].strip() 214 | # if substring: 215 | # result.append(prompt[pos:match.start()].strip()) 216 | # if prompt[match.start()] in '}>': # brackets don't get added, so this corrects for it 217 | # result[-1] = get_bracket_opening(prompt[match.start()]) + result[-1] + prompt[match.start()] 218 | 219 | # # if comma, move pos past it 220 | # if prompt[match.start()] in ',<>{}': 221 | # pos = match.end() 222 | 223 | # # finally deal with real nested stuff 224 | # elif prompt[match.start()] in '[(': 225 | # nested_result, length = tokenize_nested(prompt[match.end():]) # recurses with s, the end of match onwards 226 | # nested_result[0] = prompt[match.start()] + nested_result[0] 227 | # result.append(nested_result) 228 | # pos = match.end() + length 229 | # elif prompt[match.start()] in '])': 230 | # result[-1] = result[-1] + prompt[match.start()] # return from recurse, including the 231 | # return result, match.end() # end of the match to correct position 232 | # return result 233 | 234 | 235 | # def flatten_tokens(tokens: list): 236 | # ret = [] 237 | # for token in tokens: 238 | # if isinstance(token, list): 239 | # ret.extend(flatten_tokens(token)) 240 | # else: 241 | # ret.append(token) 242 | 243 | # return ret 244 | 245 | 246 | def space_bracekts(prompt: str): 247 | def helper(match: re.Match): 248 | # print(' '.join(match.groups())) 249 | return ' '.join(match.groups()) 250 | 251 | # print(prompt) 252 | return re_opposing_brackets.sub(helper, prompt) 253 | 254 | 255 | def align_alternating(prompt: str): 256 | def helper(match: re.Match): 257 | return match.group(1) 258 | 259 | return re_alternating.sub(helper, prompt) 260 | 261 | 262 | def bracket_to_weights(prompt: str): 263 | """ 264 | when scanning, we need a way to ignore prompt editing, composable, and alternating 265 | we still need to weigh their individual words within them, however... 266 | 267 | use a depth counter to ensure that we find closing brackets 268 | 269 | the problem is that as we modify the string, we will be changing it's length, 270 | which will mess with iterations... 271 | we can simply edit the string backwards, that way the operations don't effect 272 | the length of the parts we're working on... however, if we do this, then we can't 273 | remove consecutive brackets of the same type, we we would need to remove bracketing 274 | to the left of the part of the string we're working on. 275 | 276 | well, i think we should be fine with a while pos != end of string, and if we find 277 | a weight to add, break from the enumerate loop and resume at position to re-enumerate 278 | the new string 279 | 280 | go until we reach a [(, ignore networks < and wildcards { 281 | if ( 282 | count if consecutive repeating bracket 283 | look forward to find its corresponding closing bracket 284 | check if those closing brackets are also consecutive 285 | add weighting at the end 286 | remove excessive bracket 287 | convert bracket to () 288 | if [ 289 | count if consecutive repeating bracket 290 | look forward 291 | if we find a : or |, return/break from this weight search 292 | else, to find its corresponding closing bracket 293 | check if those closing brackets are also consecutive 294 | add weighting at the end 295 | remove excessive bracket 296 | convert bracket to () 297 | 298 | IF BRACKETS ARE CONSECUTIVE, AND AFTER THEIR SLOPE, BOTH THEIR 299 | INNER-NEXT DEPTH ARE THE SAME, IT IS A WEIGHT. 300 | 301 | Example using map_depth. 302 | c, ((a, b)) 303 | (( )) 304 | 00012222210 305 | ---^^----vv 306 | 2 ____ 2 307 | 1 /===>\ 1 308 | 0___/=====>\0 309 | Because 01 can meet on the other side, these are matching 310 | 311 | c, (a, (b)) 312 | ( ( )) 313 | 00011112210 314 | ---^---^-vv 315 | 2 _ 2 316 | 1 ___/>\ 1 317 | 0___/=====>\0 318 | 0 and 1 match, but since gradients are not exactly mirrored, 319 | thier weights should not be combined. 320 | 321 | c, ((a), b) 322 | (( ) ) 323 | 00012211110 324 | ---^^-v---v 325 | 2 _ 2 326 | 1 /=\___ 1 327 | 0___/=====>\0 328 | Similar idea to above example. 329 | 330 | c, ((a), ((b))) 331 | (( ) (( ))) 332 | 000122111233210 333 | ---^^-v--^^-vvv 334 | 3 _ 3 335 | 2 _ />\ 2 336 | 1 />\__/==>\ 1 337 | 0___/=========>\0 338 | Tricky one. Here, 01 open together, so there's a potential that their 339 | weights should be combined if they close together, but instead 1 closes 340 | early. We only need to check for closure initial checking depth - 1. 341 | 342 | """ 343 | re_existing_weight = re.compile(r'(:\d+.?\d*)[)\]]$') 344 | depths, gradients, brackets = get_mappings(prompt) 345 | 346 | pos = 0 347 | ret = prompt 348 | gradient_search = [] 349 | 350 | while pos < len(ret): 351 | current_position = ret[pos:] 352 | if ret[pos] in '([': 353 | open_bracketing = re_brackets_open.match(ret, pos) 354 | consecutive = len(open_bracketing.group(0)) 355 | gradient_search = ''.join(map(str, reversed(range(int(depths[pos]) - 1, int(depths[pos]) + consecutive)))) 356 | is_square_brackets = True if '[' in open_bracketing.group(0) else False 357 | 358 | insert_at, weight, valid_consecutive = get_weight( 359 | ret, 360 | gradients, 361 | depths, 362 | brackets, 363 | open_bracketing.end(), 364 | consecutive, 365 | gradient_search, 366 | is_square_brackets) 367 | 368 | # Check if weight already exists 369 | if weight: 370 | if re_existing_weight.search(ret[:insert_at + 1]): 371 | ret = ret[:open_bracketing.start()] + '(' + ret[ 372 | open_bracketing.start() + valid_consecutive:insert_at] + ')' + ret[ 373 | insert_at + consecutive:] 374 | else: 375 | ret = ret[:open_bracketing.start()] + '(' + ret[ 376 | open_bracketing.start() + valid_consecutive:insert_at] + f':{weight:.2f}' + ')' + ret[ 377 | insert_at + consecutive:] 378 | # offset = len(str(f'{weight:.2f}')) 379 | 380 | depths, gradients, brackets = get_mappings(ret) 381 | pos += 1 382 | 383 | match = re_bracket_open.search(ret, pos) 384 | 385 | if not match: # no more potential weight brackets to parse 386 | return ret 387 | 388 | pos = match.start() 389 | 390 | 391 | def depth_to_map(s: str): 392 | ret = '' 393 | depth = 0 394 | for c in s: 395 | if c in '([': 396 | depth += 1 397 | if c in ')]': 398 | depth -= 1 399 | ret += str(depth) 400 | return ret 401 | 402 | 403 | def depth_to_gradeint(s: str): 404 | ret = '' 405 | for c in s: 406 | if c in '([': 407 | ret += str('^') 408 | elif c in ')]': 409 | ret += str('v') 410 | else: 411 | ret += str('-') 412 | return ret 413 | 414 | 415 | def filter_brackets(s: str): 416 | return ''.join(list(map(lambda c: c if c in '[]()' else ' ', s))) 417 | 418 | 419 | def get_mappings(s: str): 420 | return depth_to_map(s), depth_to_gradeint(s), filter_brackets(s) 421 | 422 | 423 | def calculate_weight(d: str, is_square_brackets: bool): 424 | return 1 / 1.1 ** int(d) if is_square_brackets else 1 * 1.1 ** int(d) 425 | 426 | 427 | def get_weight(prompt: str, map_gradient: list, map_depth: list, map_brackets: list, pos: int, ctv: int, 428 | gradient_search: str, is_square_brackets: bool = False): 429 | ''' 430 | Returns 0 if bracket was recognized as prompt editing, alternation, or composable 431 | ''' 432 | # CURRENTLY DOES NOT TAKE INTO ACCOUNT COMPOSABLE?? DO WE EVEN NEED TO? 433 | # E.G. [a AND B :1.2] == (a AND B:1.1) != (a AND B:1.1) ???? 434 | while pos + ctv <= len(prompt): 435 | if ctv == 0: 436 | return prompt, 0, 1 437 | a, b = pos, pos + ctv 438 | if prompt[a] in ':|' and is_square_brackets: 439 | if map_depth[-2] == map_depth[a]: 440 | return prompt, 0, 1 441 | if map_depth[a] in gradient_search: 442 | gradient_search = gradient_search.replace(map_depth[a], '') 443 | ctv -= 1 444 | elif (map_gradient[a:b] == 'v' * ctv and 445 | map_depth[a - 1:b] == gradient_search): 446 | return a, calculate_weight(ctv, is_square_brackets), ctv 447 | elif ('v' == map_gradient[a] and 448 | map_depth[a - 1:b - 1] in gradient_search): 449 | narrowing = map_gradient[a:b].count('v') 450 | gradient_search = gradient_search[narrowing:] 451 | ctv -= 1 452 | pos += 1 453 | 454 | raise Exception(f'Somehow weight index searching has gone outside of prompt length with prompt: {prompt}') 455 | 456 | 457 | def format_prompt(prompt): 458 | if not prompt or prompt.strip() == '': 459 | return prompt 460 | 461 | # Clean up the string 462 | prompt = normalize_characters(prompt) 463 | prompt = remove_mismatched_brackets(prompt) 464 | 465 | # Clean up whitespace for cool beans 466 | prompt = remove_whitespace_excessive(prompt) 467 | prompt = align_brackets(prompt) 468 | prompt = space_AND(prompt) # for proper compositing alignment on colons 469 | prompt = space_bracekts(prompt) 470 | prompt = align_colons(prompt) 471 | prompt = align_commas(prompt) 472 | prompt = align_alternating(prompt) 473 | prompt = bracket_to_weights(prompt) 474 | 475 | # Further processing for usability 476 | # prompt = brackets_to_weights(prompt) 477 | # networks = extract_networks(tokens) 478 | # tokens = remove_networks(tokens) 479 | # tokens.extend(networks) 480 | 481 | # tokens = flatten_tokens(tokens) 482 | # ret.append(', '.join(list(tokens))) 483 | return prompt 484 | 485 | 486 | class FormatPrompt: 487 | @classmethod 488 | def INPUT_TYPES(s): 489 | return { 490 | "required": { 491 | "text": ("STRING", 492 | { 493 | "multiline": True 494 | }), 495 | 496 | } 497 | } 498 | 499 | RETURN_TYPES = ("STRING",) 500 | FUNCTION = "get_prompt" 501 | OUTPUT_NODE = True 502 | CATEGORY = "Qwen" 503 | 504 | def get_prompt(self, text: str, ) -> tuple[str]: 505 | return (format_prompt(text),) 506 | 507 | NODE_CLASS_MAPPINGS = { 508 | "FormatPrompt": FormatPrompt, 509 | } 510 | 511 | NODE_DISPLAY_NAME_MAPPINGS = { 512 | "FormatPrompt": "Format Prompt", 513 | } -------------------------------------------------------------------------------- /install.py: -------------------------------------------------------------------------------- 1 | import asyncio 2 | import os 3 | import json 4 | import shutil 5 | import inspect 6 | import aiohttp 7 | from server import PromptServer 8 | from tqdm import tqdm 9 | import requests 10 | import subprocess 11 | import platform 12 | import importlib.util 13 | import torch 14 | import folder_paths 15 | import sys 16 | 17 | config = None 18 | 19 | 20 | 21 | 22 | def check_nvidia_gpu(): 23 | try: 24 | # Utilizza torch per verificare la presenza di una GPU NVIDIA 25 | return torch.cuda.is_available() and 'NVIDIA' in torch.cuda.get_device_name(0) 26 | except Exception as e: 27 | print(f"Error while checking for NVIDIA GPU: {e}") 28 | return False 29 | 30 | def get_cuda_version(): 31 | try: 32 | if torch.cuda.is_available(): 33 | cuda_version = torch.version.cuda.replace(".","").strip() 34 | 35 | return "cu"+cuda_version 36 | else: 37 | return "No NVIDIA GPU available" 38 | except Exception as e: 39 | print(f"Error while checking CUDA version: {e}") 40 | return "Unable to determine CUDA version" 41 | 42 | def check_avx2_support(): 43 | import cpuinfo 44 | try: 45 | info = cpuinfo.get_cpu_info() 46 | return 'avx2' in info['flags'] 47 | except Exception as e: 48 | print(f"Error while checking AVX2 support: {e}") 49 | return False 50 | 51 | def get_python_version(): 52 | if "3.9" in platform.python_version(): 53 | return "39" 54 | elif "3.10" in platform.python_version(): 55 | return "310" 56 | elif "3.11" in platform.python_version(): 57 | return "311" 58 | else: 59 | return None 60 | 61 | 62 | def get_os(): 63 | return platform.system() 64 | 65 | def get_os_bit(): 66 | return platform.architecture()[0].replace("bit","") 67 | 68 | def get_platform_tag(): 69 | #return the first tag in the list of tags 70 | try: 71 | import packaging.tags 72 | return list(packaging.tags.sys_tags())[0] 73 | except: 74 | return None 75 | def get_last_llcpppy_version(): 76 | try: 77 | import requests 78 | 79 | response = requests.get("https://api.github.com/repos/abetlen/llama-cpp-python/releases/latest") 80 | return response.json()["tag_name"] .replace("v","") 81 | except: 82 | return "0.2.33" 83 | 84 | 85 | def check_and_install(package, import_name=""): 86 | if import_name == "": 87 | import_name = package 88 | try: 89 | importlib.import_module(import_name) 90 | print(f"{import_name} is already installed.") 91 | except ImportError: 92 | print(f"Installing {import_name}...") 93 | if package == "llama_cpp": 94 | install_llama() 95 | else: 96 | install_package(package) 97 | 98 | def install_package(package): 99 | subprocess.check_call([sys.executable, "-m", "pip", "install", "--no-cache-dir", package]) 100 | 101 | def install_llama(): 102 | 103 | 104 | try: 105 | gpu = check_nvidia_gpu() 106 | avx2 = check_avx2_support() 107 | lcpVersion = get_last_llcpppy_version() 108 | python_version = get_python_version() 109 | os = get_os() 110 | os_bit = get_os_bit() 111 | platform_tag = get_platform_tag() 112 | print(f"Python version: {python_version}") 113 | print(f"OS: {os}") 114 | print(f"OS bit: {os_bit}") 115 | print(f"Platform tag: {platform_tag}") 116 | if python_version == None: 117 | print("Unsupported Python version. Please use Python 3.9, 3.10 or 3.11.") 118 | return 119 | 120 | 121 | #python -m pip install llama-cpp-python --force-reinstall --no-deps --index-url=https://jllllll.github.io/llama-cpp-python-cuBLAS-wheels/AVX2/cu117 122 | if avx2: 123 | avx="AVX2" 124 | else: 125 | avx="AVX" 126 | 127 | #if gpu: 128 | # cuda = get_cuda_version() 129 | # subprocess.check_call([sys.executable, "-m", "pip", "install", "llama-cpp-python", "--no-cache-dir", "--force-reinstall", "--no-deps" , f"--index-url=https://jllllll.github.io/llama-cpp-python-cuBLAS-wheels/{avx}/{cuda}"]) 130 | #else: 131 | print(f"pip install https://github.com/abetlen/llama-cpp-python/releases/download/v{lcpVersion}/llama_cpp_python-{lcpVersion}-{platform_tag}.whl") 132 | subprocess.check_call([sys.executable, "-m", "pip", "install", f"https://github.com/abetlen/llama-cpp-python/releases/download/v{lcpVersion}/llama_cpp_python-{lcpVersion}-{platform_tag}.whl"]) 133 | except Exception as e: 134 | print(f"Error while installing LLAMA: {e}") 135 | try: 136 | subprocess.check_call([sys.executable, "-m", "pip", "install","--upgrade","--force-reinstall","--no-cache-dir", f"llama_cpp_python={lcpVersion}"]) 137 | except Exception as e: 138 | print(f"Error while installing LLAMA: {e}") 139 | 140 | # llama wheels https://github.com/jllllll/llama-cpp-python-cuBLAS-wheels 141 | 142 | def check_module(package): 143 | import importlib 144 | try: 145 | print("Detected: ", package) 146 | importlib.import_module(package) 147 | return True 148 | except ImportError: 149 | return False 150 | 151 | 152 | 153 | def get_ext_dir(subpath=None, mkdir=False): 154 | dir = os.path.dirname(__file__) 155 | if subpath is not None: 156 | dir = os.path.join(dir, subpath) 157 | 158 | dir = os.path.abspath(dir) 159 | 160 | if mkdir and not os.path.exists(dir): 161 | os.makedirs(dir) 162 | return dir 163 | 164 | 165 | def get_comfy_dir(subpath=None, mkdir=False): 166 | dir = os.path.dirname(inspect.getfile(PromptServer)) 167 | if subpath is not None: 168 | dir = os.path.join(dir, subpath) 169 | 170 | dir = os.path.abspath(dir) 171 | 172 | if mkdir and not os.path.exists(dir): 173 | os.makedirs(dir) 174 | return dir 175 | 176 | 177 | 178 | 179 | 180 | 181 | 182 | async def download_to_file(url, destination, update_callback=None, is_ext_subpath=True, session=None): 183 | if is_ext_subpath: 184 | destination = get_ext_dir(destination) 185 | with open(destination, mode='wb') as f: 186 | download(url, f, update_callback, session) 187 | 188 | 189 | 190 | 191 | def is_inside_dir(root_dir, check_path): 192 | root_dir = os.path.abspath(root_dir) 193 | if not os.path.isabs(check_path): 194 | check_path = os.path.abspath(os.path.join(root_dir, check_path)) 195 | return os.path.commonpath([check_path, root_dir]) == root_dir 196 | 197 | 198 | def get_child_dir(root_dir, child_path, throw_if_outside=True): 199 | child_path = os.path.abspath(os.path.join(root_dir, child_path)) 200 | if is_inside_dir(root_dir, child_path): 201 | return child_path 202 | if throw_if_outside: 203 | raise NotADirectoryError( 204 | "Saving outside the target folder is not allowed.") 205 | return None -------------------------------------------------------------------------------- /qwen_node.py: -------------------------------------------------------------------------------- 1 | import folder_paths 2 | import os 3 | from llama_cpp import Llama 4 | import copy 5 | from typing_extensions import TypedDict, Literal 6 | from typing import List, Optional 7 | 8 | 9 | _choice = ["YES", "NO"] 10 | _system_prompts = [ 11 | "You are a helpful assistant.", 12 | "你擅长翻译中文到英语。", 13 | "你擅长文言文翻译为英语。", 14 | "你是绘画大师，擅长描绘画面细节。", 15 | "你是剧作家，擅长创作连续的漫画脚本。" 16 | ] 17 | def env_or_def(env, default): 18 | if (env in os.environ): 19 | return os.environ[env] 20 | return default 21 | 22 | 23 | supported_gpt_extensions = set(['.gguf']) 24 | 25 | 26 | 27 | try: 28 | folder_paths.folder_names_and_paths["GPTcheckpoints"] = (folder_paths.folder_names_and_paths["GPTcheckpoints"][0], supported_gpt_extensions) 29 | except: 30 | # check if GPTcheckpoints exists otherwise create 31 | if not os.path.isdir(os.path.join(folder_paths.models_dir, "GPTcheckpoints")): 32 | os.mkdir(os.path.join(folder_paths.models_dir, "GPTcheckpoints")) 33 | 34 | folder_paths.folder_names_and_paths["GPTcheckpoints"] = ([os.path.join(folder_paths.models_dir, "GPTcheckpoints")], supported_gpt_extensions) 35 | 36 | 37 | 38 | class QwenLoaderSimple: 39 | @classmethod 40 | def INPUT_TYPES(s): 41 | return { 42 | "required": { 43 | "ckpt_name": (folder_paths.get_filename_list("GPTcheckpoints"), ), 44 | "gpu_layers": ("INT", {"default": 0, "min": 0, "max": 25, "step": 1}), 45 | "n_threads": ("INT", {"default": 8, "min": 1, "max": 100, "step": 1}), 46 | "max_ctx": ("INT", {"default": 512, "min": 300, "max": 100000, "step": 64}), 47 | "chat_format":("STRING",{"default": "chatml"}) 48 | } 49 | } 50 | 51 | 52 | 53 | RETURN_TYPES = ("CUSTOM","STRING") 54 | RETURN_NAMES = ("model", "model_path") 55 | FUNCTION = "load_gpt_checkpoint" 56 | 57 | CATEGORY = "Qwen" 58 | print() 59 | def load_gpt_checkpoint( 60 | self, 61 | ckpt_name, 62 | gpu_layers, 63 | n_threads, 64 | max_ctx, 65 | chat_format 66 | ): 67 | ckpt_path = folder_paths.get_full_path("GPTcheckpoints", ckpt_name) 68 | llm = Llama(model_path=ckpt_path,n_gpu_layers=gpu_layers,verbose=False,n_threads=n_threads, n_ctx=max_ctx, chat_format=chat_format) 69 | 70 | return llm, ckpt_path 71 | 72 | 73 | class QwenSampler: 74 | 75 | """ 76 | A custom node for text generation using GPT 77 | 78 | Attributes 79 | ---------- 80 | max_tokens (`int`): Maximum number of tokens in the generated text. 81 | temperature (`float`): Temperature parameter for controlling randomness (0.2 to 1.0). 82 | top_p (`float`): Top-p probability for nucleus sampling. 83 | logprobs (`int`|`None`): Number of log probabilities to output alongside the generated text. 84 | echo (`bool`): Whether to print the input prompt alongside the generated text. 85 | stop (`str`|`List[str]`|`None`): Tokens at which to stop generation. 86 | frequency_penalty (`float`): Frequency penalty for word repetition. 87 | presence_penalty (`float`): Presence penalty for word diversity. 88 | repeat_penalty (`float`): Penalty for repeating a prompt's output. 89 | top_k (`int`): Top-k tokens to consider during generation. 90 | stream (`bool`): Whether to generate the text in a streaming fashion. 91 | tfs_z (`float`): Temperature scaling factor for top frequent samples. 92 | model (`str`): The GPT model to use for text generation. 93 | """ 94 | def __init__(self): 95 | self.temp_prompt = "" 96 | pass 97 | 98 | @classmethod 99 | def INPUT_TYPES(cls): 100 | return { 101 | "required": { 102 | "prompt": ("STRING",{"forceInput": True} ), 103 | "model": ("CUSTOM", {"default": ""}), 104 | "model_path": ("STRING", {"default": "","forceInput": True}), 105 | "max_tokens": ("INT", {"default": 77}), 106 | "temperature": ("FLOAT", {"default": 0.9, "min": 0.2, "max": 1.0}), 107 | "top_p": ("FLOAT", {"default": 1.0, "min": 0.1, "max": 1.0}), 108 | "frequency_penalty": ("FLOAT", {"default": 0.0}), 109 | "presence_penalty": ("FLOAT", {"default": 0.0}), 110 | "repeat_penalty": ("FLOAT", {"default": 1.4,"min": 1.1}), 111 | "top_k": ("INT", {"default": 50, "min": 0, "max": 100}), 112 | "tfs_z": ("FLOAT", {"default": 1.0}), 113 | "print_output": (["enable", "disable"], {"default": "disable"}), 114 | "cached": (_choice,{"default": "NO"} ), 115 | "prefix": ("STRING", {"default": "必须使用英语根据主题描述一张照片，详细描述照片细节："}), 116 | "system_prompt": (_system_prompts, {"default": "You are a helpful assistant."}), 117 | 118 | 119 | } 120 | } 121 | 122 | RETURN_TYPES = ("STRING",) 123 | FUNCTION = "generate_text" 124 | CATEGORY = "Qwen" 125 | 126 | def generate_text(self,prompt, max_tokens, temperature, top_p, frequency_penalty, presence_penalty, repeat_penalty, top_k, tfs_z, model,model_path,print_output,cached,prefix,system_prompt): 127 | 128 | 129 | if cached == "NO": 130 | # Call your GPT generation function here using the provided parameters 131 | messages = [ 132 | {"role": "system", "content": system_prompt}, 133 | { 134 | "role": "user", 135 | "content": f"{prefix} {prompt}" 136 | } 137 | ] 138 | stream = model.create_chat_completion( 139 | messages, 140 | max_tokens=max_tokens, 141 | top_k=top_k, 142 | top_p=top_p, 143 | temperature=temperature, 144 | frequency_penalty=frequency_penalty, 145 | presence_penalty=presence_penalty, 146 | tfs_z=tfs_z, 147 | 148 | # stream=True, 149 | repeat_penalty=repeat_penalty, 150 | stop=["\n"] 151 | ) 152 | 153 | #print(len(stream)) 154 | #print(stream) 155 | cont= stream["choices"][0]["message"]["content"] 156 | cont = cont.strip() 157 | self.temp_prompt = cont.strip() 158 | else: 159 | cont = self.temp_prompt 160 | #remove fist 30 characters of cont 161 | try: 162 | if print_output == "enable": 163 | print(f"Input: {prompt}\nGenerated Text: {cont}") 164 | return {"ui": {"text": cont}, "result": (cont,)} 165 | 166 | except: 167 | if print_output == "enable": 168 | print(f"Input: {prompt}\nGenerated Text: ") 169 | return {"ui": {"text": " "}, "result": (" ",)} 170 | 171 | 172 | 173 | class TextBox: 174 | def __init__(self): 175 | pass 176 | 177 | @classmethod 178 | def INPUT_TYPES(cls): 179 | return { 180 | "required": { 181 | "Text": ("STRING", { 182 | "default": "", 183 | "multiline": True, 184 | }), 185 | } 186 | } 187 | 188 | RETURN_TYPES = ("STRING",) 189 | FUNCTION = "get_value" 190 | CATEGORY = "Qwen" 191 | 192 | def get_value(self, Text): 193 | return (Text,) 194 | 195 | 196 | 197 | NODE_CLASS_MAPPINGS = { 198 | "TextBox": TextBox, 199 | "Qwen Loader Simple": QwenLoaderSimple, 200 | "QwenSampler": QwenSampler 201 | } 202 | 203 | # A dictionary that contains the friendly/humanly readable titles for the nodes 204 | NODE_DISPLAY_NAME_MAPPINGS = { 205 | "Qwen Loader Simple": "Qwen Loader Simple", 206 | "QwenSampler": "Qwen Text Sampler", 207 | "TextBox": "Text Box", 208 | } 209 | -------------------------------------------------------------------------------- /qwen_workflow.json: -------------------------------------------------------------------------------- 1 | { 2 | "last_node_id": 36, 3 | "last_link_id": 37, 4 | "nodes": [ 5 | { 6 | "id": 14, 7 | "type": "VAEDecode", 8 | "pos": [ 9 | 1475, 10 | 565 11 | ], 12 | "size": { 13 | "0": 210, 14 | "1": 46 15 | }, 16 | "flags": { 17 | "collapsed": true 18 | }, 19 | "order": 9, 20 | "mode": 0, 21 | "inputs": [ 22 | { 23 | "name": "samples", 24 | "type": "LATENT", 25 | "link": 16 26 | }, 27 | { 28 | "name": "vae", 29 | "type": "VAE", 30 | "link": 17 31 | } 32 | ], 33 | "outputs": [ 34 | { 35 | "name": "IMAGE", 36 | "type": "IMAGE", 37 | "links": [ 38 | 18 39 | ], 40 | "shape": 3, 41 | "slot_index": 0 42 | } 43 | ], 44 | "properties": { 45 | "Node name for S&R": "VAEDecode" 46 | } 47 | }, 48 | { 49 | "id": 23, 50 | "type": "CLIPTextEncode", 51 | "pos": [ 52 | 659, 53 | 670 54 | ], 55 | "size": { 56 | "0": 400, 57 | "1": 200 58 | }, 59 | "flags": { 60 | "collapsed": true 61 | }, 62 | "order": 7, 63 | "mode": 0, 64 | "inputs": [ 65 | { 66 | "name": "clip", 67 | "type": "CLIP", 68 | "link": 21 69 | }, 70 | { 71 | "name": "text", 72 | "type": "STRING", 73 | "link": 33, 74 | "widget": { 75 | "name": "text" 76 | } 77 | } 78 | ], 79 | "outputs": [ 80 | { 81 | "name": "CONDITIONING", 82 | "type": "CONDITIONING", 83 | "links": [ 84 | 22 85 | ], 86 | "shape": 3, 87 | "slot_index": 0 88 | } 89 | ], 90 | "properties": { 91 | "Node name for S&R": "CLIPTextEncode" 92 | }, 93 | "widgets_values": [ 94 | "" 95 | ] 96 | }, 97 | { 98 | "id": 22, 99 | "type": "CLIPTextEncode", 100 | "pos": [ 101 | 651, 102 | 721 103 | ], 104 | "size": { 105 | "0": 400, 106 | "1": 200 107 | }, 108 | "flags": {}, 109 | "order": 4, 110 | "mode": 0, 111 | "inputs": [ 112 | { 113 | "name": "clip", 114 | "type": "CLIP", 115 | "link": 20 116 | } 117 | ], 118 | "outputs": [ 119 | { 120 | "name": "CONDITIONING", 121 | "type": "CONDITIONING", 122 | "links": [ 123 | 23 124 | ], 125 | "shape": 3, 126 | "slot_index": 0 127 | } 128 | ], 129 | "properties": { 130 | "Node name for S&R": "CLIPTextEncode" 131 | }, 132 | "widgets_values": [ 133 | "low, " 134 | ] 135 | }, 136 | { 137 | "id": 10, 138 | "type": "CheckpointLoaderSimple", 139 | "pos": [ 140 | 291, 141 | 606 142 | ], 143 | "size": { 144 | "0": 322.76556396484375, 145 | "1": 139.012939453125 146 | }, 147 | "flags": {}, 148 | "order": 0, 149 | "mode": 0, 150 | "outputs": [ 151 | { 152 | "name": "MODEL", 153 | "type": "MODEL", 154 | "links": [ 155 | 11 156 | ], 157 | "shape": 3, 158 | "slot_index": 0 159 | }, 160 | { 161 | "name": "CLIP", 162 | "type": "CLIP", 163 | "links": [ 164 | 20, 165 | 21 166 | ], 167 | "shape": 3, 168 | "slot_index": 1 169 | }, 170 | { 171 | "name": "VAE", 172 | "type": "VAE", 173 | "links": [ 174 | 17 175 | ], 176 | "shape": 3, 177 | "slot_index": 2 178 | } 179 | ], 180 | "properties": { 181 | "Node name for S&R": "CheckpointLoaderSimple" 182 | }, 183 | "widgets_values": [ 184 | "XL/ssd-1b.safetensors" 185 | ] 186 | }, 187 | { 188 | "id": 24, 189 | "type": "EmptyLatentImage", 190 | "pos": [ 191 | 298, 192 | 801 193 | ], 194 | "size": { 195 | "0": 315, 196 | "1": 106 197 | }, 198 | "flags": {}, 199 | "order": 1, 200 | "mode": 0, 201 | "outputs": [ 202 | { 203 | "name": "LATENT", 204 | "type": "LATENT", 205 | "links": [ 206 | 25 207 | ], 208 | "shape": 3, 209 | "slot_index": 0 210 | } 211 | ], 212 | "properties": { 213 | "Node name for S&R": "EmptyLatentImage" 214 | }, 215 | "widgets_values": [ 216 | 1024, 217 | 768, 218 | 1 219 | ] 220 | }, 221 | { 222 | "id": 35, 223 | "type": "FormatPrompt", 224 | "pos": [ 225 | 1119, 226 | 69 227 | ], 228 | "size": { 229 | "0": 400, 230 | "1": 200 231 | }, 232 | "flags": { 233 | "collapsed": true 234 | }, 235 | "order": 6, 236 | "mode": 0, 237 | "inputs": [ 238 | { 239 | "name": "text", 240 | "type": "STRING", 241 | "link": 37, 242 | "widget": { 243 | "name": "text" 244 | } 245 | } 246 | ], 247 | "outputs": [ 248 | { 249 | "name": "STRING", 250 | "type": "STRING", 251 | "links": [ 252 | 33 253 | ], 254 | "shape": 3, 255 | "slot_index": 0 256 | } 257 | ], 258 | "properties": { 259 | "Node name for S&R": "FormatPrompt" 260 | }, 261 | "widgets_values": [ 262 | "" 263 | ] 264 | }, 265 | { 266 | "id": 15, 267 | "type": "PreviewImage", 268 | "pos": [ 269 | 1111, 270 | 113 271 | ], 272 | "size": { 273 | "0": 338, 274 | "1": 355 275 | }, 276 | "flags": {}, 277 | "order": 10, 278 | "mode": 0, 279 | "inputs": [ 280 | { 281 | "name": "images", 282 | "type": "IMAGE", 283 | "link": 18 284 | } 285 | ], 286 | "properties": { 287 | "Node name for S&R": "PreviewImage" 288 | } 289 | }, 290 | { 291 | "id": 8, 292 | "type": "Qwen Loader Simple", 293 | "pos": [ 294 | 291, 295 | 89 296 | ], 297 | "size": { 298 | "0": 315, 299 | "1": 174 300 | }, 301 | "flags": {}, 302 | "order": 2, 303 | "mode": 0, 304 | "outputs": [ 305 | { 306 | "name": "model", 307 | "type": "CUSTOM", 308 | "links": [ 309 | 34 310 | ], 311 | "shape": 3, 312 | "slot_index": 0 313 | }, 314 | { 315 | "name": "model_path", 316 | "type": "STRING", 317 | "links": [ 318 | 35 319 | ], 320 | "shape": 3, 321 | "slot_index": 1 322 | } 323 | ], 324 | "properties": { 325 | "Node name for S&R": "Qwen Loader Simple" 326 | }, 327 | "widgets_values": [ 328 | "ggml-qwen-1_8B-q4_0.gguf", 329 | 25, 330 | 16, 331 | 512, 332 | "chatml" 333 | ] 334 | }, 335 | { 336 | "id": 11, 337 | "type": "KSamplerAdvanced", 338 | "pos": [ 339 | 1119, 340 | 545 341 | ], 342 | "size": { 343 | "0": 315, 344 | "1": 546 345 | }, 346 | "flags": {}, 347 | "order": 8, 348 | "mode": 0, 349 | "inputs": [ 350 | { 351 | "name": "model", 352 | "type": "MODEL", 353 | "link": 11 354 | }, 355 | { 356 | "name": "positive", 357 | "type": "CONDITIONING", 358 | "link": 22 359 | }, 360 | { 361 | "name": "negative", 362 | "type": "CONDITIONING", 363 | "link": 23 364 | }, 365 | { 366 | "name": "latent_image", 367 | "type": "LATENT", 368 | "link": 25 369 | } 370 | ], 371 | "outputs": [ 372 | { 373 | "name": "LATENT", 374 | "type": "LATENT", 375 | "links": [ 376 | 16 377 | ], 378 | "shape": 3, 379 | "slot_index": 0 380 | } 381 | ], 382 | "properties": { 383 | "Node name for S&R": "KSamplerAdvanced" 384 | }, 385 | "widgets_values": [ 386 | "enable", 387 | 353473084589155, 388 | "randomize", 389 | 20, 390 | 8, 391 | "euler", 392 | "normal", 393 | 0, 394 | 10000, 395 | "disable" 396 | ] 397 | }, 398 | { 399 | "id": 36, 400 | "type": "QwenSampler", 401 | "pos": [ 402 | 646, 403 | 90 404 | ], 405 | "size": { 406 | "0": 439, 407 | "1": 518 408 | }, 409 | "flags": {}, 410 | "order": 5, 411 | "mode": 0, 412 | "inputs": [ 413 | { 414 | "name": "model", 415 | "type": "CUSTOM", 416 | "link": 34 417 | }, 418 | { 419 | "name": "prompt", 420 | "type": "STRING", 421 | "link": 36, 422 | "widget": { 423 | "name": "prompt" 424 | } 425 | }, 426 | { 427 | "name": "model_path", 428 | "type": "STRING", 429 | "link": 35, 430 | "widget": { 431 | "name": "model_path" 432 | } 433 | } 434 | ], 435 | "outputs": [ 436 | { 437 | "name": "STRING", 438 | "type": "STRING", 439 | "links": [ 440 | 37 441 | ], 442 | "shape": 3, 443 | "slot_index": 0 444 | } 445 | ], 446 | "properties": { 447 | "Node name for S&R": "QwenSampler" 448 | }, 449 | "widgets_values": [ 450 | "", 451 | "", 452 | 77, 453 | 0.9, 454 | 1, 455 | 0, 456 | 0, 457 | 1.4, 458 | 50, 459 | 1, 460 | "disable", 461 | "NO", 462 | "必须使用英语根据主题描述一张图片，详细描述图片细节：", 463 | "You are a helpful assistant." 464 | ] 465 | }, 466 | { 467 | "id": 31, 468 | "type": "TextBox", 469 | "pos": [ 470 | 286, 471 | 333 472 | ], 473 | "size": { 474 | "0": 338, 475 | "1": 219 476 | }, 477 | "flags": {}, 478 | "order": 3, 479 | "mode": 0, 480 | "outputs": [ 481 | { 482 | "name": "STRING", 483 | "type": "STRING", 484 | "links": [ 485 | 36 486 | ], 487 | "shape": 3, 488 | "slot_index": 0 489 | } 490 | ], 491 | "properties": { 492 | "Node name for S&R": "TextBox" 493 | }, 494 | "widgets_values": [ 495 | "女孩在树下喝酒，远处火山爆发，末世景象" 496 | ] 497 | } 498 | ], 499 | "links": [ 500 | [ 501 | 11, 502 | 10, 503 | 0, 504 | 11, 505 | 0, 506 | "MODEL" 507 | ], 508 | [ 509 | 16, 510 | 11, 511 | 0, 512 | 14, 513 | 0, 514 | "LATENT" 515 | ], 516 | [ 517 | 17, 518 | 10, 519 | 2, 520 | 14, 521 | 1, 522 | "VAE" 523 | ], 524 | [ 525 | 18, 526 | 14, 527 | 0, 528 | 15, 529 | 0, 530 | "IMAGE" 531 | ], 532 | [ 533 | 20, 534 | 10, 535 | 1, 536 | 22, 537 | 0, 538 | "CLIP" 539 | ], 540 | [ 541 | 21, 542 | 10, 543 | 1, 544 | 23, 545 | 0, 546 | "CLIP" 547 | ], 548 | [ 549 | 22, 550 | 23, 551 | 0, 552 | 11, 553 | 1, 554 | "CONDITIONING" 555 | ], 556 | [ 557 | 23, 558 | 22, 559 | 0, 560 | 11, 561 | 2, 562 | "CONDITIONING" 563 | ], 564 | [ 565 | 25, 566 | 24, 567 | 0, 568 | 11, 569 | 3, 570 | "LATENT" 571 | ], 572 | [ 573 | 33, 574 | 35, 575 | 0, 576 | 23, 577 | 1, 578 | "STRING" 579 | ], 580 | [ 581 | 34, 582 | 8, 583 | 0, 584 | 36, 585 | 0, 586 | "CUSTOM" 587 | ], 588 | [ 589 | 35, 590 | 8, 591 | 1, 592 | 36, 593 | 2, 594 | "STRING" 595 | ], 596 | [ 597 | 36, 598 | 31, 599 | 0, 600 | 36, 601 | 1, 602 | "STRING" 603 | ], 604 | [ 605 | 37, 606 | 36, 607 | 0, 608 | 35, 609 | 0, 610 | "STRING" 611 | ] 612 | ], 613 | "groups": [], 614 | "config": {}, 615 | "extra": {}, 616 | "version": 0.4 617 | } --------------------------------------------------------------------------------