+2 -7

.gitignore

··· 1 1 - obj/ 2 2 - bin/ 3 3 - solver/ 4 4 - src/gfx/*.h 5 5 - src/gfx/*.c 6 6 - src/gfx/*.8xv 7 7 - src/gfx/*.lst 1 1 + bin/* 2 2 + obj/*

-29

CHANGELOG.txt

··· 1 1 - Version 1.4.0: 2 2 - - added ability for game to resume when reopened 3 3 - - made game end more obvious 4 4 - 5 5 - Version 1.3.0: 6 6 - - fixed and further overhauled control scheme 7 7 - - fixed bug where card could disappear if alone on stack and other card(s) 8 8 - placed above it 9 9 - - added dealing animation 10 10 - - added option to reset game partway through 11 11 - 12 12 - Version 1.2.0: 13 13 - - overhauled control scheme 14 14 - - switched to an uncompressed program and archived graphics 15 15 - 16 16 - Version 1.1.1: 17 17 - - fixed several bugs with cursor navigation 18 18 - 19 19 - Version 1.1.0: 20 20 - - added persistent win counter 21 21 - - changed background color 22 22 - 23 23 - Version 1.0.2: 24 24 - - fixed cursor starting in DROP mode on game restart 25 25 - - added basic information on assembly programs to README 26 26 - 27 27 - Version 1.0.1: 28 28 - - changed cursor behavior when navigating between tableau stacks in SELECT mode 29 29 - - fixed game not actually restarting when ENTER pressed at game end

+674 -674

LICENSE.txt

··· 1 1 - GNU GENERAL PUBLIC LICENSE 2 2 - Version 3, 29 June 2007 3 3 - 4 4 - Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/> 5 5 - Everyone is permitted to copy and distribute verbatim copies 6 6 - of this license document, but changing it is not allowed. 7 7 - 8 8 - Preamble 9 9 - 10 10 - The GNU General Public License is a free, copyleft license for 11 11 - software and other kinds of works. 12 12 - 13 13 - The licenses for most software and other practical works are designed 14 14 - to take away your freedom to share and change the works. By contrast, 15 15 - the GNU General Public License is intended to guarantee your freedom to 16 16 - share and change all versions of a program--to make sure it remains free 17 17 - software for all its users. We, the Free Software Foundation, use the 18 18 - GNU General Public License for most of our software; it applies also to 19 19 - any other work released this way by its authors. You can apply it to 20 20 - your programs, too. 21 21 - 22 22 - When we speak of free software, we are referring to freedom, not 23 23 - price. Our General Public Licenses are designed to make sure that you 24 24 - have the freedom to distribute copies of free software (and charge for 25 25 - them if you wish), that you receive source code or can get it if you 26 26 - want it, that you can change the software or use pieces of it in new 27 27 - free programs, and that you know you can do these things. 28 28 - 29 29 - To protect your rights, we need to prevent others from denying you 30 30 - these rights or asking you to surrender the rights. Therefore, you have 31 31 - certain responsibilities if you distribute copies of the software, or if 32 32 - you modify it: responsibilities to respect the freedom of others. 33 33 - 34 34 - For example, if you distribute copies of such a program, whether 35 35 - gratis or for a fee, you must pass on to the recipients the same 36 36 - freedoms that you received. You must make sure that they, too, receive 37 37 - or can get the source code. And you must show them these terms so they 38 38 - know their rights. 39 39 - 40 40 - Developers that use the GNU GPL protect your rights with two steps: 41 41 - (1) assert copyright on the software, and (2) offer you this License 42 42 - giving you legal permission to copy, distribute and/or modify it. 43 43 - 44 44 - For the developers' and authors' protection, the GPL clearly explains 45 45 - that there is no warranty for this free software. For both users' and 46 46 - authors' sake, the GPL requires that modified versions be marked as 47 47 - changed, so that their problems will not be attributed erroneously to 48 48 - authors of previous versions. 49 49 - 50 50 - Some devices are designed to deny users access to install or run 51 51 - modified versions of the software inside them, although the manufacturer 52 52 - can do so. This is fundamentally incompatible with the aim of 53 53 - protecting users' freedom to change the software. The systematic 54 54 - pattern of such abuse occurs in the area of products for individuals to 55 55 - use, which is precisely where it is most unacceptable. Therefore, we 56 56 - have designed this version of the GPL to prohibit the practice for those 57 57 - products. If such problems arise substantially in other domains, we 58 58 - stand ready to extend this provision to those domains in future versions 59 59 - of the GPL, as needed to protect the freedom of users. 60 60 - 61 61 - Finally, every program is threatened constantly by software patents. 62 62 - States should not allow patents to restrict development and use of 63 63 - software on general-purpose computers, but in those that do, we wish to 64 64 - avoid the special danger that patents applied to a free program could 65 65 - make it effectively proprietary. To prevent this, the GPL assures that 66 66 - patents cannot be used to render the program non-free. 67 67 - 68 68 - The precise terms and conditions for copying, distribution and 69 69 - modification follow. 70 70 - 71 71 - TERMS AND CONDITIONS 72 72 - 73 73 - 0. Definitions. 74 74 - 75 75 - "This License" refers to version 3 of the GNU General Public License. 76 76 - 77 77 - "Copyright" also means copyright-like laws that apply to other kinds of 78 78 - works, such as semiconductor masks. 79 79 - 80 80 - "The Program" refers to any copyrightable work licensed under this 81 81 - License. Each licensee is addressed as "you". "Licensees" and 82 82 - "recipients" may be individuals or organizations. 83 83 - 84 84 - To "modify" a work means to copy from or adapt all or part of the work 85 85 - in a fashion requiring copyright permission, other than the making of an 86 86 - exact copy. The resulting work is called a "modified version" of the 87 87 - earlier work or a work "based on" the earlier work. 88 88 - 89 89 - A "covered work" means either the unmodified Program or a work based 90 90 - on the Program. 91 91 - 92 92 - To "propagate" a work means to do anything with it that, without 93 93 - permission, would make you directly or secondarily liable for 94 94 - infringement under applicable copyright law, except executing it on a 95 95 - computer or modifying a private copy. Propagation includes copying, 96 96 - distribution (with or without modification), making available to the 97 97 - public, and in some countries other activities as well. 98 98 - 99 99 - To "convey" a work means any kind of propagation that enables other 100 100 - parties to make or receive copies. Mere interaction with a user through 101 101 - a computer network, with no transfer of a copy, is not conveying. 102 102 - 103 103 - An interactive user interface displays "Appropriate Legal Notices" 104 104 - to the extent that it includes a convenient and prominently visible 105 105 - feature that (1) displays an appropriate copyright notice, and (2) 106 106 - tells the user that there is no warranty for the work (except to the 107 107 - extent that warranties are provided), that licensees may convey the 108 108 - work under this License, and how to view a copy of this License. If 109 109 - the interface presents a list of user commands or options, such as a 110 110 - menu, a prominent item in the list meets this criterion. 111 111 - 112 112 - 1. Source Code. 113 113 - 114 114 - The "source code" for a work means the preferred form of the work 115 115 - for making modifications to it. "Object code" means any non-source 116 116 - form of a work. 117 117 - 118 118 - A "Standard Interface" means an interface that either is an official 119 119 - standard defined by a recognized standards body, or, in the case of 120 120 - interfaces specified for a particular programming language, one that 121 121 - is widely used among developers working in that language. 122 122 - 123 123 - The "System Libraries" of an executable work include anything, other 124 124 - than the work as a whole, that (a) is included in the normal form of 125 125 - packaging a Major Component, but which is not part of that Major 126 126 - Component, and (b) serves only to enable use of the work with that 127 127 - Major Component, or to implement a Standard Interface for which an 128 128 - implementation is available to the public in source code form. A 129 129 - "Major Component", in this context, means a major essential component 130 130 - (kernel, window system, and so on) of the specific operating system 131 131 - (if any) on which the executable work runs, or a compiler used to 132 132 - produce the work, or an object code interpreter used to run it. 133 133 - 134 134 - The "Corresponding Source" for a work in object code form means all 135 135 - the source code needed to generate, install, and (for an executable 136 136 - work) run the object code and to modify the work, including scripts to 137 137 - control those activities. However, it does not include the work's 138 138 - System Libraries, or general-purpose tools or generally available free 139 139 - programs which are used unmodified in performing those activities but 140 140 - which are not part of the work. For example, Corresponding Source 141 141 - includes interface definition files associated with source files for 142 142 - the work, and the source code for shared libraries and dynamically 143 143 - linked subprograms that the work is specifically designed to require, 144 144 - such as by intimate data communication or control flow between those 145 145 - subprograms and other parts of the work. 146 146 - 147 147 - The Corresponding Source need not include anything that users 148 148 - can regenerate automatically from other parts of the Corresponding 149 149 - Source. 150 150 - 151 151 - The Corresponding Source for a work in source code form is that 152 152 - same work. 153 153 - 154 154 - 2. Basic Permissions. 155 155 - 156 156 - All rights granted under this License are granted for the term of 157 157 - copyright on the Program, and are irrevocable provided the stated 158 158 - conditions are met. This License explicitly affirms your unlimited 159 159 - permission to run the unmodified Program. The output from running a 160 160 - covered work is covered by this License only if the output, given its 161 161 - content, constitutes a covered work. This License acknowledges your 162 162 - rights of fair use or other equivalent, as provided by copyright law. 163 163 - 164 164 - You may make, run and propagate covered works that you do not 165 165 - convey, without conditions so long as your license otherwise remains 166 166 - in force. You may convey covered works to others for the sole purpose 167 167 - of having them make modifications exclusively for you, or provide you 168 168 - with facilities for running those works, provided that you comply with 169 169 - the terms of this License in conveying all material for which you do 170 170 - not control copyright. Those thus making or running the covered works 171 171 - for you must do so exclusively on your behalf, under your direction 172 172 - and control, on terms that prohibit them from making any copies of 173 173 - your copyrighted material outside their relationship with you. 174 174 - 175 175 - Conveying under any other circumstances is permitted solely under 176 176 - the conditions stated below. Sublicensing is not allowed; section 10 177 177 - makes it unnecessary. 178 178 - 179 179 - 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 180 - 181 181 - No covered work shall be deemed part of an effective technological 182 182 - measure under any applicable law fulfilling obligations under article 183 183 - 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 184 - similar laws prohibiting or restricting circumvention of such 185 185 - measures. 186 186 - 187 187 - When you convey a covered work, you waive any legal power to forbid 188 188 - circumvention of technological measures to the extent such circumvention 189 189 - is effected by exercising rights under this License with respect to 190 190 - the covered work, and you disclaim any intention to limit operation or 191 191 - modification of the work as a means of enforcing, against the work's 192 192 - users, your or third parties' legal rights to forbid circumvention of 193 193 - technological measures. 194 194 - 195 195 - 4. Conveying Verbatim Copies. 196 196 - 197 197 - You may convey verbatim copies of the Program's source code as you 198 198 - receive it, in any medium, provided that you conspicuously and 199 199 - appropriately publish on each copy an appropriate copyright notice; 200 200 - keep intact all notices stating that this License and any 201 201 - non-permissive terms added in accord with section 7 apply to the code; 202 202 - keep intact all notices of the absence of any warranty; and give all 203 203 - recipients a copy of this License along with the Program. 204 204 - 205 205 - You may charge any price or no price for each copy that you convey, 206 206 - and you may offer support or warranty protection for a fee. 207 207 - 208 208 - 5. Conveying Modified Source Versions. 209 209 - 210 210 - You may convey a work based on the Program, or the modifications to 211 211 - produce it from the Program, in the form of source code under the 212 212 - terms of section 4, provided that you also meet all of these conditions: 213 213 - 214 214 - a) The work must carry prominent notices stating that you modified 215 215 - it, and giving a relevant date. 216 216 - 217 217 - b) The work must carry prominent notices stating that it is 218 218 - released under this License and any conditions added under section 219 219 - 7. This requirement modifies the requirement in section 4 to 220 220 - "keep intact all notices". 221 221 - 222 222 - c) You must license the entire work, as a whole, under this 223 223 - License to anyone who comes into possession of a copy. This 224 224 - License will therefore apply, along with any applicable section 7 225 225 - additional terms, to the whole of the work, and all its parts, 226 226 - regardless of how they are packaged. This License gives no 227 227 - permission to license the work in any other way, but it does not 228 228 - invalidate such permission if you have separately received it. 229 229 - 230 230 - d) If the work has interactive user interfaces, each must display 231 231 - Appropriate Legal Notices; however, if the Program has interactive 232 232 - interfaces that do not display Appropriate Legal Notices, your 233 233 - work need not make them do so. 234 234 - 235 235 - A compilation of a covered work with other separate and independent 236 236 - works, which are not by their nature extensions of the covered work, 237 237 - and which are not combined with it such as to form a larger program, 238 238 - in or on a volume of a storage or distribution medium, is called an 239 239 - "aggregate" if the compilation and its resulting copyright are not 240 240 - used to limit the access or legal rights of the compilation's users 241 241 - beyond what the individual works permit. Inclusion of a covered work 242 242 - in an aggregate does not cause this License to apply to the other 243 243 - parts of the aggregate. 244 244 - 245 245 - 6. Conveying Non-Source Forms. 246 246 - 247 247 - You may convey a covered work in object code form under the terms 248 248 - of sections 4 and 5, provided that you also convey the 249 249 - machine-readable Corresponding Source under the terms of this License, 250 250 - in one of these ways: 251 251 - 252 252 - a) Convey the object code in, or embodied in, a physical product 253 253 - (including a physical distribution medium), accompanied by the 254 254 - Corresponding Source fixed on a durable physical medium 255 255 - customarily used for software interchange. 256 256 - 257 257 - b) Convey the object code in, or embodied in, a physical product 258 258 - (including a physical distribution medium), accompanied by a 259 259 - written offer, valid for at least three years and valid for as 260 260 - long as you offer spare parts or customer support for that product 261 261 - model, to give anyone who possesses the object code either (1) a 262 262 - copy of the Corresponding Source for all the software in the 263 263 - product that is covered by this License, on a durable physical 264 264 - medium customarily used for software interchange, for a price no 265 265 - more than your reasonable cost of physically performing this 266 266 - conveying of source, or (2) access to copy the 267 267 - Corresponding Source from a network server at no charge. 268 268 - 269 269 - c) Convey individual copies of the object code with a copy of the 270 270 - written offer to provide the Corresponding Source. This 271 271 - alternative is allowed only occasionally and noncommercially, and 272 272 - only if you received the object code with such an offer, in accord 273 273 - with subsection 6b. 274 274 - 275 275 - d) Convey the object code by offering access from a designated 276 276 - place (gratis or for a charge), and offer equivalent access to the 277 277 - Corresponding Source in the same way through the same place at no 278 278 - further charge. You need not require recipients to copy the 279 279 - Corresponding Source along with the object code. If the place to 280 280 - copy the object code is a network server, the Corresponding Source 281 281 - may be on a different server (operated by you or a third party) 282 282 - that supports equivalent copying facilities, provided you maintain 283 283 - clear directions next to the object code saying where to find the 284 284 - Corresponding Source. Regardless of what server hosts the 285 285 - Corresponding Source, you remain obligated to ensure that it is 286 286 - available for as long as needed to satisfy these requirements. 287 287 - 288 288 - e) Convey the object code using peer-to-peer transmission, provided 289 289 - you inform other peers where the object code and Corresponding 290 290 - Source of the work are being offered to the general public at no 291 291 - charge under subsection 6d. 292 292 - 293 293 - A separable portion of the object code, whose source code is excluded 294 294 - from the Corresponding Source as a System Library, need not be 295 295 - included in conveying the object code work. 296 296 - 297 297 - A "User Product" is either (1) a "consumer product", which means any 298 298 - tangible personal property which is normally used for personal, family, 299 299 - or household purposes, or (2) anything designed or sold for incorporation 300 300 - into a dwelling. In determining whether a product is a consumer product, 301 301 - doubtful cases shall be resolved in favor of coverage. For a particular 302 302 - product received by a particular user, "normally used" refers to a 303 303 - typical or common use of that class of product, regardless of the status 304 304 - of the particular user or of the way in which the particular user 305 305 - actually uses, or expects or is expected to use, the product. A product 306 306 - is a consumer product regardless of whether the product has substantial 307 307 - commercial, industrial or non-consumer uses, unless such uses represent 308 308 - the only significant mode of use of the product. 309 309 - 310 310 - "Installation Information" for a User Product means any methods, 311 311 - procedures, authorization keys, or other information required to install 312 312 - and execute modified versions of a covered work in that User Product from 313 313 - a modified version of its Corresponding Source. The information must 314 314 - suffice to ensure that the continued functioning of the modified object 315 315 - code is in no case prevented or interfered with solely because 316 316 - modification has been made. 317 317 - 318 318 - If you convey an object code work under this section in, or with, or 319 319 - specifically for use in, a User Product, and the conveying occurs as 320 320 - part of a transaction in which the right of possession and use of the 321 321 - User Product is transferred to the recipient in perpetuity or for a 322 322 - fixed term (regardless of how the transaction is characterized), the 323 323 - Corresponding Source conveyed under this section must be accompanied 324 324 - by the Installation Information. But this requirement does not apply 325 325 - if neither you nor any third party retains the ability to install 326 326 - modified object code on the User Product (for example, the work has 327 327 - been installed in ROM). 328 328 - 329 329 - The requirement to provide Installation Information does not include a 330 330 - requirement to continue to provide support service, warranty, or updates 331 331 - for a work that has been modified or installed by the recipient, or for 332 332 - the User Product in which it has been modified or installed. Access to a 333 333 - network may be denied when the modification itself materially and 334 334 - adversely affects the operation of the network or violates the rules and 335 335 - protocols for communication across the network. 336 336 - 337 337 - Corresponding Source conveyed, and Installation Information provided, 338 338 - in accord with this section must be in a format that is publicly 339 339 - documented (and with an implementation available to the public in 340 340 - source code form), and must require no special password or key for 341 341 - unpacking, reading or copying. 342 342 - 343 343 - 7. Additional Terms. 344 344 - 345 345 - "Additional permissions" are terms that supplement the terms of this 346 346 - License by making exceptions from one or more of its conditions. 347 347 - Additional permissions that are applicable to the entire Program shall 348 348 - be treated as though they were included in this License, to the extent 349 349 - that they are valid under applicable law. If additional permissions 350 350 - apply only to part of the Program, that part may be used separately 351 351 - under those permissions, but the entire Program remains governed by 352 352 - this License without regard to the additional permissions. 353 353 - 354 354 - When you convey a copy of a covered work, you may at your option 355 355 - remove any additional permissions from that copy, or from any part of 356 356 - it. (Additional permissions may be written to require their own 357 357 - removal in certain cases when you modify the work.) You may place 358 358 - additional permissions on material, added by you to a covered work, 359 359 - for which you have or can give appropriate copyright permission. 360 360 - 361 361 - Notwithstanding any other provision of this License, for material you 362 362 - add to a covered work, you may (if authorized by the copyright holders of 363 363 - that material) supplement the terms of this License with terms: 364 364 - 365 365 - a) Disclaiming warranty or limiting liability differently from the 366 366 - terms of sections 15 and 16 of this License; or 367 367 - 368 368 - b) Requiring preservation of specified reasonable legal notices or 369 369 - author attributions in that material or in the Appropriate Legal 370 370 - Notices displayed by works containing it; or 371 371 - 372 372 - c) Prohibiting misrepresentation of the origin of that material, or 373 373 - requiring that modified versions of such material be marked in 374 374 - reasonable ways as different from the original version; or 375 375 - 376 376 - d) Limiting the use for publicity purposes of names of licensors or 377 377 - authors of the material; or 378 378 - 379 379 - e) Declining to grant rights under trademark law for use of some 380 380 - trade names, trademarks, or service marks; or 381 381 - 382 382 - f) Requiring indemnification of licensors and authors of that 383 383 - material by anyone who conveys the material (or modified versions of 384 384 - it) with contractual assumptions of liability to the recipient, for 385 385 - any liability that these contractual assumptions directly impose on 386 386 - those licensors and authors. 387 387 - 388 388 - All other non-permissive additional terms are considered "further 389 389 - restrictions" within the meaning of section 10. If the Program as you 390 390 - received it, or any part of it, contains a notice stating that it is 391 391 - governed by this License along with a term that is a further 392 392 - restriction, you may remove that term. If a license document contains 393 393 - a further restriction but permits relicensing or conveying under this 394 394 - License, you may add to a covered work material governed by the terms 395 395 - of that license document, provided that the further restriction does 396 396 - not survive such relicensing or conveying. 397 397 - 398 398 - If you add terms to a covered work in accord with this section, you 399 399 - must place, in the relevant source files, a statement of the 400 400 - additional terms that apply to those files, or a notice indicating 401 401 - where to find the applicable terms. 402 402 - 403 403 - Additional terms, permissive or non-permissive, may be stated in the 404 404 - form of a separately written license, or stated as exceptions; 405 405 - the above requirements apply either way. 406 406 - 407 407 - 8. Termination. 408 408 - 409 409 - You may not propagate or modify a covered work except as expressly 410 410 - provided under this License. Any attempt otherwise to propagate or 411 411 - modify it is void, and will automatically terminate your rights under 412 412 - this License (including any patent licenses granted under the third 413 413 - paragraph of section 11). 414 414 - 415 415 - However, if you cease all violation of this License, then your 416 416 - license from a particular copyright holder is reinstated (a) 417 417 - provisionally, unless and until the copyright holder explicitly and 418 418 - finally terminates your license, and (b) permanently, if the copyright 419 419 - holder fails to notify you of the violation by some reasonable means 420 420 - prior to 60 days after the cessation. 421 421 - 422 422 - Moreover, your license from a particular copyright holder is 423 423 - reinstated permanently if the copyright holder notifies you of the 424 424 - violation by some reasonable means, this is the first time you have 425 425 - received notice of violation of this License (for any work) from that 426 426 - copyright holder, and you cure the violation prior to 30 days after 427 427 - your receipt of the notice. 428 428 - 429 429 - Termination of your rights under this section does not terminate the 430 430 - licenses of parties who have received copies or rights from you under 431 431 - this License. If your rights have been terminated and not permanently 432 432 - reinstated, you do not qualify to receive new licenses for the same 433 433 - material under section 10. 434 434 - 435 435 - 9. Acceptance Not Required for Having Copies. 436 436 - 437 437 - You are not required to accept this License in order to receive or 438 438 - run a copy of the Program. Ancillary propagation of a covered work 439 439 - occurring solely as a consequence of using peer-to-peer transmission 440 440 - to receive a copy likewise does not require acceptance. However, 441 441 - nothing other than this License grants you permission to propagate or 442 442 - modify any covered work. These actions infringe copyright if you do 443 443 - not accept this License. Therefore, by modifying or propagating a 444 444 - covered work, you indicate your acceptance of this License to do so. 445 445 - 446 446 - 10. Automatic Licensing of Downstream Recipients. 447 447 - 448 448 - Each time you convey a covered work, the recipient automatically 449 449 - receives a license from the original licensors, to run, modify and 450 450 - propagate that work, subject to this License. You are not responsible 451 451 - for enforcing compliance by third parties with this License. 452 452 - 453 453 - An "entity transaction" is a transaction transferring control of an 454 454 - organization, or substantially all assets of one, or subdividing an 455 455 - organization, or merging organizations. If propagation of a covered 456 456 - work results from an entity transaction, each party to that 457 457 - transaction who receives a copy of the work also receives whatever 458 458 - licenses to the work the party's predecessor in interest had or could 459 459 - give under the previous paragraph, plus a right to possession of the 460 460 - Corresponding Source of the work from the predecessor in interest, if 461 461 - the predecessor has it or can get it with reasonable efforts. 462 462 - 463 463 - You may not impose any further restrictions on the exercise of the 464 464 - rights granted or affirmed under this License. For example, you may 465 465 - not impose a license fee, royalty, or other charge for exercise of 466 466 - rights granted under this License, and you may not initiate litigation 467 467 - (including a cross-claim or counterclaim in a lawsuit) alleging that 468 468 - any patent claim is infringed by making, using, selling, offering for 469 469 - sale, or importing the Program or any portion of it. 470 470 - 471 471 - 11. Patents. 472 472 - 473 473 - A "contributor" is a copyright holder who authorizes use under this 474 474 - License of the Program or a work on which the Program is based. The 475 475 - work thus licensed is called the contributor's "contributor version". 476 476 - 477 477 - A contributor's "essential patent claims" are all patent claims 478 478 - owned or controlled by the contributor, whether already acquired or 479 479 - hereafter acquired, that would be infringed by some manner, permitted 480 480 - by this License, of making, using, or selling its contributor version, 481 481 - but do not include claims that would be infringed only as a 482 482 - consequence of further modification of the contributor version. For 483 483 - purposes of this definition, "control" includes the right to grant 484 484 - patent sublicenses in a manner consistent with the requirements of 485 485 - this License. 486 486 - 487 487 - Each contributor grants you a non-exclusive, worldwide, royalty-free 488 488 - patent license under the contributor's essential patent claims, to 489 489 - make, use, sell, offer for sale, import and otherwise run, modify and 490 490 - propagate the contents of its contributor version. 491 491 - 492 492 - In the following three paragraphs, a "patent license" is any express 493 493 - agreement or commitment, however denominated, not to enforce a patent 494 494 - (such as an express permission to practice a patent or covenant not to 495 495 - sue for patent infringement). To "grant" such a patent license to a 496 496 - party means to make such an agreement or commitment not to enforce a 497 497 - patent against the party. 498 498 - 499 499 - If you convey a covered work, knowingly relying on a patent license, 500 500 - and the Corresponding Source of the work is not available for anyone 501 501 - to copy, free of charge and under the terms of this License, through a 502 502 - publicly available network server or other readily accessible means, 503 503 - then you must either (1) cause the Corresponding Source to be so 504 504 - available, or (2) arrange to deprive yourself of the benefit of the 505 505 - patent license for this particular work, or (3) arrange, in a manner 506 506 - consistent with the requirements of this License, to extend the patent 507 507 - license to downstream recipients. "Knowingly relying" means you have 508 508 - actual knowledge that, but for the patent license, your conveying the 509 509 - covered work in a country, or your recipient's use of the covered work 510 510 - in a country, would infringe one or more identifiable patents in that 511 511 - country that you have reason to believe are valid. 512 512 - 513 513 - If, pursuant to or in connection with a single transaction or 514 514 - arrangement, you convey, or propagate by procuring conveyance of, a 515 515 - covered work, and grant a patent license to some of the parties 516 516 - receiving the covered work authorizing them to use, propagate, modify 517 517 - or convey a specific copy of the covered work, then the patent license 518 518 - you grant is automatically extended to all recipients of the covered 519 519 - work and works based on it. 520 520 - 521 521 - A patent license is "discriminatory" if it does not include within 522 522 - the scope of its coverage, prohibits the exercise of, or is 523 523 - conditioned on the non-exercise of one or more of the rights that are 524 524 - specifically granted under this License. You may not convey a covered 525 525 - work if you are a party to an arrangement with a third party that is 526 526 - in the business of distributing software, under which you make payment 527 527 - to the third party based on the extent of your activity of conveying 528 528 - the work, and under which the third party grants, to any of the 529 529 - parties who would receive the covered work from you, a discriminatory 530 530 - patent license (a) in connection with copies of the covered work 531 531 - conveyed by you (or copies made from those copies), or (b) primarily 532 532 - for and in connection with specific products or compilations that 533 533 - contain the covered work, unless you entered into that arrangement, 534 534 - or that patent license was granted, prior to 28 March 2007. 535 535 - 536 536 - Nothing in this License shall be construed as excluding or limiting 537 537 - any implied license or other defenses to infringement that may 538 538 - otherwise be available to you under applicable patent law. 539 539 - 540 540 - 12. No Surrender of Others' Freedom. 541 541 - 542 542 - If conditions are imposed on you (whether by court order, agreement or 543 543 - otherwise) that contradict the conditions of this License, they do not 544 544 - excuse you from the conditions of this License. If you cannot convey a 545 545 - covered work so as to satisfy simultaneously your obligations under this 546 546 - License and any other pertinent obligations, then as a consequence you may 547 547 - not convey it at all. For example, if you agree to terms that obligate you 548 548 - to collect a royalty for further conveying from those to whom you convey 549 549 - the Program, the only way you could satisfy both those terms and this 550 550 - License would be to refrain entirely from conveying the Program. 551 551 - 552 552 - 13. Use with the GNU Affero General Public License. 553 553 - 554 554 - Notwithstanding any other provision of this License, you have 555 555 - permission to link or combine any covered work with a work licensed 556 556 - under version 3 of the GNU Affero General Public License into a single 557 557 - combined work, and to convey the resulting work. The terms of this 558 558 - License will continue to apply to the part which is the covered work, 559 559 - but the special requirements of the GNU Affero General Public License, 560 560 - section 13, concerning interaction through a network will apply to the 561 561 - combination as such. 562 562 - 563 563 - 14. Revised Versions of this License. 564 564 - 565 565 - The Free Software Foundation may publish revised and/or new versions of 566 566 - the GNU General Public License from time to time. Such new versions will 567 567 - be similar in spirit to the present version, but may differ in detail to 568 568 - address new problems or concerns. 569 569 - 570 570 - Each version is given a distinguishing version number. If the 571 571 - Program specifies that a certain numbered version of the GNU General 572 572 - Public License "or any later version" applies to it, you have the 573 573 - option of following the terms and conditions either of that numbered 574 574 - version or of any later version published by the Free Software 575 575 - Foundation. If the Program does not specify a version number of the 576 576 - GNU General Public License, you may choose any version ever published 577 577 - by the Free Software Foundation. 578 578 - 579 579 - If the Program specifies that a proxy can decide which future 580 580 - versions of the GNU General Public License can be used, that proxy's 581 581 - public statement of acceptance of a version permanently authorizes you 582 582 - to choose that version for the Program. 583 583 - 584 584 - Later license versions may give you additional or different 585 585 - permissions. However, no additional obligations are imposed on any 586 586 - author or copyright holder as a result of your choosing to follow a 587 587 - later version. 588 588 - 589 589 - 15. Disclaimer of Warranty. 590 590 - 591 591 - THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 592 - APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 593 - HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 594 - OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 595 - THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 596 - PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 597 - IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 598 - ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 599 - 600 600 - 16. Limitation of Liability. 601 601 - 602 602 - IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 603 - WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 604 - THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 605 - GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 606 - USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 607 - DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 608 - PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 609 - EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 610 - SUCH DAMAGES. 611 611 - 612 612 - 17. Interpretation of Sections 15 and 16. 613 613 - 614 614 - If the disclaimer of warranty and limitation of liability provided 615 615 - above cannot be given local legal effect according to their terms, 616 616 - reviewing courts shall apply local law that most closely approximates 617 617 - an absolute waiver of all civil liability in connection with the 618 618 - Program, unless a warranty or assumption of liability accompanies a 619 619 - copy of the Program in return for a fee. 620 620 - 621 621 - END OF TERMS AND CONDITIONS 622 622 - 623 623 - How to Apply These Terms to Your New Programs 624 624 - 625 625 - If you develop a new program, and you want it to be of the greatest 626 626 - possible use to the public, the best way to achieve this is to make it 627 627 - free software which everyone can redistribute and change under these terms. 628 628 - 629 629 - To do so, attach the following notices to the program. It is safest 630 630 - to attach them to the start of each source file to most effectively 631 631 - state the exclusion of warranty; and each file should have at least 632 632 - the "copyright" line and a pointer to where the full notice is found. 633 633 - 634 634 - <one line to give the program's name and a brief idea of what it does.> 635 635 - Copyright (C) <year> <name of author> 636 636 - 637 637 - This program is free software: you can redistribute it and/or modify 638 638 - it under the terms of the GNU General Public License as published by 639 639 - the Free Software Foundation, either version 3 of the License, or 640 640 - (at your option) any later version. 641 641 - 642 642 - This program is distributed in the hope that it will be useful, 643 643 - but WITHOUT ANY WARRANTY; without even the implied warranty of 644 644 - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 645 - GNU General Public License for more details. 646 646 - 647 647 - You should have received a copy of the GNU General Public License 648 648 - along with this program. If not, see <https://www.gnu.org/licenses/>. 649 649 - 650 650 - Also add information on how to contact you by electronic and paper mail. 651 651 - 652 652 - If the program does terminal interaction, make it output a short 653 653 - notice like this when it starts in an interactive mode: 654 654 - 655 655 - <program> Copyright (C) <year> <name of author> 656 656 - This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 657 - This is free software, and you are welcome to redistribute it 658 658 - under certain conditions; type `show c' for details. 659 659 - 660 660 - The hypothetical commands `show w' and `show c' should show the appropriate 661 661 - parts of the General Public License. Of course, your program's commands 662 662 - might be different; for a GUI interface, you would use an "about box". 663 663 - 664 664 - You should also get your employer (if you work as a programmer) or school, 665 665 - if any, to sign a "copyright disclaimer" for the program, if necessary. 666 666 - For more information on this, and how to apply and follow the GNU GPL, see 667 667 - <https://www.gnu.org/licenses/>. 668 668 - 669 669 - The GNU General Public License does not permit incorporating your program 670 670 - into proprietary programs. If your program is a subroutine library, you 671 671 - may consider it more useful to permit linking proprietary applications with 672 672 - the library. If this is what you want to do, use the GNU Lesser General 673 673 - Public License instead of this License. But first, please read 674 674 - <https://www.gnu.org/licenses/why-not-lgpl.html>. 1 1 + GNU GENERAL PUBLIC LICENSE 2 2 + Version 3, 29 June 2007 3 3 + 4 4 + Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/> 5 5 + Everyone is permitted to copy and distribute verbatim copies 6 6 + of this license document, but changing it is not allowed. 7 7 + 8 8 + Preamble 9 9 + 10 10 + The GNU General Public License is a free, copyleft license for 11 11 + software and other kinds of works. 12 12 + 13 13 + The licenses for most software and other practical works are designed 14 14 + to take away your freedom to share and change the works. By contrast, 15 15 + the GNU General Public License is intended to guarantee your freedom to 16 16 + share and change all versions of a program--to make sure it remains free 17 17 + software for all its users. We, the Free Software Foundation, use the 18 18 + GNU General Public License for most of our software; it applies also to 19 19 + any other work released this way by its authors. You can apply it to 20 20 + your programs, too. 21 21 + 22 22 + When we speak of free software, we are referring to freedom, not 23 23 + price. Our General Public Licenses are designed to make sure that you 24 24 + have the freedom to distribute copies of free software (and charge for 25 25 + them if you wish), that you receive source code or can get it if you 26 26 + want it, that you can change the software or use pieces of it in new 27 27 + free programs, and that you know you can do these things. 28 28 + 29 29 + To protect your rights, we need to prevent others from denying you 30 30 + these rights or asking you to surrender the rights. Therefore, you have 31 31 + certain responsibilities if you distribute copies of the software, or if 32 32 + you modify it: responsibilities to respect the freedom of others. 33 33 + 34 34 + For example, if you distribute copies of such a program, whether 35 35 + gratis or for a fee, you must pass on to the recipients the same 36 36 + freedoms that you received. You must make sure that they, too, receive 37 37 + or can get the source code. And you must show them these terms so they 38 38 + know their rights. 39 39 + 40 40 + Developers that use the GNU GPL protect your rights with two steps: 41 41 + (1) assert copyright on the software, and (2) offer you this License 42 42 + giving you legal permission to copy, distribute and/or modify it. 43 43 + 44 44 + For the developers' and authors' protection, the GPL clearly explains 45 45 + that there is no warranty for this free software. For both users' and 46 46 + authors' sake, the GPL requires that modified versions be marked as 47 47 + changed, so that their problems will not be attributed erroneously to 48 48 + authors of previous versions. 49 49 + 50 50 + Some devices are designed to deny users access to install or run 51 51 + modified versions of the software inside them, although the manufacturer 52 52 + can do so. This is fundamentally incompatible with the aim of 53 53 + protecting users' freedom to change the software. The systematic 54 54 + pattern of such abuse occurs in the area of products for individuals to 55 55 + use, which is precisely where it is most unacceptable. Therefore, we 56 56 + have designed this version of the GPL to prohibit the practice for those 57 57 + products. If such problems arise substantially in other domains, we 58 58 + stand ready to extend this provision to those domains in future versions 59 59 + of the GPL, as needed to protect the freedom of users. 60 60 + 61 61 + Finally, every program is threatened constantly by software patents. 62 62 + States should not allow patents to restrict development and use of 63 63 + software on general-purpose computers, but in those that do, we wish to 64 64 + avoid the special danger that patents applied to a free program could 65 65 + make it effectively proprietary. To prevent this, the GPL assures that 66 66 + patents cannot be used to render the program non-free. 67 67 + 68 68 + The precise terms and conditions for copying, distribution and 69 69 + modification follow. 70 70 + 71 71 + TERMS AND CONDITIONS 72 72 + 73 73 + 0. Definitions. 74 74 + 75 75 + "This License" refers to version 3 of the GNU General Public License. 76 76 + 77 77 + "Copyright" also means copyright-like laws that apply to other kinds of 78 78 + works, such as semiconductor masks. 79 79 + 80 80 + "The Program" refers to any copyrightable work licensed under this 81 81 + License. Each licensee is addressed as "you". "Licensees" and 82 82 + "recipients" may be individuals or organizations. 83 83 + 84 84 + To "modify" a work means to copy from or adapt all or part of the work 85 85 + in a fashion requiring copyright permission, other than the making of an 86 86 + exact copy. The resulting work is called a "modified version" of the 87 87 + earlier work or a work "based on" the earlier work. 88 88 + 89 89 + A "covered work" means either the unmodified Program or a work based 90 90 + on the Program. 91 91 + 92 92 + To "propagate" a work means to do anything with it that, without 93 93 + permission, would make you directly or secondarily liable for 94 94 + infringement under applicable copyright law, except executing it on a 95 95 + computer or modifying a private copy. Propagation includes copying, 96 96 + distribution (with or without modification), making available to the 97 97 + public, and in some countries other activities as well. 98 98 + 99 99 + To "convey" a work means any kind of propagation that enables other 100 100 + parties to make or receive copies. Mere interaction with a user through 101 101 + a computer network, with no transfer of a copy, is not conveying. 102 102 + 103 103 + An interactive user interface displays "Appropriate Legal Notices" 104 104 + to the extent that it includes a convenient and prominently visible 105 105 + feature that (1) displays an appropriate copyright notice, and (2) 106 106 + tells the user that there is no warranty for the work (except to the 107 107 + extent that warranties are provided), that licensees may convey the 108 108 + work under this License, and how to view a copy of this License. If 109 109 + the interface presents a list of user commands or options, such as a 110 110 + menu, a prominent item in the list meets this criterion. 111 111 + 112 112 + 1. Source Code. 113 113 + 114 114 + The "source code" for a work means the preferred form of the work 115 115 + for making modifications to it. "Object code" means any non-source 116 116 + form of a work. 117 117 + 118 118 + A "Standard Interface" means an interface that either is an official 119 119 + standard defined by a recognized standards body, or, in the case of 120 120 + interfaces specified for a particular programming language, one that 121 121 + is widely used among developers working in that language. 122 122 + 123 123 + The "System Libraries" of an executable work include anything, other 124 124 + than the work as a whole, that (a) is included in the normal form of 125 125 + packaging a Major Component, but which is not part of that Major 126 126 + Component, and (b) serves only to enable use of the work with that 127 127 + Major Component, or to implement a Standard Interface for which an 128 128 + implementation is available to the public in source code form. A 129 129 + "Major Component", in this context, means a major essential component 130 130 + (kernel, window system, and so on) of the specific operating system 131 131 + (if any) on which the executable work runs, or a compiler used to 132 132 + produce the work, or an object code interpreter used to run it. 133 133 + 134 134 + The "Corresponding Source" for a work in object code form means all 135 135 + the source code needed to generate, install, and (for an executable 136 136 + work) run the object code and to modify the work, including scripts to 137 137 + control those activities. However, it does not include the work's 138 138 + System Libraries, or general-purpose tools or generally available free 139 139 + programs which are used unmodified in performing those activities but 140 140 + which are not part of the work. For example, Corresponding Source 141 141 + includes interface definition files associated with source files for 142 142 + the work, and the source code for shared libraries and dynamically 143 143 + linked subprograms that the work is specifically designed to require, 144 144 + such as by intimate data communication or control flow between those 145 145 + subprograms and other parts of the work. 146 146 + 147 147 + The Corresponding Source need not include anything that users 148 148 + can regenerate automatically from other parts of the Corresponding 149 149 + Source. 150 150 + 151 151 + The Corresponding Source for a work in source code form is that 152 152 + same work. 153 153 + 154 154 + 2. Basic Permissions. 155 155 + 156 156 + All rights granted under this License are granted for the term of 157 157 + copyright on the Program, and are irrevocable provided the stated 158 158 + conditions are met. This License explicitly affirms your unlimited 159 159 + permission to run the unmodified Program. The output from running a 160 160 + covered work is covered by this License only if the output, given its 161 161 + content, constitutes a covered work. This License acknowledges your 162 162 + rights of fair use or other equivalent, as provided by copyright law. 163 163 + 164 164 + You may make, run and propagate covered works that you do not 165 165 + convey, without conditions so long as your license otherwise remains 166 166 + in force. You may convey covered works to others for the sole purpose 167 167 + of having them make modifications exclusively for you, or provide you 168 168 + with facilities for running those works, provided that you comply with 169 169 + the terms of this License in conveying all material for which you do 170 170 + not control copyright. Those thus making or running the covered works 171 171 + for you must do so exclusively on your behalf, under your direction 172 172 + and control, on terms that prohibit them from making any copies of 173 173 + your copyrighted material outside their relationship with you. 174 174 + 175 175 + Conveying under any other circumstances is permitted solely under 176 176 + the conditions stated below. Sublicensing is not allowed; section 10 177 177 + makes it unnecessary. 178 178 + 179 179 + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 180 + 181 181 + No covered work shall be deemed part of an effective technological 182 182 + measure under any applicable law fulfilling obligations under article 183 183 + 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 184 + similar laws prohibiting or restricting circumvention of such 185 185 + measures. 186 186 + 187 187 + When you convey a covered work, you waive any legal power to forbid 188 188 + circumvention of technological measures to the extent such circumvention 189 189 + is effected by exercising rights under this License with respect to 190 190 + the covered work, and you disclaim any intention to limit operation or 191 191 + modification of the work as a means of enforcing, against the work's 192 192 + users, your or third parties' legal rights to forbid circumvention of 193 193 + technological measures. 194 194 + 195 195 + 4. Conveying Verbatim Copies. 196 196 + 197 197 + You may convey verbatim copies of the Program's source code as you 198 198 + receive it, in any medium, provided that you conspicuously and 199 199 + appropriately publish on each copy an appropriate copyright notice; 200 200 + keep intact all notices stating that this License and any 201 201 + non-permissive terms added in accord with section 7 apply to the code; 202 202 + keep intact all notices of the absence of any warranty; and give all 203 203 + recipients a copy of this License along with the Program. 204 204 + 205 205 + You may charge any price or no price for each copy that you convey, 206 206 + and you may offer support or warranty protection for a fee. 207 207 + 208 208 + 5. Conveying Modified Source Versions. 209 209 + 210 210 + You may convey a work based on the Program, or the modifications to 211 211 + produce it from the Program, in the form of source code under the 212 212 + terms of section 4, provided that you also meet all of these conditions: 213 213 + 214 214 + a) The work must carry prominent notices stating that you modified 215 215 + it, and giving a relevant date. 216 216 + 217 217 + b) The work must carry prominent notices stating that it is 218 218 + released under this License and any conditions added under section 219 219 + 7. This requirement modifies the requirement in section 4 to 220 220 + "keep intact all notices". 221 221 + 222 222 + c) You must license the entire work, as a whole, under this 223 223 + License to anyone who comes into possession of a copy. This 224 224 + License will therefore apply, along with any applicable section 7 225 225 + additional terms, to the whole of the work, and all its parts, 226 226 + regardless of how they are packaged. This License gives no 227 227 + permission to license the work in any other way, but it does not 228 228 + invalidate such permission if you have separately received it. 229 229 + 230 230 + d) If the work has interactive user interfaces, each must display 231 231 + Appropriate Legal Notices; however, if the Program has interactive 232 232 + interfaces that do not display Appropriate Legal Notices, your 233 233 + work need not make them do so. 234 234 + 235 235 + A compilation of a covered work with other separate and independent 236 236 + works, which are not by their nature extensions of the covered work, 237 237 + and which are not combined with it such as to form a larger program, 238 238 + in or on a volume of a storage or distribution medium, is called an 239 239 + "aggregate" if the compilation and its resulting copyright are not 240 240 + used to limit the access or legal rights of the compilation's users 241 241 + beyond what the individual works permit. Inclusion of a covered work 242 242 + in an aggregate does not cause this License to apply to the other 243 243 + parts of the aggregate. 244 244 + 245 245 + 6. Conveying Non-Source Forms. 246 246 + 247 247 + You may convey a covered work in object code form under the terms 248 248 + of sections 4 and 5, provided that you also convey the 249 249 + machine-readable Corresponding Source under the terms of this License, 250 250 + in one of these ways: 251 251 + 252 252 + a) Convey the object code in, or embodied in, a physical product 253 253 + (including a physical distribution medium), accompanied by the 254 254 + Corresponding Source fixed on a durable physical medium 255 255 + customarily used for software interchange. 256 256 + 257 257 + b) Convey the object code in, or embodied in, a physical product 258 258 + (including a physical distribution medium), accompanied by a 259 259 + written offer, valid for at least three years and valid for as 260 260 + long as you offer spare parts or customer support for that product 261 261 + model, to give anyone who possesses the object code either (1) a 262 262 + copy of the Corresponding Source for all the software in the 263 263 + product that is covered by this License, on a durable physical 264 264 + medium customarily used for software interchange, for a price no 265 265 + more than your reasonable cost of physically performing this 266 266 + conveying of source, or (2) access to copy the 267 267 + Corresponding Source from a network server at no charge. 268 268 + 269 269 + c) Convey individual copies of the object code with a copy of the 270 270 + written offer to provide the Corresponding Source. This 271 271 + alternative is allowed only occasionally and noncommercially, and 272 272 + only if you received the object code with such an offer, in accord 273 273 + with subsection 6b. 274 274 + 275 275 + d) Convey the object code by offering access from a designated 276 276 + place (gratis or for a charge), and offer equivalent access to the 277 277 + Corresponding Source in the same way through the same place at no 278 278 + further charge. You need not require recipients to copy the 279 279 + Corresponding Source along with the object code. If the place to 280 280 + copy the object code is a network server, the Corresponding Source 281 281 + may be on a different server (operated by you or a third party) 282 282 + that supports equivalent copying facilities, provided you maintain 283 283 + clear directions next to the object code saying where to find the 284 284 + Corresponding Source. Regardless of what server hosts the 285 285 + Corresponding Source, you remain obligated to ensure that it is 286 286 + available for as long as needed to satisfy these requirements. 287 287 + 288 288 + e) Convey the object code using peer-to-peer transmission, provided 289 289 + you inform other peers where the object code and Corresponding 290 290 + Source of the work are being offered to the general public at no 291 291 + charge under subsection 6d. 292 292 + 293 293 + A separable portion of the object code, whose source code is excluded 294 294 + from the Corresponding Source as a System Library, need not be 295 295 + included in conveying the object code work. 296 296 + 297 297 + A "User Product" is either (1) a "consumer product", which means any 298 298 + tangible personal property which is normally used for personal, family, 299 299 + or household purposes, or (2) anything designed or sold for incorporation 300 300 + into a dwelling. In determining whether a product is a consumer product, 301 301 + doubtful cases shall be resolved in favor of coverage. For a particular 302 302 + product received by a particular user, "normally used" refers to a 303 303 + typical or common use of that class of product, regardless of the status 304 304 + of the particular user or of the way in which the particular user 305 305 + actually uses, or expects or is expected to use, the product. A product 306 306 + is a consumer product regardless of whether the product has substantial 307 307 + commercial, industrial or non-consumer uses, unless such uses represent 308 308 + the only significant mode of use of the product. 309 309 + 310 310 + "Installation Information" for a User Product means any methods, 311 311 + procedures, authorization keys, or other information required to install 312 312 + and execute modified versions of a covered work in that User Product from 313 313 + a modified version of its Corresponding Source. The information must 314 314 + suffice to ensure that the continued functioning of the modified object 315 315 + code is in no case prevented or interfered with solely because 316 316 + modification has been made. 317 317 + 318 318 + If you convey an object code work under this section in, or with, or 319 319 + specifically for use in, a User Product, and the conveying occurs as 320 320 + part of a transaction in which the right of possession and use of the 321 321 + User Product is transferred to the recipient in perpetuity or for a 322 322 + fixed term (regardless of how the transaction is characterized), the 323 323 + Corresponding Source conveyed under this section must be accompanied 324 324 + by the Installation Information. But this requirement does not apply 325 325 + if neither you nor any third party retains the ability to install 326 326 + modified object code on the User Product (for example, the work has 327 327 + been installed in ROM). 328 328 + 329 329 + The requirement to provide Installation Information does not include a 330 330 + requirement to continue to provide support service, warranty, or updates 331 331 + for a work that has been modified or installed by the recipient, or for 332 332 + the User Product in which it has been modified or installed. Access to a 333 333 + network may be denied when the modification itself materially and 334 334 + adversely affects the operation of the network or violates the rules and 335 335 + protocols for communication across the network. 336 336 + 337 337 + Corresponding Source conveyed, and Installation Information provided, 338 338 + in accord with this section must be in a format that is publicly 339 339 + documented (and with an implementation available to the public in 340 340 + source code form), and must require no special password or key for 341 341 + unpacking, reading or copying. 342 342 + 343 343 + 7. Additional Terms. 344 344 + 345 345 + "Additional permissions" are terms that supplement the terms of this 346 346 + License by making exceptions from one or more of its conditions. 347 347 + Additional permissions that are applicable to the entire Program shall 348 348 + be treated as though they were included in this License, to the extent 349 349 + that they are valid under applicable law. If additional permissions 350 350 + apply only to part of the Program, that part may be used separately 351 351 + under those permissions, but the entire Program remains governed by 352 352 + this License without regard to the additional permissions. 353 353 + 354 354 + When you convey a copy of a covered work, you may at your option 355 355 + remove any additional permissions from that copy, or from any part of 356 356 + it. (Additional permissions may be written to require their own 357 357 + removal in certain cases when you modify the work.) You may place 358 358 + additional permissions on material, added by you to a covered work, 359 359 + for which you have or can give appropriate copyright permission. 360 360 + 361 361 + Notwithstanding any other provision of this License, for material you 362 362 + add to a covered work, you may (if authorized by the copyright holders of 363 363 + that material) supplement the terms of this License with terms: 364 364 + 365 365 + a) Disclaiming warranty or limiting liability differently from the 366 366 + terms of sections 15 and 16 of this License; or 367 367 + 368 368 + b) Requiring preservation of specified reasonable legal notices or 369 369 + author attributions in that material or in the Appropriate Legal 370 370 + Notices displayed by works containing it; or 371 371 + 372 372 + c) Prohibiting misrepresentation of the origin of that material, or 373 373 + requiring that modified versions of such material be marked in 374 374 + reasonable ways as different from the original version; or 375 375 + 376 376 + d) Limiting the use for publicity purposes of names of licensors or 377 377 + authors of the material; or 378 378 + 379 379 + e) Declining to grant rights under trademark law for use of some 380 380 + trade names, trademarks, or service marks; or 381 381 + 382 382 + f) Requiring indemnification of licensors and authors of that 383 383 + material by anyone who conveys the material (or modified versions of 384 384 + it) with contractual assumptions of liability to the recipient, for 385 385 + any liability that these contractual assumptions directly impose on 386 386 + those licensors and authors. 387 387 + 388 388 + All other non-permissive additional terms are considered "further 389 389 + restrictions" within the meaning of section 10. If the Program as you 390 390 + received it, or any part of it, contains a notice stating that it is 391 391 + governed by this License along with a term that is a further 392 392 + restriction, you may remove that term. If a license document contains 393 393 + a further restriction but permits relicensing or conveying under this 394 394 + License, you may add to a covered work material governed by the terms 395 395 + of that license document, provided that the further restriction does 396 396 + not survive such relicensing or conveying. 397 397 + 398 398 + If you add terms to a covered work in accord with this section, you 399 399 + must place, in the relevant source files, a statement of the 400 400 + additional terms that apply to those files, or a notice indicating 401 401 + where to find the applicable terms. 402 402 + 403 403 + Additional terms, permissive or non-permissive, may be stated in the 404 404 + form of a separately written license, or stated as exceptions; 405 405 + the above requirements apply either way. 406 406 + 407 407 + 8. Termination. 408 408 + 409 409 + You may not propagate or modify a covered work except as expressly 410 410 + provided under this License. Any attempt otherwise to propagate or 411 411 + modify it is void, and will automatically terminate your rights under 412 412 + this License (including any patent licenses granted under the third 413 413 + paragraph of section 11). 414 414 + 415 415 + However, if you cease all violation of this License, then your 416 416 + license from a particular copyright holder is reinstated (a) 417 417 + provisionally, unless and until the copyright holder explicitly and 418 418 + finally terminates your license, and (b) permanently, if the copyright 419 419 + holder fails to notify you of the violation by some reasonable means 420 420 + prior to 60 days after the cessation. 421 421 + 422 422 + Moreover, your license from a particular copyright holder is 423 423 + reinstated permanently if the copyright holder notifies you of the 424 424 + violation by some reasonable means, this is the first time you have 425 425 + received notice of violation of this License (for any work) from that 426 426 + copyright holder, and you cure the violation prior to 30 days after 427 427 + your receipt of the notice. 428 428 + 429 429 + Termination of your rights under this section does not terminate the 430 430 + licenses of parties who have received copies or rights from you under 431 431 + this License. If your rights have been terminated and not permanently 432 432 + reinstated, you do not qualify to receive new licenses for the same 433 433 + material under section 10. 434 434 + 435 435 + 9. Acceptance Not Required for Having Copies. 436 436 + 437 437 + You are not required to accept this License in order to receive or 438 438 + run a copy of the Program. Ancillary propagation of a covered work 439 439 + occurring solely as a consequence of using peer-to-peer transmission 440 440 + to receive a copy likewise does not require acceptance. However, 441 441 + nothing other than this License grants you permission to propagate or 442 442 + modify any covered work. These actions infringe copyright if you do 443 443 + not accept this License. Therefore, by modifying or propagating a 444 444 + covered work, you indicate your acceptance of this License to do so. 445 445 + 446 446 + 10. Automatic Licensing of Downstream Recipients. 447 447 + 448 448 + Each time you convey a covered work, the recipient automatically 449 449 + receives a license from the original licensors, to run, modify and 450 450 + propagate that work, subject to this License. You are not responsible 451 451 + for enforcing compliance by third parties with this License. 452 452 + 453 453 + An "entity transaction" is a transaction transferring control of an 454 454 + organization, or substantially all assets of one, or subdividing an 455 455 + organization, or merging organizations. If propagation of a covered 456 456 + work results from an entity transaction, each party to that 457 457 + transaction who receives a copy of the work also receives whatever 458 458 + licenses to the work the party's predecessor in interest had or could 459 459 + give under the previous paragraph, plus a right to possession of the 460 460 + Corresponding Source of the work from the predecessor in interest, if 461 461 + the predecessor has it or can get it with reasonable efforts. 462 462 + 463 463 + You may not impose any further restrictions on the exercise of the 464 464 + rights granted or affirmed under this License. For example, you may 465 465 + not impose a license fee, royalty, or other charge for exercise of 466 466 + rights granted under this License, and you may not initiate litigation 467 467 + (including a cross-claim or counterclaim in a lawsuit) alleging that 468 468 + any patent claim is infringed by making, using, selling, offering for 469 469 + sale, or importing the Program or any portion of it. 470 470 + 471 471 + 11. Patents. 472 472 + 473 473 + A "contributor" is a copyright holder who authorizes use under this 474 474 + License of the Program or a work on which the Program is based. The 475 475 + work thus licensed is called the contributor's "contributor version". 476 476 + 477 477 + A contributor's "essential patent claims" are all patent claims 478 478 + owned or controlled by the contributor, whether already acquired or 479 479 + hereafter acquired, that would be infringed by some manner, permitted 480 480 + by this License, of making, using, or selling its contributor version, 481 481 + but do not include claims that would be infringed only as a 482 482 + consequence of further modification of the contributor version. For 483 483 + purposes of this definition, "control" includes the right to grant 484 484 + patent sublicenses in a manner consistent with the requirements of 485 485 + this License. 486 486 + 487 487 + Each contributor grants you a non-exclusive, worldwide, royalty-free 488 488 + patent license under the contributor's essential patent claims, to 489 489 + make, use, sell, offer for sale, import and otherwise run, modify and 490 490 + propagate the contents of its contributor version. 491 491 + 492 492 + In the following three paragraphs, a "patent license" is any express 493 493 + agreement or commitment, however denominated, not to enforce a patent 494 494 + (such as an express permission to practice a patent or covenant not to 495 495 + sue for patent infringement). To "grant" such a patent license to a 496 496 + party means to make such an agreement or commitment not to enforce a 497 497 + patent against the party. 498 498 + 499 499 + If you convey a covered work, knowingly relying on a patent license, 500 500 + and the Corresponding Source of the work is not available for anyone 501 501 + to copy, free of charge and under the terms of this License, through a 502 502 + publicly available network server or other readily accessible means, 503 503 + then you must either (1) cause the Corresponding Source to be so 504 504 + available, or (2) arrange to deprive yourself of the benefit of the 505 505 + patent license for this particular work, or (3) arrange, in a manner 506 506 + consistent with the requirements of this License, to extend the patent 507 507 + license to downstream recipients. "Knowingly relying" means you have 508 508 + actual knowledge that, but for the patent license, your conveying the 509 509 + covered work in a country, or your recipient's use of the covered work 510 510 + in a country, would infringe one or more identifiable patents in that 511 511 + country that you have reason to believe are valid. 512 512 + 513 513 + If, pursuant to or in connection with a single transaction or 514 514 + arrangement, you convey, or propagate by procuring conveyance of, a 515 515 + covered work, and grant a patent license to some of the parties 516 516 + receiving the covered work authorizing them to use, propagate, modify 517 517 + or convey a specific copy of the covered work, then the patent license 518 518 + you grant is automatically extended to all recipients of the covered 519 519 + work and works based on it. 520 520 + 521 521 + A patent license is "discriminatory" if it does not include within 522 522 + the scope of its coverage, prohibits the exercise of, or is 523 523 + conditioned on the non-exercise of one or more of the rights that are 524 524 + specifically granted under this License. You may not convey a covered 525 525 + work if you are a party to an arrangement with a third party that is 526 526 + in the business of distributing software, under which you make payment 527 527 + to the third party based on the extent of your activity of conveying 528 528 + the work, and under which the third party grants, to any of the 529 529 + parties who would receive the covered work from you, a discriminatory 530 530 + patent license (a) in connection with copies of the covered work 531 531 + conveyed by you (or copies made from those copies), or (b) primarily 532 532 + for and in connection with specific products or compilations that 533 533 + contain the covered work, unless you entered into that arrangement, 534 534 + or that patent license was granted, prior to 28 March 2007. 535 535 + 536 536 + Nothing in this License shall be construed as excluding or limiting 537 537 + any implied license or other defenses to infringement that may 538 538 + otherwise be available to you under applicable patent law. 539 539 + 540 540 + 12. No Surrender of Others' Freedom. 541 541 + 542 542 + If conditions are imposed on you (whether by court order, agreement or 543 543 + otherwise) that contradict the conditions of this License, they do not 544 544 + excuse you from the conditions of this License. If you cannot convey a 545 545 + covered work so as to satisfy simultaneously your obligations under this 546 546 + License and any other pertinent obligations, then as a consequence you may 547 547 + not convey it at all. For example, if you agree to terms that obligate you 548 548 + to collect a royalty for further conveying from those to whom you convey 549 549 + the Program, the only way you could satisfy both those terms and this 550 550 + License would be to refrain entirely from conveying the Program. 551 551 + 552 552 + 13. Use with the GNU Affero General Public License. 553 553 + 554 554 + Notwithstanding any other provision of this License, you have 555 555 + permission to link or combine any covered work with a work licensed 556 556 + under version 3 of the GNU Affero General Public License into a single 557 557 + combined work, and to convey the resulting work. The terms of this 558 558 + License will continue to apply to the part which is the covered work, 559 559 + but the special requirements of the GNU Affero General Public License, 560 560 + section 13, concerning interaction through a network will apply to the 561 561 + combination as such. 562 562 + 563 563 + 14. Revised Versions of this License. 564 564 + 565 565 + The Free Software Foundation may publish revised and/or new versions of 566 566 + the GNU General Public License from time to time. Such new versions will 567 567 + be similar in spirit to the present version, but may differ in detail to 568 568 + address new problems or concerns. 569 569 + 570 570 + Each version is given a distinguishing version number. If the 571 571 + Program specifies that a certain numbered version of the GNU General 572 572 + Public License "or any later version" applies to it, you have the 573 573 + option of following the terms and conditions either of that numbered 574 574 + version or of any later version published by the Free Software 575 575 + Foundation. If the Program does not specify a version number of the 576 576 + GNU General Public License, you may choose any version ever published 577 577 + by the Free Software Foundation. 578 578 + 579 579 + If the Program specifies that a proxy can decide which future 580 580 + versions of the GNU General Public License can be used, that proxy's 581 581 + public statement of acceptance of a version permanently authorizes you 582 582 + to choose that version for the Program. 583 583 + 584 584 + Later license versions may give you additional or different 585 585 + permissions. However, no additional obligations are imposed on any 586 586 + author or copyright holder as a result of your choosing to follow a 587 587 + later version. 588 588 + 589 589 + 15. Disclaimer of Warranty. 590 590 + 591 591 + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 592 + APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 593 + HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 594 + OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 595 + THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 596 + PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 597 + IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 598 + ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 599 + 600 600 + 16. Limitation of Liability. 601 601 + 602 602 + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 603 + WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 604 + THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 605 + GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 606 + USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 607 + DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 608 + PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 609 + EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 610 + SUCH DAMAGES. 611 611 + 612 612 + 17. Interpretation of Sections 15 and 16. 613 613 + 614 614 + If the disclaimer of warranty and limitation of liability provided 615 615 + above cannot be given local legal effect according to their terms, 616 616 + reviewing courts shall apply local law that most closely approximates 617 617 + an absolute waiver of all civil liability in connection with the 618 618 + Program, unless a warranty or assumption of liability accompanies a 619 619 + copy of the Program in return for a fee. 620 620 + 621 621 + END OF TERMS AND CONDITIONS 622 622 + 623 623 + How to Apply These Terms to Your New Programs 624 624 + 625 625 + If you develop a new program, and you want it to be of the greatest 626 626 + possible use to the public, the best way to achieve this is to make it 627 627 + free software which everyone can redistribute and change under these terms. 628 628 + 629 629 + To do so, attach the following notices to the program. It is safest 630 630 + to attach them to the start of each source file to most effectively 631 631 + state the exclusion of warranty; and each file should have at least 632 632 + the "copyright" line and a pointer to where the full notice is found. 633 633 + 634 634 + <one line to give the program's name and a brief idea of what it does.> 635 635 + Copyright (C) <year> <name of author> 636 636 + 637 637 + This program is free software: you can redistribute it and/or modify 638 638 + it under the terms of the GNU General Public License as published by 639 639 + the Free Software Foundation, either version 3 of the License, or 640 640 + (at your option) any later version. 641 641 + 642 642 + This program is distributed in the hope that it will be useful, 643 643 + but WITHOUT ANY WARRANTY; without even the implied warranty of 644 644 + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 645 + GNU General Public License for more details. 646 646 + 647 647 + You should have received a copy of the GNU General Public License 648 648 + along with this program. If not, see <https://www.gnu.org/licenses/>. 649 649 + 650 650 + Also add information on how to contact you by electronic and paper mail. 651 651 + 652 652 + If the program does terminal interaction, make it output a short 653 653 + notice like this when it starts in an interactive mode: 654 654 + 655 655 + <program> Copyright (C) <year> <name of author> 656 656 + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 657 + This is free software, and you are welcome to redistribute it 658 658 + under certain conditions; type `show c' for details. 659 659 + 660 660 + The hypothetical commands `show w' and `show c' should show the appropriate 661 661 + parts of the General Public License. Of course, your program's commands 662 662 + might be different; for a GUI interface, you would use an "about box". 663 663 + 664 664 + You should also get your employer (if you work as a programmer) or school, 665 665 + if any, to sign a "copyright disclaimer" for the program, if necessary. 666 666 + For more information on this, and how to apply and follow the GNU GPL, see 667 667 + <https://www.gnu.org/licenses/>. 668 668 + 669 669 + The GNU General Public License does not permit incorporating your program 670 670 + into proprietary programs. If your program is a subroutine library, you 671 671 + may consider it more useful to permit linking proprietary applications with 672 672 + the library. If this is what you want to do, use the GNU Lesser General 673 673 + Public License instead of this License. But first, please read 674 674 + <https://www.gnu.org/licenses/why-not-lgpl.html>.

+36

README.md

··· 1 1 + # Solitaire CE 2 2 + 3 3 + This is a card solitaire game for the TI-84 Plus CE and TI-83 Premium CE. 4 4 + 5 5 + ## Roadmap 6 6 + 7 7 + This branch is still heavily under development! Check back later for more information. 8 8 + 9 9 + ## Dependencies 10 10 + 11 11 + This program requires [LibLoad and the CE C libraries](https://tiny.cc/clibs) to be installed on the calculator. It also requires a linking program such as [TiLP](http://lpg.ticalc.org/prj_tilp/) to be loaded onto the device. 12 12 + 13 13 + ## Development 14 14 + 15 15 + Building this project requires the [CEdev toolchain](https://ce-programming.github.io/toolchain/static/getting-started.html). It can be built by running: 16 16 + 17 17 + ``` 18 18 + $ make gfx 19 19 + $ make 20 20 + ``` 21 21 + 22 22 + ## Licensing 23 23 + 24 24 + This program is free software: you can redistribute it and/or modify 25 25 + it under the terms of the GNU General Public License as published by 26 26 + the Free Software Foundation, either version 3 of the License, or 27 27 + at your option) any later version. 28 28 + 29 29 + This program is distributed in the hope that it will be useful, 30 30 + but WITHOUT ANY WARRANTY; without even the implied warranty of 31 31 + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 32 32 + GNU General Public License for more details. 33 33 + 34 34 + You should have received a copy of the GNU General Public License 35 35 + along with this program. If not, see <https://www.gnu.org/licenses/>. 36 36 +

-76

README.txt

··· 1 1 - ========================================================================== 2 2 - 3 3 - as designed by Zachtronics 4 4 - 5 5 - KABUFUDA SOLITAIRE 6 6 - 7 7 - art and code by euphory for the TI-84 Plus CE 8 8 - 9 9 - source public at https://github.com/ariajd27/kabufuda-solitaire-ti84plusce 10 10 - 11 11 - ========================================================================== 12 12 - 13 13 - === Rules === 14 14 - 15 15 - Identical cards may be stacked on each other (in the tableau) and moved 16 16 - as a group. If all four copies of a card are stacked directly on the 17 17 - table, they collapse and become immovable. There are also four free 18 18 - cells, which can each hold either a single card or a collapsed stack. 19 19 - Only one free cell starts out accessible; every stack collapsed in the 20 20 - tableau will unlock one of the others. 21 21 - 22 22 - Collapse all the cards into ten stacks to win! Victory is indicated by 23 23 - text at the top of the screen and the fact that all cards have been 24 24 - collapsed. At this point, the game may be exited with ON or restarted 25 25 - with ENTER. 26 26 - 27 27 - Pressing ON mid-game will save and exit. To reset, press DEL. You will 28 28 - probably do this frequently; it is easy to find yourself in an 29 29 - unwinnable state. 30 30 - 31 31 - === Controls === 32 32 - 33 33 - - arrow keys to move the cursor 34 34 - - 2ND or ENTER to select cards to be moved, or once selected, to move 35 35 - those cards to the cursor position 36 36 - - ALPHA or CLEAR to abandon placement 37 37 - - DEL at any time to restart the game 38 38 - - ON at any time to exit the program 39 39 - 40 40 - Stacks wrap around. To get to the free cells, go further left than 41 41 - the leftmost tableau stack, or further right than the rightmost. 42 42 - 43 43 - === Installation === 44 44 - 45 45 - Use TILP or any other linking program to put KBFDSLTR.8xg on your 46 46 - TI-84 Plus CE. If updating from a previous version, make sure to update 47 47 - KBFDSLTR, but overwriting KBFDGFX is unnecessary. 48 48 - 49 49 - This is an ASM program, so it must be run using the "Asm(" token found 50 50 - in the first page of the catalog (2nd+0). If your calculator does not 51 51 - have an "Asm(" token, consider using something like arTIfice. 52 52 - 53 53 - === Memory Usage === 54 54 - 55 55 - RAM: 6071 B 56 56 - - KBFDSLTR: 5968 B 57 57 - - KBFDSAVE: 85 B 58 58 - - KBFDWINS: 18 B 59 59 - 60 60 - ARC: 15126 B 61 61 - - KBFDGFX: 15126 B 62 62 - 63 63 - === License === 64 64 - 65 65 - This program is free software: you can redistribute it and/or modify 66 66 - it under the terms of the GNU General Public License as published by 67 67 - the Free Software Foundation, either version 3 of the License, or 68 68 - (at your option) any later version. 69 69 - 70 70 - This program is distributed in the hope that it will be useful, 71 71 - but WITHOUT ANY WARRANTY; without even the implied warranty of 72 72 - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 73 73 - GNU General Public License for more details. 74 74 - 75 75 - You should have received a copy of the GNU General Public License 76 76 - along with this program. If not, see <https://www.gnu.org/licenses/>.

icon.png

This is a binary file and will not be displayed.

kbfdsltr.png

This is a binary file and will not be displayed.

+15 -19

makefile

··· 1 1 - # ---------------------------- 2 2 - # Makefile Options 3 3 - # ---------------------------- 4 4 - 5 5 - NAME = KBFDSLTR 6 6 - ICON = icon.png 7 7 - DESCRIPTION = "Zachtronics's Kabufuda Solitaire" 8 8 - COMPRESSED = NO 9 9 - ARCHIVED = NO 10 10 - 11 11 - CFLAGS = -Wall -Wextra -Oz 12 12 - CXXFLAGS = -Wall -Wextra -Oz 13 13 - 14 14 - # ---------------------------- 15 15 - 16 16 - include $(shell cedev-config --makefile) 17 17 - 18 18 - group:: 19 19 - convbin -j 8x -i src/gfx/KBFDGFX.8xv -i bin/KBFDSLTR.8xp -k 8xg-auto-extract -o bin/KBFDSLTR.8xg -n KBFDSLTR 1 1 + # ---------------------------- 2 2 + # Makefile Options 3 3 + # ---------------------------- 4 4 + 5 5 + NAME = CALCSLTR 6 6 + DESCRIPTION = "Calculation Solitaire" 7 7 + COMPRESSED = NO 8 8 + ARCHIVED = NO 9 9 + 10 10 + CFLAGS = -Wall -Wextra -Oz 11 11 + CXXFLAGS = -Wall -Wextra -Oz 12 12 + 13 13 + # ---------------------------- 14 14 + 15 15 + include $(shell cedev-config --makefile)

+47

src/card.c

··· 1 1 + #include "card.h" 2 2 + #include <stdlib.h> 3 3 + 4 4 + stack_t *stacks; 5 5 + uint8_t num_stacks; 6 6 + uint8_t next_stack; 7 7 + 8 8 + uint8_t alloc_stacks(uint8_t num) 9 9 + { 10 10 + num_stacks = num; 11 11 + stacks = malloc(num_stacks * sizeof(stack_t)); 12 12 + if (stacks == NULL) return 1; 13 13 + 14 14 + next_stack = 0; 15 15 + return 0; 16 16 + } 17 17 + 18 18 + uint8_t make_stack( 19 19 + uint8_t type, uint8_t max_cards, uint24_t x, 20 20 + uint8_t y, int8_t dx, int8_t dy 21 21 + ) { 22 22 + card_t *cards = malloc(max_cards * sizeof(card_t)); 23 23 + if (cards == NULL) return 1; 24 24 + 25 25 + stacks[next_stack].type = type; 26 26 + stacks[next_stack].cards = cards; 27 27 + stacks[next_stack].max_cards = max_cards; 28 28 + stacks[next_stack].x = x; 29 29 + stacks[next_stack].y = y; 30 30 + stacks[next_stack].dx = dx; 31 31 + stacks[next_stack].dy = dy; 32 32 + 33 33 + next_stack++; 34 34 + 35 35 + return 0; 36 36 + } 37 37 + 38 38 + void free_stacks() 39 39 + { 40 40 + for (uint8_t i = 0; i < num_stacks; i++) 41 41 + { 42 42 + free(stacks[i].cards); 43 43 + } 44 44 + 45 45 + free(stacks); 46 46 + } 47 47 +

+31

src/card.h

··· 1 1 + #ifndef CARD_H 2 2 + #define CARD_H 3 3 + 4 4 + #include <stdint.h> 5 5 + 6 6 + typedef uint8_t card_t; 7 7 + #define EMPTY_CARD 0x00 8 8 + #define EXISTS(card) (card & 0x80) 9 9 + #define SUIT(card) ((card & 0x30) >> 4) 10 10 + #define IS_RED(card) (card & 0x20) 11 11 + #define NUMBER(card) (card & 0x0f) 12 12 + 13 13 + typedef struct { 14 14 + uint8_t type; 15 15 + uint24_t x; 16 16 + uint8_t y; 17 17 + int8_t dx; 18 18 + int8_t dy; 19 19 + card_t *cards; 20 20 + uint8_t max_cards; 21 21 + } stack_t; 22 22 + 23 23 + extern stack_t *stacks; 24 24 + extern uint8_t num_stacks; 25 25 + 26 26 + uint8_t alloc_stacks(uint8_t num_stacks); 27 27 + uint8_t make_stack(uint8_t type, uint8_t max_cards, uint24_t x, 28 28 + uint8_t y, int8_t dx, int8_t dy); 29 29 + void free_stacks(); 30 30 + 31 31 + #endif

+138 -143

src/drawing.c

··· 1 1 - // Kabufuda Solitaire / KBFDSLTR for the TI-84 Plus CE 2 2 - // Copyright (C) 2024 euphory 3 3 - // 4 4 - // This program is free software: you can redistribute it and/or modify 5 5 - // it under the terms of the GNU General Public License as published by 6 6 - // the Free Software Foundation, either version 3 of the License, or 7 7 - // (at your option) any later version. 8 8 - // 9 9 - // This program is distributed in the hope that it will be useful, 10 10 - // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 11 - // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 12 - // GNU General Public License for more details. 13 13 - // 14 14 - // You should have received a copy of the GNU General Public License 15 15 - // along with this program. If not, see <https://www.gnu.org/licenses/>. 16 16 - 17 1 #include "drawing.h" 18 18 - 19 19 - #include <graphx.h> 20 20 - #include <time.h> 21 2 #include "gfx/gfx.h" 22 22 - #include "variables.h" 3 3 + #include "card.h" 4 4 + #include <graphx.h> 23 5 24 24 - #define DEAL_ANIM_DECK_X ((GFX_LCD_WIDTH - CARD_WIDTH) / 2) 25 25 - #define DEAL_ANIM_DECK_Y (GFX_LCD_HEIGHT - CARD_HEIGHT * 2 / 3) 26 26 - #define DEAL_ANIM_DECK_FRAME_TIME 100 27 27 - #define DEAL_ANIM_DECK_PAUSE_TIME 1000 28 28 - #define DEAL_ANIM_TOTAL_TIME 100000 29 29 - #define DEAL_ANIM_TRAVEL_TIME 6000 30 30 - #define DEAL_ANIM_FRAME_TIME 250 31 31 - #define DEAL_ANIM_LAUNCH_INTERVAL ((DEAL_ANIM_TOTAL_TIME - DEAL_ANIM_TRAVEL_TIME) / 40) 6 6 + #define CARD_WIDTH 27 7 7 + #define CARD_HEIGHT 41 8 8 + #define CARD_NUMERAL_HOFFSET 1 9 9 + #define CARD_NUMERAL_VOFFSET 1 10 10 + #define CARD_FSUIT_HOFFSET 1 11 11 + #define CARD_FSUIT_VOFFSET 7 12 12 + #define CARD_FACE_HOFFSET 4 13 13 + #define CARD_FACE_VOFFSET 4 14 14 + #define CARD_FACE_WIDTH 19 15 15 + #define CARD_FACE_HEIGHT 17 32 16 33 33 - gfx_sprite_t* cardSprite[11]; 17 17 + #define CARD_COLOR 0 18 18 + #define BLACK_COLOR 1 19 19 + #define RED_COLOR 2 34 20 35 35 - void drawBackground() 36 36 - { 37 37 - gfx_FillScreen(BKGND_COLOR); 38 38 - gfx_SetColor(BORDER_COLOR); 39 39 - gfx_FillRectangle(0, 0, GFX_LCD_WIDTH, TOP_BORDER); 40 40 - } 21 21 + // these are used for placing pips on cards 22 22 + const uint8_t segments[] = { 23 23 + 0x01, 0x24, 0x25, 0x48, 0x49, 0x4a, 0xa8, 0x90, 0x91, 0xb4 24 24 + }; 25 25 + const uint8_t pip_code[] = { 26 26 + 0x04, 07, 02, 15, 02, 07, 12, 15, 12, 27 27 + 0x02, 07, 07, 15, 07, 28 28 + 0x01, 11, 07, 29 29 + 0x84, 12, 29, 20, 29, 12, 39, 20, 39, 30 30 + 0x82, 12, 34, 20, 34, 31 31 + 0x81, 16, 34, 32 32 + 0x02, 07, 17, 15, 17, 33 33 + 0x01, 11, 17 34 34 + }; 41 35 42 42 - void drawCursor(unsigned char X, unsigned char Y) 36 36 + void draw_mask(const uint8_t *data, uint8_t rows, uint24_t x, uint8_t y) 43 37 { 44 44 - if (cursorMode == SELECT) gfx_TransparentSprite(selcorner, X - 2, Y - 2); 45 45 - else gfx_TransparentSprite(drpcorner, X - 2, Y - 2); 46 46 - } 38 38 + uint8_t yy = y; 47 39 48 48 - void drawFrame() 49 49 - { 50 50 - drawBackground(); 40 40 + for (uint8_t row = 0; row < rows; row++) 41 41 + { 42 42 + uint8_t row_data = data[row]; 51 43 52 52 - for (unsigned char i = 0; i < NUM_FREECELLS; i++) 53 53 - { 54 54 - unsigned char cardX = FC_HPOS + i * (CARD_WIDTH + CARD_SPACING); 44 44 + for (uint24_t xx = x; xx < x + 8; xx++) 45 45 + { 46 46 + if (row_data & 0x80) 47 47 + { 48 48 + gfx_SetPixel(xx, yy); 49 49 + } 55 50 56 56 - if (freeCells[i] == 11) gfx_Sprite(freespace, cardX, FC_VPOS); 57 57 - else if (freeCells[i] > 11) gfx_Sprite(cardSprite[10], cardX, FC_VPOS); 58 58 - else gfx_Sprite(cardSprite[freeCells[i]], cardX, FC_VPOS); 51 51 + row_data <<= 1; 52 52 + } 59 53 60 60 - if (i >= fcUnlocked) 61 61 - { 62 62 - gfx_Sprite(lock, cardX + LOCK_ICON_HOFFSET, FC_VPOS + LOCK_ICON_VOFFSET); 63 63 - } 54 54 + yy++; 55 55 + } 56 56 + } 64 57 65 65 - if (i == cursorStack) drawCursor(cardX, FC_VPOS); 66 66 - } 58 58 + void draw_mask_inverted(const uint8_t *data, uint8_t rows, uint24_t x, uint8_t y) 59 59 + { 60 60 + uint8_t yy = y - rows; 67 61 68 68 - for (unsigned char i = 0; i < NUM_TABLSLOTS; i++) 62 62 + for (uint8_t row = 1; row <= rows; row++) 69 63 { 70 70 - for (unsigned char j = 0; j < TABL_STACK_SIZE; j++) 71 71 - { 72 72 - unsigned char cardX = TABL_HPOS + i * (CARD_WIDTH + CARD_SPACING); 73 73 - unsigned char cardY = TABL_VPOS + j * CARD_VOFFSET; 74 74 - 75 75 - if (progress < 10) if (i + NUM_FREECELLS == cursorStack) if (j == cursorIndex) 76 76 - drawCursor(cardX, cardY); 77 77 - 78 78 - const unsigned char x = tableau[i][j]; 79 79 - 80 80 - if (x == 11) break; 81 81 - if (x > 11) gfx_Sprite(cardSprite[10], cardX, cardY); 82 82 - else gfx_Sprite(cardSprite[x], cardX, cardY); 83 83 - } 84 84 - } 64 64 + uint8_t row_data = data[rows - row]; 85 65 86 86 - if (progress < 10) 87 87 - { 88 88 - gfx_SetTextXY(SELCARD_DISP_X, SELCARD_DISP_Y); 89 89 - if (selectedCard != 11) 66 66 + for (uint24_t xx = x - 8; xx < x; xx++) 90 67 { 91 91 - gfx_PrintUInt(selectedCard + 1, 1); 92 92 - if (selectedQty > 1) 68 68 + if (row_data & 0x01) 93 69 { 94 94 - gfx_PrintString(" x"); 95 95 - gfx_PrintUInt(selectedQty, 1); 70 70 + gfx_SetPixel(xx, yy); 96 71 } 72 72 + 73 73 + row_data >>= 1; 97 74 } 98 98 - else gfx_PrintString("EMPTY"); 75 75 + 76 76 + yy++; 99 77 } 78 78 + } 100 79 101 101 - if (progress == 10) 102 102 - gfx_PrintStringXY("COMPLETE", GFX_LCD_WIDTH / 2 - 4 * TEXT_CHAR_WIDTH, SELCARD_DISP_Y); 103 103 - else if (cursorMode == SELECT) 104 104 - gfx_PrintStringXY("SELECT", GFX_LCD_WIDTH / 2 - 3 * TEXT_CHAR_WIDTH, SELCARD_DISP_Y); 105 105 - else gfx_PrintStringXY("DROP", GFX_LCD_WIDTH / 2 - 2 * TEXT_CHAR_WIDTH, SELCARD_DISP_Y); 80 80 + void draw_card_blank(uint24_t x, uint8_t y) 81 81 + { 82 82 + gfx_SetColor(CARD_COLOR); 83 83 + gfx_HorizLine(x + 1, y, CARD_WIDTH - 2); 84 84 + gfx_HorizLine(x + 1, y + CARD_HEIGHT - 1, CARD_WIDTH - 2); 85 85 + gfx_FillRectangle(x, y + 1, CARD_WIDTH, CARD_HEIGHT - 2); 106 86 107 107 - gfx_SetTextXY(NUMWINS_DISP_X, SELCARD_DISP_Y); 108 108 - gfx_PrintUInt(numWins, 3); 109 109 - 110 110 - gfx_BlitBuffer(); 87 87 + gfx_SetColor(BLACK_COLOR); 88 88 + gfx_SetPixel(x, y + CARD_HEIGHT - 1); 89 89 + gfx_SetPixel(x + CARD_WIDTH - 1, y + CARD_HEIGHT - 1); 90 90 + gfx_HorizLine(x + 1, y + CARD_HEIGHT, CARD_WIDTH - 2); 111 91 } 112 92 113 113 - void animateDeal() 93 93 + void draw_card(uint24_t x, uint8_t y, card_t card) 114 94 { 115 115 - // phase 1: deck emerging from bottom of screen 116 116 - for (unsigned char deckY = GFX_LCD_HEIGHT; deckY >= DEAL_ANIM_DECK_Y; deckY--) 117 117 - { 118 118 - clock_t frameTimer = clock(); 95 95 + if (!EXISTS(card)) return; 119 96 120 120 - drawBackground(); 97 97 + const uint8_t card_num = NUMBER(card); 98 98 + const uint24_t card_suit = SUIT(card); 121 99 122 122 - gfx_Sprite(cardSprite[10], DEAL_ANIM_DECK_X, deckY); 100 100 + draw_card_blank(x, y); 123 101 124 124 - while (clock() - frameTimer < DEAL_ANIM_DECK_FRAME_TIME); 125 125 - 126 126 - gfx_BlitBuffer(); 127 127 - } 102 102 + if (card_num >= 10) 103 103 + { 104 104 + // this is a face card 105 105 + const uint8_t tile_index = card_suit * 3 + card_num - 10; 106 106 + const gfx_sprite_t *face_sprite = faces_tiles[tile_index]; 128 107 129 129 - clock_t mainTimer = clock(); 130 130 - while (clock() - mainTimer < DEAL_ANIM_DECK_PAUSE_TIME); 108 108 + gfx_TempSprite(bottom_sprite, CARD_FACE_WIDTH, CARD_FACE_HEIGHT); 109 109 + gfx_RotateSpriteHalf(face_sprite, bottom_sprite); 131 110 132 132 - // phase 2: cards interpolating between deck and end positions 133 133 - mainTimer = clock(); 134 134 - bool deckExists = true; 135 135 - while (clock() - mainTimer < DEAL_ANIM_TOTAL_TIME) 136 136 - { 137 137 - clock_t frameTimer = clock(); 111 111 + gfx_Sprite(face_sprite, x + CARD_FACE_HOFFSET, y + CARD_FACE_VOFFSET); 112 112 + gfx_Sprite(bottom_sprite, x + CARD_FACE_HOFFSET, y + CARD_HEIGHT / 2); 138 113 139 139 - drawBackground(); 114 114 + gfx_SetColor(BLACK_COLOR); 115 115 + gfx_VertLine(x + 3, y + 12, 26); 116 116 + gfx_VertLine(x + 23, y + 3, 26); 117 117 + gfx_HorizLine(x + 6, y + 3, 17); 118 118 + gfx_HorizLine(x + 4, y + 37, 17); 140 119 141 141 - for (unsigned char i = 0; i < NUM_TABLSLOTS; i++) 142 142 - { 143 143 - for (unsigned char j = 0; tableau[i][j] != 11; j++) 144 144 - { 145 145 - // should this card have even launched yet? 146 146 - const unsigned int delay = (i + j * 8) * DEAL_ANIM_LAUNCH_INTERVAL; 147 147 - if (clock() - mainTimer <= delay) continue; 120 120 + if (IS_RED(card)) gfx_SetColor(RED_COLOR); 121 121 + } 122 122 + else 123 123 + { 124 124 + // this is a number card (A-10) and should have pips 125 125 + gfx_SetColor(IS_RED(card) ? RED_COLOR : BLACK_COLOR); 126 126 + const uint8_t *pip_mask = medium_suits_tiles_data[card_suit]; 127 127 + const uint8_t *code_ptr = pip_code; 128 128 + for (uint8_t pip_map = segments[card_num]; pip_map != 0x00; pip_map <<= 1) 129 129 + { 130 130 + uint8_t counter = *code_ptr & 0x0f; 131 131 + if (pip_map & 0x80) 132 132 + { 133 133 + const uint8_t is_negative = *code_ptr & 0x80; 134 134 + code_ptr++; 148 135 149 149 - // if last card launched, deck sprite disappears 150 150 - if (i == 7 && j == 4) deckExists = false; 136 136 + while (counter-- > 0) 137 137 + { 138 138 + if (is_negative) draw_mask_inverted(pip_mask, 6, x + code_ptr[0], y + code_ptr[1]); 139 139 + else draw_mask(pip_mask, 6, x + code_ptr[0], y + code_ptr[1]); 151 140 152 152 - // where is the card going? 153 153 - unsigned char cardEndX = TABL_HPOS + i * (CARD_WIDTH + CARD_SPACING); 154 154 - unsigned char cardEndY = TABL_VPOS + j * CARD_VOFFSET; 141 141 + code_ptr += 2; 142 142 + } 143 143 + } 144 144 + else 145 145 + { 146 146 + code_ptr += counter * 2 + 1; 147 147 + } 148 148 + } 149 149 + } 155 150 156 156 - unsigned char cardX, cardY; 151 151 + draw_mask(numerals_tiles_data[card_num], 5, x + CARD_NUMERAL_HOFFSET, y + CARD_NUMERAL_VOFFSET); 152 152 + draw_mask(small_suits_tiles_data[card_suit], 4, x + CARD_FSUIT_HOFFSET, y + CARD_FSUIT_VOFFSET); 153 153 + draw_mask_inverted(numerals_tiles_data[card_num], 5, x + CARD_WIDTH - CARD_NUMERAL_HOFFSET, y + CARD_HEIGHT - CARD_NUMERAL_VOFFSET); 154 154 + draw_mask_inverted(small_suits_tiles_data[card_suit], 4, x + CARD_WIDTH - CARD_FSUIT_HOFFSET, y + CARD_HEIGHT - CARD_FSUIT_VOFFSET); 155 155 + } 157 156 158 158 - // is this card done traveling yet? 159 159 - if (clock() - mainTimer >= delay + DEAL_ANIM_TRAVEL_TIME) 160 160 - { 161 161 - cardX = cardEndX; 162 162 - cardY = cardEndY; 163 163 - } 164 164 - else 165 165 - { 166 166 - // okay we need to actually interpolate 167 167 - const signed int travelingFor = clock() - mainTimer - delay; 168 168 - const signed char dX = cardEndX - DEAL_ANIM_DECK_X; 169 169 - const signed char dY = cardEndY - DEAL_ANIM_DECK_Y; 170 170 - cardX = DEAL_ANIM_DECK_X + travelingFor * dX / DEAL_ANIM_TRAVEL_TIME; 171 171 - cardY = DEAL_ANIM_DECK_Y + travelingFor * dY / DEAL_ANIM_TRAVEL_TIME; 172 172 - } 157 157 + void draw_stack(stack_t *stack) 158 158 + { 159 159 + uint24_t x = stack->x; 160 160 + uint8_t y = stack->y; 173 161 174 174 - gfx_Sprite(cardSprite[tableau[i][j]], cardX, cardY); 175 175 - } 176 176 - } 162 162 + for (uint8_t i = 0; i < stack->max_cards; i++) 163 163 + { 164 164 + if (!EXISTS(stack->cards[i])) return; 177 165 178 178 - if (deckExists) gfx_Sprite(cardSprite[10], DEAL_ANIM_DECK_X, DEAL_ANIM_DECK_Y); 166 166 + draw_card(x, y, stack->cards[i]); 179 167 180 180 - while (clock() - frameTimer < DEAL_ANIM_FRAME_TIME); 168 168 + x += stack->dx; 169 169 + y += stack->dy; 170 170 + } 171 171 + } 181 172 182 182 - gfx_BlitBuffer(); 183 183 - } 173 173 + void draw_stacks() 174 174 + { 175 175 + for (uint8_t i = 0; i < num_stacks; i++) 176 176 + { 177 177 + draw_stack(&stacks[i]); 178 178 + } 184 179 }

+6 -32

src/drawing.h

··· 1 1 - // Kabufuda Solitaire / KBFDSLTR for the TI-84 Plus CE 2 2 - // Copyright (C) 2024 euphory 3 3 - // 4 4 - // This program is free software: you can redistribute it and/or modify 5 5 - // it under the terms of the GNU General Public License as published by 6 6 - // the Free Software Foundation, either version 3 of the License, or 7 7 - // (at your option) any later version. 8 8 - // 9 9 - // This program is distributed in the hope that it will be useful, 10 10 - // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 11 - // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 12 - // GNU General Public License for more details. 13 13 - // 14 14 - // You should have received a copy of the GNU General Public License 15 15 - // along with this program. If not, see <https://www.gnu.org/licenses/>. 16 16 - 17 17 - #ifndef drawing_include_file 18 18 - #define drawing_include_file 19 19 - 20 20 - #include <graphx.h> 21 21 - #include <gfx/gfx.h> 1 1 + #ifndef DRAWING_H 2 2 + #define DRAWING_H 22 3 23 23 - #define CARD_HEIGHT card1_height 24 24 - #define CARD_WIDTH card1_width 25 25 - #define CARD_SPACING 5 26 26 - #define CARD_VOFFSET 8 4 4 + #include "card.h" 27 5 28 28 - extern gfx_sprite_t* cardSprite[11]; 29 29 - 30 30 - void drawBackground(); 31 31 - void drawCursor(unsigned char X, unsigned char Y); 32 32 - void drawFrame(); 33 33 - 34 34 - void animateDeal(); 6 6 + void draw_card(uint24_t x, uint8_t y, card_t card); 7 7 + void draw_stack(stack_t *stack); 8 8 + void draw_stacks(); 35 9 36 10 #endif

+4

src/game.c

··· 1 1 + #include "game.h" 2 2 + 3 3 + uint8_t cursor_stack; 4 4 + uint8_t cursor_index;

+9

src/game.h

··· 1 1 + #ifndef GAME_H 2 2 + #define GAME_H 3 3 + 4 4 + #include <stdint.h> 5 5 + 6 6 + extern uint8_t cursor_stack; 7 7 + extern uint8_t cursor_index; 8 8 + 9 9 + #endif

src/gfx/KBFDGFX.8xv

This is a binary file and will not be displayed.

-47

src/gfx/KBFDGFX.c

··· 1 1 - #include "gfx.h" 2 2 - #include <fileioc.h> 3 3 - 4 4 - #define KBFDGFX_HEADER_SIZE 0 5 5 - 6 6 - unsigned char *KBFDGFX_appvar[16] = 7 7 - { 8 8 - (unsigned char*)0, 9 9 - (unsigned char*)14, 10 10 - (unsigned char*)1041, 11 11 - (unsigned char*)2068, 12 12 - (unsigned char*)3095, 13 13 - (unsigned char*)4122, 14 14 - (unsigned char*)5149, 15 15 - (unsigned char*)6176, 16 16 - (unsigned char*)7203, 17 17 - (unsigned char*)8230, 18 18 - (unsigned char*)9257, 19 19 - (unsigned char*)10284, 20 20 - (unsigned char*)11411, 21 21 - (unsigned char*)12438, 22 22 - (unsigned char*)12496, 23 23 - (unsigned char*)13803, 24 24 - }; 25 25 - 26 26 - unsigned char KBFDGFX_init(void) 27 27 - { 28 28 - unsigned int data, i; 29 29 - uint8_t appvar; 30 30 - 31 31 - appvar = ti_Open("KBFDGFX", "r"); 32 32 - if (appvar == 0) 33 33 - { 34 34 - return 0; 35 35 - } 36 36 - 37 37 - data = (unsigned int)ti_GetDataPtr(appvar) - (unsigned int)KBFDGFX_appvar[0] + KBFDGFX_HEADER_SIZE; 38 38 - for (i = 0; i < 16; i++) 39 39 - { 40 40 - KBFDGFX_appvar[i] += data; 41 41 - } 42 42 - 43 43 - ti_Close(appvar); 44 44 - 45 45 - return 1; 46 46 - } 47 47 -

src/gfx/card1.png

This is a binary file and will not be displayed.

src/gfx/card10.png

This is a binary file and will not be displayed.

src/gfx/card2.png

This is a binary file and will not be displayed.

src/gfx/card3.png

This is a binary file and will not be displayed.

src/gfx/card4.png

This is a binary file and will not be displayed.

src/gfx/card5.png

This is a binary file and will not be displayed.

src/gfx/card6.png

This is a binary file and will not be displayed.

src/gfx/card7.png

This is a binary file and will not be displayed.

src/gfx/card8.png

This is a binary file and will not be displayed.

src/gfx/card9.png

This is a binary file and will not be displayed.

+18

src/gfx/card_back.c

··· 1 1 + unsigned char card_back_tile_0_data[20] = 2 2 + { 3 3 + 0xff,0xff,0xcd,0xc7,0xef,0xf8,0xdb,0xfb,0xdb,0xfb,0xfa,0xca,0xfb,0xda,0xfe,0xcd,0xfd,0xe8,0xca,0x99 4 4 + }; 5 5 + unsigned char card_back_tile_1_data[20] = 6 6 + { 7 7 + 0xff,0xf7,0x63,0x49,0xff,0x00,0xff,0xc9,0x77,0x5d,0x22,0x3e,0xeb,0x2a,0x36,0x14,0x08,0xc9,0x3e,0xdd 8 8 + }; 9 9 + unsigned char card_back_tile_2_data[20] = 10 10 + { 11 11 + 0xff,0xff,0x59,0x71,0xfb,0x0f,0xed,0xef,0x6d,0x6f,0x2f,0x29,0xef,0x2d,0x3f,0x59,0x5f,0x8b,0x29,0xcc 12 12 + }; 13 13 + unsigned char *card_back_tiles_data[3] = 14 14 + { 15 15 + card_back_tile_0_data, 16 16 + card_back_tile_1_data, 17 17 + card_back_tile_2_data, 18 18 + };

+18

src/gfx/card_back.h

··· 1 1 + #ifndef card_back_include_file 2 2 + #define card_back_include_file 3 3 + 4 4 + #ifdef __cplusplus 5 5 + extern "C" { 6 6 + #endif 7 7 + 8 8 + extern unsigned char card_back_tile_0_data[20]; 9 9 + extern unsigned char card_back_tile_1_data[20]; 10 10 + extern unsigned char card_back_tile_2_data[20]; 11 11 + #define card_back_num_tiles 3 12 12 + extern unsigned char *card_back_tiles_data[3]; 13 13 + 14 14 + #ifdef __cplusplus 15 15 + } 16 16 + #endif 17 17 + 18 18 + #endif

src/gfx/card_back.png

This is a binary file and will not be displayed.

src/gfx/cardstack.png

This is a binary file and will not be displayed.

+76 -40

src/gfx/convimg.yaml

··· 1 1 - palettes: 2 2 - - name: global_palette 3 3 - fixed-entries: 4 4 - - color: {index: 0, r: 0, g: 0, b: 0} 5 5 - - color: {index: 1, r: 255, g: 255, b: 255} 6 6 - - color: {index: 2, r: 5, g: 110, b: 45} 7 7 - images: automatic 8 8 - 9 9 - converts: 10 10 - - name: sprites 11 11 - palette: global_palette 12 12 - transparent-color-index: 3 13 13 - images: 14 14 - - card1.png 15 15 - - card2.png 16 16 - - card3.png 17 17 - - card4.png 18 18 - - card5.png 19 19 - - card6.png 20 20 - - card7.png 21 21 - - card8.png 22 22 - - card9.png 23 23 - - card10.png 24 24 - - cardstack.png 25 25 - - freespace.png 26 26 - - lock.png 27 27 - - selcorner.png 28 28 - - drpcorner.png 29 29 - 30 30 - outputs: 31 31 - - type: appvar 32 32 - name: "KBFDGFX" 33 33 - include-file: gfx.h 34 34 - source-format: c 35 35 - archived: true 36 36 - palettes: 37 37 - - global_palette 38 38 - converts: 39 39 - - sprites 40 40 - 1 1 + palettes: 2 2 + - name: global_palette 3 3 + fixed-entries: 4 4 + - color: {index: 0, r: 255, g: 255, b: 255} 5 5 + - color: {index: 1, r: 0, g: 0, b: 0} 6 6 + - color: {index: 2, r: 255, g: 0, b: 0} 7 7 + - color: {index: 3, r: 5, g: 110, b: 45} 8 8 + images: automatic 9 9 + - name: binary 10 10 + fixed-entries: 11 11 + - color: {index: 0, r: 255, g: 255, b: 255} 12 12 + - color: {index: 1, r: 0, g: 0, b: 0} 13 13 + 14 14 + converts: 15 15 + - name: faces 16 16 + style: palette 17 17 + palette: global_palette 18 18 + tilesets: 19 19 + tile-width: 19 20 20 + tile-height: 17 21 21 + images: 22 22 + - faces.png 23 23 + - name: card_back 24 24 + style: palette 25 25 + bpp: 1 26 26 + width-and-height: false 27 27 + palette: binary 28 28 + tilesets: 29 29 + tile-width: 8 30 30 + tile-height: 20 31 31 + images: 32 32 + - card_back.png 33 33 + - name: numerals 34 34 + style: palette 35 35 + bpp: 1 36 36 + width-and-height: false 37 37 + palette: binary 38 38 + tilesets: 39 39 + tile-width: 8 40 40 + tile-height: 5 41 41 + images: 42 42 + - numerals.png 43 43 + - name: small_suits 44 44 + style: palette 45 45 + bpp: 1 46 46 + width-and-height: false 47 47 + palette: binary 48 48 + tilesets: 49 49 + tile-width: 8 50 50 + tile-height: 4 51 51 + images: 52 52 + - small_suits.png 53 53 + - name: medium_suits 54 54 + style: palette 55 55 + bpp: 1 56 56 + width-and-height: false 57 57 + palette: binary 58 58 + tilesets: 59 59 + tile-width: 8 60 60 + tile-height: 6 61 61 + images: 62 62 + - medium_suits.png 63 63 + - selcorner.png 64 64 + 65 65 + outputs: 66 66 + - type: c 67 67 + include-file: gfx.h 68 68 + palettes: 69 69 + - global_palette 70 70 + converts: 71 71 + - faces 72 72 + - card_back 73 73 + - numerals 74 74 + - small_suits 75 75 + - medium_suits 76 76 +

+14 -2

src/gfx/convimg.yaml.lst

··· 1 1 + global_palette.h 2 2 + global_palette.c 3 3 + faces.h 4 4 + faces.c 5 5 + card_back.h 6 6 + card_back.c 7 7 + numerals.h 8 8 + numerals.c 9 9 + small_suits.h 10 10 + small_suits.c 11 11 + medium_suits.h 12 12 + medium_suits.c 13 13 + selcorner.h 14 14 + selcorner.c 1 15 gfx.h 2 2 - KBFDGFX.c 3 3 - KBFDGFX.8xv

src/gfx/drpcorner.png

This is a binary file and will not be displayed.

+183

src/gfx/faces.c

··· 1 1 + unsigned char faces_tile_0_data[325] = 2 2 + { 3 3 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08, 4 4 + 0x08,0x08,0x00,0x00,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x00,0x07,0x07,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x08, 5 5 + 0x08,0x08,0x09,0x09,0x09,0x06,0x08,0x08,0x00,0x00,0x0a,0x00,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x09,0x09,0x09,0x06,0x06,0x06,0x00,0x00,0x0a,0x07,0x07, 6 6 + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x04,0x09,0x04,0x09,0x06,0x06,0x00,0x07,0x0a,0x07,0x07,0x07,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06, 7 7 + 0x06,0x07,0x07,0x0a,0x07,0x07,0x07,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x06,0x07,0x0a,0x07,0x07,0x07,0x00,0x00,0x00,0x00,0x06,0x06, 8 8 + 0x00,0x09,0x09,0x09,0x00,0x00,0x06,0x06,0x00,0x06,0x07,0x07,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x05,0x05,0x08,0x08,0x06,0x00,0x07,0x00, 9 9 + 0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x00,0x00,0x00,0x05,0x05,0x05,0x08,0x08,0x06,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x05,0x00,0x0a,0x05,0x05,0x05, 10 10 + 0x08,0x08,0x06,0x08,0x00,0x00,0x00,0x08,0x0a,0x08,0x08,0x05,0x05,0x05,0x00,0x00,0x05,0x05,0x05,0x05,0x08,0x06,0x08,0x00,0x00,0x00,0x08,0x08,0x0a,0x08,0x05,0x05, 11 11 + 0x05,0x00,0x0a,0x05,0x05,0x05,0x05,0x08,0x06,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x05,0x05,0x00,0x00,0x05,0x05,0x05,0x05,0x08,0x06,0x08,0x00,0x00,0x07, 12 12 + 0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x0a,0x07,0x05,0x07,0x05,0x07,0x06,0x07,0x00,0x07,0x00,0x07,0x08,0x07,0x08,0x07,0x05,0x07,0x00,0x07,0x00,0x07,0x05,0x07, 13 13 + 0x08,0x07,0x08,0x07,0x00 14 14 + }; 15 15 + unsigned char faces_tile_1_data[325] = 16 16 + { 17 17 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x06,0x0a,0x0a, 18 18 + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x06,0x06,0x06,0x06,0x06,0x00,0x07,0x05,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 19 19 + 0x00,0x06,0x06,0x09,0x09,0x06,0x06,0x07,0x05,0x07,0x05,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x07,0x05,0x07,0x05,0x07,0x07,0x00, 20 20 + 0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x05,0x07,0x05,0x07,0x05,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x04,0x09,0x04,0x07, 21 21 + 0x05,0x07,0x05,0x05,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x07,0x07,0x07,0x07,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06, 22 22 + 0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x00,0x09,0x06,0x00,0x00,0x00,0x00,0x08,0x06,0x06,0x06,0x06,0x09,0x09,0x09,0x06,0x06,0x06,0x08,0x00,0x09,0x06,0x00, 23 23 + 0x00,0x00,0x08,0x08,0x06,0x06,0x06,0x06,0x0a,0x0a,0x06,0x06,0x06,0x06,0x08,0x08,0x09,0x09,0x06,0x00,0x08,0x08,0x00,0x00,0x06,0x06,0x06,0x00,0x00,0x00,0x00,0x06, 24 24 + 0x00,0x00,0x09,0x09,0x09,0x00,0x00,0x08,0x08,0x08,0x05,0x00,0x00,0x05,0x05,0x05,0x05,0x00,0x00,0x05,0x08,0x09,0x09,0x09,0x00,0x00,0x08,0x08,0x05,0x08,0x05,0x08, 25 25 + 0x08,0x05,0x05,0x08,0x08,0x05,0x08,0x05,0x09,0x09,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x05,0x08,0x08,0x05,0x08,0x08,0x08,0x08,0x09,0x09,0x08,0x00,0x07, 26 26 + 0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x09,0x07,0x08,0x07,0x00,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07, 27 27 + 0x08,0x07,0x08,0x07,0x00 28 28 + }; 29 29 + unsigned char faces_tile_2_data[325] = 30 30 + { 31 31 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08, 32 32 + 0x0a,0x08,0x0a,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x08,0x0a,0x0a,0x0a,0x0a,0x0a,0x0a,0x0a,0x08,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 33 33 + 0x0a,0x0a,0x06,0x06,0x09,0x09,0x09,0x0a,0x0a,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x06,0x00,0x0a,0x05,0x0a,0x00, 34 34 + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x04,0x09,0x04,0x06,0x00,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x09, 35 35 + 0x06,0x00,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x06,0x06,0x06,0x06,0x06,0x06,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06, 36 36 + 0x06,0x06,0x06,0x06,0x09,0x06,0x00,0x06,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x00,0x00,0x06,0x06,0x00,0x00,0x00,0x00,0x0a,0x00,0x00,0x00, 37 37 + 0x00,0x00,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x05,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x00,0x00,0x00,0x05,0x00,0x00,0x0a,0x00,0x05, 38 38 + 0x05,0x00,0x0a,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x00,0x05,0x05,0x05,0x05,0x0a,0x05,0x05,0x05,0x08,0x0a,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x05, 39 39 + 0x05,0x05,0x05,0x08,0x05,0x05,0x05,0x08,0x0a,0x08,0x08,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x05,0x05,0x05,0x0a,0x05,0x05,0x05,0x08,0x0a,0x08,0x08,0x00,0x07, 40 40 + 0x08,0x07,0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x0a,0x07,0x08,0x07,0x00,0x07,0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x05,0x07, 41 41 + 0x08,0x07,0x08,0x07,0x00 42 42 + }; 43 43 + unsigned char faces_tile_3_data[325] = 44 44 + { 45 45 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08, 46 46 + 0x08,0x08,0x00,0x00,0x00,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x00,0x00,0x07,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x08, 47 47 + 0x08,0x08,0x09,0x09,0x06,0x06,0x08,0x08,0x00,0x07,0x07,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x07,0x07,0x07,0x00, 48 48 + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x04,0x09,0x04,0x09,0x06,0x06,0x00,0x0a,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06, 49 49 + 0x06,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08, 50 50 + 0x00,0x09,0x09,0x09,0x09,0x00,0x08,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x00,0x00,0x09,0x09,0x00,0x05,0x05,0x06,0x08,0x00,0x00,0x00,0x00, 51 51 + 0x00,0x00,0x0a,0x08,0x08,0x08,0x05,0x00,0x00,0x00,0x00,0x05,0x05,0x06,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x08,0x0a,0x08,0x08,0x05,0x05,0x00,0x0a,0x05,0x05,0x06, 52 52 + 0x08,0x08,0x08,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x05,0x05,0x05,0x00,0x05,0x05,0x06,0x05,0x08,0x08,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x05, 53 53 + 0x05,0x05,0x0a,0x05,0x05,0x06,0x05,0x08,0x08,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x05,0x05,0x05,0x00,0x05,0x06,0x05,0x05,0x08,0x08,0x08,0x00,0x00,0x07, 54 54 + 0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x0a,0x07,0x06,0x07,0x05,0x07,0x08,0x07,0x00,0x07,0x00,0x07,0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x05,0x07, 55 55 + 0x08,0x07,0x08,0x07,0x00 56 56 + }; 57 57 + unsigned char faces_tile_4_data[325] = 58 58 + { 59 59 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x0a,0x06,0x0a, 60 60 + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x06,0x06,0x06,0x06,0x06,0x00,0x00,0x05,0x05,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 61 61 + 0x00,0x06,0x06,0x09,0x09,0x06,0x06,0x0a,0x00,0x05,0x05,0x05,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x05,0x05,0x05,0x00, 62 62 + 0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x06,0x00,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x04,0x09,0x04,0x06, 63 63 + 0x06,0x06,0x00,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x06,0x00,0x00,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06, 64 64 + 0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x00,0x09,0x06,0x00,0x00,0x00,0x00,0x09,0x09,0x00,0x09,0x0a,0x09,0x09,0x0a,0x09,0x00,0x09,0x09,0x00,0x09,0x09,0x06, 65 65 + 0x00,0x00,0x09,0x09,0x00,0x00,0x09,0x09,0x0a,0x0a,0x09,0x09,0x00,0x00,0x09,0x09,0x09,0x09,0x06,0x00,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 66 66 + 0x00,0x00,0x09,0x09,0x09,0x06,0x00,0x08,0x08,0x08,0x05,0x00,0x00,0x05,0x05,0x05,0x05,0x00,0x00,0x05,0x08,0x09,0x09,0x09,0x00,0x00,0x08,0x08,0x05,0x08,0x05,0x08, 67 67 + 0x08,0x05,0x05,0x08,0x08,0x05,0x08,0x05,0x09,0x09,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x05,0x08,0x08,0x05,0x08,0x08,0x08,0x08,0x09,0x09,0x08,0x00,0x07, 68 68 + 0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x09,0x07,0x08,0x07,0x00,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07, 69 69 + 0x08,0x07,0x08,0x07,0x00 70 70 + }; 71 71 + unsigned char faces_tile_5_data[325] = 72 72 + { 73 73 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08, 74 74 + 0x0a,0x08,0x0a,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x08,0x0a,0x0a,0x0a,0x0a,0x0a,0x0a,0x0a,0x08,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 75 75 + 0x0a,0x0a,0x06,0x06,0x09,0x09,0x09,0x0a,0x0a,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x06,0x00,0x0a,0x05,0x0a,0x00, 76 76 + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x04,0x09,0x04,0x06,0x00,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x09, 77 77 + 0x06,0x00,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06, 78 78 + 0x06,0x06,0x09,0x09,0x09,0x09,0x00,0x06,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x00,0x00,0x06,0x06,0x00,0x00,0x00,0x00,0x0a,0x00,0x00,0x00, 79 79 + 0x00,0x00,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x00,0x00,0x05,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x00,0x00,0x00,0x05,0x00,0x00,0x0a,0x00,0x05, 80 80 + 0x05,0x00,0x0a,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x00,0x05,0x05,0x05,0x05,0x0a,0x05,0x05,0x05,0x08,0x0a,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x05, 81 81 + 0x05,0x05,0x05,0x08,0x05,0x05,0x05,0x08,0x0a,0x08,0x08,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x05,0x05,0x05,0x0a,0x05,0x05,0x05,0x08,0x0a,0x08,0x08,0x00,0x07, 82 82 + 0x08,0x07,0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x0a,0x07,0x08,0x07,0x00,0x07,0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x05,0x07, 83 83 + 0x08,0x07,0x08,0x07,0x00 84 84 + }; 85 85 + unsigned char faces_tile_6_data[325] = 86 86 + { 87 87 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08, 88 88 + 0x08,0x08,0x00,0x00,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x00,0x07,0x07,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x08, 89 89 + 0x08,0x08,0x09,0x09,0x09,0x06,0x08,0x08,0x00,0x00,0x0a,0x00,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x09,0x09,0x09,0x06,0x06,0x06,0x00,0x00,0x0a,0x07,0x07, 90 90 + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x04,0x09,0x04,0x09,0x06,0x06,0x00,0x07,0x0a,0x07,0x07,0x07,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06, 91 91 + 0x06,0x07,0x07,0x0a,0x07,0x07,0x07,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x06,0x07,0x0a,0x07,0x07,0x07,0x00,0x00,0x00,0x00,0x06,0x06, 92 92 + 0x00,0x09,0x09,0x09,0x00,0x00,0x06,0x06,0x00,0x06,0x07,0x07,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x05,0x05,0x08,0x08,0x06,0x00,0x07,0x00, 93 93 + 0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x00,0x00,0x00,0x05,0x05,0x05,0x08,0x08,0x06,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x05,0x00,0x0a,0x05,0x05,0x05, 94 94 + 0x08,0x08,0x06,0x08,0x00,0x00,0x00,0x08,0x0a,0x08,0x08,0x05,0x05,0x05,0x00,0x00,0x05,0x05,0x05,0x05,0x08,0x06,0x08,0x00,0x00,0x00,0x08,0x08,0x0a,0x08,0x05,0x05, 95 95 + 0x05,0x00,0x0a,0x05,0x05,0x05,0x05,0x08,0x06,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x05,0x05,0x00,0x00,0x05,0x05,0x05,0x05,0x08,0x06,0x08,0x00,0x00,0x07, 96 96 + 0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x0a,0x07,0x05,0x07,0x05,0x07,0x06,0x07,0x00,0x07,0x00,0x07,0x08,0x07,0x08,0x07,0x05,0x07,0x00,0x07,0x00,0x07,0x05,0x07, 97 97 + 0x08,0x07,0x08,0x07,0x00 98 98 + }; 99 99 + unsigned char faces_tile_7_data[325] = 100 100 + { 101 101 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x06,0x0a,0x0a, 102 102 + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x06,0x06,0x06,0x06,0x06,0x00,0x00,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 103 103 + 0x00,0x06,0x06,0x09,0x09,0x06,0x06,0x0a,0x00,0x08,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x08,0x08,0x08,0x00, 104 104 + 0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x04,0x09,0x04,0x06, 105 105 + 0x06,0x00,0x00,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x00,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06, 106 106 + 0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x00,0x09,0x06,0x00,0x00,0x00,0x00,0x08,0x06,0x06,0x06,0x06,0x09,0x09,0x09,0x06,0x06,0x06,0x08,0x00,0x09,0x09,0x06, 107 107 + 0x00,0x00,0x08,0x08,0x06,0x06,0x06,0x06,0x0a,0x0a,0x06,0x06,0x06,0x06,0x08,0x08,0x09,0x09,0x06,0x00,0x08,0x08,0x00,0x00,0x06,0x06,0x06,0x00,0x00,0x00,0x00,0x06, 108 108 + 0x00,0x00,0x09,0x09,0x09,0x06,0x00,0x08,0x08,0x08,0x05,0x00,0x00,0x05,0x05,0x05,0x05,0x00,0x00,0x05,0x08,0x09,0x09,0x09,0x00,0x00,0x08,0x08,0x05,0x08,0x05,0x08, 109 109 + 0x08,0x05,0x05,0x08,0x08,0x05,0x08,0x05,0x09,0x09,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x05,0x08,0x08,0x05,0x08,0x08,0x08,0x08,0x09,0x09,0x08,0x00,0x07, 110 110 + 0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x09,0x07,0x08,0x07,0x00,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07, 111 111 + 0x08,0x07,0x08,0x07,0x00 112 112 + }; 113 113 + unsigned char faces_tile_8_data[325] = 114 114 + { 115 115 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08, 116 116 + 0x0a,0x08,0x0a,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x08,0x0a,0x0a,0x0a,0x0a,0x0a,0x0a,0x0a,0x08,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 117 117 + 0x0a,0x0a,0x06,0x06,0x09,0x09,0x09,0x0a,0x0a,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x06,0x00,0x0a,0x08,0x0a,0x00, 118 118 + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x04,0x09,0x04,0x06,0x00,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x09, 119 119 + 0x06,0x00,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x06,0x06,0x06,0x06,0x06,0x06,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06, 120 120 + 0x06,0x06,0x06,0x06,0x09,0x06,0x00,0x06,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x00,0x00,0x06,0x06,0x00,0x00,0x00,0x00,0x0a,0x00,0x00,0x00, 121 121 + 0x00,0x00,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x05,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x00,0x00,0x00,0x05,0x00,0x00,0x0a,0x00,0x05, 122 122 + 0x05,0x00,0x0a,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x00,0x05,0x05,0x05,0x05,0x0a,0x05,0x05,0x05,0x08,0x0a,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x05, 123 123 + 0x05,0x05,0x05,0x08,0x05,0x05,0x05,0x08,0x0a,0x08,0x08,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x05,0x05,0x05,0x0a,0x05,0x05,0x05,0x08,0x0a,0x08,0x08,0x00,0x07, 124 124 + 0x08,0x07,0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x0a,0x07,0x08,0x07,0x00,0x07,0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x05,0x07, 125 125 + 0x08,0x07,0x08,0x07,0x00 126 126 + }; 127 127 + unsigned char faces_tile_9_data[325] = 128 128 + { 129 129 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08, 130 130 + 0x08,0x08,0x00,0x00,0x00,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x08,0x00,0x00,0x07,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x08, 131 131 + 0x08,0x08,0x09,0x09,0x06,0x06,0x08,0x08,0x00,0x07,0x07,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x07,0x07,0x07,0x00, 132 132 + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x04,0x09,0x04,0x09,0x06,0x06,0x00,0x0a,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06, 133 133 + 0x06,0x00,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08, 134 134 + 0x00,0x09,0x09,0x09,0x09,0x00,0x08,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x08,0x08,0x00,0x00,0x09,0x09,0x00,0x05,0x05,0x06,0x08,0x00,0x00,0x00,0x00, 135 135 + 0x00,0x00,0x0a,0x08,0x08,0x08,0x05,0x00,0x00,0x00,0x00,0x05,0x05,0x06,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x08,0x0a,0x08,0x08,0x05,0x05,0x00,0x0a,0x05,0x05,0x06, 136 136 + 0x08,0x08,0x08,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x05,0x05,0x05,0x00,0x05,0x05,0x06,0x05,0x08,0x08,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x05, 137 137 + 0x05,0x05,0x0a,0x05,0x05,0x06,0x05,0x08,0x08,0x08,0x00,0x00,0x00,0x08,0x08,0x08,0x08,0x05,0x05,0x05,0x05,0x00,0x05,0x06,0x05,0x05,0x08,0x08,0x08,0x00,0x00,0x07, 138 138 + 0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x0a,0x07,0x06,0x07,0x05,0x07,0x08,0x07,0x00,0x07,0x00,0x07,0x08,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x05,0x07, 139 139 + 0x08,0x07,0x08,0x07,0x00 140 140 + }; 141 141 + unsigned char faces_tile_10_data[325] = 142 142 + { 143 143 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x06,0x0a,0x0a, 144 144 + 0x00,0x00,0x00,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x06,0x06,0x06,0x06,0x06,0x00,0x00,0x08,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 145 145 + 0x00,0x06,0x06,0x09,0x09,0x06,0x06,0x0a,0x00,0x08,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x06,0x00,0x00, 146 146 + 0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x04,0x09,0x04,0x06, 147 147 + 0x06,0x00,0x00,0x00,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x00,0x09,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x06, 148 148 + 0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x00,0x09,0x09,0x06,0x00,0x00,0x00,0x09,0x09,0x09,0x09,0x0a,0x09,0x09,0x0a,0x09,0x09,0x09,0x09,0x00,0x09,0x09,0x06, 149 149 + 0x00,0x00,0x09,0x09,0x00,0x00,0x09,0x09,0x0a,0x0a,0x09,0x09,0x00,0x00,0x09,0x09,0x09,0x09,0x06,0x00,0x08,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 150 150 + 0x00,0x00,0x09,0x09,0x09,0x00,0x00,0x08,0x08,0x08,0x05,0x00,0x00,0x05,0x05,0x05,0x05,0x00,0x00,0x05,0x08,0x09,0x09,0x00,0x00,0x00,0x08,0x08,0x05,0x08,0x05,0x08, 151 151 + 0x08,0x05,0x05,0x08,0x08,0x05,0x08,0x05,0x09,0x09,0x08,0x00,0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x05,0x08,0x08,0x05,0x08,0x08,0x08,0x08,0x09,0x09,0x08,0x00,0x07, 152 152 + 0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x09,0x07,0x08,0x07,0x00,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07,0x08,0x07, 153 153 + 0x08,0x07,0x08,0x07,0x00 154 154 + }; 155 155 + unsigned char faces_tile_11_data[325] = 156 156 + { 157 157 + 0x13,0x11,0x00,0x00,0x00,0x00,0x00,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x0a,0x08,0x0a,0x08,0x0a,0x08, 158 158 + 0x0a,0x08,0x0a,0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x08,0x0a,0x0a,0x0a,0x0a,0x0a,0x0a,0x0a,0x08,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 159 159 + 0x0a,0x0a,0x06,0x06,0x09,0x09,0x09,0x0a,0x0a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x06,0x00,0x00,0x00,0x00,0x00, 160 160 + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x09,0x04,0x09,0x04,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x09, 161 161 + 0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x06,0x09,0x09,0x09,0x09,0x06,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x07,0x06,0x06, 162 162 + 0x06,0x06,0x09,0x09,0x09,0x09,0x00,0x06,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x07,0x00,0x00,0x06,0x00,0x00,0x06,0x06,0x00,0x00,0x00,0x00,0x0a,0x00,0x00,0x00, 163 163 + 0x00,0x00,0x07,0x07,0x00,0x00,0x00,0x00,0x00,0x06,0x06,0x00,0x00,0x05,0x0a,0x08,0x0a,0x00,0x00,0x00,0x00,0x07,0x07,0x00,0x00,0x00,0x05,0x00,0x00,0x0a,0x00,0x05, 164 164 + 0x05,0x00,0x0a,0x00,0x00,0x00,0x00,0x08,0x07,0x07,0x08,0x00,0x05,0x05,0x05,0x05,0x0a,0x05,0x05,0x05,0x0a,0x0a,0x0a,0x00,0x00,0x00,0x0a,0x0a,0x0a,0x0a,0x08,0x05, 165 165 + 0x05,0x05,0x05,0x08,0x05,0x05,0x0a,0x0a,0x0a,0x0a,0x0a,0x00,0x00,0x08,0x0a,0x0a,0x08,0x08,0x08,0x05,0x05,0x05,0x0a,0x05,0x05,0x0a,0x0a,0x0a,0x0a,0x0a,0x00,0x07, 166 166 + 0x08,0x07,0x0a,0x07,0x08,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x0a,0x07,0x0a,0x07,0x0a,0x07,0x00,0x07,0x0a,0x07,0x0a,0x07,0x05,0x07,0x05,0x07,0x05,0x07,0x05,0x07, 167 167 + 0x0a,0x07,0x0a,0x07,0x00 168 168 + }; 169 169 + unsigned char *faces_tiles_data[12] = 170 170 + { 171 171 + faces_tile_0_data, 172 172 + faces_tile_1_data, 173 173 + faces_tile_2_data, 174 174 + faces_tile_3_data, 175 175 + faces_tile_4_data, 176 176 + faces_tile_5_data, 177 177 + faces_tile_6_data, 178 178 + faces_tile_7_data, 179 179 + faces_tile_8_data, 180 180 + faces_tile_9_data, 181 181 + faces_tile_10_data, 182 182 + faces_tile_11_data, 183 183 + };

+40

src/gfx/faces.h

··· 1 1 + #ifndef faces_include_file 2 2 + #define faces_include_file 3 3 + 4 4 + #ifdef __cplusplus 5 5 + extern "C" { 6 6 + #endif 7 7 + 8 8 + #define faces_tile_0 ((gfx_sprite_t*)faces_tile_0_data) 9 9 + extern unsigned char faces_tile_0_data[325]; 10 10 + #define faces_tile_1 ((gfx_sprite_t*)faces_tile_1_data) 11 11 + extern unsigned char faces_tile_1_data[325]; 12 12 + #define faces_tile_2 ((gfx_sprite_t*)faces_tile_2_data) 13 13 + extern unsigned char faces_tile_2_data[325]; 14 14 + #define faces_tile_3 ((gfx_sprite_t*)faces_tile_3_data) 15 15 + extern unsigned char faces_tile_3_data[325]; 16 16 + #define faces_tile_4 ((gfx_sprite_t*)faces_tile_4_data) 17 17 + extern unsigned char faces_tile_4_data[325]; 18 18 + #define faces_tile_5 ((gfx_sprite_t*)faces_tile_5_data) 19 19 + extern unsigned char faces_tile_5_data[325]; 20 20 + #define faces_tile_6 ((gfx_sprite_t*)faces_tile_6_data) 21 21 + extern unsigned char faces_tile_6_data[325]; 22 22 + #define faces_tile_7 ((gfx_sprite_t*)faces_tile_7_data) 23 23 + extern unsigned char faces_tile_7_data[325]; 24 24 + #define faces_tile_8 ((gfx_sprite_t*)faces_tile_8_data) 25 25 + extern unsigned char faces_tile_8_data[325]; 26 26 + #define faces_tile_9 ((gfx_sprite_t*)faces_tile_9_data) 27 27 + extern unsigned char faces_tile_9_data[325]; 28 28 + #define faces_tile_10 ((gfx_sprite_t*)faces_tile_10_data) 29 29 + extern unsigned char faces_tile_10_data[325]; 30 30 + #define faces_tile_11 ((gfx_sprite_t*)faces_tile_11_data) 31 31 + extern unsigned char faces_tile_11_data[325]; 32 32 + #define faces_num_tiles 12 33 33 + #define faces_tiles ((gfx_sprite_t**)faces_tiles_data) 34 34 + extern unsigned char *faces_tiles_data[12]; 35 35 + 36 36 + #ifdef __cplusplus 37 37 + } 38 38 + #endif 39 39 + 40 40 + #endif

src/gfx/faces.png

This is a binary file and will not be displayed.

src/gfx/freespace.png

This is a binary file and will not be displayed.

+14 -68

src/gfx/gfx.h

··· 1 1 - #ifndef KBFDGFX_appvar_include_file 2 2 - #define KBFDGFX_appvar_include_file 1 1 + #ifndef gfx_include_file 2 2 + #define gfx_include_file 3 3 4 4 #ifdef __cplusplus 5 5 extern "C" { 6 6 #endif 7 7 8 8 - #define sizeof_global_palette 14 9 9 - #define global_palette (KBFDGFX_appvar[0]) 10 10 - #define sprites_palette_offset 0 11 11 - #define card1_width 25 12 12 - #define card1_height 41 13 13 - #define KBFDGFX_sprites_card1_index 1 14 14 - #define card1 ((gfx_sprite_t*)KBFDGFX_appvar[1]) 15 15 - #define card2_width 25 16 16 - #define card2_height 41 17 17 - #define KBFDGFX_sprites_card2_index 2 18 18 - #define card2 ((gfx_sprite_t*)KBFDGFX_appvar[2]) 19 19 - #define card3_width 25 20 20 - #define card3_height 41 21 21 - #define KBFDGFX_sprites_card3_index 3 22 22 - #define card3 ((gfx_sprite_t*)KBFDGFX_appvar[3]) 23 23 - #define card4_width 25 24 24 - #define card4_height 41 25 25 - #define KBFDGFX_sprites_card4_index 4 26 26 - #define card4 ((gfx_sprite_t*)KBFDGFX_appvar[4]) 27 27 - #define card5_width 25 28 28 - #define card5_height 41 29 29 - #define KBFDGFX_sprites_card5_index 5 30 30 - #define card5 ((gfx_sprite_t*)KBFDGFX_appvar[5]) 31 31 - #define card6_width 25 32 32 - #define card6_height 41 33 33 - #define KBFDGFX_sprites_card6_index 6 34 34 - #define card6 ((gfx_sprite_t*)KBFDGFX_appvar[6]) 35 35 - #define card7_width 25 36 36 - #define card7_height 41 37 37 - #define KBFDGFX_sprites_card7_index 7 38 38 - #define card7 ((gfx_sprite_t*)KBFDGFX_appvar[7]) 39 39 - #define card8_width 25 40 40 - #define card8_height 41 41 41 - #define KBFDGFX_sprites_card8_index 8 42 42 - #define card8 ((gfx_sprite_t*)KBFDGFX_appvar[8]) 43 43 - #define card9_width 25 44 44 - #define card9_height 41 45 45 - #define KBFDGFX_sprites_card9_index 9 46 46 - #define card9 ((gfx_sprite_t*)KBFDGFX_appvar[9]) 47 47 - #define card10_width 25 48 48 - #define card10_height 41 49 49 - #define KBFDGFX_sprites_card10_index 10 50 50 - #define card10 ((gfx_sprite_t*)KBFDGFX_appvar[10]) 51 51 - #define cardstack_width 25 52 52 - #define cardstack_height 45 53 53 - #define KBFDGFX_sprites_cardstack_index 11 54 54 - #define cardstack ((gfx_sprite_t*)KBFDGFX_appvar[11]) 55 55 - #define freespace_width 25 56 56 - #define freespace_height 41 57 57 - #define KBFDGFX_sprites_freespace_index 12 58 58 - #define freespace ((gfx_sprite_t*)KBFDGFX_appvar[12]) 59 59 - #define lock_width 7 60 60 - #define lock_height 8 61 61 - #define KBFDGFX_sprites_lock_index 13 62 62 - #define lock ((gfx_sprite_t*)KBFDGFX_appvar[13]) 63 63 - #define selcorner_width 29 64 64 - #define selcorner_height 45 65 65 - #define KBFDGFX_sprites_selcorner_index 14 66 66 - #define selcorner ((gfx_sprite_t*)KBFDGFX_appvar[14]) 67 67 - #define drpcorner_width 29 68 68 - #define drpcorner_height 45 69 69 - #define KBFDGFX_sprites_drpcorner_index 15 70 70 - #define drpcorner ((gfx_sprite_t*)KBFDGFX_appvar[15]) 71 71 - #define KBFDGFX_entries_num 16 72 72 - extern unsigned char *KBFDGFX_appvar[16]; 73 73 - unsigned char KBFDGFX_init(void); 8 8 + #include "global_palette.h" 9 9 + #define faces_palette_offset 0 10 10 + #include "faces.h" 11 11 + #define card_back_palette_offset 0 12 12 + #include "card_back.h" 13 13 + #define numerals_palette_offset 0 14 14 + #include "numerals.h" 15 15 + #define small_suits_palette_offset 0 16 16 + #include "small_suits.h" 17 17 + #define medium_suits_palette_offset 0 18 18 + #include "medium_suits.h" 19 19 + #include "selcorner.h" 74 20 75 21 #ifdef __cplusplus 76 22 }

+14

src/gfx/global_palette.c

··· 1 1 + unsigned char global_palette[22] = 2 2 + { 3 3 + 0xff, 0xff, /* 0: rgb(255, 255, 255) */ 4 4 + 0x00, 0x00, /* 1: rgb( 0, 0, 0) */ 5 5 + 0x00, 0x7c, /* 2: rgb(255, 0, 0) */ 6 6 + 0xa5, 0x85, /* 3: rgb( 8, 109, 41) */ 7 7 + 0x00, 0x00, /* 4: rgb( 0, 0, 0) */ 8 8 + 0xb9, 0x95, /* 5: rgb( 41, 109, 206) */ 9 9 + 0xc2, 0x20, /* 6: rgb( 66, 49, 16) */ 10 10 + 0xd7, 0xda, /* 7: rgb(181, 182, 189) */ 11 11 + 0xa5, 0xe8, /* 8: rgb(214, 45, 41) */ 12 12 + 0xb2, 0x6a, /* 9: rgb(214, 170, 148) */ 13 13 + 0x6a, 0xf7, /* 10: rgb(239, 223, 82) */ 14 14 + };

