├── .gitignore ├── Cargo.toml ├── LICENSE ├── out ├── mandel_1920x1680-0.7_s4-2.png ├── mandelbrot_1920x1680-0.7_s1-2.png ├── mandelbrot_1920x1680-0.7_s1024-2.png ├── mandelbrot_1920x1680-0.7_s4-2.png ├── mandelbrot_1920x1680-0.7_s64-2.png └── mandelbrot_1920x1680-0.7_s8-2.png ├── readme.md └── src ├── color.rs ├── lib.rs ├── main.rs └── renderer.rs /.gitignore: -------------------------------------------------------------------------------- 1 | target/ 2 | Cargo.lock 3 | binaries/ 4 | prep.sh -------------------------------------------------------------------------------- /Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "fracgen" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | clap = { version = "3.1.2", features = ["derive"] } 10 | err-derive = "0.3.1" 11 | image = "0.24.1" 12 | linya = "0.2.2" 13 | num = "0.4.0" 14 | num_cpus = "1.13.1" 15 | rand = "0.8.5" 16 | rayon = "1.5.1" 17 | 18 | [profile.release] 19 | opt-level = 3 # fast and small wasm 20 | lto = "fat" 21 | codegen-units = 1 -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /out/mandel_1920x1680-0.7_s4-2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ahhhh6980/fracgen/f6b0bf316667c9240f5aff008f3ccfaa617256ba/out/mandel_1920x1680-0.7_s4-2.png -------------------------------------------------------------------------------- /out/mandelbrot_1920x1680-0.7_s1-2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ahhhh6980/fracgen/f6b0bf316667c9240f5aff008f3ccfaa617256ba/out/mandelbrot_1920x1680-0.7_s1-2.png -------------------------------------------------------------------------------- /out/mandelbrot_1920x1680-0.7_s1024-2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ahhhh6980/fracgen/f6b0bf316667c9240f5aff008f3ccfaa617256ba/out/mandelbrot_1920x1680-0.7_s1024-2.png -------------------------------------------------------------------------------- /out/mandelbrot_1920x1680-0.7_s4-2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ahhhh6980/fracgen/f6b0bf316667c9240f5aff008f3ccfaa617256ba/out/mandelbrot_1920x1680-0.7_s4-2.png -------------------------------------------------------------------------------- /out/mandelbrot_1920x1680-0.7_s64-2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ahhhh6980/fracgen/f6b0bf316667c9240f5aff008f3ccfaa617256ba/out/mandelbrot_1920x1680-0.7_s64-2.png -------------------------------------------------------------------------------- /out/mandelbrot_1920x1680-0.7_s8-2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ahhhh6980/fracgen/f6b0bf316667c9240f5aff008f3ccfaa617256ba/out/mandelbrot_1920x1680-0.7_s8-2.png -------------------------------------------------------------------------------- /readme.md: -------------------------------------------------------------------------------- 1 | # fracgen 2 | 3 | ## Cpu fractal rendering run from the command prompt! 4 | 5 | Currently only supports the mandelbrot set, but formula specification will be the next update. 6 | 7 | ![](out/mandelbrot_1920x1680-0.7_s1024-2.png) 8 | 9 | ## To compile 10 | `cargo build --release` 11 | 12 | ## To use 13 | `./fracgen --w 1920 --h 1680 --name mandelbrot --threads 4 --zoom 0.7 --limit 256.0 --bail 4.0` 14 | 15 | ## Commands 16 | filename: `--name str` 17 | * example: `--name mandelbrot` 18 | * example: `-n mandelbrot` 19 | 20 | threads: `--threads x` 21 | * example: `--threads 4` 22 | * example: `-t 4` 23 | 24 | width: `--w x` 25 | * example: `--w 1920` 26 | 27 | height: `--h x` 28 | * example: `--h 1680` 29 | 30 | origin: `--origin x,y` 31 | * example: `--origin -0.75,0.0` 32 | * example: `-o -0.75,0.0` 33 | 34 | set coloring: `--set_color r,g,b,a` 35 | * example: `--set_color 0,0,0,255` 36 | 37 | zoom: `--zoom x` 38 | * example: `--zoom 0.7` 39 | * example: `-z 0.7` 40 | 41 | samples: `--samples x` 42 | * example: `--samples 4` 43 | 44 | sample distance: `--sample_d x` 45 | * example: `--sample_d 2.0` 46 | 47 | iteration limit: `--limit x` 48 | * example: `--limit 256.0` 49 | * example: `-l 256.0` 50 | 51 | iter bailout: `--bail x` 52 | * example: `--bail 4.0` 53 | * example: `-b 4.0` 54 | 55 | color exponent: `--c_exp x` 56 | * example: `--c_exp 1.0` 57 | 58 | -------------------------------------------------------------------------------- /src/color.rs: -------------------------------------------------------------------------------- 1 | // fracgen 2 | // Color type 3 | // (C) 2022 by Jacob (ahhhh6980@gmail.com) 4 | 5 | // This program is free software: you can redistribute it and/or modify 6 | // it under the terms of the GNU General Public License as published by 7 | // the Free Software Foundation, either version 3 of the License, or 8 | // (at your option) any later version. 9 | 10 | // This program is distributed in the hope that it will be useful, 11 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | // GNU General Public License for more details. 14 | 15 | // You should have received a copy of the GNU General Public License 16 | // along with this program. If not, see . 17 | 18 | use std::{num::ParseIntError, str::FromStr}; 19 | 20 | #[derive(Clone, Copy, Debug, PartialEq, Eq)] 21 | pub enum ColorType { 22 | Rgba, 23 | SRgba, 24 | Hsva, 25 | } 26 | 27 | #[allow(non_snake_case)] 28 | #[derive(Clone, Copy, Debug)] 29 | pub struct Color { 30 | pub ch: [f64; 4], 31 | pub mode: ColorType, 32 | } 33 | 34 | #[allow(non_snake_case, dead_code)] 35 | impl Color { 36 | pub fn new(ch: [f64; 4], mode: ColorType) -> Color { 37 | Color { ch, mode } 38 | } 39 | 40 | pub fn to(self, ctype: ColorType) -> Color { 41 | let mut out = self; 42 | if self.mode != ctype { 43 | match ctype { 44 | ColorType::Hsva => match self.mode { 45 | ColorType::Rgba => out = self.to_Hsva(), 46 | ColorType::SRgba => out = self.to_Rgba().to_Hsva(), 47 | _ => out = self, 48 | }, 49 | ColorType::Rgba => match self.mode { 50 | ColorType::SRgba => out = self.to_Rgba(), 51 | ColorType::Hsva => out = self.to_Rgba(), 52 | _ => out = self, 53 | }, 54 | ColorType::SRgba => match self.mode { 55 | ColorType::Rgba => out = self.to_sRgba(), 56 | ColorType::Hsva => out = self.to_Rgba().to_sRgba(), 57 | _ => out = self, 58 | }, 59 | } 60 | } 61 | out 62 | } 63 | 64 | fn sRGB(value: f64, inverse: bool) -> f64 { 65 | if inverse { 66 | if value <= 0.04045 { 67 | (25.0 * value) / 323.0 68 | } else { 69 | (((200.0 * value) + 11.0) / 211.0).powf(12.0 / 5.0) 70 | } 71 | } else if value <= 0.0031308 { 72 | (323.0 * value) / 25.0 73 | } else { 74 | (211.0 * value.powf(5.0 / 12.0) - 11.0) / 200.0 75 | } 76 | } 77 | 78 | pub fn f_hsv(h: f64, s: f64, v: f64, n: f64) -> f64 { 79 | let k = (n + (h / 60.0)) % 6.0; 80 | v - (v * s * (0.0f64).max((k).min((4.0 - k).min(1.0)))) 81 | } 82 | pub fn from_hsv(h: f64, s: f64, v: f64, a: f64) -> Color { 83 | let h = h % 360.0; 84 | Color { 85 | ch: [ 86 | Color::f_hsv(h, s, v, 5.0), 87 | Color::f_hsv(h, s, v, 3.0), 88 | Color::f_hsv(h, s, v, 1.0), 89 | a, 90 | ], 91 | mode: ColorType::Rgba, 92 | } 93 | } 94 | 95 | pub fn to_Hsva(&self) -> Color { 96 | let v = self.ch[0].max(self.ch[1]).max(self.ch[2]); 97 | let min = self.ch[0].min(self.ch[1]).min(self.ch[2]); 98 | let c = v - min; 99 | // let l = v - (c / 2.0); 100 | let mut h = 0.0; 101 | let (r, g, b) = (self.ch[0], self.ch[1], self.ch[2]); 102 | if c != 0.0 { 103 | h = 60.0; 104 | if v == r { 105 | h *= 0.0 + ((g - b) / c); 106 | } 107 | if v == g { 108 | h *= 2.0 + ((b - r) / c); 109 | } 110 | if v == b { 111 | h *= 4.0 + ((r - g) / c); 112 | } 113 | } 114 | let mut s = 0.0; 115 | if v != 0.0 { 116 | s = c / v; 117 | } 118 | Color { 119 | ch: [h, s, v, self.ch[3]], 120 | mode: ColorType::Hsva, 121 | } 122 | } 123 | 124 | pub fn to_sRgba(&self) -> Color { 125 | Color { 126 | ch: self.ch.map(|v| Color::sRGB(v, false)), 127 | mode: ColorType::SRgba, 128 | } 129 | } 130 | pub fn to_Rgba(&self) -> Color { 131 | if self.mode == ColorType::Hsva { 132 | Color { 133 | ch: [ 134 | Color::f_hsv(self.ch[0], self.ch[1], self.ch[2], 5.0), 135 | Color::f_hsv(self.ch[0], self.ch[1], self.ch[2], 3.0), 136 | Color::f_hsv(self.ch[0], self.ch[1], self.ch[2], 1.0), 137 | self.ch[3], 138 | ], 139 | mode: ColorType::Rgba, 140 | } 141 | } else { 142 | Color { 143 | ch: self.ch.map(|v| Color::sRGB(v, true)), 144 | mode: ColorType::Rgba, 145 | } 146 | } 147 | } 148 | pub fn to_arr(&self) -> [f64; 4] { 149 | self.ch 150 | } 151 | pub fn to_arr16(&self) -> [u16; 4] { 152 | self.ch.map(|x| (x * u16::MAX as f64) as u16) 153 | } 154 | pub fn to_arr8(&self) -> [u8; 4] { 155 | self.ch.map(|x| (x * u8::MAX as f64) as u8) 156 | } 157 | } 158 | 159 | impl FromStr for Color { 160 | type Err = ParseIntError; 161 | fn from_str(string: &str) -> Result { 162 | let cols: Vec = string 163 | .split(',') 164 | .map(|x| x.parse::().unwrap()) 165 | .collect(); 166 | let cols: [f64; 4] = cols.try_into().unwrap(); 167 | Ok(Color { 168 | ch: cols.map(|x| x / 255.0), 169 | mode: ColorType::Rgba, 170 | }) 171 | } 172 | } 173 | // mode: ColorType::Rgba 174 | // Color operators 175 | impl std::ops::Add for Color { 176 | type Output = Color; 177 | fn add(self, mut _rhs: Color) -> Color { 178 | _rhs = _rhs.to(self.mode); 179 | let cols: Vec = self 180 | .ch 181 | .iter() 182 | .enumerate() 183 | .map(|(i, v)| v + _rhs.ch[i]) 184 | .collect(); 185 | Color { 186 | ch: cols.try_into().unwrap(), 187 | mode: self.mode, 188 | } 189 | } 190 | } 191 | impl std::ops::Sub for Color { 192 | type Output = Color; 193 | fn sub(self, mut _rhs: Color) -> Color { 194 | _rhs = _rhs.to(self.mode); 195 | let cols: Vec = self 196 | .ch 197 | .iter() 198 | .enumerate() 199 | .map(|(i, v)| v - _rhs.ch[i]) 200 | .collect(); 201 | Color { 202 | ch: cols.try_into().unwrap(), 203 | mode: self.mode, 204 | } 205 | } 206 | } 207 | impl std::ops::Mul for Color { 208 | type Output = Color; 209 | fn mul(self, mut _rhs: Color) -> Color { 210 | _rhs = _rhs.to(self.mode); 211 | let cols: Vec = self 212 | .ch 213 | .iter() 214 | .enumerate() 215 | .map(|(i, v)| v * _rhs.ch[i]) 216 | .collect(); 217 | Color { 218 | ch: cols.try_into().unwrap(), 219 | mode: self.mode, 220 | } 221 | } 222 | } 223 | 224 | // f64 operators 225 | impl std::ops::Add for Color { 226 | type Output = Color; 227 | fn add(self, _rhs: f64) -> Color { 228 | let cols: Vec = self.ch.iter().map(|v| v + _rhs).collect(); 229 | Color { 230 | ch: cols.try_into().unwrap(), 231 | mode: self.mode, 232 | } 233 | } 234 | } 235 | impl std::ops::Sub for Color { 236 | type Output = Color; 237 | fn sub(self, _rhs: f64) -> Color { 238 | let cols: Vec = self.ch.iter().map(|v| v - _rhs).collect(); 239 | Color { 240 | ch: cols.try_into().unwrap(), 241 | mode: self.mode, 242 | } 243 | } 244 | } 245 | impl std::ops::Mul for Color { 246 | type Output = Color; 247 | fn mul(self, _rhs: f64) -> Color { 248 | let cols: Vec = self.ch.iter().map(|v| v * _rhs).collect(); 249 | Color { 250 | ch: cols.try_into().unwrap(), 251 | mode: self.mode, 252 | } 253 | } 254 | } 255 | impl std::ops::Div for Color { 256 | type Output = Color; 257 | fn div(self, _rhs: f64) -> Color { 258 | let cols: Vec = self.ch.iter().map(|v| v / _rhs).collect(); 259 | Color { 260 | ch: cols.try_into().unwrap(), 261 | mode: self.mode, 262 | } 263 | } 264 | } 265 | -------------------------------------------------------------------------------- /src/lib.rs: -------------------------------------------------------------------------------- 1 | mod color; 2 | mod renderer; 3 | pub use color::{Color, ColorType}; 4 | pub use renderer::{Args, Functions, Functs, Renderer}; 5 | -------------------------------------------------------------------------------- /src/main.rs: -------------------------------------------------------------------------------- 1 | // fracgen 2 | // Main 3 | // (C) 2022 by Jacob (ahhhh6980@gmail.com) 4 | 5 | // This program is free software: you can redistribute it and/or modify 6 | // it under the terms of the GNU General Public License as published by 7 | // the Free Software Foundation, either version 3 of the License, or 8 | // (at your option) any later version. 9 | 10 | // This program is distributed in the hope that it will be useful, 11 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | // GNU General Public License for more details. 14 | 15 | // You should have received a copy of the GNU General Public License 16 | // along with this program. If not, see . 17 | 18 | use clap::Parser; 19 | use fracgen::{Args, Functions, Functs, Renderer}; 20 | use num::Complex; 21 | use std::{path, time::Instant}; 22 | type Cf64 = Complex; 23 | fn main() { 24 | let args = Args::parse(); 25 | let name = format!( 26 | "out{}{}_{}x{}-{}_s{}-{}-f{}-c{}-d{}.png", 27 | path::MAIN_SEPARATOR, 28 | args.name, 29 | args.width, 30 | args.height, 31 | args.zoom, 32 | args.samples, 33 | args.sampled, 34 | args.fractal_mode, 35 | args.color_mode, 36 | args.bail_mode, 37 | ); 38 | println!("Now processing {} with {} threads...", name, args.threads); 39 | rayon::ThreadPoolBuilder::new() 40 | .num_threads(args.threads) 41 | .build_global() 42 | .unwrap(); 43 | let now = Instant::now(); 44 | let mut mandelbrot = Renderer::new( 45 | args.clone(), 46 | Functs::new( 47 | match args.fractal_mode { 48 | 0 => match args.is_julia { 49 | true => |z, _, j| z * z + j, 50 | false => |z, c, _| z * z + c, 51 | }, 52 | 1 => match args.is_julia { 53 | true => |z, _, j| { 54 | Cf64::new(z.re.abs(), z.im.abs()) * Cf64::new(z.re.abs(), z.im.abs()) + j 55 | }, 56 | false => |z, c, _| { 57 | Cf64::new(z.re.abs(), z.im.abs()) * Cf64::new(z.re.abs(), z.im.abs()) + c 58 | }, 59 | }, 60 | 2 => match args.is_julia { 61 | true => |z, _, j| { 62 | let mut tz = z * z + j; 63 | tz = Cf64::new(tz.re.abs(), tz.im.abs()) 64 | * Cf64::new(tz.re.abs(), tz.im.abs()) 65 | + j; 66 | tz = tz * tz + j; 67 | tz = tz * tz + j; 68 | tz 69 | }, 70 | false => |z, c, _| { 71 | let mut tz = z * z + c; 72 | tz = Cf64::new(tz.re.abs(), tz.im.abs()) 73 | * Cf64::new(tz.re.abs(), tz.im.abs()) 74 | + c; 75 | tz = tz * tz + c; 76 | tz = tz * tz + c; 77 | tz 78 | }, 79 | }, 80 | 3 => match args.is_julia { 81 | true => |z, _, j| (z * j).powc(z / j) + (z / j), 82 | false => |z, c, _| (z * c).powc(z / c) + (z / c), 83 | }, 84 | _ => match args.is_julia { 85 | true => |z, _, j| z * z + j, 86 | false => |z, c, _| z * z + c, 87 | }, 88 | }, 89 | move |z, _| z, 90 | Functions::identity, 91 | match args.color_mode { 92 | 0 => Functions::coloring, 93 | 1 => Functions::normal_map, 94 | 2 => Functions::miles_coloring, 95 | 3 => Functions::miles_coloring2, 96 | _ => Functions::coloring, 97 | }, 98 | match args.bail_mode { 99 | 0 => Functions::default_bail, 100 | 1 => Functions::sqrt_bail, 101 | 2 => Functions::der_bail, 102 | _ => Functions::default_bail, 103 | }, 104 | ), 105 | ); 106 | mandelbrot.render_samples(args.samples, true); 107 | mandelbrot.process_image(); 108 | mandelbrot.image.save(&name).unwrap(); 109 | // output.save(&name).unwrap(); 110 | let notif = format!("Finished in: {}ms!", now.elapsed().as_millis()); 111 | println!( 112 | "{},{},{},{}", 113 | &args.set_color.ch[0], &args.set_color.ch[1], &args.set_color.ch[2], &args.set_color.ch[3] 114 | ); 115 | 116 | println!("{}", notif); 117 | } 118 | -------------------------------------------------------------------------------- /src/renderer.rs: -------------------------------------------------------------------------------- 1 | // fracgen 2 | // Renderer type 3 | // (C) 2022 by Jacob (ahhhh6980@gmail.com) 4 | 5 | // This program is free software: you can redistribute it and/or modify 6 | // it under the terms of the GNU General Public License as published by 7 | // the Free Software Foundation, either version 3 of the License, or 8 | // (at your option) any later version. 9 | 10 | // This program is distributed in the hope that it will be useful, 11 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | // GNU General Public License for more details. 14 | 15 | // You should have received a copy of the GNU General Public License 16 | // along with this program. If not, see . 17 | 18 | #![allow(incomplete_features, unused_imports, dead_code)] 19 | use clap::Parser; 20 | use image::{DynamicImage, ImageBuffer, Rgba}; 21 | use linya::{Bar, Progress}; 22 | use num::complex::Complex; 23 | use rand::Rng; 24 | use rayon::iter::{IntoParallelIterator, ParallelIterator}; 25 | use std::{ 26 | f64::consts::PI, 27 | path, 28 | sync::Mutex, 29 | time::{Instant, SystemTime}, 30 | }; 31 | type Cf64 = Complex; 32 | type Img8 = ImageBuffer, Vec>; 33 | use crate::color::{Color, ColorType}; 34 | 35 | pub struct Functions; 36 | 37 | impl Functions { 38 | #[allow(dead_code, unused_variables)] 39 | pub fn default_bail(rend: &Renderer, z: Cf64, der: Cf64, der_sum: Cf64) -> bool { 40 | z.norm_sqr() < rend.args.bail 41 | } 42 | 43 | #[allow(dead_code, unused_variables)] 44 | pub fn sqrt_bail(rend: &Renderer, z: Cf64, der: Cf64, der_sum: Cf64) -> bool { 45 | z.norm() < rend.args.bail 46 | } 47 | 48 | #[allow(dead_code, unused_variables)] 49 | pub fn der_bail(rend: &Renderer, z: Cf64, der: Cf64, der_sum: Cf64) -> bool { 50 | (der_sum * der_sum).norm_sqr() < rend.args.derbail 51 | && z.norm_sqr() * z.norm_sqr() < rend.args.bail 52 | } 53 | 54 | #[allow(dead_code, unused_variables)] 55 | pub fn coloring(rend: &Renderer, i: f64, s: f64, z: Cf64, der: Cf64) -> Color { 56 | let hue = ((1.0 - (s / rend.args.limit)) * 360.0) 57 | .powf(rend.args.cexp) 58 | .powf(1.5); 59 | Color::new([hue, 1.0, 1.0, 1.0], ColorType::Hsva).to_Rgba() 60 | } 61 | 62 | #[allow(dead_code, unused_variables)] 63 | pub fn miles_coloring(rend: &Renderer, i: f64, s: f64, z: Cf64, der: Cf64) -> Color { 64 | let iter_count = s; 65 | // let iter_count = s; 66 | 67 | let sat = (4096.0 / 360.0 * PI * iter_count).cos() / 2.0 + 0.5; 68 | let val = 1.0 - (2048.0 / 360.0 * PI * iter_count).sin() / 2.0 - 0.5; 69 | 70 | // # convert u into rgb of hue cycle 71 | let mut r = (((1.0 - 2.0 * (iter_count).cos()) / 2.0).max(0.0)).min(1.0); 72 | let mut g = (((1.0 - 2.0 * (iter_count + PI * 2.0 / 3.0).cos()) / 2.0).max(0.0)).min(1.0); 73 | let mut b = (((1.0 - 2.0 * (iter_count + PI * 4.0 / 3.0).cos()) / 2.0).max(0.0)).min(1.0); 74 | 75 | // # apply saturation and brightness to the rgb 76 | r = ((1.0 + r * sat - sat) * val).sqrt(); 77 | g = ((1.0 + g * sat - sat) * val).sqrt(); 78 | b = ((1.0 + b * sat - sat) * val).sqrt(); 79 | 80 | let light_deg = 270f64; 81 | let norm_height = 1.5; 82 | let light_vec = Cf64::new( 83 | ((light_deg * PI) / 180.0).cos(), 84 | ((light_deg * PI) / 180.0).sin(), 85 | ); 86 | let normal_vec = z / der; 87 | let normal_vec = normal_vec / normal_vec.norm(); // abs norm_vec 88 | let mut value = 89 | ((normal_vec.re * light_vec.re) + (normal_vec.im * light_vec.im) + norm_height) 90 | / (1.0 + norm_height); 91 | if value < 0.0 { 92 | value = 0.0; 93 | } 94 | if value > 1.0 { 95 | value = 1.0; 96 | } 97 | 98 | // let hue = (((s / limit).powf(cexp)) * 360.0).powf(1.5); 99 | let mut color = Color::new([r, g, b, 1.0], ColorType::Rgba).to_Rgba(); 100 | color.ch[2] *= value; 101 | color 102 | } 103 | 104 | #[allow(dead_code, unused_variables)] 105 | pub fn miles_coloring2(rend: &Renderer, i: f64, s: f64, z: Cf64, der: Cf64) -> Color { 106 | let iter_count = s.sqrt().powf(rend.args.cexp); 107 | // let iter_count = s; 108 | 109 | let sat = (4096.0 / 360.0 * PI * iter_count).cos() / 2.0 + 0.5; 110 | let sat = 1.0; 111 | let val = 1.0 - (2048.0 / 360.0 * PI * iter_count).sin() / 2.0 - 0.5; 112 | let val = 1.0; 113 | // # convert u into rgb of hue cycle 114 | let mut r = (((1.0 - 2.0 * (iter_count).cos()) / 2.0).max(0.0)).min(1.0); 115 | let mut g = (((1.0 - 2.0 * (iter_count + PI * 2.0 / 3.0).cos()) / 2.0).max(0.0)).min(1.0); 116 | let mut b = (((1.0 - 2.0 * (iter_count + PI * 4.0 / 3.0).cos()) / 2.0).max(0.0)).min(1.0); 117 | 118 | // # apply saturation and brightness to the rgb 119 | r = ((1.0 + r * sat - sat) * val).sqrt(); 120 | g = ((1.0 + g * sat - sat) * val).sqrt(); 121 | b = ((1.0 + b * sat - sat) * val).sqrt(); 122 | 123 | let light_deg = 270f64; 124 | let norm_height = 1.5; 125 | let light_vec = Cf64::new( 126 | ((light_deg * PI) / 180.0).cos(), 127 | ((light_deg * PI) / 180.0).sin(), 128 | ); 129 | let normal_vec = z / der; 130 | let normal_vec = normal_vec / normal_vec.norm(); // abs norm_vec 131 | let mut value = 132 | ((normal_vec.re * light_vec.re) + (normal_vec.im * light_vec.im) + norm_height) 133 | / (1.0 + norm_height); 134 | if value < 0.0 { 135 | value = 0.0; 136 | } 137 | if value > 1.0 { 138 | value = 1.0; 139 | } 140 | 141 | // let hue = (((s / limit).powf(cexp)) * 360.0).powf(1.5); 142 | let mut color = Color::new([r, g, b, 1.0], ColorType::Rgba).to_Rgba(); 143 | color.ch[2] *= value; 144 | color 145 | } 146 | 147 | #[allow(dead_code, unused_variables)] 148 | pub fn normal_map(rend: &Renderer, i: f64, s: f64, z: Cf64, der: Cf64) -> Color { 149 | let light_deg = 270f64; 150 | let norm_height = 1.5; 151 | let light_vec = Cf64::new( 152 | ((light_deg * PI) / 180.0).cos(), 153 | ((light_deg * PI) / 180.0).sin(), 154 | ); 155 | let normal_vec = z / der; 156 | let normal_vec = normal_vec / normal_vec.norm(); // abs norm_vec 157 | let mut value = 158 | ((normal_vec.re * light_vec.re) + (normal_vec.im * light_vec.im) + norm_height) 159 | / (1.0 + norm_height); 160 | if value < 0.0 { 161 | value = 0.0; 162 | } 163 | if value > 1.0 { 164 | value = 1.0; 165 | } 166 | let hue = (((s / rend.args.limit).powf(rend.args.cexp)) * 360.0).powf(1.5); 167 | Color::new([hue, 1.0, value, 1.0], ColorType::Hsva).to_Rgba() 168 | } 169 | 170 | #[allow(dead_code, unused_variables)] 171 | pub fn image_mapping(rend: &Renderer, i: f64, s: f64, z: Cf64, der: Cf64) -> Color { 172 | let (w, h) = (rend.texture.width(), rend.texture.height()); 173 | let width = ((z.im.atan2(z.re) + PI) / (PI * 2.0) * w as f64).round() as u32 % w; 174 | let height = (h as f64 - 1.0f64) 175 | - ((z.norm() / rend.args.bail).log(rend.args.bail) * (h as f64 - 1.0f64)).floor(); 176 | let mut height = ((height as u32) * 2) % h; 177 | if i as u32 % 2 == 1 { 178 | height = (h - 1) - height; 179 | } 180 | let mut color = Color::new( 181 | rend.texture 182 | .get_pixel(width, height) 183 | .0 184 | .map(|x| x as f64 / u8::MAX as f64), 185 | ColorType::Rgba, 186 | ) 187 | .to_Hsva(); 188 | 189 | let light_deg = 270f64; 190 | let norm_height = 1.5; 191 | let light_vec = Cf64::new( 192 | ((light_deg * PI) / 180.0).cos(), 193 | ((light_deg * PI) / 180.0).sin(), 194 | ); 195 | let normal_vec = z / der; 196 | let normal_vec = normal_vec / normal_vec.norm(); // abs norm_vec 197 | let mut value = 198 | ((normal_vec.re * light_vec.re) + (normal_vec.im * light_vec.im) + norm_height) 199 | / (1.0 + norm_height); 200 | if value < 0.0 { 201 | value = 0.0; 202 | } 203 | if value > 1.0 { 204 | value = 1.0; 205 | } 206 | 207 | color.ch[2] *= value; 208 | color.to_Rgba() 209 | } 210 | 211 | #[allow(dead_code, unused_variables)] 212 | pub fn map_complex(c: Cf64) -> Cf64 { 213 | let nc = Cf64::new(c.im, c.re); 214 | (nc + 1.0) / ((-nc / 1.25) + 1.0) 215 | } 216 | 217 | #[allow(dead_code, unused_variables)] 218 | pub fn map_complex2(c: Cf64) -> Cf64 { 219 | let nc = Cf64::new(c.im, c.re); 220 | (c - 1.0) / (c + 1.0) 221 | } 222 | #[allow(dead_code, unused_variables)] 223 | pub fn map_circle(c: Cf64) -> Cf64 { 224 | 1.0 / c 225 | } 226 | 227 | #[allow(dead_code, unused_variables)] 228 | pub fn identity(c: Cf64) -> Cf64 { 229 | c 230 | } 231 | 232 | #[allow(dead_code, unused_variables)] 233 | pub fn mandelbrot(z: Cf64, c: Cf64, j: Cf64) -> Cf64 { 234 | z * z + c 235 | } 236 | } 237 | 238 | #[derive(Debug, Clone, Parser)] 239 | #[clap(author, version, about, long_about = None)] 240 | pub struct Args { 241 | #[clap(long, default_value = "1920")] 242 | pub width: i32, 243 | 244 | #[clap(long, default_value = "1680")] 245 | pub height: i32, 246 | 247 | #[clap(long, default_value = "mandel")] 248 | pub name: String, 249 | 250 | #[clap(long, default_value_t=((num_cpus::get() as f64) * 0.70).ceil() as usize)] 251 | pub threads: usize, 252 | 253 | #[clap(long, default_value_t=Complex::::new(-0.75,0.0))] 254 | pub origin: Cf64, 255 | 256 | #[clap(long, default_value_t=Complex::::new(0.0,0.0))] 257 | pub z_init: Cf64, 258 | 259 | #[clap(long, default_value_t=Complex::::new(0.0,0.0))] 260 | pub julia: Cf64, 261 | 262 | #[clap(long, default_value = "0.7")] 263 | pub zoom: f64, 264 | 265 | #[clap(long, default_value = "4")] 266 | pub samples: usize, 267 | 268 | #[clap(long, default_value = "20")] 269 | pub cycles: usize, 270 | 271 | #[clap(long, default_value = "2.0")] 272 | pub sampled: f64, 273 | 274 | #[clap(long, default_value = "1024.0")] 275 | pub limit: f64, 276 | 277 | #[clap(long, default_value = "64.0")] 278 | pub bail: f64, 279 | 280 | #[clap(long, default_value = "16384.0")] 281 | pub derbail: f64, 282 | 283 | #[clap(long, default_value = "1.0")] 284 | pub cexp: f64, 285 | 286 | #[clap(long, default_value = "0,0,0,255")] 287 | pub set_color: Color, 288 | 289 | #[clap(short)] 290 | pub is_julia: bool, 291 | 292 | #[clap(long, default_value = "0")] 293 | pub fractal_mode: usize, 294 | 295 | #[clap(long, default_value = "0")] 296 | pub color_mode: usize, 297 | 298 | #[clap(long, default_value = "0")] 299 | pub bail_mode: usize, 300 | } 301 | 302 | impl Args { 303 | pub fn new() -> Args { 304 | Args { 305 | width: 1920, 306 | height: 1680, 307 | name: String::from("mandel"), 308 | threads: ((num_cpus::get() as f64) * 0.75).ceil() as usize, 309 | origin: Complex::::new(-0.75, 0.0), 310 | z_init: Complex::::new(0.0, 0.0), 311 | julia: Complex::::new(0.0, 0.0), 312 | cycles: 20, 313 | zoom: 0.7, 314 | samples: 4, 315 | sampled: 2.0, 316 | limit: 1024.0, 317 | bail: 256.0, 318 | derbail: 16384.0, 319 | cexp: 1.0, 320 | is_julia: false, 321 | fractal_mode: 0, 322 | color_mode: 0, 323 | bail_mode: 0, 324 | set_color: Color::new([0.0, 0.0, 0.0, 1.0], ColorType::Rgba), 325 | } 326 | } 327 | } 328 | 329 | impl Default for Args { 330 | fn default() -> Self { 331 | Self::new() 332 | } 333 | } 334 | 335 | fn abs(z: Cf64) -> f64 { 336 | z.re * z.re + z.im * z.im 337 | } 338 | 339 | pub fn normalize_coords(x: i32, y: i32, w: i32, h: i32, z: f64) -> Cf64 { 340 | let nx = 2.0 * (x as f64 / w as f64) - 1.0; 341 | let ny = 2.0 * (y as f64 / h as f64) - 1.0; 342 | Complex::new(nx / z, ny * (h as f64 / w as f64) / z) 343 | } 344 | 345 | #[derive(Clone)] 346 | pub struct Functs { 347 | pub iter_funct: fn(Cf64, Cf64, Cf64) -> Cf64, 348 | pub init_funct: fn(Cf64, Cf64) -> Cf64, 349 | pub cmap_funct: fn(Cf64) -> Cf64, 350 | pub color_funct: fn(&Renderer, f64, f64, Cf64, Cf64) -> Color, 351 | pub conditional: fn(&Renderer, Cf64, Cf64, Cf64) -> bool, 352 | } 353 | 354 | impl Functs { 355 | pub fn new( 356 | a: fn(Cf64, Cf64, Cf64) -> Cf64, 357 | b: fn(Cf64, Cf64) -> Cf64, 358 | c: fn(Cf64) -> Cf64, 359 | d: fn(&Renderer, f64, f64, Cf64, Cf64) -> Color, 360 | e: fn(&Renderer, Cf64, Cf64, Cf64) -> bool, 361 | ) -> Functs { 362 | Functs { 363 | iter_funct: a, 364 | init_funct: b, 365 | cmap_funct: c, 366 | color_funct: d, 367 | conditional: e, 368 | } 369 | } 370 | } 371 | pub struct Renderer { 372 | pub args: Args, 373 | pub width: i32, 374 | pub height: i32, 375 | pub functs: Functs, 376 | pub image: Img8, 377 | pub raw: Vec>, 378 | pub rendered_samples: usize, 379 | pub not_rendering: bool, 380 | pub texture: Img8, 381 | } 382 | 383 | impl Renderer { 384 | pub fn new(args: Args, functs: Functs) -> Renderer { 385 | Renderer { 386 | args: args.clone(), 387 | width: args.width, 388 | height: args.height, 389 | functs, 390 | image: Img8::new(args.width as u32, args.height as u32), 391 | raw: vec![ 392 | vec![Color::new([0f64; 4], ColorType::SRgba); args.width as usize]; 393 | args.height as usize 394 | ], 395 | rendered_samples: 0, 396 | not_rendering: true, 397 | texture: Img8::new(0, 0), 398 | } 399 | } 400 | 401 | pub fn resize(&mut self, w: usize, h: usize) { 402 | self.args.width = w as i32; 403 | self.args.height = h as i32; 404 | self.width = w as i32; 405 | self.height = h as i32; 406 | self.image = Img8::new(w as u32, h as u32); 407 | self.raw = vec![vec![Color::new([0f64; 4], ColorType::SRgba); w]; h]; 408 | self.rendered_samples = 0; 409 | } 410 | 411 | pub fn pixel(&self, i: i32, samples: usize) -> Color { 412 | let mut out = Color::new([0.0; 4], ColorType::SRgba); 413 | let d: Cf64 = normalize_coords(1, 1, self.width, self.height, self.args.zoom) 414 | - normalize_coords(0, 0, self.width, self.height, self.args.zoom); 415 | let mut rng = rand::thread_rng(); 416 | for _ in 0..samples { 417 | let mut c = normalize_coords( 418 | i / self.height, 419 | i % self.height, 420 | self.width, 421 | self.height, 422 | self.args.zoom, 423 | ) + self.args.origin; 424 | c.re += d.re * (rng.gen_range(-1.0..1.0) / self.args.sampled); 425 | c.im += d.im * (rng.gen_range(-1.0..1.0) / self.args.sampled); 426 | c = (self.functs.cmap_funct)(c); 427 | let mut z = (self.functs.init_funct)(self.args.z_init, c); 428 | let mut i = 0.0; 429 | let mut s = 0.0; 430 | let mut der = Cf64::new(1.0, 0.0); 431 | let mut tot_der = Cf64::new(1.0, 0.0); 432 | let dc = Cf64::new(1.0, 0.0); 433 | let mut test = z; 434 | let mut old = z; 435 | let chk = d.re.min(d.im) * 0.5; 436 | 437 | let mut period = 1; 438 | while (self.functs.conditional)(self, z, der, tot_der) && i < self.args.limit { 439 | tot_der += der; 440 | der = (der * 2.0 * z) + dc; 441 | z = (self.functs.iter_funct)(z, c, (self.functs.cmap_funct)(self.args.julia)); 442 | i += 1.0; 443 | s += (-(abs(z + 1.0))).exp(); 444 | 445 | let dif = z - old; 446 | if dif.re.abs() < chk && dif.im.abs() < chk { 447 | i = self.args.limit; 448 | s = self.args.limit; 449 | } 450 | 451 | period += 1; 452 | if period > self.args.cycles { 453 | period = 0; 454 | old = z; 455 | } 456 | test += z; 457 | } 458 | 459 | let mut color = (self.functs.color_funct)(self, i, s, z, der); 460 | 461 | color = color.to_sRgba(); 462 | if i < self.args.limit { 463 | out = out + (color * color); 464 | } else { 465 | out = out + (self.args.set_color * self.args.set_color); 466 | } 467 | } 468 | out 469 | } 470 | #[allow(clippy::needless_late_init)] 471 | pub fn render_samples(&mut self, samples: usize, progress: bool) { 472 | let now = SystemTime::now(); 473 | self.not_rendering = false; 474 | let out: Vec; 475 | if progress { 476 | let progress = Mutex::new(Progress::new()); 477 | let bar: Bar = progress 478 | .lock() 479 | .unwrap() 480 | .bar((self.width * self.height) as usize, ""); 481 | out = (0..(self.width * self.height)) 482 | .into_par_iter() 483 | .map(|i| { 484 | progress.lock().unwrap().inc_and_draw(&bar, 1); 485 | Renderer::pixel(self, i as i32, samples) 486 | }) 487 | .collect(); 488 | } else { 489 | out = (0..(self.width * self.height)) 490 | .into_par_iter() 491 | .map(|i| Renderer::pixel(self, i as i32, samples)) 492 | .collect(); 493 | } 494 | 495 | for (i, e) in out.iter().enumerate() { 496 | let (x, y) = ( 497 | (i as i32 / (self.height)) as u32, 498 | (i as i32 % (self.height)) as u32, 499 | ); 500 | if (y as i32) < self.height { 501 | if self.rendered_samples > 0 { 502 | self.raw[y as usize][x as usize] = self.raw[y as usize][x as usize] + *e; 503 | } else { 504 | self.raw[y as usize][x as usize] = *e; 505 | } 506 | } 507 | } 508 | println!("{:4.4}", now.elapsed().unwrap().as_secs_f32()); 509 | self.rendered_samples += samples; 510 | self.not_rendering = true; 511 | } 512 | 513 | pub fn process_image(&mut self) { 514 | for i in 0..(self.width * self.height) { 515 | let (x, y) = ( 516 | (i as i32 / (self.height)) as u32, 517 | (i as i32 % (self.height)) as u32, 518 | ); 519 | if (y as i32) < self.height { 520 | let e = self.raw[y as usize][x as usize] / self.rendered_samples as f64; 521 | self.image.put_pixel( 522 | x, 523 | y, 524 | Rgba::from( 525 | e.to_Rgba() 526 | .to_arr() 527 | .map(|v| (v.sqrt() * u8::MAX as f64) as u8), 528 | ), 529 | ); 530 | } 531 | } 532 | } 533 | 534 | pub fn update_args(&mut self, args: Args) { 535 | self.args = args.clone(); 536 | self.width = args.width; 537 | self.height = args.height; 538 | } 539 | 540 | pub fn update_functs(&mut self, functs: Functs) { 541 | self.functs = functs; 542 | } 543 | } 544 | --------------------------------------------------------------------------------