From 5836da01efd519a6f228d7e249b9e6093319576a Mon Sep 17 00:00:00 2001 From: Sasha Koshka Date: Mon, 21 Nov 2022 00:51:09 -0500 Subject: [PATCH] Initial commit --- LICENSE | 674 ++++++++++++++++++++++++++++++++++++++++++++++++ README.md | 10 + error.go | 21 ++ go.mod | 15 ++ go.sum | 39 +++ icon/icon.svg | 29 +++ icon/icon64.png | Bin 0 -> 4519 bytes main.go | 495 +++++++++++++++++++++++++++++++++++ tree.go | 447 ++++++++++++++++++++++++++++++++ 9 files changed, 1730 insertions(+) create mode 100644 LICENSE create mode 100644 README.md create mode 100644 error.go create mode 100644 go.mod create mode 100644 go.sum create mode 100644 icon/icon.svg create mode 100644 icon/icon64.png create mode 100644 main.go create mode 100644 tree.go diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..f288702 --- /dev/null +++ b/LICENSE @@ -0,0 +1,674 @@ + 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. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/README.md b/README.md new file mode 100644 index 0000000..e6b1fae --- /dev/null +++ b/README.md @@ -0,0 +1,10 @@ +![Mathpan](icon/icon64.png) + +# mathpan + +I forgot what the name means. + +Mathpan is an interactive calculator that operates on a live AST of square +bracketed s-expressions. Use the arrow keys to select different tree nodes in +the input box, and see the result of that node display in the panel to the left +in decimal, hexadecimal, octal, and binary. diff --git a/error.go b/error.go new file mode 100644 index 0000000..b189bb8 --- /dev/null +++ b/error.go @@ -0,0 +1,21 @@ +package main + +type Error int + +const ( + ErrorUnknownOpcode Error = iota + ErrorDivideByZero + ErrorWrongOperandCount +) + +func (err Error) Error () (description string) { + switch err { + case ErrorUnknownOpcode: + description = "unknown opcode" + case ErrorDivideByZero: + description = "division by zero" + case ErrorWrongOperandCount: + description = "wrong amount of operands" + } + return +} diff --git a/go.mod b/go.mod new file mode 100644 index 0000000..32b4599 --- /dev/null +++ b/go.mod @@ -0,0 +1,15 @@ +module git.tebibyte.media/sashakoshka/mathpan + +go 1.19 + +require git.tebibyte.media/sashakoshka/stone v0.0.0-20221119230047-9a37fbf04a0d + +require ( + github.com/BurntSushi/freetype-go v0.0.0-20160129220410-b763ddbfe298 // indirect + github.com/BurntSushi/graphics-go v0.0.0-20160129215708-b43f31a4a966 // indirect + github.com/flopp/go-findfont v0.1.0 // indirect + github.com/jezek/xgb v1.1.0 // indirect + github.com/jezek/xgbutil v0.0.0-20210302171758-530099784e66 // indirect + golang.org/x/image v0.1.0 // indirect + golang.org/x/text v0.4.0 // indirect +) diff --git a/go.sum b/go.sum new file mode 100644 index 0000000..69d423e --- /dev/null +++ b/go.sum @@ -0,0 +1,39 @@ +git.tebibyte.media/sashakoshka/stone v0.0.0-20221119230047-9a37fbf04a0d h1:JLX1/Pvt+oWohUn6wlZgOdO+uf6ps410ynRowLvErao= +git.tebibyte.media/sashakoshka/stone v0.0.0-20221119230047-9a37fbf04a0d/go.mod h1:ISnqmX6xvItOot3eW3YWLcNFeJrGpKetQGQniAjnU2A= +github.com/BurntSushi/freetype-go v0.0.0-20160129220410-b763ddbfe298 h1:1qlsVAQJXZHsaM8b6OLVo6muQUQd4CwkH/D3fnnbHXA= +github.com/BurntSushi/freetype-go v0.0.0-20160129220410-b763ddbfe298/go.mod h1:D+QujdIlUNfa0igpNMk6UIvlb6C252URs4yupRUV4lQ= +github.com/BurntSushi/graphics-go v0.0.0-20160129215708-b43f31a4a966 h1:lTG4HQym5oPKjL7nGs+csTgiDna685ZXjxijkne828g= +github.com/BurntSushi/graphics-go v0.0.0-20160129215708-b43f31a4a966/go.mod h1:Mid70uvE93zn9wgF92A/r5ixgnvX8Lh68fxp9KQBaI0= +github.com/flopp/go-findfont v0.1.0 h1:lPn0BymDUtJo+ZkV01VS3661HL6F4qFlkhcJN55u6mU= +github.com/flopp/go-findfont v0.1.0/go.mod h1:wKKxRDjD024Rh7VMwoU90i6ikQRCr+JTHB5n4Ejkqvw= +github.com/jezek/xgb v1.1.0 h1:wnpxJzP1+rkbGclEkmwpVFQWpuE2PUGNUzP8SbfFobk= +github.com/jezek/xgb v1.1.0/go.mod h1:nrhwO0FX/enq75I7Y7G8iN1ubpSGZEiA3v9e9GyRFlk= +github.com/jezek/xgbutil v0.0.0-20210302171758-530099784e66 h1:+wPhoJD8EH0/bXipIq8Lc2z477jfox9zkXPCJdhvHj8= +github.com/jezek/xgbutil v0.0.0-20210302171758-530099784e66/go.mod h1:KACeV+k6b+aoLTVrrurywEbu3UpqoQcQywj4qX8aQKM= +github.com/yuin/goldmark v1.4.13/go.mod h1:6yULJ656Px+3vBD8DxQVa3kxgyrAnzto9xy5taEt/CY= +golang.org/x/crypto v0.0.0-20190308221718-c2843e01d9a2/go.mod h1:djNgcEr1/C05ACkg1iLfiJU5Ep61QUkGW8qpdssI0+w= +golang.org/x/crypto v0.0.0-20210921155107-089bfa567519/go.mod h1:GvvjBRRGRdwPK5ydBHafDWAxML/pGHZbMvKqRZ5+Abc= +golang.org/x/image v0.1.0 h1:r8Oj8ZA2Xy12/b5KZYj3tuv7NG/fBz3TwQVvpJ9l8Rk= +golang.org/x/image v0.1.0/go.mod h1:iyPr49SD/G/TBxYVB/9RRtGUT5eNbo2u4NamWeQcD5c= +golang.org/x/mod v0.6.0-dev.0.20220419223038-86c51ed26bb4/go.mod h1:jJ57K6gSWd91VN4djpZkiMVwK6gcyfeH4XE8wZrZaV4= +golang.org/x/net v0.0.0-20190620200207-3b0461eec859/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s= +golang.org/x/net v0.0.0-20210226172049-e18ecbb05110/go.mod h1:m0MpNAwzfU5UDzcl9v0D8zg8gWTRqZa9RBIspLL5mdg= +golang.org/x/net v0.0.0-20220722155237-a158d28d115b/go.mod h1:XRhObCWvk6IyKnWLug+ECip1KBveYUHfp+8e9klMJ9c= +golang.org/x/sync v0.0.0-20190423024810-112230192c58/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= +golang.org/x/sync v0.0.0-20220722155255-886fb9371eb4/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= +golang.org/x/sys v0.0.0-20190215142949-d0b11bdaac8a/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY= +golang.org/x/sys v0.0.0-20201119102817-f84b799fce68/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= +golang.org/x/sys v0.0.0-20210615035016-665e8c7367d1/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= +golang.org/x/sys v0.0.0-20220520151302-bc2c85ada10a/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= +golang.org/x/sys v0.0.0-20220722155257-8c9f86f7a55f/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= +golang.org/x/term v0.0.0-20201126162022-7de9c90e9dd1/go.mod h1:bj7SfCRtBDWHUb9snDiAeCFNEtKQo2Wmx5Cou7ajbmo= +golang.org/x/term v0.0.0-20210927222741-03fcf44c2211/go.mod h1:jbD1KX2456YbFQfuXm/mYQcufACuNUgVhRMnK/tPxf8= +golang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ= +golang.org/x/text v0.3.3/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ= +golang.org/x/text v0.3.7/go.mod h1:u+2+/6zg+i71rQMx5EYifcz6MCKuco9NR6JIITiCfzQ= +golang.org/x/text v0.4.0 h1:BrVqGRd7+k1DiOgtnFvAkoQEWQvBc25ouMJM6429SFg= +golang.org/x/text v0.4.0/go.mod h1:mrYo+phRRbMaCq/xk9113O4dZlRixOauAjOtrjsXDZ8= +golang.org/x/tools v0.0.0-20180917221912-90fa682c2a6e/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ= +golang.org/x/tools v0.0.0-20191119224855-298f0cb1881e/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo= +golang.org/x/tools v0.1.12/go.mod h1:hNGJHUnrk76NpqgfD5Aqm5Crs+Hm0VOH/i9J2+nxYbc= +golang.org/x/xerrors v0.0.0-20190717185122-a985d3407aa7/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0= diff --git a/icon/icon.svg b/icon/icon.svg new file mode 100644 index 0000000..1bc4fb3 --- /dev/null +++ b/icon/icon.svg @@ -0,0 +1,29 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/icon/icon64.png b/icon/icon64.png new file mode 100644 index 0000000000000000000000000000000000000000..fe53411f8097f86d4398032b2a37306fef58a989 GIT binary patch literal 4519 zcmV;Y5m@etP)-b#VObPWS9f7`n`>JE*QFR; zFbhg=2_{GjsU)PBKoZjHOp=+*y!*#YCNm~MU@1Po(Oy-??&wI~z&OPUQ&Yi$r zxhr?&uH2Qoa#!xkUHRV>(f@Y?XDwOc)S~VfODFn6JGUM9pZR7JX3w7(5*}G#qf{9H z0T2R)47(DW_>|qxalHe8*}yW3Yw?XJnlXQw%dp6CXC)G;&}F#gH9Bt6uAht15?~IH z*4sjXSFcxL?97LjI=gvjyL3pTGU1-dGlVDBz9R&L4if;u)yup6P8;q8yafEvhv5Qn z6p&tz(x`-K|By(#zxA-Fal+b9lY~F+NfrLMCslapnHSBU#m`yb*ELUin~d%U%mo$z z69BQ<4aDNg(19++*@e{+fDKRyJPdSRlglq#ro4DMBjeY;Bph;(2@rhf1mLnbd;f^- zU5CA}aqsb!zyCJE1WqULIFNcR#!s5FVEoxbNA}lLmMZ{4!lQWfmDjORs@U+$rF80a z$Q3sD3sC_wna)Q31!kP6EI;IJ9ba(r4vY1K^VBwIjse^-NV=tDUApYp2y2oCQH}>SIkB ziCEm^pi|hJeDg}DPK#6~WAUoBjEs)!b!>S_A-gw!Ku0K{T3Q4^>CHEmz=)0X3| z<^kfuOLdh)1Ks?4L^vCnQfVVoUTv{;&20@Djkev#!_m_`Pa$h+(slR%`M~6^NPI04 zdEd0p()K1VHW&;jY;Adb&2I@FIlAZmEy&~W&h2ER96=C_fzQ65vwmcB{Hm0HfBD{z z$6qZ5kXuq)-x~m3A_#&|S=U-~sj{h|psc?6Twb~6yYrXCc_p>(ZSA^2kwd++Q@1>B z24H}jLsL_04M4~B7(Xf|{@|%Y-zErxfXcy<RZ~zQfGdwXdQJ(X|<+Hh`(uM*!xw`Sx8}H)o zZR9cfP93KX@8e+7=hReOwlaM1@bF9@AKzc>{c2n0)t=Ft2Q--ga55MK7p+0>qSYDc zz?TPd(w?3l=4(BrSvJ11$`T%(N1+e1vjX1fuAqWQ2_wQlvwoNqFRGa76JM}XJhK)>d9^m`< z;T>Cwa=t(Dlit-A6MPZyG!YtG;1__?&cnI7r{_lj;AE$8P}#`y)$Q6~;3V*B|IrM!=!K}EDQ2>+g9b`er7~K~DQ|8Veo|X1}%H`sV4gi5eN3eA5+bHeqsV=|7 z=Nr~jT99iV@9O2<5jbq*CL2$el}9&kzAmoc7XTms=>2dYwxpub*7D}a5Ra-88D+u1 zV3RR|MQYOlvab*4HqD9)0br1ivyWILsxt^ee-lWb|M@zxptiBCpXJTjaiOvk z8D#*@Cc>1{l_`NtAmaGBQmbqc=<8f?v9#_UU}9|IQ+5&>qC4BQp$3Cs*V^1TA$9kz z1iii!kx0aS4=!ffqNRw%VzSax*!=cdI(0fE5-B61(VTQ+iV|GXvn$Q+xnN?Di#dJuV!VIIP=592PtC>~^m_jJ?wja4JCWPi z3S$$dFFcm~#m6_ROubeQFf%n>r@@LH2K%{`WfxZam^^^k*jJ^3W6rYj;-Y5?v(5pq zb@w^x*f391-0;M$zXR2E&8Qq4ng8rdIJvqbmC2ARY;baMLn7^7)`@SwrlO?CI5#?W z>)~D7w%yD+{kj2Y*Xp#E08EbwF=Q831NaRa8~trY_WSoW*49|*P0OyZQugeVvsv@j z7Szp6$Zc%R6I>-7gqpU4A!jq z|EBxm=-eNGecLu)^}(a#CZV!-1fZg%c=;U%phK&-0$@ato1a)Dve?66EO}`iZ~XJ$ zjGH#g7(t6mXld^zeJZ(_#Sg{NCG!BLIzcb>vre^kjW2?Q5hrW8t5)h!2L){-SonI}_swW(W0Vu^&{QDaO&&8F`| zic!vHH!aTTjsqf**t`uga*6@ibodIvb3fwmn|GqqY7t8$On4xX)gNwUOu`gIA`yGH zZes8VW9X?WD>ZKgJI8(}ZYBV|QsMlpypvUzN^JoicytBjCB}}mjZNPGI4LCr1O`%6 zP|#~2ym0m;C56RAJh6+cbKP+wc;sm2E`JVppYGOU!TB@fpF70^kFEe9GyS+3OqHGT z^IPfx_fDDlr@S*KgSwg#v9lhcLt|_}*j~j00K!KE0#K5dZFLmY6$f-$t=V{IHxC|L z{RU6H`JR>W4K-D4dFNH`U;KnQwVpb(*I0cH9Mp6mX=}zU17Px^MV?tFQ=S6o@8QLQ zm8%hnMCJ}mb5k>W&NdzP4CeL5OD<6E$h;gx2 z^IIAl_~6x51P&cxE{8MIQm8IBR@~l!gSX%8TEJ=x)RbM>)Y4Ed0hqUZr8#)Dn*gY) zs9^T8KjQ4>MqErdPs|7!z))Zs_%T>MAQR==HRz)#T+B^7*cGKHc{N`88sE-5m(>RPgbhLRwpz zQ7Bbbr#3?(?V;4kkz1&@F+sUqv&YUkeQak*<%N|aPAZay`J*YQvSZVlux&a z2?+~DBsRKwake!f>hJE^>jH95r}NqGUZY*3Vd3+?#y`YZK;@k|$)T@|y$|1@(E3SZ zM?IUiFPU2gKtoN{ye@YQjTqbOV1=!cG4Ycb6F-^Orbf=C9Omq?1C-=tBM1iavbtM> zP4%_ZU8(5R-MbDo_HEz7fgPVAmPlCg@;bA}RFo94`R%m`f&rDigCTH4@~Evdf5&e4gO>2rvgK8MDdYR-Rmj8ljAa;Y%iJf=7&vsVDhi!ZYE zz29=Vr~rknEsw2!laTO804ht1d4J7H+BIqu_SKSjBjj7gYc9;a?;V*mEfIG&t@!C=5UFo;K9d<{3# zGmCSx_+?zn2CvtkVuWiRodQUzWm@_I(0h4Vlj~k(>_Vtzk4~iSj+&} zC{>+p>Q-4(eeF$C-qEJv@K;+omYhVJx)qT~%*g0CW-M8bi@CmU;fud+;N0;;rpBkO zFeZNT+b6!+wVK-?W&rwocvdykRCyOBD=uaQ1r)1_NS= zgptv4On!I?UIBsTv1g7QWameJqNTCEiyi8QN5?KW`mgO@a+|~qfUB4HuEMO0r|Yg% zkdbnPQR5Sg^|!&mkJ^CN-O~1UE*BM0l$}9wZYD)J=gqF)-@}X1u@kv>%1oSG-OO`J z^0G+&^nHpgxcWK%>H81XHq=zfRQ8Via>M($d;1{> z21@huxKx-=dGSRWYN`Z&SeZR&1zI`nhK!!LkA!@>y-kF@>~gI-T&+Hq2L ze??(dh6TxT*M&vKyq2=(%eS}#V%6OkKV#mi)NgkF-k{f`vUg;`%GHELS)X`mTAHb; zyiB{PKmxE;+2J<82ODM2ZdF4~6{nBvC-s}1R%iLPDm!7w=zG3(ar0fgFX`{~+#%`F z-ie$zb@S;%`yT14=7L5<5Hn*gp%GEYPw^kOrSY!Jl~9%hx0&C29G&%j89iJV(VO9I$ulr>E~9HTQYR zQ&{FEJ&<}4WhbG7p)|6?REF;QNvH7swet((_aR}td;6~3mAi6H@*m@g++TD@*wFw0002ovPDHLk FV1f-k>m>jH literal 0 HcmV?d00001 diff --git a/main.go b/main.go new file mode 100644 index 0000000..8ac8242 --- /dev/null +++ b/main.go @@ -0,0 +1,495 @@ +package main + +import "fmt" +import "bytes" +import "image" +import _ "embed" +import _ "image/png" +import "git.tebibyte.media/sashakoshka/stone" +import _ "git.tebibyte.media/sashakoshka/stone/backends/x" + +//go:embed icon/icon64.png +var iconBytes []byte + +var application = &stone.Application { } + +var expressionRoot Expression +var inputBuffer stone.DamageBuffer +var showLeftColumn bool + +var inputState struct { + alt bool +} + +func main () { + application.SetTitle("MathPan") + application.SetSize(64, 10) + + icon, _, err := image.Decode(bytes.NewReader(iconBytes)) + if err != nil { panic(err) } + application.SetIcon([]image.Image { icon }) + + application.OnStart(onStart) + application.OnResize(redraw) + application.OnPress(onPress) + + err = application.Run() + if err != nil { panic(err) } +} + +func onPress (button stone.Button) { + switch button { + case stone.KeyUp: + if selectedExpression == nil { break } + + newSelection := selectedExpression.Parent() + if newSelection != nil { + selectedExpression = newSelection + } + + redraw() + application.Draw() + + case stone.KeyLeft: + if selectedExpression == nil { break } + + newSelection := selectedExpression.Previous() + if newSelection != nil { + selectedExpression = newSelection + } + + redraw() + application.Draw() + + case stone.KeyRight: + if selectedExpression == nil { break } + + newSelection := selectedExpression.Next() + if newSelection != nil { + selectedExpression = newSelection + } + + redraw() + application.Draw() + + case stone.KeyLeftAlt, stone.KeyRightAlt: + inputState.alt = true + + case '[': + insertGeneric(&Operation { }) + redraw() + application.Draw() + + case '+', '-', '*', '/', 'p', 'r', '%', '|', '~', '&', '^', 'm': + insertOperation(rune(button)) + redraw() + application.Draw() + + case stone.KeyDelete: + if selectedExpression == nil { break } + parent := selectedExpression.Parent() + + if parent == nil { + expressionRoot = nil + selectedExpression = nil + } else { + previous := selectedExpression.Parent().Previous() + next := selectedExpression.Parent().Next() + + selectedExpression.Parent().Disown(selectedExpression) + + if next == nil { + selectedExpression = previous + } else { + selectedExpression = next + } + } + + redraw() + application.Draw() + + case stone.KeyBackspace: + if selectedExpression == nil { break } + + parent := selectedExpression.Parent() + + switch selectedExpression.(type) { + case *IntegerLiteral: + integer := selectedExpression.(*IntegerLiteral) + if integer.value == 0 { break } + integer.value /= int64(integer.displayRadix) + goto stopBackspacing + } + + if parent == nil { + expressionRoot = nil + selectedExpression = nil + } else { + previous := selectedExpression.Parent().Previous() + + selectedExpression.Parent().Disown(selectedExpression) + + if previous != nil { + selectedExpression = previous + } + } + + stopBackspacing: + redraw() + application.Draw() + + case ' ': + insertGeneric(&IntegerLiteral { displayRadix: 10 }) + redraw() + application.Draw() + + case + '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', + 'a', 'b', 'c', 'd', 'e', 'f': + + value := rune(button) + if value >= 'a' { + value -= 'a' + value += 10 + } else { + value -= '0' + } + + switch selectedExpression.(type) { + case *Operation: + insertGeneric (&IntegerLiteral { + displayRadix: 10, + value: int64(value), + }) + + case *IntegerLiteral: + integer := selectedExpression.(*IntegerLiteral) + integer.value *= int64(integer.displayRadix) + integer.value += int64(value) + } + + redraw() + application.Draw() + + case 'x': + switch selectedExpression.(type) { + case *IntegerLiteral: + integer := selectedExpression.(*IntegerLiteral) + switch integer.displayRadix { + case 2: + integer.displayRadix = 8 + case 8: + integer.displayRadix = 10 + case 10: + integer.displayRadix = 16 + case 16: + integer.displayRadix = 2 + } + } + + redraw() + application.Draw() + + case 'X': + switch selectedExpression.(type) { + case *IntegerLiteral: + integer := selectedExpression.(*IntegerLiteral) + switch integer.displayRadix { + case 2: + integer.displayRadix = 16 + case 8: + integer.displayRadix = 2 + case 10: + integer.displayRadix = 8 + case 16: + integer.displayRadix = 10 + } + } + + redraw() + application.Draw() + } +} + +func onRelease (button stone.Button) { + switch button { + case stone.KeyLeftAlt, stone.KeyRightAlt: + inputState.alt = false + } +} + +func insertOperation (symbol rune) { + var opcode Opcode + switch (symbol) { + case '+': opcode = OpcodeAdd + case '-': opcode = OpcodeSubtract + case '*': opcode = OpcodeMultiply + case '/': opcode = OpcodeDivide + case 'p': opcode = OpcodePower + case 'r': opcode = OpcodeRoot + case '%': opcode = OpcodeModulo + case '|': opcode = OpcodeOr + case '~': opcode = OpcodeNot + case '&': opcode = OpcodeAnd + case '^': opcode = OpcodeXor + case 'm': opcode = OpcodeMean + } + + operation, isOperation := selectedExpression.(*Operation) + if isOperation { + if operation.opcode == OpcodeUnknown || inputState.alt { + operation.opcode = opcode + return + } + } + + newExpression := &Operation { opcode: opcode } + insertGeneric(newExpression) +} + +func insertGeneric (expression Expression) { + defer func () { + selectedExpression = expression + } () + + if expressionRoot == nil { + // if there are no expressions, place this one down in the empty + // void + expressionRoot = expression + return + } + + parent := selectedExpression.Parent() + + if inputState.alt { + // if alt is held, swap the selected expression for the new one + if parent == nil { + expressionRoot = expression + } else { + selectedExpression.Parent().Swap(selectedExpression, expression) + } + return + } + + operation, isOperation := selectedExpression.(*Operation) + + if (isOperation && len(operation.operands) < 1) || parent == nil { + // if we have an empty operation selected, always insert the + // new expression into it + operation.Adopt(expression) + return + } + + // else, insert the new expression after the selected expression + if parent == nil { + expressionRoot = expression + } else { + selectedExpression.Parent().Insert(selectedExpression, expression) + } +} + +func onStart () { + redraw() +} + +func redraw () { + width, _ := application.Size() + showLeftColumn = width > 44 + + if showLeftColumn { + drawNumberReadouts() + } + drawInput() +} + +func drawInput () { + width, height := application.Size() + xOffset := 0 + if showLeftColumn { + xOffset = 26 + } + y := height - 1 + + inputWidth, _ := inputBuffer.Size() + newWidth := width - xOffset + if newWidth != inputWidth { + inputBuffer.SetSize(newWidth, 1) + } + + inputBuffer.Clear() + if expressionRoot != nil { + expressionRoot.Render(&inputBuffer, 0) + } + + for x := 0; x < newWidth; x ++ { + character := '_' + + cell := inputBuffer.Cell(x, 0) + if cell.Rune() > 0 { + character = cell.Rune() + } + + application.SetRune(x + xOffset, y, character) + + if character == '_' { + application.SetColor(x + xOffset, y, stone.ColorDim) + } else { + application.SetColor(x + xOffset, y, cell.Color()) + } + } +} + +func drawNumberReadouts () { + _, height := application.Size() + var number int64 + var err error + if selectedExpression != nil { + number, err = selectedExpression.Solution() + } + + if err != nil { + clear(0, height - 10, 25, 10) + application.SetDot((25 - len(err.Error())) / 2, height - 6) + fmt.Fprint(application, err.Error()) + } else { + drawHexadecimal (0, height - 10, uint64(number)) + drawDecimal (0, height - 8, uint64(number)) + drawOctal (0, height - 6, uint64(number)) + drawBinary (0, height - 4, uint64(number)) + } +} + +func clear (x, y, width, height int) { + for yy := 0; yy < height; yy ++ { + for xx := 0; xx < width; xx ++ { + application.SetRune(xx + x, yy + y, 0) + application.SetColor(xx + x, yy + y, stone.ColorForeground) + }} +} + +func drawBinary (xOffset, yOffset int, number uint64) { + bitOffset := 64 + + for y := 0; y < 4; y ++ { + application.SetDot(xOffset, y + yOffset) + fmt.Fprint(application, bitOffset) + application.SetColor(xOffset, y + yOffset, stone.ColorBlue) + application.SetColor(xOffset + 1, y + yOffset, stone.ColorBlue) + + for x := 0; x < 16; x ++ { + bitOffset -- + + trueX := x + xOffset + x / 4 + 3 + character := '0' + rune((number >> bitOffset) & 0x1) + + application.SetRune(trueX, y + yOffset, character) + if character == '0' { + application.SetColor ( + trueX, + y + yOffset, + stone.ColorDim) + } else { + application.SetColor ( + trueX, + y + yOffset, + stone.ColorForeground) + } + } + application.SetDot(xOffset + 23, y + yOffset) + fmt.Fprint(application, bitOffset + 1) + application.SetColor(xOffset + 23, y + yOffset, stone.ColorBlue) + application.SetColor(xOffset + 24, y + yOffset, stone.ColorBlue) + } +} + +func drawHexadecimal (xOffset, yOffset int, number uint64) { + bitOffset := 64 + + application.SetDot(xOffset, yOffset) + fmt.Fprint(application, "16") + application.SetColor(xOffset, yOffset, stone.ColorBlue) + application.SetColor(xOffset + 1, yOffset, stone.ColorBlue) + + for x := 0; x < 16; x ++ { + bitOffset -= 4 + + trueX := x + xOffset + x / 4 + 6 + character := rune((number >> bitOffset) & 0xF) + if character < 10 { + character += '0' + } else { + character += 'A' - 10 + } + + application.SetRune(trueX, yOffset, character) + if character == '0' { + application.SetColor ( + trueX, + yOffset, + stone.ColorDim) + } else { + application.SetColor ( + trueX, + yOffset, + stone.ColorForeground) + } + } +} + +func drawDecimal (xOffset, yOffset int, number uint64) { + var divisor uint64 = 10000000000000000000 + + application.SetDot(xOffset, yOffset) + fmt.Fprint(application, "10") + application.SetColor(xOffset, yOffset, stone.ColorBlue) + application.SetColor(xOffset + 1, yOffset, stone.ColorBlue) + + for x := 0; x < 20; x ++ { + trueX := x + xOffset + 5 + character := rune((number / divisor) % 10) + '0' + + application.SetRune(trueX, yOffset, character) + if character == '0' { + application.SetColor ( + trueX, + yOffset, + stone.ColorDim) + } else { + application.SetColor ( + trueX, + yOffset, + stone.ColorForeground) + } + divisor /= 10 + } +} + +func drawOctal (xOffset, yOffset int, number uint64) { + // fuck octal i hate it almost as much as decimal + bitOffset := 63 + + application.SetDot(xOffset, yOffset) + fmt.Fprint(application, "08") + application.SetColor(xOffset, yOffset, stone.ColorBlue) + application.SetColor(xOffset + 1, yOffset, stone.ColorBlue) + + for x := 0; x < 21; x ++ { + bitOffset -= 3 + + trueX := x + xOffset + 4 + character := '0' + rune((number >> bitOffset) % 8) + + application.SetRune(trueX, yOffset, character) + if character == '0' { + application.SetColor ( + trueX, + yOffset, + stone.ColorDim) + } else { + application.SetColor ( + trueX, + yOffset, + stone.ColorForeground) + } + } +} diff --git a/tree.go b/tree.go new file mode 100644 index 0000000..4780db4 --- /dev/null +++ b/tree.go @@ -0,0 +1,447 @@ +package main + +import "math" + +import "git.tebibyte.media/sashakoshka/stone" + +var selectedExpression Expression + +type Opcode int + +const ( + OpcodeUnknown Opcode = iota + + OpcodeAdd + OpcodeSubtract + OpcodeMultiply + OpcodeDivide + OpcodePower + OpcodeRoot + + OpcodeModulo + + OpcodeOr + OpcodeNot + OpcodeAnd + OpcodeXor + + OpcodeMean +) + +func (opcode Opcode) String () (output string) { + switch opcode { + case OpcodeUnknown: output = "?" + case OpcodeAdd: output = "+" + case OpcodeSubtract: output = "-" + case OpcodeMultiply: output = "*" + case OpcodeDivide: output = "/" + case OpcodePower: output = "p" + case OpcodeRoot: output = "r" + case OpcodeModulo: output = "%" + case OpcodeOr: output = "|" + case OpcodeNot: output = "~" + case OpcodeAnd: output = "&" + case OpcodeXor: output = "^" + case OpcodeMean: output = "mean" + } + return +} + +type Expression interface { + Parent () (parent *Operation) + Next () (next Expression) + Previous () (previous Expression) + Render (target stone.Buffer, offset int) (moved int) + Solution () (solution int64, err error) + // InexactSolution () (solution float64, err error) +} + +type Operation struct { + parent *Operation + opcode Opcode + operands []Expression +} + +func (operation *Operation) Parent () (parent *Operation) { + parent = operation.parent + return +} + +func (operation *Operation) Adopt (child Expression) { + operation.operands = append(operation.operands, child) + operation.adopt(child) +} + +func (operation *Operation) adopt (child Expression) { + switch child.(type) { + case *Operation: + child.(*Operation).parent = operation + case *IntegerLiteral: + child.(*IntegerLiteral).parent = operation + } +} + +func (operation *Operation) Insert (after Expression, child Expression) { + var operand Expression + var index int + var found bool + for index, operand = range operation.operands { + if operand == after { found = true; break } + } + + if !found { return } + index ++ + + operation.operands = append(operation.operands, nil) + copy(operation.operands[index + 1:], operation.operands[index:]) + operation.operands[index] = child + operation.adopt(child) +} + +func (operation *Operation) Disown (child Expression) { + var operand Expression + var index int + var found bool + for index, operand = range operation.operands { + if operand == child { found = true; break } + } + + if !found { return } + + operation.operands = append ( + operation.operands[:index], + operation.operands[index + 1:]...) +} + +func (operation *Operation) Swap (child Expression, with Expression) { + var operand Expression + var index int + var found bool + for index, operand = range operation.operands { + if operand == child { found = true; break } + } + + if !found { return } + + operation.operands[index] = with + operation.adopt(with) +} + +func (operation *Operation) Next () (next Expression) { + if operation == selectedExpression && len(operation.operands) > 0 { + // selection descends into this operation + next = operation.operands[0] + return + } + + next = operation.next(selectedExpression) + + return +} + +func (operation *Operation) next (after Expression) (next Expression) { + var operand Expression + var index int + var found bool + for index, operand = range operation.operands { + if operand == after { found = true; break } + } + + if !found { return } + + index ++ + if index >= len(operation.operands) { + // selection goes out of bounds to the right, ascending + // out of this operation + if operation.parent != nil { + next = operation.parent.next(operation) + } + } else { + // selection moves to the right within this operation + next = operation.operands[index] + } + + return +} + +func (operation *Operation) Previous () (previous Expression) { + if operation == selectedExpression { + if operation.parent != nil { + previous = operation.parent.Previous() + } + return + } + + var operand Expression + var index int + var found bool + for index, operand = range operation.operands { + if operand == selectedExpression { found = true; break } + } + + if !found { + if operation.parent != nil { + previous = operation.parent.Next() + } + } else { + index -- + if index < 0 { + previous = operation + } else { + previous = operation.operands[index] + subOperation, isOperation := previous.(*Operation) + if isOperation { + previous = subOperation.Last() + if previous == nil { + previous = subOperation + } + } + } + } + + return +} + +func (operation *Operation) Last () (last Expression) { + if len(operation.operands) < 1 { return } + last = operation.operands[len(operation.operands) - 1] + return +} + +func (operation *Operation) Render (target stone.Buffer, offset int) (moved int) { + target.SetRune(offset, 0, '[') + if selectedExpression == operation { + target.SetColor(offset, 0, stone.ColorBlue) + } else { + target.SetColor(offset, 0, stone.ColorDim) + } + moved ++ + + opcodeSymbol := operation.opcode.String() + for _, character := range opcodeSymbol { + target.SetRune(offset + moved, 0, character) + if selectedExpression == operation { + target.SetColor(offset + moved, 0, stone.ColorBlue) + } else { + target.SetColor(offset + moved, 0, stone.ColorYellow) + } + moved ++ + } + + for _, operand := range operation.operands { + target.SetRune(offset + moved, 0, ' ') + moved ++ + moved += operand.Render(target, offset + moved) + } + + target.SetRune(offset + moved, 0, ']') + if selectedExpression == operation { + target.SetColor(offset + moved, 0, stone.ColorBlue) + } else { + target.SetColor(offset + moved, 0, stone.ColorDim) + } + moved ++ + return +} + +func (operation *Operation) Solution () (solution int64, err error) { + var subSolution int64 + + switch operation.opcode { + case OpcodeAdd: + for _, operand := range operation.operands { + subSolution, err = operand.Solution() + if err != nil { return } + solution += subSolution + } + case OpcodeSubtract: + for _, operand := range operation.operands { + subSolution, err = operand.Solution() + if err != nil { return } + solution -= subSolution + } + case OpcodeMultiply: + solution = 1 + for _, operand := range operation.operands { + subSolution, err = operand.Solution() + if err != nil { return } + solution *= subSolution + } + case OpcodeDivide: + for index, operand := range operation.operands { + subSolution, err = operand.Solution() + if err != nil { return } + if index == 0 { + solution = subSolution + } else if subSolution == 0 { + err = ErrorDivideByZero + } else { + solution /= subSolution + } + } + case OpcodePower: + for index, operand := range operation.operands { + subSolution, err = operand.Solution() + if err != nil { return } + if index == 0 { + solution = subSolution + } else { + solution = integerPower(solution, subSolution) + } + } + case OpcodeRoot: + for index, operand := range operation.operands { + subSolution, err = operand.Solution() + if err != nil { return } + if index == 0 { + solution = subSolution + } else { + solution = integerPower ( + solution, subSolution * -1) + } + } + case OpcodeModulo: + for index, operand := range operation.operands { + subSolution, err = operand.Solution() + if err != nil { return } + if index == 0 { + solution = subSolution + } else { + solution %= subSolution + } + } + case OpcodeOr: + for _, operand := range operation.operands { + subSolution, err = operand.Solution() + if err != nil { return } + solution |= subSolution + } + case OpcodeNot: + if len(operation.operands) > 1 { + err = ErrorWrongOperandCount + return + } + case OpcodeAnd: + for index, operand := range operation.operands { + subSolution, err = operand.Solution() + if err != nil { return } + if index == 0 { + solution = subSolution + } else { + solution &= subSolution + } + } + case OpcodeXor: + for index, operand := range operation.operands { + subSolution, err = operand.Solution() + if err != nil { return } + if index == 0 { + solution = subSolution + } else { + solution ^= subSolution + } + } + case OpcodeMean: + if len(operation.operands) == 0 { break } + for _, operand := range operation.operands { + subSolution, err = operand.Solution() + if err != nil { break } + solution += subSolution + } + solution /= int64(len(operation.operands)) + default: + err = ErrorUnknownOpcode + } + return +} + +func integerPower (x, y int64) (result int64) { + if y == 0 { + result = 1 + return + } else if y < 0 { + // FIXME: find some algorithm for the nth root of an integer + result = int64(math.Pow(float64(x), float64(y))) + } + + result = x + for index := int64(2); index <= y; index ++ { + result *= x + } + return +} + +type IntegerLiteral struct { + parent *Operation + displayRadix int + value int64 +} + +func (literal *IntegerLiteral) Parent () (parent *Operation) { + parent = literal.parent + return +} + +func (literal *IntegerLiteral) Next () (next Expression) { + if literal.parent != nil { + next = literal.parent.Next() + } + return +} + +func (literal *IntegerLiteral) Previous () (previous Expression) { + if literal.parent != nil { + previous = literal.parent.Previous() + } + return +} + +func (literal *IntegerLiteral) Render (target stone.Buffer, offset int) (moved int) { + var output []rune + value := literal.value + for value > 0 { + digit := rune(value % int64(literal.displayRadix)) + value /= int64(literal.displayRadix) + + if digit < 10 { + digit += '0' + } else { + digit += 'A' - 10 + } + + output = append([]rune { digit }, output...) + } + + if len(output) == 0 { + output = []rune { '0' } + } + + switch literal.displayRadix { + case 2: + output = append([]rune("0b"), output...) + case 8: + output = append([]rune("0"), output...) + case 10: + case 16: + output = append([]rune("0x"), output...) + default: + output = append([]rune("0?"), output...) + } + + for _, character := range output { + target.SetRune(offset + moved, 0, character) + if selectedExpression == literal { + target.SetColor(offset + moved, 0, stone.ColorBlue) + } else { + target.SetColor(offset + moved, 0, stone.ColorPurple) + } + moved ++ + } + + return +} + +func (literal *IntegerLiteral) Solution () (solution int64, err error) { + solution = literal.value + return +}