+15

src/gfx/global_palette.h

··· 1 1 + #ifndef global_palette_include_file 2 2 + #define global_palette_include_file 3 3 + 4 4 + #ifdef __cplusplus 5 5 + extern "C" { 6 6 + #endif 7 7 + 8 8 + #define sizeof_global_palette 22 9 9 + extern unsigned char global_palette[22]; 10 10 + 11 11 + #ifdef __cplusplus 12 12 + } 13 13 + #endif 14 14 + 15 15 + #endif

src/gfx/lock.png

This is a binary file and will not be displayed.

+23

src/gfx/medium_suits.c

··· 1 1 + unsigned char medium_suits_tile_0_data[6] = 2 2 + { 3 3 + 0x20,0x70,0xf8,0xf8,0x20,0x70 4 4 + }; 5 5 + unsigned char medium_suits_tile_1_data[6] = 6 6 + { 7 7 + 0x20,0x70,0xa8,0xf8,0xa8,0x20 8 8 + }; 9 9 + unsigned char medium_suits_tile_2_data[6] = 10 10 + { 11 11 + 0x00,0xd8,0xf8,0xf8,0x70,0x20 12 12 + }; 13 13 + unsigned char medium_suits_tile_3_data[6] = 14 14 + { 15 15 + 0x20,0x70,0xf8,0xf8,0x70,0x20 16 16 + }; 17 17 + unsigned char *medium_suits_tiles_data[4] = 18 18 + { 19 19 + medium_suits_tile_0_data, 20 20 + medium_suits_tile_1_data, 21 21 + medium_suits_tile_2_data, 22 22 + medium_suits_tile_3_data, 23 23 + };

