From 4f21f6060fb1699956ac0c67ffe83814b76da809 Mon Sep 17 00:00:00 2001 From: girst Date: Tue, 27 Jun 2017 16:04:33 +0200 Subject: [PATCH] ihello world^[:wq --- LICENSE | 619 ++++++++++++++++++++++++++++++++++++++++++++ Makefile | 11 + mines_2017.c | 707 +++++++++++++++++++++++++++++++++++++++++++++++++++ schemes.h | 135 ++++++++++ 4 files changed, 1472 insertions(+) create mode 100644 LICENSE create mode 100644 Makefile create mode 100644 mines_2017.c create mode 100644 schemes.h diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..bc08fe2 --- /dev/null +++ b/LICENSE @@ -0,0 +1,619 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..0f953e6 --- /dev/null +++ b/Makefile @@ -0,0 +1,11 @@ +.PHONY: all clean run +all: 2017mines + +2017mines: mines_2017.c schemes.h + gcc mines_2017.c -o 2017mines + +run: 2017mines + ./2017mines + +clean: + rm -f 2017mines diff --git a/mines_2017.c b/mines_2017.c new file mode 100644 index 0000000..71ca10d --- /dev/null +++ b/mines_2017.c @@ -0,0 +1,707 @@ +/******************************************************************************* + minesviiper 0.3.11 + By Tobias Girstmair, 2015 - 2017 + + ./minesviiper -w 16 -h 16 -m 40 + (see ./minesviiper -\? for full list of options) + + MOUSE MODE: - left click to open and choord + - right click to flag/unflag + VI MODE: - hjkl to move cursor left/down/up/right + - bduw to jump left/down/up/right by 5 cells + - space to open and choord + - i to flag/unflag + + GNU GPL v3, see LICENSE or https://www.gnu.org/licenses/gpl-3.0.txt +*******************************************************************************/ + + +#define _POSIX_C_SOURCE 2 /*for getopt, sigaction in c99*/ +#include +#include +#include +#include +#include +#include +#include + +#include "schemes.h" + +#define LINE_OFFSET 3 +#define COL_OFFSET 2 +#define BIG_MOVE 5 + +#define MIN(a,b) (a>b?b:a) +#define MAX(a,b) (a>b?a:b) +#define printm(num, str) for (int i = 0; i < num; i++) fputs (str, stdout) +#define print(str) fputs (str, stdout) + +struct minecell { + unsigned m:2; /* mine?1:killmine?2:0 */ + unsigned o:1; /* open?1:0 */ + unsigned f:2; /* flagged?1:questioned?2:0 */ + unsigned n:4; /* 0<= neighbours <=8 */ +}; +struct minefield { + struct minecell **c; + int w; /* width */ + int h; /* height */ + int m; /* number of mines */ + + int f; /* flags counter */ + int t; /* time of game start */ + int p[2]; /* cursor position {line, col} */ +} f; + +struct opt { + struct minescheme* scheme; + int mode; /* allow flags? quesm? */ +} op; + +void fill_minefield (int, int); +void move (int, int); +int getch (unsigned char*); +int getctrlseq (unsigned char*); +int everything_opened (); +int wait_mouse_up (int, int); +void partial_show_minefield (int, int, int); +void show_minefield (int); +int get_neighbours (int, int, int); +int uncover_square (int, int); +void flag_square (int, int); +int choord_square (int, int); +struct minecell** alloc_array (int, int); +void free_field (); +int screen2field_l (int); +int screen2field_c (int); +int field2screen_l (int); +int field2screen_c (int); +void quit(); +void signal_handler (int signum); + +enum modes { + NORMAL, + REDUCED, + SHOWMINES, +}; +enum flagtypes { + NOFLAG, + FLAG, + QUESM, +}; +enum fieldopenstates { + CLOSED, + OPENED, +}; +enum event { + /* for getctrlseq() */ + CTRSEQ_NULL = 0, + CTRSEQ_EOF = -1, + CTRSEQ_INVALID = -2, + CTRSEQ_MOUSE = -3, + /* for getch() */ + CTRSEQ_MOUSE_LEFT = -4, + CTRSEQ_MOUSE_MIDDLE = -5, + CTRSEQ_MOUSE_RIGHT = -6, +}; +enum mine_types { + NO_MINE, + STD_MINE, + DEATH_MINE, +}; + +void signal_handler (int signum) { + switch (signum) { + case SIGALRM: + move (1, f.w*op.scheme->cell_width-(op.scheme->cell_width%2)-3); + printf ("[%03d]", f.t?(int)difftime (time(NULL), f.t):0); + break; + case SIGINT: + exit(128+SIGINT); + } +} + +/* http://users.csc.calpoly.edu/~phatalsk/357/lectures/code/sigalrm.c */ +struct termios saved_term_mode; +struct termios set_raw_term_mode() { + struct termios cur_term_mode, raw_term_mode; + + tcgetattr(STDIN_FILENO, &cur_term_mode); + raw_term_mode = cur_term_mode; + raw_term_mode.c_lflag &= ~(ICANON | ECHO); + raw_term_mode.c_cc[VMIN] = 1 ; + raw_term_mode.c_cc[VTIME] = 0; + tcsetattr(STDIN_FILENO, TCSAFLUSH, &raw_term_mode); + + return cur_term_mode; +} +void restore_term_mode(struct termios saved_term_mode) { + tcsetattr(STDIN_FILENO, TCSAFLUSH, &saved_term_mode); +} + + +int main (int argc, char** argv) { + struct itimerval tbuf; + struct sigaction saction; + saved_term_mode = set_raw_term_mode(); + + atexit (*quit); + + saction.sa_handler = signal_handler; + sigemptyset(&saction.sa_mask); + saction.sa_flags = 0; + if (sigaction(SIGALRM, &saction, NULL) < 0 ) { + perror("SIGALRM"); + exit(1); + } + tbuf.it_interval.tv_sec = 1; + tbuf.it_interval.tv_usec = 0; + tbuf.it_value.tv_sec = 1; + tbuf.it_value.tv_usec = 0; + + if (sigaction(SIGINT, &saction, NULL) < 0 ) { + perror ("SIGINT"); + exit (1); + } + /* end screen setup */ + + /* setup defaults */ + f.w = 30; + f.h = 16; + f.m = 99; + + op.scheme = &symbols_mono; + op.mode = FLAG; + /* end defaults */ + /* parse options */ + int optget; + opterr = 0; /* don't print message on unrecognized option */ + while ((optget = getopt (argc, argv, "+w:h:m:nfqcdx")) != -1) { + switch (optget) { + case 'w': f.w = atoi (optarg); break; + case 'h': f.h = atoi (optarg); break; + case 'm': f.m = atoi (optarg); break; + case 'n': op.mode = NOFLAG; break; + case 'f': op.mode = FLAG; break; /*default*/ + case 'q': op.mode = QUESM; break; + case 'c': op.scheme = &symbols_col1; break; + case 'd': op.scheme = &symbols_doublewidth; break; + case '?': + fprintf (stderr, "%s [OPTIONS]\n" + "OPTIONS:\n" + " w(idth)\n" + " h(eight)\n" + " m(ines)\n" + " n(o flagging)\n" + " f(lagging)\n" + " q(uestion marks)\n" + " c(olored symbols)\n" + " d(oublewidth symbols)\n" + "\n" + "hjkl: move 1 left/down/up/right\n" + "bduw: move 5 left/down/up/right\n" + "left mouse/space: open/choord\n" + "right mouse/i: flag/unflag\n", argv[0]); + return 1; + } + } + /* end parse options*/ + /* check boundaries */ + if (f.m > (f.w-1) * (f.h-1)) { + f.m = (f.w-1) * (f.h-1); + fprintf (stderr, "too many mines. reduced to %d.\r\n", f.m); + } + /* end check */ + +newgame: + f.c = alloc_array (f.h, f.w); + + f.f = 0; + f.t = 0; + f.p[0] = 0; + f.p[1] = 0; + + int is_newgame = 1; + int cheatmode = 0; + + printf ("\033[H\033[J"); + + show_minefield (NORMAL); + + /* enable mouse, hide cursor */ + printf ("\033[?1000h\033[?25l"); + while (1) { + int l, c; + int action; + unsigned char mouse[3]; + + action = getch(mouse); + switch (action) { + case CTRSEQ_MOUSE_LEFT: + f.p[0] = screen2field_l (mouse[2]); + f.p[1] = screen2field_c (mouse[1]); + /* :D clicked: TODO: won't work in single-width mode! */ + if (mouse[2] == LINE_OFFSET-1 && + (mouse[1] == f.w+COL_OFFSET || + mouse[1] == f.w+COL_OFFSET+1)) { + free_field (); + goto newgame; + } + if (f.p[1] < 0 || f.p[1] >= f.w || + f.p[0] < 0 || f.p[0] >= f.h) break; /*out of bound*/ + /* fallthrough */ + case ' ': + if (is_newgame) { + is_newgame = 0; + fill_minefield (f.p[0], f.p[1]); + f.t = time(NULL); + tbuf.it_value.tv_sec = 1; + tbuf.it_value.tv_usec = 0; + if (setitimer(ITIMER_REAL, &tbuf, NULL) == -1) { + perror("setitimer"); + exit(1); + } + } + + if (f.c[f.p[0]][f.p[1]].f == FLAG ) break; + if (f.c[f.p[0]][f.p[1]].o == CLOSED) { + if (uncover_square (f.p[0], f.p[1])) goto lose; + } else if (get_neighbours (f.p[0], f.p[1], 1) == 0) { + if (choord_square (f.p[0], f.p[1])) goto lose; + } + if (everything_opened()) goto win; + break; + case CTRSEQ_MOUSE_RIGHT: + f.p[0] = screen2field_l (mouse[2]); + f.p[1] = screen2field_c (mouse[1]); + if (f.p[1] < 0 || f.p[1] >= f.w || + f.p[0] < 0 || f.p[1] >= f.h) break; /*out of bound*/ + /* fallthrough */ + case 'i': + if (f.c[f.p[0]][f.p[1]].o == CLOSED) + flag_square (f.p[0], f.p[1]); + break; + case 'h': + partial_show_minefield (f.p[0], f.p[1], NORMAL); + if (f.p[1] > 0) f.p[1]--; + move (f.p[0]+LINE_OFFSET, field2screen_c(f.p[1])); + fputs (op.scheme->mouse_highlight, stdout); + break; + case 'j': + partial_show_minefield (f.p[0], f.p[1], NORMAL); + if (f.p[0] < f.h-1) f.p[0]++; + move (f.p[0]+LINE_OFFSET, field2screen_c(f.p[1])); + fputs (op.scheme->mouse_highlight, stdout); + break; + case 'k': + partial_show_minefield (f.p[0], f.p[1], NORMAL); + if (f.p[0] > 0) f.p[0]--; + move (f.p[0]+LINE_OFFSET, field2screen_c(f.p[1])); + fputs (op.scheme->mouse_highlight, stdout); + break; + case 'l': + partial_show_minefield (f.p[0], f.p[1], NORMAL); + if (f.p[1] < f.w-1) f.p[1]++; + move (f.p[0]+LINE_OFFSET, field2screen_c(f.p[1])); + fputs (op.scheme->mouse_highlight, stdout); + break; + case 'w': + partial_show_minefield (f.p[0], f.p[1], NORMAL); + f.p[1] += BIG_MOVE; + if (f.p[1] >= f.w) f.p[1] = f.w-1; + move (f.p[0]+LINE_OFFSET, field2screen_c(f.p[1])); + fputs (op.scheme->mouse_highlight, stdout); + break; + case 'b': + partial_show_minefield (f.p[0], f.p[1], NORMAL); + f.p[1] -= BIG_MOVE; + if (f.p[1] < 0) f.p[1] = 0; + move (f.p[0]+LINE_OFFSET, field2screen_c(f.p[1])); + fputs (op.scheme->mouse_highlight, stdout); + break; + case 'u': + partial_show_minefield (f.p[0], f.p[1], NORMAL); + f.p[0] -= BIG_MOVE; + if (f.p[0] < 0) f.p[0] = 0; + move (f.p[0]+LINE_OFFSET, field2screen_c(f.p[1])); + fputs (op.scheme->mouse_highlight, stdout); + break; + case 'd': + partial_show_minefield (f.p[0], f.p[1], NORMAL); + f.p[0] += BIG_MOVE; + if (f.p[0] >= f.h-1) f.p[0] = f.h-1; + move (f.p[0]+LINE_OFFSET, field2screen_c(f.p[1])); + fputs (op.scheme->mouse_highlight, stdout); + break; + case 'q': + goto quit; + case '\014': /* Ctrl-L -- redraw */ + show_minefield (NORMAL); + break; + case '\\': + if (is_newgame) { + is_newgame = 0; + fill_minefield (-1, -1); + f.t = time(NULL); + setitimer (ITIMER_REAL, &tbuf, NULL); + } + show_minefield (cheatmode?NORMAL:SHOWMINES); + cheatmode = !cheatmode; + break; + } + } + +win: +lose: + /* stop timer: */ + tbuf.it_value.tv_sec = 0; + tbuf.it_value.tv_usec = 0; + if ( setitimer(ITIMER_REAL, &tbuf, NULL) == -1 ) { + perror("setitimer"); + exit(1); + } + show_minefield (SHOWMINES); + int gotaction; + do { + unsigned char mouse[3]; + gotaction = getch(mouse); + /* :D clicked: TODO: won't work in single-width mode! */ + if (gotaction==CTRSEQ_MOUSE_LEFT && mouse[2]==LINE_OFFSET-1 && + (mouse[1]==f.w+COL_OFFSET || mouse[1]==f.w+COL_OFFSET+1)) { + free_field (); + goto newgame; + } else if (gotaction == 'q') { + goto quit; + } + } while (1); + +quit: + return 0; +} + +void quit () { + move(f.h+LINE_OFFSET+2, 0); + /* disable mouse, show cursor */ + printf ("\033[?9l\033[?25h"); + free_field (); + restore_term_mode(saved_term_mode); +} + +/* I haven't won as long as a cell exists, that + - I haven't opened, and + - is not a mine */ +int everything_opened () { + for (int row = 0; row < f.h; row++) + for (int col = 0; col < f.w; col++) + if (f.c[row][col].o == CLOSED && + f.c[row][col].m == NO_MINE ) return 0; + return 1; +} + +int wait_mouse_up (int l, int c) { + unsigned char mouse2[3]; + int level = 1; + int l2, c2; + + /* show :o face */ + move (1, field2screen_c (f.w/2)-1); print (":o"); + + if (!(l < 0 || l >= f.h || c < 0 || c >= f.w)) { + /* show a pushed-in button if cursor is on minefield */ + move (l+LINE_OFFSET, field2screen_c(c)); + fputs (op.scheme->mouse_highlight, stdout); + } + + while (level > 0) { + if (getctrlseq (mouse2) == CTRSEQ_MOUSE) { + /* ignore mouse wheel events: */ + if (mouse2[0] & 0x40) continue; + + else if (mouse2[0]&3 == 3) level--; /* release event */ + else level++; /* another button pressed */ + } + } + + move (1, field2screen_c (f.w/2)-1); print (":D"); + if (!(l < 0 || l >= f.h || c < 0 || c >= f.w)) { + partial_show_minefield (l, c, NORMAL); + } + c2 = screen2field_c(mouse2[1]); + l2 = screen2field_l(mouse2[2]); + return ((l2 == l) && (c2 == c)); +} + +int choord_square (int line, int col) { + for (int l = MAX(line-1, 0); l <= MIN(line+1, f.h-1); l++) { + for (int c = MAX(col-1, 0); c <= MIN(col+1, f.w-1); c++) { + if (f.c[l][c].f != FLAG) { + if (uncover_square (l, c)) + return 1; + } + } + } + + return 0; +} + +int uncover_square (int l, int c) { + f.c[l][c].o = OPENED; + partial_show_minefield (l, c, NORMAL); + + if (f.c[l][c].m) { + f.c[l][c].m = DEATH_MINE; + return 1; + } + + /* check for chording */ + if (f.c[l][c].n == 0) { + for (int choord_l = -1; choord_l <= 1; choord_l++) { + for (int choord_c = -1; choord_c <= 1; choord_c++) { + int newl = l + choord_l; + int newc = c + choord_c; + if (newl >= 0 && newl < f.h && + newc >= 0 && newc < f.w && + f.c[newl][newc].o == CLOSED && + uncover_square (newl, newc)) { + return 1; + } + } + } + } + + return 0; +} + +void flag_square (int l, int c) { + /* cycles through flag/quesm/noflag (uses op.mode to detect which ones + are allowed) */ + f.c[l][c].f = (f.c[l][c].f + 1) % (op.mode + 1); + if (f.c[l][c].f==FLAG) f.f++; + else f.f--; + partial_show_minefield (l, c, NORMAL); + move (1, op.scheme->cell_width); + printf ("[%03d]", f.f); +} + +void fill_minefield (int l, int c) { + srand (time(0)); + int mines_set = f.m; + while (mines_set) { + int line = rand() % f.h; + int col = rand() % f.w; + + if (f.c[line][col].m) { + /* skip if field already has a mine */ + continue; + } else if ((line == l) && (col == c)) { + /* don't put a mine on the already opened (first click) field */ + continue; + } else { + mines_set--; + f.c[line][col].m = STD_MINE; + } + } + + /* precalculate neighbours */ + for (int l=0; l < f.h; l++) + for (int c=0; c < f.w; c++) + f.c[l][c].n = get_neighbours (l, c, NORMAL); +} + +void move (int line, int col) { + printf ("\033[%d;%dH", line+1, col+1); +} + +void partial_show_minefield (int l, int c, int mode) { + move (l+LINE_OFFSET, field2screen_c(c)); + + if (f.c[l][c].f == FLAG ) print (op.scheme->field_flagged); + else if (f.c[l][c].f == QUESM ) print (op.scheme->field_question); + else if (f.c[l][c].o == CLOSED ) print (op.scheme->field_closed); + else if (f.c[l][c].m == STD_MINE || + f.c[l][c].m == DEATH_MINE) print (op.scheme->mine_normal); + else /*.......................*/ print (op.scheme->number[f.c[l][c].n]); +} + +void show_minefield (int mode) { + int dtime; + + move (0,0); + + if (f.t == 0) { + dtime = 0; + } else { + dtime = difftime (time(NULL), f.t); + } + + /* first line */ + print (op.scheme->border_top_l); + printm (f.w*op.scheme->cell_width,op.scheme->border_top_m); + printf ("%s\r\n", op.scheme->border_top_r); + /* second line */ + print (op.scheme->border_status_l); + printf("[%03d]", f.f); + printm (f.w*op.scheme->cell_width/2-6, " "); + printf ("%s", mode==SHOWMINES?":C":":D"); + printm (f.w*op.scheme->cell_width/2-6, " "); + printf ("[%03d]", dtime); + print (op.scheme->border_status_r); + print ("\r\n"); + /* third line */ + print (op.scheme->border_spacer_l); + printm (f.w*op.scheme->cell_width,op.scheme->border_spacer_m); + print (op.scheme->border_spacer_r); + print ("\r\n"); + /* main body */ + for (int l = 0; l < f.h; l++) { + print (op.scheme->border_field_l); + for (int c = 0; c < f.w; c++) { + if (mode == SHOWMINES) { + if (f.c[l][c].f == FLAG && + f.c[l][c].m ) print (op.scheme->field_flagged); + else if (f.c[l][c].f == FLAG && + f.c[l][c].m == NO_MINE ) print (op.scheme->mine_wrongf); + else if (f.c[l][c].m == STD_MINE ) print (op.scheme->mine_normal); + else if (f.c[l][c].m == DEATH_MINE) print (op.scheme->mine_death); + else if (f.c[l][c].o == CLOSED ) print (op.scheme->field_closed); + else /*.......................*/ print (op.scheme->number[f.c[l][c].n]); + } else { + if (f.c[l][c].f == FLAG ) print (op.scheme->field_flagged); + else if (f.c[l][c].f == QUESM ) print (op.scheme->field_question); + else if (f.c[l][c].o == CLOSED ) print (op.scheme->field_closed); + else if (f.c[l][c].m == STD_MINE ) print (op.scheme->mine_normal); + else if (f.c[l][c].m == DEATH_MINE) print (op.scheme->mine_death); + else /*.......................*/ print (op.scheme->number[f.c[l][c].n]); + } + } + print (op.scheme->border_field_r); print ("\r\n"); + } + /* last line */ + print (op.scheme->border_bottom_l); + printm (f.w*op.scheme->cell_width,op.scheme->border_bottom_m); + print (op.scheme->border_bottom_r); + print ("\r\n"); +} + +int get_neighbours (int line, int col, int reduced_mode) { + /* counts mines surrounding a square + modes: 0=normal; 1=reduced */ + + int count = 0; + + for (int l = MAX(line-1, 0); l <= MIN(line+1, f.h-1); l++) { + for (int c = MAX(col-1, 0); c <= MIN(col+1, f.w-1); c++) { + if (!l && !c) continue; + + count += !!f.c[l][c].m; + count -= reduced_mode * f.c[l][c].f==FLAG; + } + } + return count; +} + +struct minecell** alloc_array (int lines, int cols) { + struct minecell** a = malloc (lines * sizeof(struct minecell*)); + if (a == NULL) return NULL; + for (int l = 0; l < lines; l++) { + a[l] = calloc (cols, sizeof(struct minecell)); + if (a[l] == NULL) goto unalloc; + } + + return a; +unalloc: + for (int l = 0; l < lines; l++) + free (a[l]); + return NULL; +} + +void free_field () { + for (int l = 0; l < f.h; l++) { + free (f.c[l]); + } + free (f.c); +} + +int screen2field_l (int l) { + return (l-LINE_OFFSET) - 1; +} +/* some trickery is required to extract the mouse position from the cell width, +depending on wheather we are using full width characters or double line width. +WARN: tested only with scheme.cell_width = 1 and scheme.cell_width = 2. */ +int screen2field_c (int c) { + return (c-COL_OFFSET+1 - 2*(op.scheme->cell_width%2))/2 - op.scheme->cell_width/2; +} +int field2screen_l (int l) { + return 0; //TODO: is never used, therefore not implemented +} +int field2screen_c (int c) { + return (op.scheme->cell_width*c+COL_OFFSET - (op.scheme->cell_width%2)); +} + +enum esc_states { + START, + ESC_SENT, + CSI_SENT, + MOUSE_EVENT, +}; +int getctrlseq (unsigned char* buf) { + int c; + int state = START; + int offset = 0x20; /* never sends control chars as data */ + while ((c = getchar()) != EOF) { + switch (state) { + case START: + switch (c) { + case '\033': state=ESC_SENT; break; + default: return c; + } + break; + case ESC_SENT: + switch (c) { + case '[': state=CSI_SENT; break; + default: return CTRSEQ_INVALID; + } + break; + case CSI_SENT: + switch (c) { + case 'M': state=MOUSE_EVENT; break; + default: return CTRSEQ_INVALID; + } + break; + case MOUSE_EVENT: + buf[0] = c - offset; + buf[1] = getchar() - offset; + buf[2] = getchar() - offset; + return CTRSEQ_MOUSE; + default: + return CTRSEQ_INVALID; + } + } + return 2; +} + +int getch(unsigned char* buf) { +/* returns a character, EOF, or constant for an escape/control sequence - NOT +compatible with the ncurses implementation of same name */ + int action = getctrlseq(buf); + int l, c; + switch (action) { + case CTRSEQ_MOUSE: + l = screen2field_l (buf[2]); + c = screen2field_c (buf[1]); + + if (buf[0] > 3) break; /* ignore all but left/middle/right/up */ + int success = wait_mouse_up(l, c); + + /* mouse moved while pressed: */ + if (!success) return CTRSEQ_INVALID; + + switch (buf[0]) { + case 0: return CTRSEQ_MOUSE_LEFT; + case 1: return CTRSEQ_MOUSE_MIDDLE; + case 2: return CTRSEQ_MOUSE_RIGHT; + } + } + + return action; +} diff --git a/schemes.h b/schemes.h new file mode 100644 index 0000000..b520024 --- /dev/null +++ b/schemes.h @@ -0,0 +1,135 @@ +/* +contains color/monchrome schemes for tty-mines. +*/ +#ifndef __SCHEMES_H__ +#define __SCHEMES_H__ + +struct minescheme { + char* number[9]; + char* field_closed; + char* field_flagged; + char* field_question; + char* mouse_highlight; + char* mine_normal; + char* mine_death; + char* mine_wrongf; + char* mine_wrongq; + + char* border_top_l; + char* border_top_m; + char* border_top_r; + + char* border_status_l; + //TODO: better define status line + char* border_status_r; + + char* border_spacer_l; + char* border_spacer_m; + char* border_spacer_r; + + char* border_field_l; + char* border_field_r; + + char* border_bottom_l; + char* border_bottom_m; + char* border_bottom_r; + + int cell_width; +}; + +struct minescheme symbols_mono = { + .number = {"　", "１", "２", "３", "４", "５", "６", "７", "８"}, + .field_closed = "░░", + .field_flagged = "▒▒", + .field_question = "？", + .mouse_highlight = "▓▓", + .mine_normal = "＊", + .mine_death = "＃", + .mine_wrongf = "／", + .mine_wrongq = "＼", + + .border_top_l = "╔═", + .border_top_m = "═", + .border_top_r = "═╗", + + .border_status_l = "║ ", + .border_status_r = " ║", + + .border_spacer_l = "╟─", + .border_spacer_m = "─", + .border_spacer_r = "─╢", + + .border_field_l = "║ ", + .border_field_r = " ║", + + .border_bottom_l = "╚═", + .border_bottom_m = "═", + .border_bottom_r = "═╝", + + .cell_width = 2, +}; + +struct minescheme symbols_col1 = { + .number = {"　", "\033[94m１\033[m", "\033[32m２\033[m", "\033[31m３\033[m", "\033[34m４\033[m", "\033[33m５\033[m", "\033[36m６\033[m", "\033[30m７\033[m", "\033[97m８\033[m"}, + .field_closed = "░░", + .field_flagged = "▒▒", + .field_question = "？", + .mouse_highlight = "▓▓", + .mine_normal = "＊", + .mine_death = "\033[31m＊\033[m", + .mine_wrongf = "／", + .mine_wrongq = "＼", + + .border_top_l = "╔═", + .border_top_m = "═", + .border_top_r = "═╗", + + .border_status_l = "║ ", + .border_status_r = " ║", + + .border_spacer_l = "╟─", + .border_spacer_m = "─", + .border_spacer_r = "─╢", + + .border_field_l = "║ ", + .border_field_r = " ║", + + .border_bottom_l = "╚═", + .border_bottom_m = "═", + .border_bottom_r = "═╝", + + .cell_width = 2, +}; + +struct minescheme symbols_doublewidth = { + .number = {" ", "1", "2", "3", "4", "5", "6", "7", "8"}, + .field_closed = "░", + .field_flagged = "▒", + .field_question = "?", + .mouse_highlight = "▓", + .mine_normal = "*", + .mine_death = "#", + .mine_wrongf = "/", + .mine_wrongq = "\\", + + .border_top_l = "\033#6╔", + .border_top_m = "═", + .border_top_r = "╗", + + .border_status_l = "\033#6║", + .border_status_r = "║", + + .border_spacer_l = "\033#6╟", + .border_spacer_m = "─", + .border_spacer_r = "╢", + + .border_field_l = "\033#6║", + .border_field_r = "║", + + .border_bottom_l = "\033#6╚", + .border_bottom_m = "═", + .border_bottom_r = "╝", + + .cell_width = 1, +}; +#endif -- 2.39.3