commit 28b03b152112a02a787a1516c720f50f6f7aa042 Author: 4yn Date: Fri Apr 30 20:03:33 2021 +0800 haha websockets, c++ and winuser go brr diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..8c674e3 --- /dev/null +++ b/.gitignore @@ -0,0 +1,5 @@ +.vs/ +build/ +res/chart/* +!res/chart/.gitkeep +dist/ diff --git a/.vscode/launch.json b/.vscode/launch.json new file mode 100644 index 0000000..9966455 --- /dev/null +++ b/.vscode/launch.json @@ -0,0 +1,16 @@ +{ + "version": "0.2.0", + "configurations": [ + { + "name": "Launch", + "type": "cppvsdbg", + "request": "launch", + "program": "${command:cmake.launchTargetPath}", + "args": [], + "stopAtEntry": false, + "cwd": "${workspaceFolder}", + "environment": [], + "externalConsole": true + } + ] +} diff --git a/.vscode/settings.json b/.vscode/settings.json new file mode 100644 index 0000000..8373baa --- /dev/null +++ b/.vscode/settings.json @@ -0,0 +1,5 @@ +{ + "C_Cpp.default.configurationProvider": "vector-of-bool.cmake-tools", + "cmake.configureOnOpen": true, + "editor.defaultFormatter": "ms-vscode.cpptools" + } diff --git a/CMakeLists.txt b/CMakeLists.txt new file mode 100644 index 0000000..28c0968 --- /dev/null +++ b/CMakeLists.txt @@ -0,0 +1,16 @@ +cmake_minimum_required(VERSION 3.15) + +project(brokenithm-kb) + +set(CMAKE_C_STANDARD 14) +set(CMAKE_C_STANDARD_REQUIRED True) +set(CMAKE_CXX_STANDARD 17) +set(CMAKE_CXX_STANDARD_REQUIRED True) + +set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/bin) +set(CMAKE_LIBRARY_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/bin) +set(CMAKE_ARCHIVE_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/lib) + +add_subdirectory(src) + + 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..6d59085 --- /dev/null +++ b/README.md @@ -0,0 +1,74 @@ +# brokenithm-kb 💸 + +> Because $300 plus shipping and a two month wait is too painful for a tasoller + +Run this together alongside SUSPlayer or your other favourite sliding universal score simulator. + +## Setup + +1. Check the releases page on github, download and unzip into your preferred folder. +2. Connect an iPad or some other tablet device to the **same wifi access point** as your windows machine. + + > Windows hotspot also works, just make sure you turn on the hotspot before running `brokenithm-kb.exe`. + + ![hotspot](images/wifi.png) + +3. Run `brokenithm-kb.exe`. +4. If this is the first time running the program, give the program firewall permissions. + + ![firewall](images/firewall.png) + + > When using windows hotspot, ensure 'public' is enabled. If there are any other issues, try checking the "incoming rules" menu of windows firewall from the control panel. + + > You may need grant firewall permissions the first time and then restart the program. + +5. Some URLs should be displayed on the command line window, try opening each one of them in your tablet device until you see the controller screen. + + ![running window](images/link.png) + +6. If you see 'Controller ID ? Connected', the controller is working! + + ![connected](images/connected.png) + +7. Open up SUSplayer or some other simulator and have fun! + +I also recommend using the "Add to home" feature for Safari / Chrome, it makes the controller fullscreen. + +![add to home](images/homescreen.png) + +The difference between Safari and "Add to home" looks like this: + +![safari vs add to home](images/fullscreen.png) + +## Options + +Options for the server can be changed with command line arguments, check `.\brokenithm-kb.exe -h` or edit `run.bat`. + +Appearance of the touchscreen controller can be changed by editing `./res/www/config.js`. +You can change the displayed colors and also add a background image URL to the controller. Just upload an image to imgur or somewhere else and place the link there. + +## Building from source + +Needs cmake and some vcpkg packages: + +``` +libuv:x64-windows +openssl-windows:x64-windows +openssl:x64-windows +usockets:x64-windows +zlib:x64-windows +``` + +Built on windows `cl.exe 19.28.29337`. + +If anyone knows enough C++/cmake/CI to help out with making this section better do pm me. + +## Attribution + +[uWebsockets](https://github.com/uNetworking/uWebSockets) is licensed under the Apache License 2.0. + +[spdlog](https://github.com/gabime/spdlog) is licensed under the MIT License. + +Packaged background image was created using [SVG-Backgrounds](https://www.svgbackgrounds.com/). + +[Twemoji](https://github.com/twitter/twemoji) is licensed under CC-BY 4.0. diff --git a/brokenithm-kb.code-workspace b/brokenithm-kb.code-workspace new file mode 100644 index 0000000..15f4453 --- /dev/null +++ b/brokenithm-kb.code-workspace @@ -0,0 +1,107 @@ +{ + "folders": [ + { + "path": "." + } + ], + "settings": { + "cmake.configureArgs": [ + "-DCMAKE_TOOLCHAIN_FILE=E:\\Environment\\vcpkg\\scripts\\buildsystems\\vcpkg.cmake", + "-DVCPKG_TARGET_TRIPLET=x64-windows" + ], + "editor.defaultFormatter": "ms-vscode.cpptools", + "editor.formatOnSave": true, + "C_Cpp.formatting": "Default", + "editor.tabSize": 4, + "files.associations": { + "*.in": "plaintext", + "*.out": "plaintext", + "*.ans": "plaintext", + "xstring": "cpp", + "unordered_map": "cpp", + "vector": "cpp", + "exception": "cpp", + "filesystem": "cpp", + "future": "cpp", + "chrono": "cpp", + "algorithm": "cpp", + "array": "cpp", + "atomic": "cpp", + "bitset": "cpp", + "cctype": "cpp", + "clocale": "cpp", + "cmath": "cpp", + "codecvt": "cpp", + "complex": "cpp", + "concepts": "cpp", + "condition_variable": "cpp", + "csignal": "cpp", + "cstdarg": "cpp", + "cstddef": "cpp", + "cstdint": "cpp", + "cstdio": "cpp", + "cstdlib": "cpp", + "cstring": "cpp", + "ctime": "cpp", + "cwchar": "cpp", + "cwctype": "cpp", + "deque": "cpp", + "fstream": "cpp", + "functional": "cpp", + "initializer_list": "cpp", + "iomanip": "cpp", + "ios": "cpp", + "iosfwd": "cpp", + "iostream": "cpp", + "istream": "cpp", + "iterator": "cpp", + "limits": "cpp", + "list": "cpp", + "locale": "cpp", + "map": "cpp", + "memory": "cpp", + "mutex": "cpp", + "new": "cpp", + "numeric": "cpp", + "optional": "cpp", + "ostream": "cpp", + "ratio": "cpp", + "set": "cpp", + "shared_mutex": "cpp", + "sstream": "cpp", + "stdexcept": "cpp", + "streambuf": "cpp", + "string": "cpp", + "system_error": "cpp", + "thread": "cpp", + "tuple": "cpp", + "type_traits": "cpp", + "typeindex": "cpp", + "typeinfo": "cpp", + "unordered_set": "cpp", + "utility": "cpp", + "variant": "cpp", + "xfacet": "cpp", + "xhash": "cpp", + "xiosbase": "cpp", + "xlocale": "cpp", + "xlocbuf": "cpp", + "xlocinfo": "cpp", + "xlocmes": "cpp", + "xlocmon": "cpp", + "xlocnum": "cpp", + "xloctime": "cpp", + "xmemory": "cpp", + "xstddef": "cpp", + "xtr1common": "cpp", + "xtree": "cpp", + "xutility": "cpp", + "forward_list": "cpp", + "valarray": "cpp", + "queue": "cpp" + }, + "search.exclude": { + "src/vendor/*": true + } + } +} diff --git a/images/connected.png b/images/connected.png new file mode 100644 index 0000000..fee78fb Binary files /dev/null and b/images/connected.png differ diff --git a/images/firewall.png b/images/firewall.png new file mode 100644 index 0000000..924f92a Binary files /dev/null and b/images/firewall.png differ diff --git a/images/fullscreen.png b/images/fullscreen.png new file mode 100644 index 0000000..0490036 Binary files /dev/null and b/images/fullscreen.png differ diff --git a/images/homescreen.png b/images/homescreen.png new file mode 100644 index 0000000..2b7d9fd Binary files /dev/null and b/images/homescreen.png differ diff --git a/images/link.png b/images/link.png new file mode 100644 index 0000000..52581ed Binary files /dev/null and b/images/link.png differ diff --git a/images/wifi.png b/images/wifi.png new file mode 100644 index 0000000..63ceaba Binary files /dev/null and b/images/wifi.png differ diff --git a/res/www/app.js b/res/www/app.js new file mode 100644 index 0000000..59828f1 --- /dev/null +++ b/res/www/app.js @@ -0,0 +1 @@ +var throttle=function(e,t){var a=!0,n=null;return function o(){var s=this;a?(a=!1,setTimeout(function(){a=!0,n&&o.apply(s)},t),n?(e.apply(this,n),n=null):e.apply(this,arguments)):n=arguments}},keys=document.getElementsByClassName("key"),airKeys=[],midline=0,touchKeys=[],allKeys=[],topKeys=airKeys,bottomKeys=touchKeys,compileKey=function(e){var t=e.previousElementSibling,a=e.nextElementSibling;return{top:e.offsetTop,bottom:e.offsetTop+e.offsetHeight,left:e.offsetLeft,right:e.offsetLeft+e.offsetWidth,almostLeft:t?e.offsetLeft+e.offsetWidth/4:-99999,almostRight:a?e.offsetLeft+3*e.offsetWidth/4:99999,kflag:parseInt(e.dataset.kflag)+(parseInt(e.dataset.air)?32:0),isAir:!!parseInt(e.dataset.air),prevKeyRef:t,prevKeyKflag:t?parseInt(t.dataset.kflag)+(parseInt(t.dataset.air)?32:0):null,nextKeyRef:a,nextKeyKflag:a?parseInt(a.dataset.kflag)+(parseInt(a.dataset.air)?32:0):null,ref:e}},isInside=function(e,t,a){return a.left<=e&&e2)return wsTimeout=0,ws.close(),wsConnected=!1,void wsConnect();wsConnected&&ws.send("alive?")},canvas=document.getElementById("canvas"),canvasCtx=canvas.getContext("2d"),canvasData=canvasCtx.getImageData(0,0,33,1),setupLed=function(){for(var e=0;e<33;e++)canvasData.data[4*e+3]=255};setupLed();var updateLed=function(e){for(var t=new Uint8Array(e),a=0;a<32;a++)canvasData.data[4*a]=t[3*(31-a)+1],canvasData.data[4*a+1]=t[3*(31-a)+2],canvasData.data[4*a+2]=t[3*(31-a)+0];canvasData.data[128]=t[94],canvasData.data[129]=t[95],canvasData.data[130]=t[93],canvasCtx.putImageData(canvasData,0,0)},fs=document.getElementById("fullscreen"),requestFullscreen=function(){!document.fullscreenElement&&screen.height<=1024&&(fs.requestFullscreen?fs.requestFullscreen():fs.mozRequestFullScreen?fs.mozRequestFullScreen():fs.webkitRequestFullScreen&&fs.webkitRequestFullScreen())},throttledRequestFullscreen=throttle(requestFullscreen,3e3),cnt=document.getElementById("main");cnt.addEventListener("touchstart",updateTouches),cnt.addEventListener("touchmove",updateTouches),cnt.addEventListener("touchend",updateTouches);var readConfig=function(e){var t="";e.invert&&(t+=".container, .air-container {flex-flow: column-reverse nowrap;} ");var a=e.bgColor||"rbga(0, 0, 0, 0.9)";e.bgImage?t+="#fullscreen {background: ".concat(a,' url("').concat(e.bgImage,'") fixed center / cover!important; background-repeat: no-repeat;} '):t+="#fullscreen {background: ".concat(a,";} "),"number"==typeof e.ledOpacity&&(0===e.ledOpacity?t+="#canvas {display: none} ":t+="#canvas {opacity: ".concat(e.ledOpacity,"} ")),"string"==typeof e.keyColor&&(t+=".key[data-active] {background-color: ".concat(e.keyColor,";} ")),"string"==typeof e.keyColor&&(t+=".key.air[data-active] {background-color: ".concat(e.lkeyColor,";} ")),"string"==typeof e.keyBorderColor&&(t+=".key {border: 1px solid ".concat(e.keyBorderColor,";} ")),e.keyColorFade&&"number"==typeof e.keyColorFade&&(t+=".key:not([data-active]) {transition: background ".concat(e.keyColorFade,"ms ease-out;} ")),"number"==typeof e.keyHeight&&(0===e.keyHeight?t+=".touch-container {display: none;} ":t+=".touch-container {flex: ".concat(e.keyHeight,";} ")),"number"==typeof e.lkeyHeight&&(0===e.lkeyHeight?t+=".air-container {display: none;} ":t+=".air-container {flex: ".concat(e.keyHeight,";} "));var n=document.createElement("style");n.innerHTML=t,document.head.appendChild(n)},initialize=function(){readConfig(config),compileKeys(),wsConnect(),setInterval(wsWatch,1e3)};initialize(),window.onresize=compileKeys; \ No newline at end of file diff --git a/res/www/config.js b/res/www/config.js new file mode 100644 index 0000000..56114fa --- /dev/null +++ b/res/www/config.js @@ -0,0 +1,21 @@ +var config = { + // Inverted layout mode. + // Set to "true" to have the "lift" key at the bottom of the screen rather than the top. + invert: false, + + // Use a solid background color + bgImage: false, + bgColor: "#000000", + + // Use a custom background image + // bgColor is overlayed on the image, so make it semi-transparent + // bgImage: + // "https://raw.githubusercontent.com/gist/4yn/df052666266ce25554110ca1b4f33ce3/raw/1e5e6ab966639bb6786a4690dc49097763b16ba0/subtle-prism.svg", + // bgColor: "rgba(0, 0, 0, 0.5)", + + // Key Press Color + keyColor: "#FF00FF", + + // Lift key color + lkeyColor: "#00FFFF", +}; diff --git a/res/www/favicon.ico b/res/www/favicon.ico new file mode 100644 index 0000000..9ed6dc6 Binary files /dev/null and b/res/www/favicon.ico differ diff --git a/res/www/index.html b/res/www/index.html new file mode 100644 index 0000000..8728f08 --- /dev/null +++ b/res/www/index.html @@ -0,0 +1,116 @@ + + + + brokenithm-kb + + + + + + + +
+ +
+
+
+ +
+
+ +
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ + + + diff --git a/res/www/src.js b/res/www/src.js new file mode 100644 index 0000000..94cd9e4 --- /dev/null +++ b/res/www/src.js @@ -0,0 +1,344 @@ +/* + Post-process with https://babeljs.io/repl and https://javascript-minifier.com/ +*/ + +const throttle = (func, wait) => { + var ready = true; + var args = null; + return function throttled() { + var context = this; + if (ready) { + ready = false; + setTimeout(function () { + ready = true; + if (args) { + throttled.apply(context); + } + }, wait); + if (args) { + func.apply(this, args); + args = null; + } else { + func.apply(this, arguments); + } + } else { + args = arguments; + } + }; +}; + +// Element refs +var keys = document.getElementsByClassName("key"); +var airKeys = []; +var midline = 0; +var touchKeys = []; +var allKeys = []; +var topKeys = airKeys; +var bottomKeys = touchKeys; +const compileKey = (key) => { + const prev = key.previousElementSibling; + const next = key.nextElementSibling; + return { + top: key.offsetTop, + bottom: key.offsetTop + key.offsetHeight, + left: key.offsetLeft, + right: key.offsetLeft + key.offsetWidth, + almostLeft: !!prev ? key.offsetLeft + key.offsetWidth / 4 : -99999, + almostRight: !!next ? key.offsetLeft + (key.offsetWidth * 3) / 4 : 99999, + kflag: parseInt(key.dataset.kflag) + (parseInt(key.dataset.air) ? 32 : 0), + isAir: parseInt(key.dataset.air) ? true : false, + prevKeyRef: prev, + prevKeyKflag: prev + ? parseInt(prev.dataset.kflag) + (parseInt(prev.dataset.air) ? 32 : 0) + : null, + nextKeyRef: next, + nextKeyKflag: next + ? parseInt(next.dataset.kflag) + (parseInt(next.dataset.air) ? 32 : 0) + : null, + ref: key, + }; +}; +const isInside = (x, y, compiledKey) => { + return ( + compiledKey.left <= x && + x < compiledKey.right && + compiledKey.top <= y && + y < compiledKey.bottom + ); +}; +const compileKeys = () => { + keys = document.getElementsByClassName("key"); + airKeys = []; + touchKeys = []; + for (var i = 0, key; i < keys.length; i++) { + const compiledKey = compileKey(keys[i]); + if (!compiledKey.isAir) { + touchKeys.push(compiledKey); + } else { + airKeys.push(compiledKey); + } + allKeys.push(compiledKey); + } + + if (!config.invert) { + // Not inverted + topKeys = airKeys; + bottomKeys = touchKeys; + midline = touchKeys[0].top; + } else { + // Inverted + topKeys = touchKeys; + bottomKeys = airKeys; + midline = touchKeys[0].bottom; + } +}; + +const getKey = (x, y) => { + if (y < midline) { + for (var i = 0; i < topKeys.length; i++) { + if (isInside(x, y, topKeys[i])) return topKeys[i]; + } + } else { + for (var i = 0; i < bottomKeys.length; i++) { + if (isInside(x, y, bottomKeys[i])) { + return bottomKeys[i]; + } + } + } + return null; +}; + +// Button State +// prettier-ignore +var lastState = [ + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, +]; + +function updateTouches(e) { + try { + e.preventDefault(); + + // prettier-ignore + var keyFlags = [ + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, + ]; + + throttledRequestFullscreen(); + + for (var i = 0; i < e.touches.length; i++) { + const touch = e.touches[i]; + + const x = touch.clientX; + const y = touch.clientY; + + const key = getKey(x, y); + + if (!key) continue; + + setKey(keyFlags, key.kflag, key.isAir); + + if (key.isAir) continue; + + if (x < key.almostLeft) { + setKey(keyFlags, key.prevKeyKflag, false); + } + + if (key.almostRight < x) { + setKey(keyFlags, key.nextKeyKflag, false); + } + } + + // Render keys + for (var i = 0; i < allKeys.length; i++) { + const key = allKeys[i]; + const kflag = key.kflag; + if (keyFlags[kflag] !== lastState[kflag]) { + if (keyFlags[kflag]) { + key.ref.setAttribute("data-active", ""); + } else { + key.ref.removeAttribute("data-active"); + } + } + } + + if (keyFlags !== lastState) { + throttledSendKeys(keyFlags); + } + lastState = keyFlags; + } catch (err) { + alert(err); + } +} +const throttledUpdateTouches = throttle(updateTouches, 10); + +const setKey = (keyFlags, kflag, isAir) => { + var idx = kflag; + if (keyFlags[idx] && !isAir) { + idx++; + } + keyFlags[idx] = 1; +}; + +const sendKeys = (keyFlags) => { + if (wsConnected) { + ws.send("b" + keyFlags.join("")); + } +}; +const throttledSendKeys = throttle(sendKeys, 10); + +// Websockets +var ws = null; +var wsTimeout = 0; +var wsConnected = false; +const wsConnect = () => { + ws = new WebSocket("ws://" + location.host + "/ws"); + ws.binaryType = "arraybuffer"; + ws.onopen = () => { + ws.send("alive?"); + }; + ws.onmessage = (e) => { + if (e.data.byteLength) { + updateLed(e.data); + } else if (e.data == "alive") { + wsTimeout = 0; + wsConnected = true; + } + }; +}; +const wsWatch = () => { + if (wsTimeout++ > 2) { + wsTimeout = 0; + ws.close(); + wsConnected = false; + wsConnect(); + return; + } + if (wsConnected) { + ws.send("alive?"); + } +}; + +// Canvas vars +var canvas = document.getElementById("canvas"); +var canvasCtx = canvas.getContext("2d"); +var canvasData = canvasCtx.getImageData(0, 0, 33, 1); +const setupLed = () => { + for (var i = 0; i < 33; i++) { + canvasData.data[i * 4 + 3] = 255; + } +}; +setupLed(); +const updateLed = (data) => { + const buf = new Uint8Array(data); + for (var i = 0; i < 32; i++) { + canvasData.data[i * 4] = buf[(31 - i) * 3 + 1]; // r + canvasData.data[i * 4 + 1] = buf[(31 - i) * 3 + 2]; // g + canvasData.data[i * 4 + 2] = buf[(31 - i) * 3 + 0]; // b + } + // Copy from first led + canvasData.data[128] = buf[94]; + canvasData.data[129] = buf[95]; + canvasData.data[130] = buf[93]; + canvasCtx.putImageData(canvasData, 0, 0); +}; + +// Fullscreener +const fs = document.getElementById("fullscreen"); +const requestFullscreen = () => { + if (!document.fullscreenElement && screen.height <= 1024) { + if (fs.requestFullscreen) { + fs.requestFullscreen(); + } else if (fs.mozRequestFullScreen) { + fs.mozRequestFullScreen(); + } else if (fs.webkitRequestFullScreen) { + fs.webkitRequestFullScreen(); + } + } +}; +const throttledRequestFullscreen = throttle(requestFullscreen, 3000); + +// Do update hooks +const cnt = document.getElementById("main"); + +cnt.addEventListener("touchstart", updateTouches); +cnt.addEventListener("touchmove", updateTouches); +cnt.addEventListener("touchend", updateTouches); + +// cnt.addEventListener("touchstart", throttledUpdateTouches); +// cnt.addEventListener("touchmove", throttledUpdateTouches); +// cnt.addEventListener("touchend", throttledUpdateTouches); + +// Load config +const readConfig = (config) => { + var style = ""; + + if (!!config.invert) { + style += `.container, .air-container {flex-flow: column-reverse nowrap;} `; + } + + var bgColor = config.bgColor || "rbga(0, 0, 0, 0.9)"; + if (!config.bgImage) { + style += `#fullscreen {background: ${bgColor};} `; + } else { + style += `#fullscreen {background: ${bgColor} url("${config.bgImage}") fixed center / cover!important; background-repeat: no-repeat;} `; + } + + if (typeof config.ledOpacity === "number") { + if (config.ledOpacity === 0) { + style += `#canvas {display: none} `; + } else { + style += `#canvas {opacity: ${config.ledOpacity}} `; + } + } + + if (typeof config.keyColor === "string") { + style += `.key[data-active] {background-color: ${config.keyColor};} `; + } + if (typeof config.keyColor === "string") { + style += `.key.air[data-active] {background-color: ${config.lkeyColor};} `; + } + if (typeof config.keyBorderColor === "string") { + style += `.key {border: 1px solid ${config.keyBorderColor};} `; + } + if (!!config.keyColorFade && typeof config.keyColorFade === "number") { + style += `.key:not([data-active]) {transition: background ${config.keyColorFade}ms ease-out;} `; + } + + if (typeof config.keyHeight === "number") { + if (config.keyHeight === 0) { + style += `.touch-container {display: none;} `; + } else { + style += `.touch-container {flex: ${config.keyHeight};} `; + } + } + + if (typeof config.lkeyHeight === "number") { + if (config.lkeyHeight === 0) { + style += `.air-container {display: none;} `; + } else { + style += `.air-container {flex: ${config.keyHeight};} `; + } + } + + var styleRef = document.createElement("style"); + styleRef.innerHTML = style; + document.head.appendChild(styleRef); +}; + +// Initialize +const initialize = () => { + readConfig(config); + compileKeys(); + wsConnect(); + setInterval(wsWatch, 1000); +}; +initialize(); + +// Update keys on resize +window.onresize = compileKeys; diff --git a/scripts/run.bat b/scripts/run.bat new file mode 100644 index 0000000..a56c637 --- /dev/null +++ b/scripts/run.bat @@ -0,0 +1,10 @@ +ECHO OFF + +REM Just run brokenithm-kb +.\brokenithm-kb.exe + +REM Run on a different port +REM .\brokenithm-kb.exe -p 1117 + +REM Run in debug mode +REM .\brokenithm-kb.exe -v diff --git a/src/CMakeLists.txt b/src/CMakeLists.txt new file mode 100644 index 0000000..57d7eba --- /dev/null +++ b/src/CMakeLists.txt @@ -0,0 +1,21 @@ +add_subdirectory(Vendor) + +set(SRCROOT ${CMAKE_CURRENT_SOURCE_DIR}/src/) + +file(GLOB SRC "${SRCROOT}/*.cpp" "${SRCROOT}/*.hpp" "${SRCROOT}/*.rc") +source_group("Sources" FILES ${SRC}) + +message("${SRCROOT}") + +add_executable(brokenithm-kb ${SRC}) + +target_compile_features(brokenithm-kb PRIVATE cxx_std_17) +target_include_directories(brokenithm-kb PRIVATE ${SRCROOT}) + +target_link_libraries(brokenithm-kb PRIVATE uws optparse spdlog) + +add_custom_command( + TARGET brokenithm-kb POST_BUILD + COMMAND ${CMAKE_COMMAND} -E copy_directory ${CMAKE_SOURCE_DIR}/res/ $/res/ + COMMAND ${CMAKE_COMMAND} -E copy_directory ${CMAKE_SOURCE_DIR}/scripts/ $/ +) diff --git a/src/Vendor/CMakeLists.txt b/src/Vendor/CMakeLists.txt new file mode 100644 index 0000000..d7396ae --- /dev/null +++ b/src/Vendor/CMakeLists.txt @@ -0,0 +1,3 @@ +add_subdirectory(uwebsockets) +add_subdirectory(optparse) +add_subdirectory(spdlog) diff --git a/src/Vendor/optparse/CMakeLists.txt b/src/Vendor/optparse/CMakeLists.txt new file mode 100644 index 0000000..381acf4 --- /dev/null +++ b/src/Vendor/optparse/CMakeLists.txt @@ -0,0 +1,3 @@ +project(optparse LANGUAGES CXX) +add_library(optparse INTERFACE) +target_include_directories(optparse INTERFACE ${CMAKE_CURRENT_SOURCE_DIR}/include) diff --git a/src/Vendor/optparse/README.rst b/src/Vendor/optparse/README.rst new file mode 100644 index 0000000..1b23e53 --- /dev/null +++ b/src/Vendor/optparse/README.rst @@ -0,0 +1,80 @@ +======== +optparse +======== + +.. image:: https://travis-ci.org/myint/optparse.svg?branch=master + :target: https://travis-ci.org/myint/optparse + :alt: Build status + +This is yet another option parser for C++. It is modelled after the +excellent Python optparse API. Although incomplete, anyone familiar to +optparse should feel at home: +https://docs.python.org/library/optparse.html + +Copyright (C) 2010 Johannes Weißl + +License: your favourite BSD-style license + +Design decisions +================ + +- elegant and easy usage more important than speed / flexibility +- shortness more important than feature completeness + - no unicode + - no checking for user programming errors + +Why not use getopt/getopt_long? + +- not C++ / not completely POSIX +- too cumbersome to use, would need lot of additional code + +Why not use Boost.Program_options? + +- boost not installed on all target platforms (esp. cluster, HPC, ...) +- too big to include just for option handling: + 322 ``*.h`` (44750 lines) + 7 ``*.cpp`` (2078 lines) + +Why not use tclap/Opag/Options/CmdLine/Anyoption/Argument_helper/...? + +- no reason, writing one is faster than code inspection :-) +- similarity to Python desired for faster learning curve + +Future work +=========== + +- nargs > 1? +- comments? + +Example +======= + +.. code-block:: cpp + + #include + + #include + #include + #include + + + int main(int argc, char **argv) + { + optparse::OptionParser parser = + optparse::OptionParser().description("just an example"); + + parser.add_option("-f", "--file").dest("filename") + .help("write report to FILE").metavar("FILE"); + parser.add_option("-q", "--quiet") + .action("store_false") + .dest("verbose") + .set_default("1") + .help("don't print status messages to stdout"); + + const optparse::Values options = parser.parse_args(argc, argv); + const std::vector args = parser.args(); + + if (options.get("verbose")) + { + std::cout << options["filename"] << "\n"; + } + } diff --git a/src/Vendor/optparse/include/optparse/optparse.hpp b/src/Vendor/optparse/include/optparse/optparse.hpp new file mode 100644 index 0000000..921a085 --- /dev/null +++ b/src/Vendor/optparse/include/optparse/optparse.hpp @@ -0,0 +1,1362 @@ +/** + * Copyright (C) 2010 Johannes Weißl + * License: your favourite BSD-style license + */ + +#ifndef OPTPARSE_H +#define OPTPARSE_H + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + + +namespace optparse +{ + class Callback; + class Option; + class OptionGroup; + class OptionParser; + + + // Class for automatic conversion from string -> anytype. + class Value + { + public: + + Value() : str(), valid(false) {} + + explicit Value(const std::string &v) : str(v), valid(true) {} + + operator const char *() + { + return str.c_str(); + } + + operator bool() + { + bool t; + return (valid && (std::istringstream(str) >> t)) ? t : false; + } + + operator short() + { + short t; + return (valid && (std::istringstream(str) >> t)) ? t : 0; + } + + operator unsigned short() + { + unsigned short t; + return (valid && (std::istringstream(str) >> t)) ? t : 0; + } + + operator int() + { + int t; + return (valid && (std::istringstream(str) >> t)) ? t : 0; + } + + operator unsigned int() + { + unsigned int t; + return (valid && (std::istringstream(str) >> t)) ? t : 0; + } + + operator long() + { + long t; + return (valid && (std::istringstream(str) >> t)) ? t : 0; + } + + operator unsigned long() + { + unsigned long t; + return (valid && (std::istringstream(str) >> t)) ? t : 0; + } + + operator float() + { + float t; + return (valid && (std::istringstream(str) >> t)) ? t : 0; + } + + operator double() + { + double t; + return (valid && (std::istringstream(str) >> t)) ? t : 0; + } + + operator long double() + { + long double t; + return (valid && (std::istringstream(str) >> t)) ? t : 0; + } + private: + + const std::string str; + bool valid; + }; + + + class Values + { + public: + + Values() : _map() {} + + const std::string &operator[](const std::string &d) const + { + std::map::const_iterator it = _map.find(d); + static const std::string empty = ""; + return (it != _map.end()) ? it->second : empty; + } + + std::string &operator[](const std::string &d) + { + return _map[d]; + } + + bool is_set(const std::string &d) const + { + return _map.find(d) != _map.end(); + } + + bool is_set_by_user(const std::string &d) const + { + return _user_set.find(d) != _user_set.end(); + } + + void is_set_by_user(const std::string &d, bool yes) + { + if (yes) + { + _user_set.insert(d); + } + else + { + _user_set.erase(d); + } + } + + Value get(const std::string &d) const + { + return (is_set(d)) ? Value((*this)[d]) : Value(); + } + + typedef std::vector::iterator iterator; + typedef std::vector::const_iterator const_iterator; + + std::vector &all(const std::string &d) + { + return _append_map[d]; + } + + const std::vector all(const std::string &d) const + { + static const std::vector empty; + return (_append_map.find(d) == _append_map.end()) ? + empty : + _append_map.at(d); + } + + private: + + std::map _map; + std::map > _append_map; + std::set _user_set; + }; + + + namespace detail + { + class str_wrap + { + public: + + str_wrap(const std::string &l, const std::string &r) : lwrap(l), rwrap(r) {} + explicit str_wrap(const std::string &w) : lwrap(w), rwrap(w) {} + std::string operator()(const std::string &s) + { + return lwrap + s + rwrap; + } + + const std::string lwrap, rwrap; + }; + + + template + static std::string str_join_trans(const std::string &sep, InputIterator begin, InputIterator end, UnaryOperator op) + { + std::string buf; + for (InputIterator it = begin; it != end; ++it) + { + if (it != begin) + { + buf += sep; + } + buf += op(*it); + } + + return buf; + } + + + template + static std::string str_join(const std::string &sep, InputIterator begin, InputIterator end) + { + return str_join_trans(sep, begin, end, str_wrap("")); + } + + + static std::string &str_replace_helper(std::string &s, const std::string &patt, const std::string &repl) + { + size_t pos = 0; + const size_t n = patt.length(); + while (true) + { + pos = s.find(patt, pos); + if (pos == std::string::npos) + { + break; + } + s.replace(pos, n, repl); + pos += repl.size(); + } + + return s; + } + + + static std::string str_replace(const std::string &s, const std::string &patt, const std::string &repl) + { + std::string tmp = s; + str_replace_helper(tmp, patt, repl); + return tmp; + } + + + static std::string str_format(const std::string &s, size_t pre, size_t len, bool indent_first = true) + { + std::stringstream ss; + std::string p; + if (indent_first) + { + p = std::string(pre, ' '); + } + + size_t pos = 0, linestart = 0; + size_t line = 0; + while (true) + { + bool wrap = false; + + size_t new_pos = s.find_first_of(" \n\t", pos); + if (new_pos == std::string::npos) + { + break; + } + + if (s[new_pos] == '\n') + { + pos = new_pos + 1; + wrap = true; + } + + if (line == 1) + { + p = std::string(pre, ' '); + } + + if (wrap or new_pos + pre > linestart + len) + { + ss << p << s.substr(linestart, pos - linestart - 1) << std::endl; + linestart = pos; + line++; + } + + pos = new_pos + 1; + } + + ss << p << s.substr(linestart) << std::endl; + return ss.str(); + } + + + static std::string str_inc(const std::string &s) + { + std::stringstream ss; + long i = 0; + std::istringstream(s) >> i; + ss << i + 1; + return ss.str(); + } + + + static unsigned int cols() + { + unsigned int n = 80; +#ifndef _WIN32 + const char *s = getenv("COLUMNS"); + if (s) + { + std::istringstream(s) >> n; + } +#endif + return n; + } + + + static std::string basename(const std::string &s) + { + const char seps[] = +#ifdef _WIN32 + "/\\"; +#else + "/"; +#endif + std::string b = s; + size_t i = b.find_last_not_of(seps); + if (i == std::string::npos) + { + if (b[0] == '/') + { + b.erase(1); + } + + return b; + } + + b.erase(i + 1, b.length() - i - 1); + i = b.find_last_of(seps); + if (i != std::string::npos) + { + b.erase(0, i + 1); + } + + return b; + } + + + static OptionParser &add_option_group_helper(OptionParser &parser, + const OptionGroup &group); + + + static Values &parse_args_helper(OptionParser &parser, + const std::vector &v); + + + static std::string format_help_helper(const OptionParser &parser); + } + + + class Callback + { + public: + + virtual void operator()(const Option &option, + const std::string &opt, + const std::string &val, + const OptionParser &parser) = 0; + virtual ~Callback() {} + }; + + + class Option + { + public: + + Option() : _action("store"), _type("string"), _nargs(1), _suppress_help(false), _callback(0) {} + + Option &action(const std::string &a) + { + _action = a; + if (a == "store_const" or + a == "store_true" or + a == "store_false" or + a == "append_const" or + a == "count" or + a == "help" or + a == "version") + { + nargs(0); + } + return *this; + } + + Option &type(const std::string &t) + { + _type = t; + return *this; + } + + Option &dest(const std::string &d) + { + _dest = d; + return *this; + } + + Option &set_default(const std::string &d) + { + _default = d; + return *this; + } + + template + Option &set_default(T t) + { + std::ostringstream ss; + ss << t; + _default = ss.str(); + return *this; + } + + Option &nargs(size_t n) + { + // This doesn't seem to be currently supported. + if (n > 1) + { + throw std::invalid_argument( + "nargs greater than 1 not supported"); + } + + _nargs = n; + return *this; + } + + Option &set_const(const std::string &c) + { + _const = c; + return *this; + } + + template + Option &choices(InputIterator begin, InputIterator end) + { + _choices.assign(begin, end); + type("choice"); + return *this; + } + + Option &help(const std::string &h) + { + _help = h; + return *this; + } + + Option &suppress_help(const bool suppress=true) + { + _suppress_help = suppress; + return *this; + } + + Option &metavar(const std::string &m) + { + _metavar = m; + return *this; + } + + Option &callback(Callback &c) + { + _callback = &c; + return *this; + } + + const std::string &action() const + { + return _action; + } + + const std::string &type() const + { + return _type; + } + + const std::string &dest() const + { + return _dest; + } + + const std::string &get_default() const + { + return _default; + } + + size_t nargs() const + { + return _nargs; + } + + const std::string &get_const() const + { + return _const; + } + + const std::list &choices() const + { + return _choices; + } + + const std::string &help() const + { + return _help; + } + + const std::string &metavar() const + { + return _metavar; + } + + Callback *callback() const + { + return _callback; + } + + private: + + std::string check_type(const std::string &opt, const std::string &val) const + { + std::istringstream ss(val); + std::stringstream err; + + if (type() == "int" or type() == "long") + { + long t; + if (not (ss >> t)) + { + err << "option" << " " << opt << ": " << "invalid integer value" << ": '" << val << "'"; + } + } + else if (type() == "float" or type() == "double") + { + double t; + if (not (ss >> t)) + { + err << "option" << " " << opt << ": " << "invalid floating-point value" << ": '" << val << "'"; + } + } + else if (type() == "choice") + { + if (find(choices().begin(), choices().end(), val) == choices().end()) + { + std::list tmp = choices(); + std::transform(tmp.begin(), tmp.end(), tmp.begin(), detail::str_wrap("'")); + err << "option" << " " << opt << ": " << "invalid choice" << ": '" << val << "'" + << " (" << "choose from" << " " << detail::str_join(", ", tmp.begin(), tmp.end()) << ")"; + } + } + else if (type() == "complex") + { + std::complex t; + if (not (ss >> t)) + { + err << "option" << " " << opt << ": " << "invalid complex value" << ": '" << val << "'"; + } + } + + return err.str(); + } + + std::string format_option_help(const unsigned int indent=2) const + { + std::string mvar_short; + std::string mvar_long; + + if (nargs() == 1) + { + std::string mvar = metavar(); + if (mvar.empty()) + { + mvar = type(); + std::transform(mvar.begin(), mvar.end(), mvar.begin(), ::toupper); + } + mvar_short = " " + mvar; + mvar_long = "=" + mvar; + } + + std::stringstream ss; + ss << std::string(indent, ' '); + + if (not _short_opts.empty()) + { + ss << detail::str_join_trans(", ", _short_opts.begin(), _short_opts.end(), detail::str_wrap("-", mvar_short)); + if (not _long_opts.empty()) + { + ss << ", "; + } + } + if (not _long_opts.empty()) + { + ss << detail::str_join_trans(", ", _long_opts.begin(), _long_opts.end(), detail::str_wrap("--", mvar_long)); + } + + return ss.str(); + } + + std::string format_help(const unsigned int indent=2) const + { + std::stringstream ss; + std::string h = format_option_help(indent); + unsigned int width = detail::cols(); + unsigned int opt_width = std::min(width * 3 / 10, 36u); + bool indent_first = false; + ss << h; + + // If the option list is too long, start a new paragraph. + if (h.length() >= (opt_width - 1)) + { + ss << std::endl; + indent_first = true; + } + else + { + ss << std::string(opt_width - h.length(), ' '); + if (help().empty()) + ss << std::endl; + } + + if (not help().empty()) + { + std::string help_str = (not get_default().empty()) ? detail::str_replace(help(), "%default", get_default()) : help(); + ss << detail::str_format(help_str, opt_width, width, indent_first); + } + + return ss.str(); + } + + std::set _short_opts; + std::set _long_opts; + + std::string _action; + std::string _type; + std::string _dest; + std::string _default; + size_t _nargs; + std::string _const; + std::list _choices; + std::string _help; + bool _suppress_help; + std::string _metavar; + Callback *_callback; + + friend class OptionParser; + + friend OptionParser &detail::add_option_group_helper( + OptionParser &parser, + const OptionGroup &group); + }; + + + class OptionParser + { + public: + + OptionParser() : + _usage("%prog [options]"), + _add_help_option(true), + _add_version_option(true), + _interspersed_args(true) + { + } + + virtual ~OptionParser() + { + } + + OptionParser &usage(const std::string &u) + { + set_usage(u); + return *this; + } + + OptionParser &version(const std::string &v) + { + _version = v; + return *this; + } + + OptionParser &description(const std::string &d) + { + _description = d; + return *this; + } + + OptionParser &add_help_option(bool h) + { + _add_help_option = h; + return *this; + } + + OptionParser &add_version_option(bool v) + { + _add_version_option = v; + return *this; + } + + OptionParser &prog(const std::string &p) + { + _prog = p; + return *this; + } + + OptionParser &epilog(const std::string &e) + { + _epilog = e; + return *this; + } + + OptionParser &set_defaults(const std::string &dest, const std::string &val) + { + _defaults[dest] = val; + return *this; + } + + template + OptionParser &set_defaults(const std::string &dest, T t) + { + std::ostringstream ss; + ss << t; + _defaults[dest] = ss.str(); + return *this; + } + + OptionParser &enable_interspersed_args() + { + _interspersed_args = true; + return *this; + } + + OptionParser &disable_interspersed_args() + { + _interspersed_args = false; + return *this; + } + + OptionParser &add_option_group(const OptionGroup &group) + { + return detail::add_option_group_helper(*this, group); + } + + const std::string &usage() const + { + return _usage; + } + + const std::string &version() const + { + return _version; + } + + const std::string &description() const + { + return _description; + } + + bool add_help_option() const + { + return _add_help_option; + } + + bool add_version_option() const + { + return _add_version_option; + } + + const std::string &prog() const + { + return _prog; + } + + const std::string &epilog() const + { + return _epilog; + } + + bool interspersed_args() const + { + return _interspersed_args; + } + + Option &add_option(const std::vector &opt) + { + _opts.resize(_opts.size() + 1); + Option &option = _opts.back(); + std::string dest_fallback; + for (std::vector::const_iterator it = opt.begin(); it != opt.end(); ++it) + { + if (it->substr(0, 2) == "--") + { + const std::string s = it->substr(2); + if (option.dest().empty()) + option.dest(detail::str_replace(s, "-", "_")); + option._long_opts.insert(s); + _optmap_l[s] = &option; + } + else + { + const std::string s = it->substr(1, 1); + if (dest_fallback.empty()) + dest_fallback = s; + option._short_opts.insert(s); + _optmap_s[s] = &option; + } + } + if (option.dest().empty()) + { + option.dest(dest_fallback); + } + return option; + } + + Option &add_option(const std::string &opt) + { + const std::string tmp[1] = {opt}; + return add_option(std::vector(tmp, tmp+1)); + } + + Option &add_option(const std::string &opt1, const std::string &opt2) + { + const std::string tmp[2] = {opt1, opt2}; + return add_option(std::vector(tmp, tmp+2)); + } + + Option &add_option(const std::string &opt1, const std::string &opt2, const std::string &opt3) + { + const std::string tmp[3] = {opt1, opt2, opt3}; + return add_option(std::vector(tmp, tmp+3)); + } + + Values &parse_args(int argc, char const *const *argv) + { + if (prog().empty()) + { + prog(detail::basename(argv[0])); + } + return parse_args(&argv[1], &argv[argc]); + } + + Values &parse_args(const std::vector &arguments) + { + return detail::parse_args_helper(*this, arguments); + } + + template + Values &parse_args(InputIterator begin, InputIterator end) + { + return parse_args(std::vector(begin, end)); + } + + const std::vector &args() const + { + return _leftover; + } + + std::string format_help() const + { + return detail::format_help_helper(*this); + } + + std::string format_option_help(unsigned int indent=2) const + { + std::stringstream ss; + + if (_opts.empty()) + { + return ss.str(); + } + + for (std::list