+19

src/gfx/medium_suits.h

··· 1 1 + #ifndef medium_suits_include_file 2 2 + #define medium_suits_include_file 3 3 + 4 4 + #ifdef __cplusplus 5 5 + extern "C" { 6 6 + #endif 7 7 + 8 8 + extern unsigned char medium_suits_tile_0_data[6]; 9 9 + extern unsigned char medium_suits_tile_1_data[6]; 10 10 + extern unsigned char medium_suits_tile_2_data[6]; 11 11 + extern unsigned char medium_suits_tile_3_data[6]; 12 12 + #define medium_suits_num_tiles 4 13 13 + extern unsigned char *medium_suits_tiles_data[4]; 14 14 + 15 15 + #ifdef __cplusplus 16 16 + } 17 17 + #endif 18 18 + 19 19 + #endif

src/gfx/medium_suits.png

This is a binary file and will not be displayed.

+68

src/gfx/numerals.c

··· 1 1 + unsigned char numerals_tile_0_data[5] = 2 2 + { 3 3 + 0x70,0x50,0x70,0x50,0x50 4 4 + }; 5 5 + unsigned char numerals_tile_1_data[5] = 6 6 + { 7 7 + 0x70,0x10,0x70,0x40,0x70 8 8 + }; 9 9 + unsigned char numerals_tile_2_data[5] = 10 10 + { 11 11 + 0x70,0x10,0x30,0x10,0x70 12 12 + }; 13 13 + unsigned char numerals_tile_3_data[5] = 14 14 + { 15 15 + 0x50,0x50,0x70,0x10,0x10 16 16 + }; 17 17 + unsigned char numerals_tile_4_data[5] = 18 18 + { 19 19 + 0x70,0x40,0x70,0x10,0x70 20 20 + }; 21 21 + unsigned char numerals_tile_5_data[5] = 22 22 + { 23 23 + 0x70,0x40,0x70,0x50,0x70 24 24 + }; 25 25 + unsigned char numerals_tile_6_data[5] = 26 26 + { 27 27 + 0x70,0x10,0x10,0x10,0x10 28 28 + }; 29 29 + unsigned char numerals_tile_7_data[5] = 30 30 + { 31 31 + 0x70,0x50,0x70,0x50,0x70 32 32 + }; 33 33 + unsigned char numerals_tile_8_data[5] = 34 34 + { 35 35 + 0x70,0x50,0x70,0x10,0x10 36 36 + }; 37 37 + unsigned char numerals_tile_9_data[5] = 38 38 + { 39 39 + 0xb8,0xa8,0xa8,0xa8,0xb8 40 40 + }; 41 41 + unsigned char numerals_tile_10_data[5] = 42 42 + { 43 43 + 0x70,0x20,0x20,0x20,0x60 44 44 + }; 45 45 + unsigned char numerals_tile_11_data[5] = 46 46 + { 47 47 + 0x70,0x50,0x50,0x50,0x68 48 48 + }; 49 49 + unsigned char numerals_tile_12_data[5] = 50 50 + { 51 51 + 0x50,0x50,0x60,0x50,0x50 52 52 + }; 53 53 + unsigned char *numerals_tiles_data[13] = 54 54 + { 55 55 + numerals_tile_0_data, 56 56 + numerals_tile_1_data, 57 57 + numerals_tile_2_data, 58 58 + numerals_tile_3_data, 59 59 + numerals_tile_4_data, 60 60 + numerals_tile_5_data, 61 61 + numerals_tile_6_data, 62 62 + numerals_tile_7_data, 63 63 + numerals_tile_8_data, 64 64 + numerals_tile_9_data, 65 65 + numerals_tile_10_data, 66 66 + numerals_tile_11_data, 67 67 + numerals_tile_12_data, 68 68 + };

