├── LICENSE ├── README.md └── comp.py /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 | # comp.py 2 | This script was originally written for VS R53 and Python 3.9, and has been tested on VS R65 and Python 3.11. 3 | 4 | ### Prerequisites: 5 | 1. [Install Python](https://www.python.org/downloads/) 6 | 7 | 2. [Install Vapoursynth](https://github.com/vapoursynth/vapoursynth/releases) 8 | 9 | 3. Install Python dependencies: 10 | ```powershell 11 | pip install anitopy pyperclip requests requests_toolbelt natsort vstools rich colorama 12 | ``` 13 | 14 | 4. Install Vapoursynth plugin dependencies: 15 | ```powershell 16 | vsrepo install fpng lsmas sub 17 | ``` 18 | - Alternatively, install the following to your usual Vapoursynth plugins folder: 19 | - https://github.com/Mikewando/vsfpng 20 | - https://github.com/AkarinVS/L-SMASH-Works/releases/latest 21 | - https://github.com/vapoursynth/subtext/releases/latest 22 | - Note: plugins folder is typically found in `%AppData%\Roaming\VapourSynth\plugins64` or `C:\Program Files\VapourSynth\plugins` 23 | 24 | 5. Optional: If using [FFmpeg](https://ffmpeg.org/download.html), it must be installed and in PATH. 25 | 26 | ### How to use: 27 | - Put `comp.py` into the same folder where the video files you want to compare are located. 28 | - (Optional) Rename your files to have typical `[Group] Show - Ep.mkv` naming if they don't, since the script will try to parse the group and show name. 29 | - e.g. `Youjo Senki 1.m2ts` --> `[JPBD] Youjo Senki - 01.m2ts`. 30 | - Adjust the variables in the script accordingly. 31 | - Run the script by double-clicking it or by running `py comp.py` in your terminal. 32 | -------------------------------------------------------------------------------- /comp.py: -------------------------------------------------------------------------------- 1 | r""" 2 | I do not provide support for this unless its an actual error in the code and not related to your setup. 3 | This script was originally written for VS R53 and Python 3.9, and has been tested on VS R65 and Python 3.11. 4 | 5 | You'll need: 6 | - VapourSynth (https://github.com/vapoursynth/vapoursynth/releases) 7 | - "pip install anitopy pyperclip requests requests_toolbelt natsort vstools rich colorama" in terminal (without quotes) 8 | - "vsrepo install fpng lsmas sub" in terminal (without quotes) or the following installed to your usual VapourSynth plugins folder: 9 | - https://github.com/Mikewando/vsfpng 10 | - https://github.com/AkarinVS/L-SMASH-Works/releases/latest 11 | - https://github.com/vapoursynth/subtext/releases/latest 12 | - Note: plugins folder is typically found in "%AppData%\Roaming\VapourSynth\plugins64" or "C:\Program Files\VapourSynth\plugins" 13 | - Optional: If using FFmpeg, it must be installed and in PATH. 14 | 15 | How to use: 16 | - Drop comp.py into a folder with the video files you want to compare. 17 | - (Recommended) Rename your files to have the typical [Group] Show - Ep.mkv naming, since the script will try to parse the group and show name. 18 | e.g. [JPBD] Youjo Senki - 01.m2ts; [Vodes] Youjo Senki - 01.mkv. 19 | - Change variables below. 20 | - Run comp.py. 21 | """ 22 | 23 | # Ram limit (in MB) 24 | ram_limit = 4000 25 | 26 | # Number of dark, bright, and high motion frames to algorithmically select. 27 | frame_count_dark = 20 28 | frame_count_bright = 10 29 | frame_count_motion = 15 30 | # Choose your own frames to export. Does not decrease the number of algorithmically selected frames. 31 | user_frames = [] 32 | # Number of frames to choose randomly. Completely separate from frame_count_bright, frame_count_dark, and save_frames. Will change every time you run the script. 33 | random_frames = 15 34 | 35 | # Save the brightness data in a text file so it doesn't have to be reanalysed next time the script is run. Frames will be reanalysed if show/movie name or episode numbers change. 36 | # Does not save user_frames or random_frames. 37 | save_frames = True 38 | 39 | # Print frame info on screenshots. 40 | frame_info = True 41 | # Upscale videos to make the clips match the highest found res. 42 | upscale = True 43 | # Scale all videos to one vertical resolution. Set to 0 to disable, otherwise input the desired vertical res. 44 | single_res = 0 45 | # Use FFmpeg as the image renderer. If false, fpng is used instead 46 | ffmpeg = False 47 | # Compression level. For FFmpeg, range is 0-100. For fpng, 0 is fast, 1 is slow, 2 is uncompressed. 48 | compression = 1 49 | 50 | # Automatically upload to slow.pics. 51 | slowpics = True 52 | # Flags to toggle for slowpics settings. 53 | hentai_flag = False 54 | public_flag = True 55 | # TMDB ID of show or movie being comped. Should be in the format "TV_XXXXXX" or "MOVIE_XXXXXX". 56 | tmdbID = "" 57 | # Remove the comparison after this many days. Set to 0 to disable. 58 | remove_after = 0 59 | # Output slow.pics link to discord webhook. Disabled if empty. 60 | webhook_url = r"" 61 | # Automatically open slow.pics url in default browser 62 | browser_open = True 63 | # Create a URL shortcut for each comparison uploaded. 64 | url_shortcut = True 65 | # Automatically delete the screenshot directory after uploading to slow.pics. 66 | delete_screen_dir = True 67 | 68 | """ 69 | Used to trim clips, or add blank frames to the beginning of a clip. 70 | Clips are taken in alphabetical order of the filenames. 71 | First input can be the filename, group name, or index of the file. Second input must be an integer. 72 | 73 | Example: 74 | trim_dict = {0: 1000, "Vodes": 1046, 3:-50} 75 | trim_dict_end = {"Youjo Senki - 01.mkv": 9251, 4: -12} 76 | First clip will start at frame 1000. 77 | Clip with group name "Vodes" will start at frame 1046. 78 | Clip with filename "Youjo Senki - 01.mkv" will end at frame 9251. 79 | Fourth clip will have 50 blank frames appended to its start. 80 | Fifth clip will end 12 frames early. 81 | 82 | Note: 83 | If multiple files have the same group name, the trim will be applied to all of them. 84 | """ 85 | trim_dict = {} 86 | trim_dict_end = {} 87 | 88 | """ 89 | Actively adjusts a clip's fps to a target. Useful for sources which incorrectly convert 23.976fps to 24fps. 90 | First input can be the filename, group name, or index of the file. 91 | Second input must be a fraction split into a list. Numerator comes first, denominator comes second. 92 | Second input can also be the string "set". This will make all other files, if unspecified fps, use the set file's fps. 93 | 94 | Example: 95 | change_fps = {0: [24, 1], 1: [24000, 1001]} 96 | First clip will have its fps adjusted to 24 97 | Second clip will have its fps adjusted to 23.976 98 | 99 | Example 2: 100 | change_fps = {0: [24, 1], "MTBB": "set"} 101 | First clip will have its fps adjusted to 24 102 | Every other clip will have its fps adjusted to match MTBB's 103 | 104 | Note: 105 | If multiple files have the same group name, the specified fps will be applied to all of them. 106 | """ 107 | change_fps = {} 108 | 109 | """ 110 | Specify which clip will be analyzed for frame selection algorithm. 111 | Input can be the filename, group name, or index of the file. 112 | By default will select the file which can be accessed the fastest. 113 | """ 114 | analyze_clip = "" 115 | 116 | ##### Advanced Settings ##### 117 | 118 | # Random seed to use in frame selection algorithm. May change selected frames. Recommended to leave as default 119 | random_seed = 20202020 120 | # Filename of the text file in which the brightness data will be stored. Recommended to leave as default. 121 | frame_filename = "generated.compframes" 122 | # Directory in which the screenshots will be kept 123 | screen_dirname = "screens" 124 | # Minimum time between dark, light, and random frames, in seconds. Motion frames use a quarter of this value 125 | screen_separation = 6 126 | # Number of frames in each direction over which the motion data will be averaged out. So a radius of 4 would take the average of 9 frames, the frame in the middle, and 4 in each direction. 127 | # Higher value will make it less likely scene changes get picked up as motion, but may lead to less precise results. 128 | motion_diff_radius = 4 129 | 130 | ### Not recommended to change stuff below 131 | import os, sys, time, textwrap, re, uuid, random, pathlib, requests, vstools, webbrowser, colorama, shutil, fractions, subprocess 132 | from rich.progress import Progress, BarColumn, TextColumn, TimeRemainingColumn 133 | from natsort import os_sorted 134 | import anitopy as ani 135 | import pyperclip as pc 136 | import vapoursynth as vs 137 | from requests import Session 138 | from functools import partial 139 | from requests_toolbelt import MultipartEncoder 140 | from typing import Any, Dict, List, Optional, BinaryIO, Union, Callable, TypeVar, Sequence, cast 141 | RenderCallback = Callable[[int, vs.VideoFrame], None] 142 | VideoProp = Union[int, Sequence[int],float, Sequence[float],str, Sequence[str],vs.VideoNode, Sequence[vs.VideoNode],vs.VideoFrame, Sequence[vs.VideoFrame],Callable[..., Any], Sequence[Callable[..., Any]]] 143 | T = TypeVar("T", bound=VideoProp) 144 | vs.core.max_cache_size = ram_limit 145 | colorama.init() 146 | 147 | def FrameInfo(clip: vs.VideoNode, 148 | title: str, 149 | style: str = "sans-serif,20,&H00FFFFFF,&H000000FF,&H00000000,&H00000000,""0,0,0,0,100,100,0,0,1,2,0,7,10,10,10,1", 150 | newlines: int = 3, 151 | pad_info: bool = False) -> vs.VideoNode: 152 | """ 153 | FrameInfo function stolen from awsmfunc, implemented by LibreSneed 154 | Prints the frame number, frame type and a title on the clip 155 | """ 156 | 157 | def FrameProps(n: int, f: vs.VideoFrame, clip: vs.VideoNode, padding: Optional[str]) -> vs.VideoNode: 158 | if "_PictType" in f.props: 159 | info = f"Frame {n} of {clip.num_frames}\nPicture type: {f.props['_PictType'].decode()}" 160 | else: 161 | info = f"Frame {n} of {clip.num_frames}\nPicture type: N/A" 162 | 163 | if pad_info and padding: 164 | info_text = [padding + info] 165 | else: 166 | info_text = [info] 167 | 168 | clip = vs.core.sub.Subtitle(clip, text=info_text, style=style) 169 | 170 | return clip 171 | 172 | padding_info: Optional[str] = None 173 | 174 | if pad_info: 175 | padding_info = " " + "".join(['\n'] * newlines) 176 | padding_title = " " + "".join(['\n'] * (newlines + 4)) 177 | else: 178 | padding_title = " " + "".join(['\n'] * newlines) 179 | 180 | clip = vs.core.std.FrameEval(clip, partial(FrameProps, clip=clip, padding=padding_info), prop_src=clip) 181 | clip = vs.core.sub.Subtitle(clip, text=[padding_title + title], style=style) 182 | 183 | return clip 184 | 185 | def dedupe(clip: vs.VideoNode, framelist: list, framecount: int, diff_thr: int, selected_frames: list = [], seed: int = None, motion: bool = False): 186 | """ 187 | Selects frames from a list as long as they aren't too close together. 188 | 189 | :param framelist: Detailed list of frames that has to be cut down. 190 | :param framecount: Number of frames to select. 191 | :param seed: Seed for `random.sample()`. 192 | :param diff_thr: Minimum distance between each frame (in seconds). 193 | :param motion: If enabled, the frames will be put in an ordered list, not selected randomly. 194 | 195 | :return: Deduped framelist 196 | """ 197 | 198 | random.seed(seed) 199 | thr = round(clip.fps_num / clip.fps_den * diff_thr) 200 | initial_length = len(selected_frames) 201 | 202 | while (len(selected_frames) - initial_length) < framecount and len(framelist) > 0: 203 | dupe = False 204 | 205 | #get random frame from framelist with removal. if motion, get first frame 206 | if motion: 207 | rand = framelist.pop(0) 208 | else: 209 | rand = framelist.pop(random.randint(0, len(framelist) - 1)) 210 | 211 | #check if it's too close to an already selected frame 212 | for selected_frame in selected_frames: 213 | if abs(selected_frame - rand) < thr: 214 | dupe = True 215 | break 216 | 217 | if not dupe: 218 | selected_frames.append(rand) 219 | 220 | selected_frames.sort() 221 | 222 | return selected_frames 223 | 224 | def lazylist(clip: vs.VideoNode, dark_frames: int = 25, light_frames: int = 15, motion_frames: int = 0, selected_frames: list = [], seed: int = random_seed, 225 | diff_thr: int = screen_separation, diff_radius: int = motion_diff_radius, dark_list: list = None, light_list: list = None, motion_list: list = None, 226 | save_frames: bool = False, file: str = None, files: list = None, files_info: list = None): 227 | """ 228 | Generates a list of frames for comparison purposes. 229 | 230 | :param clip: Input clip. 231 | :param dark_frames: Number of dark frames. 232 | :param light_frames: Number of light frames. 233 | :param motion_frames: Number of frames with high level of motion. 234 | :param seed: Seed for `random.sample()`. 235 | :param diff_thr: Minimum distance between each frame (in seconds). 236 | :param diff_thr: Number of frames to take into account when finding high motion frames. 237 | :param dark_list: Pre-existing detailed list of dark frames that needs to be sorted. 238 | :param light_list: Pre-existing detailed list of light frames that needs to be sorted. 239 | :param motion_list: Pre-existing detailed list of high motion frames that needs to be sorted. 240 | :param save_frames: If true, returns detailed lists with every type of frame. 241 | :param file: File being analyzed. 242 | :param files: List of files in directory. 243 | :param files_info: Information for each file in directory. 244 | 245 | :return: List of dark, light, and high motion frames. 246 | """ 247 | 248 | #if no frames were requested, return empty list before running algorithm 249 | if dark_frames + light_frames + motion_frames == 0: 250 | return [], dark_list, light_list, motion_list 251 | 252 | findex = files.index(file) 253 | 254 | dark = [] 255 | light = [] 256 | diff = [] 257 | motion = [] 258 | 259 | if dark_list is None or light_list is None or motion_list is None: 260 | 261 | def checkclip(n, f, clip): 262 | avg = f.props["PlaneStatsAverage"] 263 | 264 | if 0.062746 <= avg <= 0.380000: 265 | dark.append(n) 266 | 267 | elif 0.450000 <= avg <= 0.800000: 268 | light.append(n) 269 | 270 | if motion_list is None and motion_frames > 0: 271 | 272 | #src = mvf.Depth(clip, 5) 273 | gray = vstools.get_y(clip) 274 | 275 | gray_last = vs.core.std.BlankClip(gray)[0] + gray 276 | 277 | #make diff between frame and last frame, with prewitt (difference is white on black background) 278 | diff_clip = vs.core.std.MakeDiff(gray_last, gray) 279 | diff_clip = vs.core.std.Prewitt(diff_clip) 280 | 281 | diff_clip = diff_clip.std.PlaneStats() 282 | 283 | diff.append(diff_clip.get_frame(n).props["PlaneStatsAverage"]) 284 | 285 | return clip 286 | 287 | s_clip = clip.std.PlaneStats() 288 | 289 | eval_frames = vs.core.std.FrameEval(clip, partial(checkclip, clip=s_clip), prop_src=s_clip) 290 | 291 | #if group name is present, display only it and color it cyan. if group name isnt present, display file name and color it yellow. 292 | if file is not None and files is not None and files_info is not None: 293 | suffix = files_info[findex].get('suffix') 294 | 295 | if files_info[findex].get("suffix_color") == "yellow": 296 | message = f'Analyzing video: [yellow]{suffix.strip()}' 297 | 298 | elif files_info[findex].get("suffix_color") == "cyan": 299 | message = f"Analyzing video: [cyan]{suffix.strip()}" 300 | else: 301 | message = "Analyzing video" 302 | 303 | vstools.clip_async_render(eval_frames, progress=message) 304 | 305 | else: 306 | dark = dark_list 307 | light = light_list 308 | diff = motion_list 309 | 310 | #remove frames that are within diff_thr seconds of other frames. for dark and light, select random frames as well 311 | selected_frames = dedupe(clip, dark, dark_frames, diff_thr, selected_frames, seed) 312 | selected_frames = dedupe(clip, light, light_frames, diff_thr, selected_frames, seed) 313 | 314 | #find frames with most motion 315 | if motion_frames > 0: 316 | 317 | avg_diff = [] 318 | 319 | #get average difference over diff_radius frames in each direction 320 | #store frame number in avg_diff as well in the form [frame, avg_diff] 321 | for i, d in enumerate(diff): 322 | 323 | if i >= (diff_radius) and i < (clip.num_frames - diff_radius): 324 | if isinstance(d, float): 325 | surr_frames = diff[i-diff_radius:i+diff_radius+1] 326 | mean = sum(surr_frames) / len(surr_frames) 327 | avg_diff.append([i, mean]) 328 | 329 | #sort avg_diff list based on the diff values, not the frame numbers 330 | sorted_avg_diff = sorted(avg_diff, key=lambda x: x[1], reverse=True) 331 | 332 | for i in range(0, len(sorted_avg_diff)): 333 | motion.append(sorted_avg_diff[i][0]) 334 | 335 | #remove frames that are too close to other frames. uses lower diff_thr because high motion frames will be different from one another 336 | selected_frames = dedupe(clip, motion, motion_frames, round(diff_thr/4), selected_frames, seed, motion=True) 337 | 338 | print() 339 | 340 | if save_frames: 341 | dark_list = dark 342 | light_list = light 343 | motion_list = diff 344 | 345 | return selected_frames, dark_list, light_list, motion_list 346 | else: 347 | return selected_frames 348 | 349 | def _get_slowpics_header(content_length: str, content_type: str, sess: Session) -> Dict[str, str]: 350 | """ 351 | Stolen from vardefunc, fixed by Jimbo. 352 | """ 353 | 354 | return { 355 | "Accept": "*/*", 356 | "Accept-Encoding": "gzip, deflate", 357 | "Accept-Language": "en-US,en;q=0.9", 358 | "Access-Control-Allow-Origin": "*", 359 | "Content-Length": content_length, 360 | "Content-Type": content_type, 361 | "Origin": "https://slow.pics/", 362 | "Referer": "https://slow.pics/comparison", 363 | "User-Agent": "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/113.0.0.0 Safari/537.36", 364 | "X-XSRF-TOKEN": sess.cookies.get_dict()["XSRF-TOKEN"] 365 | } 366 | 367 | def get_highest_res(files: List[str]) -> int: 368 | """ 369 | Finds the video source with the highest resolution from a list of files. 370 | 371 | :param files: The list of files in question. 372 | 373 | :return: The width, height, and filename of the highest resolution video. 374 | """ 375 | 376 | height = 0 377 | width = 0 378 | filenum = -1 379 | for f in files: 380 | filenum+=1 381 | video = vs.core.lsmas.LWLibavSource(f) 382 | if height < video.height: 383 | height = video.height 384 | width = video.width 385 | max_res_file = filenum 386 | 387 | return width, height, max_res_file 388 | 389 | def estimate_analysis_time(file, read_len: int=15): 390 | """ 391 | Estimates the time it would take to analyze a video source. 392 | 393 | :param read_len: How many frames to read from the video. 394 | """ 395 | 396 | clip = vs.core.lsmas.LWLibavSource(file) 397 | 398 | #safeguard for if there arent enough frames in clip 399 | while clip.num_frames / 3 + 1 < read_len: 400 | read_len -= 1 401 | 402 | clip1 = clip[int(clip.num_frames / 3) : int(clip.num_frames / 3) + read_len] 403 | clip2 = clip[int(clip.num_frames * 2 / 3) : int(clip.num_frames * 2 / 3) + read_len] 404 | 405 | def checkclip(n, f, clip): 406 | avg = f.props["PlaneStatsAverage"] 407 | return clip 408 | 409 | start_time = time.time() 410 | vstools.clip_async_render(vs.core.std.FrameEval(clip1, partial(checkclip, clip=clip1.std.PlaneStats()), prop_src=clip1.std.PlaneStats())) 411 | elapsed_time = time.time() - start_time 412 | 413 | start_time = time.time() 414 | vstools.clip_async_render(vs.core.std.FrameEval(clip2, partial(checkclip, clip=clip2.std.PlaneStats()), prop_src=clip2.std.PlaneStats())) 415 | elapsed_time = (elapsed_time + time.time() - start_time)/2 416 | 417 | return elapsed_time 418 | 419 | def evaluate_analyze_clip(analyze_clip, files, files_info): 420 | """ 421 | Determines which file should be analyzed by lazylist. 422 | """ 423 | 424 | file_analysis_default = False 425 | 426 | #check if analyze_clip is an int or string with just an int in it 427 | if (isinstance(analyze_clip, int) and analyze_clip >= 0) or (isinstance(analyze_clip, str) and analyze_clip.isdigit() and int(analyze_clip) >= 0): 428 | first_file = files[int(analyze_clip)] 429 | 430 | #check if analyze_clip is a group or file name 431 | elif isinstance(analyze_clip, str) and analyze_clip != "": 432 | matches = 0 433 | for dict in files_info: 434 | if analyze_clip == dict.get("release_group") or analyze_clip == dict.get("file_name") or analyze_clip in dict.get("file_name"): 435 | matches+=1 436 | first_file = files[files_info.index(dict)] 437 | 438 | #if no matches found, use default 439 | if matches == 0: 440 | printwrap('No file matching the "analyze_clip" parameter has been found. Using default.') 441 | file_analysis_default = True 442 | if matches > 1: 443 | printwrap('Too many files match the "analyze_clip" parameter. Using default.') 444 | 445 | #if no clip specified, use default 446 | else: 447 | file_analysis_default = True 448 | 449 | #default: pick file with smallest read time 450 | if file_analysis_default: 451 | printwrap("Determining which file to analyze...\n") 452 | estimated_times = [estimate_analysis_time(file) for file in files] 453 | first_file = files[estimated_times.index(min(estimated_times))] 454 | 455 | return first_file 456 | 457 | def init_clip(file: str, files: list, trim_dict: dict, trim_dict_end: dict, change_fps: dict = {}, 458 | analyze_clip: str = None, files_info: list = None, return_file: bool = False): 459 | """ 460 | Gets trimmed and fps modified clip from video file. 461 | """ 462 | 463 | #evaluate analyze_clip if it hasn't been already 464 | if analyze_clip is not None and file is None and first_file is None: 465 | file = evaluate_analyze_clip(analyze_clip, files, files_info) 466 | 467 | findex = files.index(file) 468 | clip = vs.core.lsmas.LWLibavSource(file) 469 | 470 | if trim_dict.get(findex) is not None: 471 | 472 | if trim_dict.get(findex) > 0: 473 | clip = clip[trim_dict.get(findex):] 474 | 475 | elif trim_dict.get(findex) < 0: 476 | #append blank clip to beginning of source to "extend" it 477 | clip = vs.core.std.BlankClip(clip)[:(trim_dict.get(findex) * -1)] + clip 478 | #keep count of how many blank frames were appended 479 | extended = trim_dict.get(findex) * -1 480 | 481 | if trim_dict_end.get(findex) is not None: 482 | clip = clip[:trim_dict_end.get(findex)] 483 | 484 | if change_fps.get(findex) is not None: 485 | clip = vstools.change_fps(clip, fractions.Fraction(numerator=change_fps.get(findex)[0], denominator=change_fps.get(findex)[1])) 486 | 487 | if return_file: 488 | return clip, file 489 | else: 490 | return clip 491 | 492 | def get_suffixes(files_info: list, first_display: bool = False): 493 | """ 494 | Gets display name ('suffix') and its color for every file based on its release group and filename. 495 | 496 | :param files_info: List of dictionaries generated by anitopy for every file. 497 | :param first_display: Whether or not the suffixes are being generated for the program's initial display of found files. 498 | 499 | :return: List of dictionaries for every file with 'suffix' and 'suffix_color' updated. 500 | """ 501 | 502 | #if group name exists use it, otherwise use file name 503 | for i in range(0, len(files_info)): 504 | 505 | if files_info[i].get('release_group') is not None: 506 | files_info[i]['suffix'] = str(files_info[i].get('release_group')) 507 | files_info[i]['suffix_color'] = "cyan" 508 | 509 | else: 510 | files_info[i]['suffix'] = files_info[i].get('file_name') 511 | files_info[i]['suffix_color'] = "yellow" 512 | 513 | #check for duplicates 514 | for i in range(0, len(files_info)): 515 | matches = [i] 516 | 517 | for f in range(i + 1, len(files_info)): 518 | if files_info[i].get('suffix') == files_info[f].get('suffix'): 519 | matches.append(f) 520 | 521 | #if duplicates found, check whether they have version number in file name and put it in suffix 522 | if len(matches) > 1: 523 | for f in (matches): 524 | 525 | #don't want to rely on anitopy cause i don't know what regex it uses 526 | '''if files_info[f].get('release_version') != None: 527 | files_info[f]['suffix'] = files_info[f].get('suffix') + " " + files_info[f].get('release_version') 528 | files_info[f]['suffix_color'] = "cyan"''' 529 | 530 | for pos, letter in enumerate(files_info[f].get('file_name')): 531 | x = 0 532 | 533 | if letter.lower() == "v": 534 | while files_info[f].get('file_name')[pos+1:pos+x+2].isdigit() and pos+x+2 <= len(files_info[f].get('file_name')): 535 | x += 1 536 | 537 | #if they do, add " vXX" to suffix 538 | #also check that the match for "vXX" not in the file extension 539 | if x > 0 and files_info[f].get('file_name')[pos+1:pos+x+2] not in os.path.splitext(files_info[f].get('file_name'))[1]: 540 | files_info[f]['suffix'] = files_info[f].get('suffix') + " " + files_info[f].get('file_name')[pos:pos+x+1] 541 | files_info[f]['suffix_color'] = "cyan" 542 | break 543 | 544 | #check for duplicates again and just set filename this time 545 | for i in range(0, len(files_info)): 546 | matches = [i] 547 | 548 | for f in range(i + 1, len(files_info)): 549 | if files_info[i].get('suffix') == files_info[f].get('suffix'): 550 | matches.append(f) 551 | 552 | if len(matches) > 1: 553 | for f in (matches): 554 | files_info[f]['suffix'] = files_info[f].get('file_name') 555 | files_info[f]['suffix_color'] = "yellow" 556 | 557 | #if it's not the first display, only show file name up until there's a difference with another file name 558 | if not first_display: 559 | for i in range(0, len(files_info)): 560 | highest = 0 561 | highest_file = 0 562 | filename = files_info[i].get('file_name') 563 | 564 | if files_info[i].get('suffix') == filename: 565 | for f in range(0, len(files_info)): 566 | pos = 0 567 | 568 | if i == f: 569 | continue 570 | 571 | while files_info[i].get('file_name')[pos] == files_info[f].get('file_name')[pos]: 572 | pos += 1 573 | 574 | if pos > highest: 575 | highest = pos 576 | highest_file = f 577 | 578 | #progress bar should take up about half the screen, at least 2/5 of that will be used, max all of it 579 | #original: l_bound = 20, h_bound = 45 580 | consolesize = os.get_terminal_size().columns 581 | progress = min(round(consolesize / 2), 68) 582 | l_bound = round((consolesize - progress) * 2/5) 583 | h_bound = consolesize - progress 584 | 585 | #show whole filename if it fits within limit 586 | if len(filename) < (h_bound): 587 | pass 588 | 589 | #put "..." at the end if the different part appears within limit 590 | elif highest < h_bound-3: 591 | files_info[i]['suffix'] = filename[:h_bound-3].strip() + "..." 592 | 593 | #if section thats different starts less than "l_bound" chars away from end, put "..." in middle of name, with diff following it 594 | elif len(filename[highest+1:]) <= l_bound: 595 | files_info[i]['suffix'] = filename[:h_bound-3-len(filename[highest+1:])].strip() + "..." + filename[highest+1:].strip() 596 | 597 | #if section thats different starts more than "l_bound" chars away from end, put "..." then diff in parentheses 598 | else: 599 | 600 | for pos, letter in enumerate(filename): 601 | if pos >= len(files_info[highest_file].get('file_name')): 602 | break 603 | 604 | if letter != files_info[highest_file].get('file_name')[pos]: 605 | last_diff_pos = pos 606 | 607 | if last_diff_pos + 1 == len(files_info[highest_file].get('file_name')): 608 | diff = filename[highest:] 609 | else: 610 | diff = filename[highest:last_diff_pos+1] 611 | 612 | #if all of the diff fits 613 | if len(diff) < (h_bound-l_bound-6): 614 | files_info[i]['suffix'] = filename[:l_bound].strip() + "... (" + diff.strip() + ")" 615 | 616 | #if only some of the diff fits 617 | else: 618 | files_info[i]['suffix'] = filename[:l_bound].strip() + "... (" + diff[:h_bound-l_bound-6].strip() + ")" 619 | 620 | return files_info 621 | 622 | def str_to_number(string: str): 623 | """ 624 | Converts a string to a float or int if possible. 625 | """ 626 | 627 | try: 628 | float(string) 629 | try: 630 | int(string) 631 | return int(string) 632 | except: 633 | return float(string) 634 | except: 635 | return string 636 | 637 | def extend_clip(clip: vs.VideoNode, frames: list): 638 | """ 639 | If a clip is shorter than the largest frame that needs to be rendered, extend it. 640 | """ 641 | 642 | if clip.num_frames < frames[-1]: 643 | clip = clip + (vs.core.std.BlankClip(clip)[0] * (frames[-1] - clip.num_frames + 1)) 644 | 645 | return clip 646 | 647 | def printwrap(text: str, width: int=os.get_terminal_size().columns, end: str="\n", *args, **kwargs): 648 | """ 649 | Prints text with smart wrapping using textwrap.fill(). 650 | 651 | :param text: Text to wrap and display. 652 | :param width: Width of wrapping area, based on the terminal's size by default. 653 | :param end: Standard param passed on to print(). 654 | 655 | Also passes along extra args to textwrap.fill(). 656 | """ 657 | 658 | print(textwrap.fill(text, width, *args, **kwargs), end=end) 659 | 660 | 661 | 662 | def run_comparison(): 663 | #START_TIME = time.time() 664 | 665 | global first_file 666 | first_file = None 667 | #first file is only determined by analyze_clip if it is called 668 | 669 | supported_extensions = ('.mkv', '.m2ts', '.mp4', '.webm', '.ogm', '.mpg', '.vob', '.iso', '.ts', '.mts', '.mov', '.qv', '.yuv', 670 | '.flv', '.avi', '.rm', '.rmvb', '.m2v', '.m4v', '.mp2', '.mpeg', '.mpe', '.mpv', '.wmv', '.avc', '.hevc', 671 | '.264', '.265', '.av1') 672 | 673 | #find video files in the current directory, and exit if there are fewer than two 674 | files = [file for file in os.listdir('.') if file.lower().endswith(supported_extensions)] 675 | files = os_sorted(files) 676 | file_count = len(files) 677 | if file_count < 2: 678 | sys.exit("Error: Fewer than 2 video files found in directory.") 679 | 680 | #use anitopy library to get dictionary of show name, episode number, episode title, release group, etc 681 | files_info = [] 682 | for file in files: 683 | files_info.append(ani.parse(file)) 684 | 685 | anime_title = "" 686 | anime_episode_number = "" 687 | anime_episode_title = "" 688 | 689 | #get anime title, episode number, and episode title 690 | for dict in files_info: 691 | if dict.get('anime_title') is not None and anime_title == "": 692 | anime_title = dict.get('anime_title') 693 | 694 | if dict.get('episode_number') is not None and anime_episode_number == "": 695 | anime_episode_number = dict.get('episode_number') 696 | 697 | if dict.get('episode_title') is not None and anime_episode_title == "": 698 | anime_episode_title = dict.get('episode_title') 699 | 700 | #what to name slow.pics collection 701 | if anime_title != "" and anime_episode_number != "": 702 | collection_name = anime_title.strip() + " - " + anime_episode_number.strip() 703 | elif anime_title != "": 704 | collection_name = anime_title.strip() 705 | elif anime_episode_title != "": 706 | collection_name = anime_episode_title.strip() 707 | else: 708 | collection_name = files_info[0].get('file_name') 709 | collection_name = re.sub(r"\[.*?\]|\(.*?\}|\{.*?\}|\.[^.]+$", "", collection_name).strip() 710 | 711 | #if anime title still isn't found, give it collection name 712 | if anime_title == "": 713 | anime_title = collection_name 714 | 715 | #replace group or file names in trim_dict with file index 716 | for d in [trim_dict, trim_dict_end, change_fps]: 717 | for i in list(d): 718 | if isinstance(i, str): 719 | found = False 720 | 721 | for dict in files_info: 722 | if i == dict.get("release_group") or i == dict.get("file_name"): # or i in dict.get("file_name") 723 | d[files_info.index(dict)] = d[i] 724 | found = True 725 | 726 | if found: 727 | d.pop(i) 728 | 729 | #detects and sets up change_fps "set" feature 730 | if (list(change_fps.values())).count("set") > 0: 731 | if (list(change_fps.values())).count("set") > 1: 732 | sys.exit('Error: More than one change_fps file using "set".') 733 | 734 | #if "set" is found, get the index of its file, get its fps, and set every other unspecified file to that fps 735 | findex = list(change_fps.keys())[list(change_fps.values()).index("set")] 736 | del change_fps[findex] 737 | file = files[findex] 738 | temp_clip = vs.core.lsmas.LWLibavSource(file) 739 | fps = [temp_clip.fps_num, temp_clip.fps_den] 740 | 741 | for i in range(0, len(files)): 742 | if i not in change_fps: 743 | change_fps[i] = fps 744 | 745 | #if file is already set to certain fps, remove it from change_fps 746 | for findex, file in enumerate(files): 747 | temp_clip = init_clip(file, files, trim_dict, trim_dict_end) 748 | if change_fps.get(findex) is not None: 749 | if not isinstance(change_fps.get(findex), list): 750 | sys.exit("Error: change_fps parameter only accepts lists as input") 751 | if temp_clip.fps_num / temp_clip.fps_den == change_fps.get(findex)[0] / change_fps.get(findex)[1]: 752 | del change_fps[findex] 753 | 754 | #get display version of suffixes 755 | get_suffixes(files_info, first_display=True) 756 | 757 | #print list of files 758 | print('\nFiles found: ') 759 | for findex, file in enumerate(files): 760 | 761 | groupname = files_info[findex].get("suffix") 762 | 763 | if files_info[findex].get("release_group") != None: 764 | #if group name is found, highlight 765 | if groupname == files_info[findex].get("release_group"): 766 | filename = files_info[findex].get("file_name").split(groupname) 767 | filename = filename[0] + colorama.Fore.CYAN + groupname + colorama.Fore.YELLOW + filename[1] 768 | 769 | #if group name with version number is found, highlight both group and version 770 | elif (files_info[findex].get("release_group") + " v") in groupname: 771 | v = groupname.rindex("v") 772 | filename = files_info[findex].get("file_name").split(groupname[:v - 1]) 773 | filename = filename[0] + colorama.Fore.CYAN + groupname[:v - 1] + colorama.Fore.YELLOW + filename[1] 774 | filename = filename.split(groupname[v:]) 775 | filename = filename[0] + colorama.Fore.CYAN + groupname[v:] + colorama.Fore.YELLOW + filename[1] 776 | 777 | #if suffix is filename but group name found, still highlight 778 | elif files_info[findex].get("release_group") in groupname: 779 | filename = files_info[findex].get("file_name").split(files_info[findex].get("release_group")) 780 | filename = filename[0] + colorama.Fore.CYAN + files_info[findex].get("release_group") + colorama.Fore.YELLOW + filename[1] 781 | 782 | #if no group name is found, dont highlight 783 | else: 784 | filename = groupname 785 | 786 | #output filenames 787 | printwrap(colorama.Fore.YELLOW + " - " + filename + colorama.Style.RESET_ALL, subsequent_indent=" ") 788 | 789 | #output which files will be trimmed 790 | if trim_dict.get(findex) is not None: 791 | if trim_dict.get(findex) >= 0: 792 | printwrap(f" - Trimmed to start at frame {trim_dict.get(findex)}", subsequent_indent=" ") 793 | elif trim_dict.get(findex) < 0: 794 | printwrap(f" - {(trim_dict.get(findex) * -1)} frame(s) appended at start", subsequent_indent=" ") 795 | if trim_dict_end.get(findex) is not None: 796 | if trim_dict_end.get(findex) >= 0: 797 | printwrap(f" - Trimmed to end at frame {trim_dict_end.get(findex)}", subsequent_indent=" ") 798 | elif trim_dict_end.get(findex) < 0: 799 | printwrap(f" - Trimmed to end {trim_dict_end.get(findex) * -1} frame(s) early", subsequent_indent=" ") 800 | 801 | if change_fps.get(findex) is not None: 802 | printwrap(f" - FPS changed to {change_fps.get(findex)[0]}/{change_fps.get(findex)[1]}", subsequent_indent=" ") 803 | 804 | print() 805 | 806 | #get version of suffixes that will be used in the rest of the file 807 | get_suffixes(files_info, first_display=False) 808 | 809 | #check if conflicting options are enabled 810 | if (upscale and single_res > 0): 811 | sys.exit("Error: Can't use 'upscale' and 'single_res' functions at the same time.") 812 | 813 | 814 | 815 | frames = [] 816 | 817 | #add user specified frames to list 818 | frames.extend(user_frames) 819 | 820 | #if save_frames is enabled, store generated brightness data in a text file, so they don't have to be analyzed again 821 | if save_frames and (frame_count_dark + frame_count_bright + frame_count_motion) > 0: 822 | mismatch = False 823 | #if frame file exists, read from it 824 | if os.path.exists(frame_filename) and os.stat(frame_filename).st_size > 0: 825 | 826 | printwrap(f'Reading data from "{frame_filename}"...') 827 | with open(frame_filename) as frame_file: 828 | generated_frames = frame_file.readlines() 829 | 830 | #turn numbers into floats or ints, and get rid of newlines 831 | for i, v in enumerate(generated_frames): 832 | v = v.strip() 833 | generated_frames[i] = str_to_number(v) 834 | 835 | dark_list = generated_frames[generated_frames.index("dark:")+1:generated_frames.index("bright:")] 836 | light_list = generated_frames[generated_frames.index("bright:")+1:generated_frames.index("motion:")] 837 | motion_list = generated_frames[generated_frames.index("motion:")+1:] 838 | 839 | analyzed_file = generated_frames[generated_frames.index("analyzed_file:") + 1] 840 | analyzed_group = ani.parse(analyzed_file).get("release_group") 841 | file_trim = generated_frames[generated_frames.index("analyzed_file_trim:") + 1] 842 | file_trim_end = generated_frames[generated_frames.index("analyzed_file_trim:") + 2] 843 | file_fps_num = generated_frames[generated_frames.index("analyzed_file_fps:") + 1] 844 | file_fps_den = generated_frames[generated_frames.index("analyzed_file_fps:") + 2] 845 | 846 | #check if a file with the same group name as the analyzed file is present in our current directory 847 | group_found = False 848 | for i, dict in enumerate(files_info): 849 | if dict.get("release_group") is not None: 850 | if dict.get("release_group").lower() == analyzed_group.lower(): 851 | group_found = True 852 | group_file_index = files.index(dict.get("file_name")) 853 | 854 | #if file wasn't found but group name was, set file with the same group name 855 | if analyzed_file not in files and group_found is True: 856 | analyzed_file = files[group_file_index] 857 | 858 | #check if show name, episode number, or the release which was analyzed has changed 859 | if (generated_frames[generated_frames.index("show_name:") + 1] != anime_title 860 | or generated_frames[generated_frames.index("episode_num:") + 1] != int(anime_episode_number) 861 | or analyzed_file not in files): 862 | 863 | mismatch = True 864 | 865 | #check if trim for analyzed file has changed 866 | if mismatch == False: 867 | found_trim = 0 868 | found_trim_end = 0 869 | if files.index(analyzed_file) in trim_dict: 870 | found_trim = trim_dict.get(files.index(analyzed_file)) 871 | if files.index(analyzed_file) in trim_dict_end: 872 | found_trim_end = trim_dict_end.get(files.index(analyzed_file)) 873 | 874 | if (file_trim != found_trim 875 | or file_trim_end != found_trim_end): 876 | mismatch = True 877 | 878 | #check if fps of analyzed file has changed 879 | if mismatch == False: 880 | temp_clip = init_clip(analyzed_file, files, trim_dict, trim_dict_end, change_fps) 881 | if file_fps_num / file_fps_den != temp_clip.fps_num / temp_clip.fps_den: 882 | mismatch = True 883 | 884 | 885 | #if mismatch is detected, re-analyze frames 886 | if mismatch: 887 | printwrap("\nParameters have changed. Will re-analyze brightness data.\n") 888 | os.remove(frame_filename) 889 | 890 | #only spend time processing lazylist if we need to 891 | elif (frame_count_dark + frame_count_bright + frame_count_motion) > 0: 892 | clip = init_clip(files[0], files, trim_dict, trim_dict_end, change_fps, analyze_clip, files_info) 893 | frames.extend(lazylist(clip, frame_count_dark, frame_count_bright, frame_count_motion, frames, dark_list=dark_list, light_list=light_list, motion_list=motion_list, file=files[0], files=files, files_info=files_info)) 894 | 895 | #if frame file does not exist or has less frames than specified, write to it 896 | if not os.path.exists(frame_filename) or os.stat(frame_filename).st_size == 0 or mismatch: 897 | 898 | #if this is the first time first_file is being called, it will be evaluated. if not, it will already be known, since it's a global variable 899 | first, first_file = init_clip(first_file, files, trim_dict, trim_dict_end, change_fps, analyze_clip, files_info, return_file=True) 900 | 901 | #get the trim 902 | first_trim = 0 903 | first_trim_end = 0 904 | if files.index(first_file) in trim_dict: 905 | first_trim = trim_dict[files.index(first_file)] 906 | if files.index(first_file) in trim_dict_end: 907 | first_trim_end = trim_dict_end[files.index(first_file)] 908 | 909 | 910 | frames_temp, dark_list, light_list, motion_list = lazylist(first, frame_count_dark, frame_count_bright, frame_count_motion, frames, save_frames=True, file=first_file, files=files, files_info=files_info) 911 | frames.extend(frames_temp) 912 | 913 | with open(frame_filename, 'w') as frame_file: 914 | 915 | frame_file.write(f"show_name:\n{anime_title}\nepisode_num:\n{anime_episode_number}\nanalyzed_file:\n{first_file}\nanalyzed_file_trim:\n{first_trim}\n{first_trim_end}\nanalyzed_file_fps:\n{first.fps_num}\n{first.fps_den}\ndark:\n") 916 | for val in dark_list: 917 | frame_file.write(f"{val}\n") 918 | 919 | frame_file.write("bright:\n") 920 | for val in light_list: 921 | frame_file.write(f"{val}\n") 922 | 923 | frame_file.write("motion:\n") 924 | for val in motion_list: 925 | frame_file.write(f"{val}\n") 926 | 927 | #if save_frames isn't enabled, run lazylist 928 | elif (frame_count_dark + frame_count_bright + frame_count_motion) > 0: 929 | first, first_file = init_clip(first_file, files, trim_dict, trim_dict_end, change_fps, analyze_clip, files_info, return_file=True) 930 | frames.extend(lazylist(first, frame_count_dark, frame_count_bright, frame_count_motion, frames, file=first_file, files=files, files_info=files_info)) 931 | 932 | if random_frames > 0: 933 | 934 | print("Getting random frames...\n") 935 | 936 | #get list of all frames in clip 937 | frame_ranges = list(range(0, init_clip(files[0], files, trim_dict, trim_dict_end, change_fps).num_frames)) 938 | 939 | #randomly selects frames at least screen_separation seconds apart 940 | frame_ranges = dedupe(init_clip(files[0], files, trim_dict, trim_dict_end, change_fps), frame_ranges, random_frames, screen_separation, frames) 941 | 942 | frames.extend(frame_ranges) 943 | 944 | #remove dupes and sort 945 | frames = [*set(frames)] 946 | frames.sort() 947 | 948 | #if no frames selected, terminate program 949 | if len(frames) == 0: 950 | sys.exit("Error: No frames have been selected, unable to proceed.") 951 | 952 | #print comma separated list of which frames have been selected 953 | print(f"Selected {len(frames)} frames:") 954 | first = True 955 | message = "" 956 | for f in frames: 957 | if not first: 958 | message+=", " 959 | first = False 960 | message+=str(f) 961 | 962 | printwrap(message, end="\n\n") 963 | 964 | 965 | 966 | if upscale: 967 | max_width, max_height, max_res_file = get_highest_res(files) 968 | 969 | #create screenshot directory, if one already exists delete it first 970 | screen_dir = pathlib.Path("./" + screen_dirname + "/") 971 | if os.path.isdir(screen_dir): 972 | shutil.rmtree(screen_dir) 973 | os.mkdir(screen_dir) 974 | 975 | #check if ffmpeg is available. if not, run script with ffmpeg disabled 976 | global ffmpeg 977 | if ffmpeg: 978 | try: 979 | subprocess.run(["ffmpeg", "-version"], check=True, stdout=subprocess.DEVNULL, stderr=subprocess.DEVNULL) 980 | except: 981 | ffmpeg = False 982 | printwrap("FFmpeg was not found. Continuing to generate screens without it.") 983 | 984 | print("Generating screenshots:") 985 | #initialize progress bar, specify information to be output 986 | #would use expand=True but the lazylist progress bar doesn't so i'd rather go for consistency 987 | with Progress(TextColumn("{task.description}"), BarColumn(), TextColumn("{task.completed}/{task.total}"), TextColumn("{task.percentage:>3.02f}%"), TimeRemainingColumn()) as progress: 988 | 989 | total_gen_progress = progress.add_task("[green]Total", total=len(frames) * len(files)) 990 | file_gen_progress = progress.add_task("", total=len(frames), visible=0) 991 | 992 | for file in files: 993 | findex = files.index(file) 994 | 995 | clip = init_clip(file, files, trim_dict, trim_dict_end, change_fps) 996 | 997 | #extend clip if a frame is out of range 998 | clip = extend_clip(clip, frames) 999 | 1000 | #get release group or filename of file 1001 | suffix = files_info[findex].get('suffix') 1002 | #remove any characters not suited for filepath 1003 | suffix = suffix.replace("[\\/:\"*?<>|]+", "").strip() 1004 | 1005 | if files_info[findex].get("suffix_color") == "yellow": 1006 | message = f'[yellow]{suffix}' 1007 | 1008 | elif files_info[findex].get("suffix_color") == "cyan": 1009 | message = f'[cyan]{suffix}' 1010 | 1011 | else: 1012 | message = suffix 1013 | 1014 | progress.reset(file_gen_progress, description=message, visible=1) 1015 | 1016 | #get matrix of clip, account for black clips added to the beginning due to negative trim 1017 | if trim_dict.get(findex) is not None and trim_dict.get(findex) < 0: 1018 | matrix = clip.get_frame(trim_dict.get(findex) * -1).props._Matrix 1019 | else: 1020 | matrix = clip.get_frame(0).props._Matrix 1021 | 1022 | #if matrix is unspecified, change it to 709 1023 | if matrix == 2: 1024 | matrix = 1 1025 | 1026 | #upscale depending on options selected. if none are, just convert to rgb 1027 | if single_res > 0 and clip.height != single_res: 1028 | clip = clip.resize.Lanczos(int(round(clip.width * (single_res / clip.height), 0)), single_res, filter_param_a=3, format=vs.RGB24, matrix_in=matrix, dither_type="error_diffusion") 1029 | elif upscale and clip.height != max_height: 1030 | clip = clip.resize.Lanczos(int(round(clip.width * (max_height / clip.height), 0)), max_height, filter_param_a=3, format=vs.RGB24, matrix_in=matrix, dither_type="error_diffusion") 1031 | else: 1032 | clip = clip.resize.Lanczos(filter_param_a=3, format=vs.RGB24, matrix_in=matrix, dither_type="error_diffusion") 1033 | 1034 | #if frame_info option selected, print frame info to screen 1035 | if frame_info: 1036 | clip = FrameInfo(clip, title=suffix) 1037 | 1038 | #generate screens 1039 | for i, frame in enumerate(frames): 1040 | 1041 | filename = f"{screen_dir}/{frame} - {suffix}.png" 1042 | 1043 | if ffmpeg: 1044 | ffmpeg_line = f"ffmpeg -y -hide_banner -loglevel error -f rawvideo -video_size {clip.width}x{clip.height} -pixel_format gbrp -framerate {str(clip.fps)} -i pipe: -pred mixed -compression_level {compression} \"{filename}\"" 1045 | try: 1046 | with subprocess.Popen(ffmpeg_line, stdin=subprocess.PIPE) as process: 1047 | #ffmpeg needs these planes to be shuffled so they are in gbrp pixel_format (the p is important, rgb24 format doesnt work) 1048 | clip[frame].std.ShufflePlanes([1, 2, 0], vs.RGB).output(cast(BinaryIO, process.stdin), y4m=False) 1049 | except: 1050 | None 1051 | 1052 | else: 1053 | vs.core.fpng.Write(clip, filename, compression=compression, overwrite=True).get_frame(frame) 1054 | 1055 | progress.update(total_gen_progress, advance=1) 1056 | progress.update(file_gen_progress, advance=1) 1057 | 1058 | print() 1059 | #print(time.time() - START_TIME) 1060 | 1061 | if slowpics: 1062 | #time.sleep(0.5) 1063 | 1064 | browserId = str(uuid.uuid4()) 1065 | fields: Dict[str, Any] = { 1066 | 'collectionName': collection_name, 1067 | 'hentai': str(hentai_flag).lower(), 1068 | 'optimize-images': 'true', 1069 | 'browserId': browserId, 1070 | 'public': str(public_flag).lower() 1071 | } 1072 | 1073 | if tmdbID != "": 1074 | fields |= {'tmdbId': str(tmdbID)} 1075 | if remove_after != "" and remove_after != 0: 1076 | fields |= {'removeAfter': str(remove_after)} 1077 | 1078 | all_image_files = os_sorted([f for f in os.listdir(screen_dir) if f.endswith('.png')]) 1079 | 1080 | #check if all image files are present before uploading. if not, wait a bit and check again. if still not, exit program 1081 | if len(all_image_files) < len(frames) * len(files): 1082 | time.sleep(5) 1083 | all_image_files = os_sorted([f for f in os.listdir(screen_dir) if f.endswith('.png')]) 1084 | 1085 | if len(all_image_files) < len(frames) * len(files): 1086 | sys.exit(f'Error: Number of screenshots in "{screen_dirname}" folder does not match expected value.') 1087 | 1088 | for x in range(0, len(frames)): 1089 | #current_comp is list of image files for this frame 1090 | current_comp = [f for f in all_image_files if f.startswith(str(frames[x]) + " - ")] 1091 | 1092 | #add field for comparison name. after every comparison name there needs to be as many image names as there are comped video files 1093 | fields[f'comparisons[{x}].name'] = str(frames[x]) 1094 | 1095 | #iterate over the image files for this frame 1096 | for imageName in current_comp: 1097 | i = current_comp.index(imageName) 1098 | image = pathlib.Path(f"{screen_dir}/{imageName}") 1099 | fields[f'comparisons[{x}].imageNames[{i}]'] = os.path.basename(image.name).split(' - ', 1)[1].replace(".png", "") 1100 | 1101 | #this would upload the images all at once, but that wouldnt let us get progress 1102 | #fields[f'comparisons[{x}].images[{i}].file'] = (image.name.split(' - ', 1)[1].replace(".png", ""), image.read_bytes(), 'image/png') 1103 | 1104 | with Session() as sess: 1105 | sess.get('https://slow.pics/comparison') 1106 | 1107 | files = MultipartEncoder(fields, str(uuid.uuid4())) 1108 | 1109 | comp_req = sess.post( 1110 | 'https://slow.pics/upload/comparison', data=files.to_string(), 1111 | headers=_get_slowpics_header(str(files.len), files.content_type, sess) 1112 | ) 1113 | 1114 | comp_response = comp_req.json() 1115 | 1116 | collection = comp_response["collectionUuid"] 1117 | key = comp_response["key"] 1118 | 1119 | with Progress(TextColumn("{task.description}"), BarColumn(), TextColumn("{task.completed}/{task.total}"), TextColumn("{task.percentage:>3.02f}%"), TimeRemainingColumn()) as progress: 1120 | upload_progress = progress.add_task("[bright_magenta]Uploading to Slowpoke Pics", total=len(all_image_files)) 1121 | 1122 | for index, image_section in enumerate(comp_response["images"]): 1123 | base = index * file_count 1124 | for image_index, image_id in enumerate(image_section): 1125 | 1126 | upload_info = { 1127 | "collectionUuid": collection, 1128 | "imageUuid": image_id, 1129 | "file": (all_image_files[base + image_index], pathlib.Path(f"{screen_dir}/{all_image_files[base + image_index]}").read_bytes(), 'image/png'), 1130 | 'browserId': browserId, 1131 | } 1132 | upload_info = MultipartEncoder(upload_info, str(uuid.uuid4())) 1133 | upload_response = sess.post( 1134 | 'https://slow.pics/upload/image', data=upload_info.to_string(), 1135 | headers=_get_slowpics_header(str(upload_info.len), upload_info.content_type, sess) 1136 | ) 1137 | 1138 | progress.update(upload_progress, advance=1) 1139 | 1140 | assert upload_response.status_code == 200, "Status code not 200" 1141 | assert upload_response.content.decode() == "OK", "Content not OK" 1142 | 1143 | slowpics_url = f'https://slow.pics/c/{key}' 1144 | print(f'\nSlowpoke Pics url: {slowpics_url}', end='') 1145 | pc.copy(slowpics_url) 1146 | 1147 | if browser_open: 1148 | webbrowser.open(slowpics_url) 1149 | 1150 | if webhook_url: 1151 | data = {"content": slowpics_url} 1152 | if requests.post(webhook_url, data).status_code < 300: 1153 | print('Posted to webhook.') 1154 | else: 1155 | print('Failed to post on webhook!') 1156 | 1157 | if url_shortcut: 1158 | #datetime.datetime.now().strftime("%Y.%m.%d") + " - " + 1159 | shortcut_path = os.path.join("Comparisons", collection_name + " - " + key + ".url") 1160 | 1161 | if not os.path.exists(os.path.dirname(shortcut_path)): 1162 | os.mkdir(os.path.dirname(shortcut_path)) 1163 | 1164 | with open(shortcut_path, "w", encoding='utf-8') as shortcut: 1165 | shortcut.write(f'[InternetShortcut]\nURL={slowpics_url}') 1166 | 1167 | if delete_screen_dir and os.path.isdir(screen_dir): 1168 | shutil.rmtree(screen_dir) 1169 | 1170 | time.sleep(3) 1171 | 1172 | run_comparison() 1173 | --------------------------------------------------------------------------------