+28

src/gfx/numerals.h

··· 1 1 + #ifndef numerals_include_file 2 2 + #define numerals_include_file 3 3 + 4 4 + #ifdef __cplusplus 5 5 + extern "C" { 6 6 + #endif 7 7 + 8 8 + extern unsigned char numerals_tile_0_data[5]; 9 9 + extern unsigned char numerals_tile_1_data[5]; 10 10 + extern unsigned char numerals_tile_2_data[5]; 11 11 + extern unsigned char numerals_tile_3_data[5]; 12 12 + extern unsigned char numerals_tile_4_data[5]; 13 13 + extern unsigned char numerals_tile_5_data[5]; 14 14 + extern unsigned char numerals_tile_6_data[5]; 15 15 + extern unsigned char numerals_tile_7_data[5]; 16 16 + extern unsigned char numerals_tile_8_data[5]; 17 17 + extern unsigned char numerals_tile_9_data[5]; 18 18 + extern unsigned char numerals_tile_10_data[5]; 19 19 + extern unsigned char numerals_tile_11_data[5]; 20 20 + extern unsigned char numerals_tile_12_data[5]; 21 21 + #define numerals_num_tiles 13 22 22 + extern unsigned char *numerals_tiles_data[13]; 23 23 + 24 24 + #ifdef __cplusplus 25 25 + } 26 26 + #endif 27 27 + 28 28 + #endif

src/gfx/numerals.png

This is a binary file and will not be displayed.

+13

src/gfx/selcorner.c

··· 1 1 + unsigned char selcorner_tile_0_data[6] = 2 2 + { 3 3 + 0xfc,0xfc,0xe0,0xc0,0xc0,0xc0 4 4 + }; 5 5 + unsigned char selcorner_tile_1_data[6] = 6 6 + { 7 7 + 0xfc,0xfc,0x1c,0x0c,0x0c,0x0c 8 8 + }; 9 9 + unsigned char *selcorner_tiles_data[2] = 10 10 + { 11 11 + selcorner_tile_0_data, 12 12 + selcorner_tile_1_data, 13 13 + };

+17

src/gfx/selcorner.h

··· 1 1 + #ifndef selcorner_include_file 2 2 + #define selcorner_include_file 3 3 + 4 4 + #ifdef __cplusplus 5 5 + extern "C" { 6 6 + #endif 7 7 + 8 8 + extern unsigned char selcorner_tile_0_data[6]; 9 9 + extern unsigned char selcorner_tile_1_data[6]; 10 10 + #define selcorner_num_tiles 2 11 11 + extern unsigned char *selcorner_tiles_data[2]; 12 12 + 13 13 + #ifdef __cplusplus 14 14 + } 15 15 + #endif 16 16 + 17 17 + #endif

src/gfx/selcorner.png

This is a binary file and will not be displayed.

+23

src/gfx/small_suits.c

··· 1 1 + unsigned char small_suits_tile_0_data[4] = 2 2 + { 3 3 + 0x20,0x70,0x70,0x50 4 4 + }; 5 5 + unsigned char small_suits_tile_1_data[4] = 6 6 + { 7 7 + 0x20,0x70,0x20,0x70 8 8 + }; 9 9 + unsigned char small_suits_tile_2_data[4] = 10 10 + { 11 11 + 0x50,0x70,0x70,0x20 12 12 + }; 13 13 + unsigned char small_suits_tile_3_data[4] = 14 14 + { 15 15 + 0x20,0x70,0x70,0x20 16 16 + }; 17 17 + unsigned char *small_suits_tiles_data[4] = 18 18 + { 19 19 + small_suits_tile_0_data, 20 20 + small_suits_tile_1_data, 21 21 + small_suits_tile_2_data, 22 22 + small_suits_tile_3_data, 23 23 + };

+19

src/gfx/small_suits.h

··· 1 1 + #ifndef small_suits_include_file 2 2 + #define small_suits_include_file 3 3 + 4 4 + #ifdef __cplusplus 5 5 + extern "C" { 6 6 + #endif 7 7 + 8 8 + extern unsigned char small_suits_tile_0_data[4]; 9 9 + extern unsigned char small_suits_tile_1_data[4]; 10 10 + extern unsigned char small_suits_tile_2_data[4]; 11 11 + extern unsigned char small_suits_tile_3_data[4]; 12 12 + #define small_suits_num_tiles 4 13 13 + extern unsigned char *small_suits_tiles_data[4]; 14 14 + 15 15 + #ifdef __cplusplus 16 16 + } 17 17 + #endif 18 18 + 19 19 + #endif

src/gfx/small_suits.png

This is a binary file and will not be displayed.

-150

src/input.c

··· 1 1 - // Kabufuda Solitaire / KBFDSLTR for the TI-84 Plus CE 2 2 - // Copyright (C) 2024 euphory 3 3 - // 4 4 - // This program is free software: you can redistribute it and/or modify 5 5 - // it under the terms of the GNU General Public License as published by 6 6 - // the Free Software Foundation, either version 3 of the License, or 7 7 - // (at your option) any later version. 8 8 - // 9 9 - // This program is distributed in the hope that it will be useful, 10 10 - // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 11 - // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 12 - // GNU General Public License for more details. 13 13 - // 14 14 - // You should have received a copy of the GNU General Public License 15 15 - // along with this program. If not, see <https://www.gnu.org/licenses/>. 16 16 - 17 17 - #include "input.h" 18 18 - 19 19 - #include <stdlib.h> 20 20 - #include <keypadc.h> 21 21 - #include "variables.h" 22 22 - #include "ops.h" 23 23 - #include "save.h" 24 24 - 25 25 - unsigned char down, left, right, up; 26 26 - 27 27 - bool doInput() 28 28 - { 29 29 - const bool prevSecond = kb_IsDown(kb_Key2nd); 30 30 - const bool prevEnter = kb_IsDown(kb_KeyEnter); 31 31 - const bool prevAlpha = kb_IsDown(kb_KeyAlpha); 32 32 - const bool prevClear = kb_IsDown(kb_KeyClear); 33 33 - 34 34 - kb_Scan(); 35 35 - 36 36 - up = kb_IsDown(kb_KeyUp) ? up + 1 : 0; 37 37 - down = kb_IsDown(kb_KeyDown) ? down + 1 : 0; 38 38 - left = kb_IsDown(kb_KeyLeft) ? left + 1 : 0; 39 39 - right = kb_IsDown(kb_KeyRight) ? right + 1 : 0; 40 40 - 41 41 - const bool select = (kb_IsDown(kb_Key2nd) && !prevSecond) || (kb_IsDown(kb_KeyEnter) && !prevEnter); 42 42 - const bool clear = (kb_IsDown(kb_KeyClear) && !prevClear) || (kb_IsDown(kb_KeyAlpha) && !prevAlpha); 43 43 - 44 44 - if (select) 45 45 - { 46 46 - if (cursorMode == SELECT && canGrabCard()) 47 47 - { 48 48 - orgStack = cursorStack; 49 49 - orgIndex = cursorIndex; 50 50 - cursorMode = DROP; 51 51 - } 52 52 - else if (canDropCard()) 53 53 - { 54 54 - dropCard(); 55 55 - cursorMode = SELECT; 56 56 - } 57 57 - else if (cursorStack == orgStack) 58 58 - { 59 59 - cursorMode = SELECT; 60 60 - } 61 61 - } 62 62 - else if (clear) cursorMode = SELECT; 63 63 - 64 64 - unsigned char prevCursorStack = cursorStack; 65 65 - 66 66 - if (down == 1 || down > HOLD_TIME) 67 67 - { 68 68 - cursorIndex++; 69 69 - } 70 70 - else if (left == 1 || left > HOLD_TIME) 71 71 - { 72 72 - do 73 73 - { 74 74 - if (cursorStack == 0) cursorStack = NUM_FREECELLS + NUM_TABLSLOTS - 1; // wrap 75 75 - else cursorStack--; 76 76 - } 77 77 - while (cursorOnCollapsed() || cursorOnLocked()); // skip useless stacks 78 78 - } 79 79 - else if (right == 1 || right > HOLD_TIME) 80 80 - { 81 81 - do 82 82 - { 83 83 - if (cursorStack > NUM_FREECELLS + NUM_TABLSLOTS - 2) cursorStack = 0; // wrap 84 84 - else cursorStack++; 85 85 - } 86 86 - while (cursorOnCollapsed() || cursorOnLocked()); // skip useless stacks 87 87 - } 88 88 - else if (up == 1 || up > HOLD_TIME) 89 89 - { 90 90 - if (cursorIndex > 0) cursorIndex--; 91 91 - } 92 92 - 93 93 - if (cursorStack < NUM_FREECELLS) 94 94 - { 95 95 - cursorIndex = 0; 96 96 - } 97 97 - else if (cursorMode == DROP) 98 98 - { 99 99 - // if dropping cards, the cursor should always be at the top of the stack it's on 100 100 - // except maxCursorIndex() doesn't work so well on empty tableau stacks 101 101 - if (cursorStack != orgStack) 102 102 - { 103 103 - if (tableau[cursorStack - NUM_FREECELLS][0] == 11) 104 104 - { 105 105 - cursorIndex = 0; 106 106 - } 107 107 - else 108 108 - { 109 109 - maxCursorIndex(); 110 110 - cursorIndex++; 111 111 - } 112 112 - } 113 113 - else cursorIndex = orgIndex; // also this makes it more clear if we are trying to drop 114 114 - // back on the original cards 115 115 - } 116 116 - else if (cursorStack != prevCursorStack) 117 117 - { 118 118 - maxCursorIndex(); 119 119 - } 120 120 - else 121 121 - { 122 122 - while (tableau[cursorStack - NUM_FREECELLS][cursorIndex] == 11 && cursorIndex > 0) cursorIndex--; 123 123 - } 124 124 - 125 125 - if (cursorMode == SELECT) 126 126 - { 127 127 - selectedQty = 1; 128 128 - if (cursorStack < NUM_FREECELLS) selectedCard = freeCells[cursorStack]; 129 129 - else 130 130 - { 131 131 - selectedCard = tableau[cursorStack - NUM_FREECELLS][cursorIndex]; 132 132 - for (int i = cursorIndex + 1; tableau[cursorStack - NUM_FREECELLS][i] == selectedCard; i++) 133 133 - selectedQty++; 134 134 - } 135 135 - 136 136 - if (selectedCard > 11) 137 137 - { 138 138 - selectedCard -= 12; 139 139 - selectedQty = 4; 140 140 - } 141 141 - } 142 142 - 143 143 - if (kb_IsDown(kb_KeyDel)) 144 144 - { 145 145 - deleteSave(); 146 146 - start(); 147 147 - } 148 148 - 149 149 - return !kb_On && progress < 10; 150 150 - }

-24

src/input.h

··· 1 1 - // Kabufuda Solitaire / KBFDSLTR for the TI-84 Plus CE 2 2 - // Copyright (C) 2024 euphory 3 3 - // 4 4 - // This program is free software: you can redistribute it and/or modify 5 5 - // it under the terms of the GNU General Public License as published by 6 6 - // the Free Software Foundation, either version 3 of the License, or 7 7 - // (at your option) any later version. 8 8 - // 9 9 - // This program is distributed in the hope that it will be useful, 10 10 - // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 11 - // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 12 - // GNU General Public License for more details. 13 13 - // 14 14 - // You should have received a copy of the GNU General Public License 15 15 - // along with this program. If not, see <https://www.gnu.org/licenses/>. 16 16 - 17 17 - #ifndef input_include_file 18 18 - #define input_include_file 19 19 - 20 20 - #include <stdbool.h> 21 21 - 22 22 - bool doInput(); 23 23 - 24 24 - #endif

+20 -93

src/main.c

··· 1 1 - // Kabufuda Solitaire / KBFDSLTR for the TI-84 Plus CE 2 2 - // Copyright (C) 2024 euphory 3 3 - // 4 4 - // This program is free software: you can redistribute it and/or modify 5 5 - // it under the terms of the GNU General Public License as published by 6 6 - // the Free Software Foundation, either version 3 of the License, or 7 7 - // (at your option) any later version. 8 8 - // 9 9 - // This program is distributed in the hope that it will be useful, 10 10 - // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 11 - // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 12 - // GNU General Public License for more details. 13 13 - // 14 14 - // You should have received a copy of the GNU General Public License 15 15 - // along with this program. If not, see <https://www.gnu.org/licenses/>. 16 16 - 17 17 - #include <fileioc.h> 18 18 - #include <stdlib.h> 19 19 - #include <math.h> 20 20 - #include <time.h> 21 21 - #include <keypadc.h> 22 22 - 23 23 - #include "variables.h" 24 24 - #include "input.h" 1 1 + #include "card.h" 25 2 #include "drawing.h" 26 26 - #include "save.h" 27 27 - #include "ops.h" 28 28 - 29 29 - unsigned char tableau[NUM_TABLSLOTS][TABL_STACK_SIZE]; 30 30 - unsigned char freeCells[NUM_FREECELLS]; 31 31 - unsigned char fcUnlocked; 32 32 - unsigned char progress; 33 33 - unsigned char numWins; 34 34 - 35 35 - bool run() 36 36 - { 37 37 - start(); 38 38 - 39 39 - while (doInput()) 40 40 - { 41 41 - clock_t frameTimer = clock(); 42 42 - 43 43 - drawFrame(); 44 44 - 45 45 - while (clock() - frameTimer < FRAME_TIME); 46 46 - } 47 47 - 48 48 - if (progress == 10) 49 49 - { 50 50 - // this way we know not to try to resume 51 51 - deleteSave(); 52 52 - 53 53 - drawFrame(); 54 54 - 55 55 - while (kb_AnyKey()); 56 56 - 57 57 - while (true) 58 58 - { 59 59 - kb_Scan(); 60 60 - if (kb_On) return false; 61 61 - if (kb_IsDown(kb_Key2nd) || kb_IsDown(kb_KeyEnter)) return true; 62 62 - } 63 63 - } 64 64 - else 65 65 - { 66 66 - // user exited mid-game 67 67 - save(); 68 68 - return false; 69 69 - } 70 70 - } 3 3 + #include "gfx/gfx.h" 4 4 + #include <graphx.h> 5 5 + #include <ti/getcsc.h> 71 6 72 7 int main(void) 73 8 { 74 74 - KBFDGFX_init(); 75 75 - 76 76 - cardSprite[0] = card1; 77 77 - cardSprite[1] = card2; 78 78 - cardSprite[2] = card3; 79 79 - cardSprite[3] = card4; 80 80 - cardSprite[4] = card5; 81 81 - cardSprite[5] = card6; 82 82 - cardSprite[6] = card7; 83 83 - cardSprite[7] = card8; 84 84 - cardSprite[8] = card9; 85 85 - cardSprite[9] = card10; 86 86 - cardSprite[10] = cardstack; 87 87 - 88 88 - gfx_Begin(); 89 89 - gfx_SetDrawBuffer(); 90 90 - gfx_SetPalette(global_palette, sizeof_global_palette, 0); 91 91 - gfx_SetTransparentColor(3); 9 9 + gfx_Begin(); 10 10 + gfx_SetPalette(&global_palette, sizeof(global_palette), 0); 11 11 + gfx_SetDrawBuffer(); 12 12 + gfx_FillScreen(3); 92 13 93 93 - kb_EnableOnLatch(); 94 94 - kb_ClearOnLatch(); 14 14 + alloc_stacks(2); 15 15 + make_stack(0, 5, 100, 50, 5, 2); 16 16 + stacks[0].cards[0] = 0x8c; 17 17 + stacks[0].cards[1] = 0x9b; 95 18 96 96 - while (run()); 19 19 + while (!boot_CheckOnPressed()) 20 20 + { 21 21 + gfx_SetColor(7); 97 22 98 98 - gfx_End(); 23 23 + draw_stacks(); 24 24 + gfx_BlitBuffer(); 99 25 100 100 - kb_ClearOnLatch(); 26 26 + os_GetCSC(); 27 27 + } 101 28 102 102 - return 0; 29 29 + gfx_End(); 103 30 }

-150

src/ops.c

··· 1 1 - // Kabufuda Solitaire / KBFDSLTR for the TI-84 Plus CE 2 2 - // Copyright (C) 2024 euphory 3 3 - // 4 4 - // This program is free software: you can redistribute it and/or modify 5 5 - // it under the terms of the GNU General Public License as published by 6 6 - // the Free Software Foundation, either version 3 of the License, or 7 7 - // (at your option) any later version. 8 8 - // 9 9 - // This program is distributed in the hope that it will be useful, 10 10 - // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 11 - // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 12 - // GNU General Public License for more details. 13 13 - // 14 14 - // You should have received a copy of the GNU General Public License 15 15 - // along with this program. If not, see <https://www.gnu.org/licenses/>. 16 16 - 17 17 - #include "ops.h" 18 18 - 19 19 - #include <stdlib.h> 20 20 - #include <fileioc.h> 21 21 - 22 22 - #include "variables.h" 23 23 - #include "save.h" 24 24 - 25 25 - unsigned char cursorStack; 26 26 - unsigned char cursorIndex; 27 27 - enum cursorMode_t cursorMode; 28 28 - unsigned char selectedCard; 29 29 - unsigned char selectedQty; 30 30 - unsigned char orgStack; 31 31 - unsigned char orgIndex; 32 32 - 33 33 - void start() 34 34 - { 35 35 - loadWins(); 36 36 - 37 37 - // fill tableau and free cells with empty space 38 38 - for (unsigned char i = 0; i < NUM_FREECELLS; i++) 39 39 - freeCells[i] = 11; 40 40 - for (unsigned char i = 0; i < NUM_TABLSLOTS; i++) 41 41 - for (unsigned char j = 0; j < TABL_STACK_SIZE; j++) 42 42 - tableau[i][j] = 11; 43 43 - 44 44 - load(); // will call deal() as well if necessary 45 45 - 46 46 - // set initial variables 47 47 - cursorMode = SELECT; 48 48 - cursorStack = NUM_FREECELLS; 49 49 - maxCursorIndex(); 50 50 - selectedCard = tableau[cursorStack][cursorIndex]; 51 51 - } 52 52 - 53 53 - bool canGrabCard() 54 54 - { 55 55 - if (cursorStack < NUM_FREECELLS) return freeCells[cursorStack] < 11; 56 56 - 57 57 - if (tableau[cursorStack - NUM_FREECELLS][0] > 11) return false; 58 58 - for (unsigned char i = cursorIndex + 1; i < TABL_STACK_SIZE; i++) 59 59 - { 60 60 - const unsigned char x = tableau[cursorStack - NUM_FREECELLS][i]; 61 61 - if (x == 11) return true; 62 62 - if (x != selectedCard) return false; 63 63 - } 64 64 - 65 65 - return true; 66 66 - } 67 67 - 68 68 - bool canDropCard() 69 69 - { 70 70 - if (cursorStack < NUM_FREECELLS) 71 71 - { 72 72 - const unsigned char x = freeCells[cursorStack]; 73 73 - if (cursorStack < fcUnlocked) 74 74 - { 75 75 - if (selectedQty == 1 || selectedQty == 4) return x == 11; 76 76 - else return x == selectedCard && selectedQty == 3; 77 77 - } 78 78 - else return false; 79 79 - } 80 80 - else if (cursorIndex == 0) return true; 81 81 - else return tableau[cursorStack - NUM_FREECELLS][cursorIndex - 1] == selectedCard; 82 82 - } 83 83 - 84 84 - bool checkTableauCollapse(unsigned char stackToCheck) 85 85 - { 86 86 - const unsigned char x = tableau[stackToCheck][0]; 87 87 - for (unsigned char i = 1; i < 5; i++) 88 88 - { 89 89 - const unsigned char y = tableau[stackToCheck][i]; 90 90 - if (i == 4 && y == 11) return true; 91 91 - if (y != x) return false; 92 92 - } 93 93 - 94 94 - return false; 95 95 - } 96 96 - 97 97 - void dropCard() 98 98 - { 99 99 - if (cursorStack == orgStack) return; 100 100 - 101 101 - unsigned char const prevProgress = progress; 102 102 - 103 103 - if (cursorStack < NUM_FREECELLS) 104 104 - { 105 105 - if (selectedQty == 1) freeCells[cursorStack] = selectedCard; 106 106 - else 107 107 - { 108 108 - progress++; 109 109 - freeCells[cursorStack] = 12 + selectedCard; 110 110 - } 111 111 - } 112 112 - else 113 113 - { 114 114 - for (unsigned char i = cursorIndex; i < cursorIndex + selectedQty; i++) 115 115 - tableau[cursorStack - NUM_FREECELLS][i] = selectedCard; 116 116 - if (checkTableauCollapse(cursorStack - NUM_FREECELLS)) 117 117 - { 118 118 - fcUnlocked++; 119 119 - progress++; 120 120 - tableau[cursorStack - NUM_FREECELLS][0] = selectedCard + 12; 121 121 - for (int i = 1; i < 4; i++) tableau[cursorStack - NUM_FREECELLS][i] = 11; 122 122 - } 123 123 - } 124 124 - 125 125 - if (orgStack < NUM_FREECELLS) freeCells[orgStack] = 11; 126 126 - else for (unsigned char i = orgIndex; i < orgIndex + selectedQty; i++) 127 127 - tableau[orgStack - NUM_FREECELLS][i] = 11; 128 128 - 129 129 - if (progress == 10 && prevProgress < 10) numWins++; 130 130 - } 131 131 - 132 132 - void maxCursorIndex() 133 133 - { 134 134 - if (cursorStack < NUM_FREECELLS) return; 135 135 - 136 136 - cursorIndex = TABL_STACK_SIZE - 1; 137 137 - while (tableau[cursorStack - NUM_FREECELLS][cursorIndex] == 11 && cursorIndex > 0) cursorIndex--; 138 138 - } 139 139 - 140 140 - bool cursorOnCollapsed() 141 141 - { 142 142 - return cursorStack < NUM_FREECELLS ? freeCells[cursorStack] > 11 143 143 - : tableau[cursorStack - NUM_FREECELLS][0] > 11; 144 144 - } 145 145 - 146 146 - bool cursorOnLocked() 147 147 - { 148 148 - return cursorStack >= fcUnlocked && cursorStack < NUM_FREECELLS; 149 149 - } 150 150 -

-34

src/ops.h

··· 1 1 - // Kabufuda Solitaire / KBFDSLTR for the TI-84 Plus CE 2 2 - // Copyright (C) 2024 euphory 3 3 - // 4 4 - // This program is free software: you can redistribute it and/or modify 5 5 - // it under the terms of the GNU General Public License as published by 6 6 - // the Free Software Foundation, either version 3 of the License, or 7 7 - // (at your option) any later version. 8 8 - // 9 9 - // This program is distributed in the hope that it will be useful, 10 10 - // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 11 - // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 12 - // GNU General Public License for more details. 13 13 - // 14 14 - // You should have received a copy of the GNU General Public License 15 15 - // along with this program. If not, see <https://www.gnu.org/licenses/>. 16 16 - 17 17 - #ifndef ops_include_file 18 18 - #define ops_include_file 19 19 - 20 20 - #include <stdbool.h> 21 21 - 22 22 - void start(); 23 23 - 24 24 - bool canGrabCard(); 25 25 - bool canDropCard(); 26 26 - bool checkTableauCollapse(unsigned char stackToCheck); 27 27 - 28 28 - void dropCard(); 29 29 - void maxCursorIndex(); 30 30 - 31 31 - bool cursorOnCollapsed(); 32 32 - bool cursorOnLocked(); 33 33 - 34 34 - #endif

-120

src/save.c

··· 1 1 - // Kabufuda Solitaire / KBFDSLTR for the TI-84 Plus CE 2 2 - // Copyright (C) 2024 euphory 3 3 - // 4 4 - // This program is free software: you can redistribute it and/or modify 5 5 - // it under the terms of the GNU General Public License as published by 6 6 - // the Free Software Foundation, either version 3 of the License, or 7 7 - // (at your option) any later version. 8 8 - // 9 9 - // This program is distributed in the hope that it will be useful, 10 10 - // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 11 - // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 12 - // GNU General Public License for more details. 13 13 - // 14 14 - // You should have received a copy of the GNU General Public License 15 15 - // along with this program. If not, see <https://www.gnu.org/licenses/>. 16 16 - 17 17 - #include "save.h" 18 18 - 19 19 - #include <sys/rtc.h> 20 20 - #include <fileioc.h> 21 21 - #include <stdlib.h> 22 22 - 23 23 - #include "variables.h" 24 24 - #include "drawing.h" 25 25 - 26 26 - void deal() 27 27 - { 28 28 - srand(rtc_Time()); 29 29 - 30 30 - for (unsigned char i = 0; i < 10; i++) 31 31 - { 32 32 - for (unsigned char j = 0; j < 4; j++) 33 33 - { 34 34 - while (true) 35 35 - { 36 36 - unsigned char dStack = rand() % 8; 37 37 - unsigned char dIndex = rand() % 5; 38 38 - 39 39 - if (tableau[dStack][dIndex] == 11) 40 40 - { 41 41 - tableau[dStack][dIndex] = i; 42 42 - break; 43 43 - } 44 44 - } 45 45 - } 46 46 - } 47 47 - 48 48 - fcUnlocked = 1; 49 49 - progress = 0; 50 50 - 51 51 - animateDeal(); 52 52 - } 53 53 - 54 54 - void load() 55 55 - { 56 56 - unsigned char saveHandle = ti_Open(SAVE_VAR_NAME, "r"); 57 57 - 58 58 - if (saveHandle == 0) 59 59 - { 60 60 - // no save present 61 61 - deal(); 62 62 - } 63 63 - else 64 64 - { 65 65 - // load save 66 66 - ti_Read(freeCells, 1, NUM_FREECELLS, saveHandle); 67 67 - ti_Read(tableau, 1, NUM_TABLSLOTS * TABL_STACK_SIZE, saveHandle); 68 68 - 69 69 - // how far along does that make us? 70 70 - progress = 0; 71 71 - fcUnlocked = 1; 72 72 - for (unsigned char i = 0; i < NUM_FREECELLS; i++) 73 73 - { 74 74 - if (freeCells[i] > 11) 75 75 - { 76 76 - progress++; 77 77 - } 78 78 - } 79 79 - for (unsigned char i = 0; i < NUM_TABLSLOTS; i++) 80 80 - { 81 81 - if (tableau[i][0] > 11) 82 82 - { 83 83 - progress++; 84 84 - fcUnlocked++; 85 85 - } 86 86 - } 87 87 - } 88 88 - 89 89 - ti_Close(saveHandle); 90 90 - } 91 91 - 92 92 - void save() 93 93 - { 94 94 - unsigned char saveHandle = ti_Open(SAVE_VAR_NAME, "w"); 95 95 - 96 96 - ti_Write(freeCells, 1, NUM_FREECELLS, saveHandle); 97 97 - ti_Write(tableau, 1, NUM_TABLSLOTS * TABL_STACK_SIZE, saveHandle); 98 98 - 99 99 - ti_Close(saveHandle); 100 100 - } 101 101 - 102 102 - void deleteSave() 103 103 - { 104 104 - ti_Delete(SAVE_VAR_NAME); 105 105 - } 106 106 - 107 107 - void loadWins() 108 108 - { 109 109 - numWins = 0; 110 110 - unsigned char winsHandle = ti_Open(WINS_VAR_NAME, "r"); 111 111 - if (winsHandle != 0) ti_Read(&numWins, 1, 1, winsHandle); 112 112 - ti_Close(winsHandle); 113 113 - } 114 114 - 115 115 - void saveWins() 116 116 - { 117 117 - unsigned char const winsHandle = ti_Open(WINS_VAR_NAME, "w"); 118 118 - ti_Write(&numWins, 1, 1, winsHandle); 119 119 - ti_Close(winsHandle); 120 120 - }

-27

src/save.h

··· 1 1 - // Kabufuda Solitaire / KBFDSLTR for the TI-84 Plus CE 2 2 - // Copyright (C) 2024 euphory 3 3 - // 4 4 - // This program is free software: you can redistribute it and/or modify 5 5 - // it under the terms of the GNU General Public License as published by 6 6 - // the Free Software Foundation, either version 3 of the License, or 7 7 - // (at your option) any later version. 8 8 - // 9 9 - // This program is distributed in the hope that it will be useful, 10 10 - // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 11 - // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 12 - // GNU General Public License for more details. 13 13 - // 14 14 - // You should have received a copy of the GNU General Public License 15 15 - // along with this program. If not, see <https://www.gnu.org/licenses/>. 16 16 - 17 17 - #ifndef save_include_file 18 18 - #define save_include_file 19 19 - 20 20 - void deal(); 21 21 - void load(); 22 22 - void save(); 23 23 - void deleteSave(); 24 24 - void loadWins(); 25 25 - void saveWins(); 26 26 - 27 27 - #endif

-60

src/variables.h

··· 1 1 - // Kabufuda Solitaire / KBFDSLTR for the TI-84 Plus CE 2 2 - // Copyright (C) 2024 euphory 3 3 - // 4 4 - // This program is free software: you can redistribute it and/or modify 5 5 - // it under the terms of the GNU General Public License as published by 6 6 - // the Free Software Foundation, either version 3 of the License, or 7 7 - // (at your option) any later version. 8 8 - // 9 9 - // This program is distributed in the hope that it will be useful, 10 10 - // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 11 - // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 12 - // GNU General Public License for more details. 13 13 - // 14 14 - // You should have received a copy of the GNU General Public License 15 15 - // along with this program. If not, see <https://www.gnu.org/licenses/>. 16 16 - 17 17 - #ifndef variables_include_file 18 18 - #define variables_include_file 19 19 - 20 20 - #define WINS_VAR_NAME "KBFDWINS" 21 21 - #define SAVE_VAR_NAME "KBFDSAVE" 22 22 - 23 23 - #define BKGND_COLOR 2 24 24 - #define BORDER_COLOR 1 25 25 - #define TOP_BORDER 25 26 26 - 27 27 - #define FRAME_TIME 3277 28 28 - #define HOLD_TIME 2 29 29 - 30 30 - #define NUM_FREECELLS 4 31 31 - #define NUM_TABLSLOTS 8 32 32 - #define TABL_STACK_SIZE 8 33 33 - #define LOCK_ICON_VOFFSET 17 34 34 - #define LOCK_ICON_HOFFSET 9 35 35 - #define FC_VPOS 50 36 36 - #define TABL_VPOS 100 37 37 - #define FC_HPOS 102 38 38 - #define TABL_HPOS 42 39 39 - 40 40 - #define TEXT_CHAR_WIDTH 8 41 41 - #define SELCARD_DISP_X 5 42 42 - #define SELCARD_DISP_Y 9 43 43 - #define NUMWINS_DISP_X (GFX_LCD_WIDTH - 5 - 3 * TEXT_CHAR_WIDTH) 44 44 - 45 45 - extern unsigned char tableau[NUM_TABLSLOTS][TABL_STACK_SIZE]; 46 46 - extern unsigned char freeCells[NUM_FREECELLS]; 47 47 - extern unsigned char fcUnlocked; 48 48 - 49 49 - extern unsigned char cursorStack; 50 50 - extern unsigned char cursorIndex; 51 51 - extern enum cursorMode_t { SELECT, DROP } cursorMode; 52 52 - extern unsigned char selectedCard; 53 53 - extern unsigned char selectedQty; 54 54 - extern unsigned char orgStack; 55 55 - extern unsigned char orgIndex; 56 56 - 57 57 - extern unsigned char progress; 58 58 - extern unsigned char numWins; 59 59 - 60 60 - #endif