commit 5232d446a5dec84ac1d023ff34c36afc34704718 Author: Ulysse Cura Date: Sun Apr 12 16:34:12 2026 +0200 First Commit 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..376e1dd --- /dev/null +++ b/README.md @@ -0,0 +1,9 @@ +[![License: GPL v3](https://img.shields.io/badge/License-GPLv3-blue.svg)](https://www.gnu.org/licenses/gpl-3.0) +# 2D_Engine_C SDL2 Core + +## Description +The core made on SDL2 for the multi-platform 2D_Engine_C. + +## Licences +- This program is open-source : you can redistribute and/or modify it under the term of the **GNU GPLv3**. + Copyright (C) 2025 Ulysse Cura. See [LICENSE](LICENSE) or [gnu.org/licenses/gpl-3.0.html](https://www.gnu.org/licenses/gpl-3.0.html). diff --git a/src/Makefile b/src/Makefile new file mode 100644 index 0000000..9947285 --- /dev/null +++ b/src/Makefile @@ -0,0 +1,50 @@ +# Source files +CORE_SOURCES := \ + texture_manager.c \ + event.c \ + vector2d.c \ + linked_list.c \ + display.c + +# Compiler and flags +CORE_CC = gcc +CORE_CFLAGS = $(sdl2-config --cflags --libs) -Wall -Wextra -std=c17 -fPIC -g +CORE_INCLUDE_DIRS = $(CORE_DIR)/headers +CORE_LDFLAGS = + +# Deduce objects +CORE_OBJECTS = $(CORE_SOURCES:%.c=$(BUILD_DIR)/$(CORE_DIR)/%.o) + +# Current file nb to process +CURRENT_CORE_FILE := 0 + +# Build core target +build_core: core_setup count_core_build $(BUILD_DIR)/libCore.so core_end + +# Core build directories +core_setup: + @echo "Building libCore.so (1/3)" + $(Q)mkdir -p $(dir $(CORE_OBJECTS)) + +# Count files to build +count_core_build: + $(eval export TOTAL_CORE_FILES := $(shell echo $$(($$(make -n $(CORE_OBJECTS) 2>/dev/null | grep -c "Building") + 1)))) + +# Link core target +$(BUILD_DIR)/libCore.so: $(CORE_OBJECTS) + @echo -e "[100%] $(YELLOW)Linking libCore.so$(RESET)" + $(Q)$(CORE_CC) -shared $(CORE_LDFLAGS) -o $@ $(CORE_OBJECTS) + +# Build .o files +$(BUILD_DIR)/$(CORE_DIR)/%.o: $(CORE_DIR)/%.c + $(eval CURRENT_CORE_FILE := $(shell echo $$(($(CURRENT_CORE_FILE)+1)))) + $(eval PERCENTAGE := $(shell echo $$(($(CURRENT_CORE_FILE)*100/$(TOTAL_CORE_FILES))))) + @echo -e "[$(PERCENTAGE)%] $(GREEN)Building C object $@$(RESET)" + $(Q)$(CORE_CC) $(CORE_CFLAGS) $(CORE_INCLUDE_DIRS:%=-I%) -MMD -MP -c $< -o $@ + +# Print ending message +core_end: $(BUILD_DIR)/libCore.so + @echo "Built target libCore.so" + +# Source files dependencies +-include $(SOURCE_OBJECTS:.o=.d) diff --git a/src/display.c b/src/display.c new file mode 100644 index 0000000..a681ae8 --- /dev/null +++ b/src/display.c @@ -0,0 +1,36 @@ +#include "display.h" + +#include + +SDL_Window *window = NULL; +SDL_Renderer *renderer = NULL; + +void display_init(void) +{ + SDL_Init(SDL_INIT_EVERYTHING); + window = SDL_CreateWindow("2D_Engine", SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED, DISPLAY_WIDTH * DISPLAY_SCALE, DISPLAY_HEIGHT * DISPLAY_SCALE, SDL_WINDOW_SHOWN); + renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_ACCELERATED); +} + +void display_update(void) +{ + SDL_RenderPresent(renderer); +} + +void display_clear(void) +{ + SDL_SetRenderDrawColor(renderer, COLOR_WHITE); + SDL_RenderClear(renderer); +} + +void display_subimage(image_t *image, const rect_t *dst_rect, const rect_t *src_rect, bool flip __attribute__((unused))) +{ + SDL_RenderCopy(renderer, image, src_rect, dst_rect); +} + +void display_exit(void) +{ + SDL_DestroyRenderer(renderer); + SDL_DestroyWindow(window); + SDL_Quit(); +} diff --git a/src/event.c b/src/event.c new file mode 100644 index 0000000..1ac55b8 --- /dev/null +++ b/src/event.c @@ -0,0 +1,6 @@ +#include "event.h" + +inline int pollevent(event_t *event) +{ + return SDL_PollEvent(event); +} diff --git a/src/headers/display.h b/src/headers/display.h new file mode 100644 index 0000000..25ed7f2 --- /dev/null +++ b/src/headers/display.h @@ -0,0 +1,27 @@ +#ifndef DISPLAY_H +#define DISPLAY_H + +#include +#include "image.h" +#include "vector2d.h" + +#define COLOR_WHITE 255, 255, 255, 255 + +#define DISPLAY_WIDTH 396 +#define DISPLAY_HEIGHT 224 +#define DISPLAY_SCALE 2 + +extern SDL_Window *window; +extern SDL_Renderer *renderer; + +void display_init(void); + +void display_update(void); + +void display_clear(void); + +void display_subimage(image_t *image, const rect_t *dst_rect, const rect_t *src_rect, bool flip); + +void display_exit(void); + +#endif // DISPLAY_H \ No newline at end of file diff --git a/src/headers/event.h b/src/headers/event.h new file mode 100644 index 0000000..70b52ae --- /dev/null +++ b/src/headers/event.h @@ -0,0 +1,14 @@ +#ifndef KEYBOARD_H +#define KEYBOARD_H + +#include + +#define EVENT_KEY_UP SDL_KEYUP +#define EVENT_KEY_DOWN SDL_KEYDOWN +#define EVENT_QUIT SDL_QUIT + +typedef SDL_Event event_t; + +int pollevent(event_t *event); + +#endif // KEYBOARD_H \ No newline at end of file diff --git a/src/headers/image.h b/src/headers/image.h new file mode 100644 index 0000000..9a60e39 --- /dev/null +++ b/src/headers/image.h @@ -0,0 +1,8 @@ +#ifndef IMAGE_H +#define IMAGE_H + +#include + +typedef SDL_Texture image_t; + +#endif // IMAGE_H \ No newline at end of file diff --git a/src/headers/keycodes.h b/src/headers/keycodes.h new file mode 100644 index 0000000..b80fc92 --- /dev/null +++ b/src/headers/keycodes.h @@ -0,0 +1,13 @@ +#ifndef KEYCODES_H +#define KEYCODES_H + +#include + +#define MAX_KEYCODES SDL_NUM_SCANCODES + +#define KEY_UP SDL_SCANCODE_UP +#define KEY_DOWN SDL_SCANCODE_DOWN +#define KEY_LEFT SDL_SCANCODE_LEFT +#define KEY_RIGHT SDL_SCANCODE_RIGHT + +#endif // KEYCODES_H \ No newline at end of file diff --git a/src/headers/linked_list.h b/src/headers/linked_list.h new file mode 100644 index 0000000..e15a54a --- /dev/null +++ b/src/headers/linked_list.h @@ -0,0 +1,287 @@ +#ifndef LINKED_LIST_H +#define LINKED_LIST_H + +#include +#include +#include + +/** + * @brief Element struct for linked lists. + * This struct is the base for storing data in a linked list. + * + * @param data Raw pointer to any type of data + * @param prev Pointer to the prev element in the linked list + * @param next Pointer to the next element in the linked list +*/ +typedef struct elem_t { + void *data; + struct elem_t *prev; + struct elem_t *next; +} elem_t; + +/** + * @brief A type for deleters used during the destruction of data stored in elements. + * + * During the initialisation of linked lists you can pass in argument a deleter. + * It is used during the destruction of an element. + * You can pass NULL to the initialisation to use the default deleter (kfree(elem->data)). + * Your deleter_t function declaration must look like this : + * + * void name_of_your_deleter(void *data); + * + * Then do what you need to destroy your data (don't forget to free the data itself...) but not the elements. + * You should always define your function with "inline" if it's no too long. +*/ +typedef void (*deleter_t)(void *data); + +/** + * @brief A type for condition used for function like linked_list_remove_if + * + * For function like linked_list_remove_if you need a condition. + * It have two argument which are "elem_t *" and "va_list", that is because it passes the element on the actual index + * and the args passed to the function. + * Your condition_t function declaration must look like this : + * + * bool name_of_your_condition(elem_t *elem, va_list); + * + * Then return true if you want the element to be removed from the list or false if not. + * You should always define your function with "static", and "inline" if the condition is not too long. +*/ +typedef bool (*condition_t)(elem_t *elem, va_list args); + +/** + * @brief A type for action used for function like linked_list_for_each + * + * For function like linked_list_for_each you need an action to do. + * It have two argument which are "elem_t *" and "va_list", that is because it passes the element on the actual index + * and the args passed to the function. + * Your condition_t function declaration must look like this : + * + * void name_of_your_condition(elem_t *elem, va_list); + * + * Then do whatever you want with the element data, just don't remove it. + * You should always define your function with "static", and "inline" if the action is short. +*/ +typedef void (*action_t)(elem_t *elem, va_list args); + +/** + * @brief Base of linked lists. + * This struct is the base for creating linked lists. + * + * @param data_size Size of the data stored in elements of the linked list (used while creating new elements) + * @param first Pointer to the first element in the linked list + * @param last Pointer to the last element in the linked list + * @param size Size of the linked list + * @param deleter Deleter of the data when removing an element +*/ +typedef struct linked_list_t { + size_t data_size; + elem_t *first; + elem_t *last; + size_t size; + deleter_t elem_deleter; +} linked_list_t; + +/** + * @brief Init a linked list + * This function is necessary if you create a linked list. + * + * WARNING : It doesn't allocate the memory for you ! + * + * @param linked_list Pointer to an linked list + * @param data_size Data size for elements in the linked list + * @param deleter The deleter used during destroyement of an elem +*/ +void linked_list_init(linked_list_t *linked_list, const size_t data_size, deleter_t deleter); + +/** + * @brief Create an elem to fill with data to insert in a linked list. + * This function is usefull when you want to initialise an elem with the proper data_size strored in the linked list. + * + * WARNING : Don't change the "data" ptr after calling this function or it will lead to memory leaks ! + * Instead do something like this : *(int *)elem->data = 42; + * + * @param linked_list Pointer to an linked list + * + * @return Address of initialised elem, NULL on error. +*/ +elem_t *elem_create(const linked_list_t *linked_list); + +/** + * @brief Destroy the given element and its data. + * This function is usefull when you want to free an element. + * The deleter is used for the data only and you can pass NULL to use the default deleter. + * + * @param elem Pointer to an element + * @param elem_deleter Function to use to free the data +*/ +void destroy_elem(elem_t *elem, const deleter_t elem_deleter); + +/** + * @brief Insert an element from the back in a linked list, do nothing on error. + * + * @param linked_list Pointer to a linked list + * @param elem Pointer to an element +*/ +void linked_list_push_back_elem(linked_list_t *linked_list, elem_t *elem); + +/** + * @brief Insert an element from the front in a linked list, do nothing on error. + * + * @param linked_list Pointer to a linked list + * @param elem Pointer to an element +*/ +void linked_list_push_front_elem(linked_list_t *linked_list, elem_t *elem); + +/** + * @brief Insert an element initialised and filled with data from the back in a linked list, do nothing on error. + * + * @param linked_list Pointer to a linked list + * @param data Pointer to any data +*/ +void linked_list_push_back(linked_list_t *linked_list, void *data); + +/** + * @brief Insert an element filled with data from the front in a linked list. + * + * @param linked_list Pointer to a linked list + * @param data Pointer to any data +*/ +void linked_list_push_front(linked_list_t *linked_list, void *data); + +/** + * @brief Delete the last element in the given linked list, do nothing on error. + * + * @param linked_list Pointer to a linked list +*/ +void linked_list_pop_back(linked_list_t *linked_list); + +/** + * @brief Delete the first element in the given linked list, do nothing on error. + * + * @param linked_list Pointer to a linked list +*/ +void linked_list_pop_front(linked_list_t *linked_list); + +/** + * @brief Clear the given linked list, do nothing on error. + * + * @brief linked_list Pointer to a linked list +*/ +void linked_list_clear(linked_list_t *linked_list); + +/** + * @brief Check if the given linked list is empty. + * + * @param linked_list Pointer to a linked list + * + * @return True if the given linked list is empty else false. +*/ +bool linked_list_is_empty(const linked_list_t *linked_list); + +/** + * @brief Check if the given index is whithin the range of the linked list. + * + * @param linked_list Pointer to an linked_list_t + * + * @return True if index in within the range of the linked list else false. +*/ +bool linked_list_is_in_bound(const linked_list_t *linked_list, const size_t index); + +/** + * @brief Get element at the given index in the linked list. + * + * @param linked_list Pointer to a linked list + * @param index Index of the element + * + * @return Element, NULL on error. +*/ +elem_t *linked_list_get_elem(const linked_list_t *linked_list, const size_t index); + +/** + * @brief Get data in the element at the given index in the linked list. + * + * @param linked_list Pointer to an linked list + * @param index Index of the wanted element + * + * @return Data, NULL on error. +*/ +void *linked_list_get(const linked_list_t *linked_list, const size_t index); + +/** + * @brief Insert element at the given index in the linked list, do nothing on error. + * + * @param linked_list Pointer to a linked list + * @param elem Pointer to an element + * @param index Index to insert element +*/ +void linked_list_insert_elem(linked_list_t *linked_list, elem_t *elem, const size_t index); + +/** + * @brief Insert element with data at the given index in the linked list, do nothing on error. + * + * @param linked_list Pointer to a linked list + * @param data Data to put in the new element + * @param index Index to insert the element +*/ +void linked_list_insert(linked_list_t *linked_list, void *data, const size_t index); + +/** + * @brief Remove the given elem in the linked list, do nothing on error. + * + * @param linked_list Pointer to a linked list + * @param elem Element to remove +*/ +void linked_list_remove_elem(linked_list_t *linked_list, elem_t *elem); + +/** + * @brief Remove element at the given index in the linked list, do nothing on error. + * + * @param linked_list Pointer to a linked list + * @param index Index of the element +*/ +void linked_list_remove(linked_list_t *linked_list, const size_t index); + +/** + * @brief Return first element that the condition verify + * + * @param linked_list Pointer to a linked list + * @param condition Condition to verify + * @param ... Argument to pass to the condition + * + * @return Element, NULL if no element verify the condition or if an error ocurred. +*/ +elem_t *linked_list_get_elem_if(const linked_list_t *linked_list, const condition_t condition, ...); + +/** + * @brief Return data in the first element that the condition verify + * + * @param linked_list Pointer to a linked list + * @param condition Condition to verify + * @param ... Argument to pass to the condition + * + * @return Element data, NULL if no element verify the condition or if an error ocurred. +*/ +void *linked_list_get_if(const linked_list_t *linked_list, const condition_t condition, ...); + +/** + * @brief Remove every elements that the condition verify, do nothing on error. + * + * @param linked_list Pointer to an linked list + * @param condition Condition to verify + * @param ... Argument to pass to the condition +*/ +void linked_list_remove_if(linked_list_t *linked_list, const condition_t condition, ...); + +/** + * @brief Apply an action to every elements in the list. + * Useful for changing a value in every single element data. + * The action can be anything that doesn't destroy the element. + * + * @param linked_list Pointer to an linked list + * @param action Action to apply + * @param ... Argument to pass to the action +*/ +void linked_list_for_each(const linked_list_t *linked_list, const action_t action, ...); + +#endif // LINKED_LIST_H diff --git a/src/headers/memory_alloc.h b/src/headers/memory_alloc.h new file mode 100644 index 0000000..9a0a8b5 --- /dev/null +++ b/src/headers/memory_alloc.h @@ -0,0 +1,6 @@ +#ifndef MALLOC_H +#define MALLOC_H + +#include + +#endif // MALLOC_H \ No newline at end of file diff --git a/src/headers/texture_manager.h b/src/headers/texture_manager.h new file mode 100644 index 0000000..a623c6a --- /dev/null +++ b/src/headers/texture_manager.h @@ -0,0 +1,81 @@ +#ifndef TEXTURE_MANAGER_H +#define TEXTURE_MANAGER_H + +#include +#include "vector2d.h" +#include "linked_list.h" + +/* texture_t: Texture struct + This struct is the base for textures + + @name Name of the texture + @image Image of type image_t */ +typedef struct texture_t { + const char *name; + image_t *image; +} texture_t; + +/* create_texture(): Create a texture with the given image and name + + @name Name of the texture + @image Texture of type image_t + Return the created texture, NULL on error. */ +texture_t *create_texture(image_t *, const char *); + +/* destroy_texture(): Destroy the given texture + + @texture Texture to destroy */ +void destroy_texture(texture_t *); + +/* draw_texture(): Draw the given texture from given src rect to dst rect + + @texture Texture to draw + @src Source rectangle of the texture to draw + @dst Destination of the drawing */ +void draw_texture(const texture_t *, const rect_t *, const rect_t *, bool); + +/* texture_manager_t: Texture manager + + @textures Textures loaded in memory */ +typedef struct texture_manager_t { + linked_list_t textures; +} texture_manager_t; + +/* texture_manager_init(): Initialise the given texture_manager + + @texture_manager Pointer to a texture manager */ +void texture_manager_init(texture_manager_t *); + +/* texture_manager_add_texture(): Add a texture in the texture manager + + @texture_manager Pointer to a texture manager + @texture Texture to add in the texture manager */ +void texture_manager_add_texture(texture_manager_t *, texture_t *); + +/* texture_manager_get_texture(): Get a texture in the texture manager + + @texture_manager Pointer to a texture manager + @name Name of the texture to get + Return the texture, NULL on error or if the texture is not found. */ +texture_t *texture_manager_get_texture(texture_manager_t *, const char *); + +/* texture_manager_remove_texture(): Remove a texture in the texture manager + + @texture_manager Pointer to a texture manager + @name Name of the texture to remove + Do nothing if the texture is not found. */ +void texture_manager_remove_texture(texture_manager_t *, const char *); + +/* texture_manager_clear(): Clear the texture manager + + @texture_manager Pointer to a texture manager */ +void texture_manager_clear(texture_manager_t *); + +/* texture_manager_draw_texture(): Draw a texture in the texture manager + + @texture_manager Pointer to a texture manager + @name Name of the texture to draw + Do nothing if the texture is not found. */ +void texture_manager_draw_texture(texture_manager_t *, const char *, const rect_t *, const rect_t *, bool); + +#endif // TEXTURE_MANAGER_H \ No newline at end of file diff --git a/src/headers/vector2d.h b/src/headers/vector2d.h new file mode 100644 index 0000000..502b428 --- /dev/null +++ b/src/headers/vector2d.h @@ -0,0 +1,135 @@ +#ifndef VECTOR2D_H +#define VECTOR2D_H + +#include +#include + +/** + * @brief Point struct. (int) + * + * @param x X pos + * @param y Y pos +*/ +typedef SDL_Point vector2d_t; + +/** + * @brief Point struct. (float) + * + * @param x X pos + * @param y Y pos +*/ +typedef SDL_FPoint fvector2d_t; + +/** + * @brief Rectangle struct. (int) + * + * @param x X pos + * @param y Y pos + * @param w Width + * @param h Height +*/ +typedef SDL_Rect rect_t; + +/** + * @brief Rectangle struct. (float) + * + * @param x X pos + * @param y Y pos + * @param w Width + * @param h Height +*/ +typedef SDL_FRect frect_t; + +#define EPSILON 0.000001f + +__attribute__((const)) float fabsf(float x); + +#define is_equal_to_zero(X) (fabsf(X) <= EPSILON) + +#define is_not_zero(X) (fabsf(X) > EPSILON) + +void rect_to_frect(const rect_t rect, frect_t frect); + +void frect_to_rect(const frect_t *frect, rect_t *rect); + +/** + * @brief Verify if a point is in a rectangle. (int) + * + * @param P Vector2d + * @param R Rectangle + * + * @return True if the point is in the rectangle, else false. +*/ +#define point_in_rect(P, R) SDL_PointInRect(P, R) + +/** + * @brief Verify if a point is in a rectangle. (float) + * + * @param P Vector2d + * @param R Rectangle + * + * @return True if the point is in the rectangle, else false. +*/ +#define fpoint_in_frect(P, R) SDL_PointInRectF(P, R) + +/** + * @brief Verify if a rectangle is empty + * + * @param R Rectangle + * + * @return True if the rectangle is empty, else false. +*/ +#define rect_empty(R) SDL_RectEmpty(R) + +/** + * @brief Verify if a rectangle is empty + * + * @param R Rectangle + * + * @return True if the rectangle is empty, else false. +*/ +#define frect_empty(R) SDL_FRectEmpty(R) + +/** + * @brief Verify if there is a intersction between two rectangles. (int) + * + * @param A Rectangle A + * @param B Rectangle B + * + * @return True if there is an intersection, else false. +*/ +#define has_intersection(A, B) SDL_HasIntersection(A, B) + +/** + * @brief Verify if there is a intersction between two rectangles. (float) + * + * @param A Rectangle A + * @param B Rectangle B + * + * @return True if there is an intersection, else false. +*/ +#define fhas_intersection(A, B) SDL_HasIntersectionF(A, B) + +/** + * @brief Verify if there is an intersection between two rectangles and get the intersection rectangle. (int) + * + * @param A Rectangle A + * @param B Rectangle B + * @param result The intersection rectangle + * + * @return True if there is an intersection, else false. +*/ +#define intersect_rect(A, B, result) SDL_IntersectRect(A, B, result) + +/** + * @brief Verify if there is an intersection between two rectangles and get the intersection rectangle. (float) + * + * @param A Rectangle A + * @param B Rectangle B + * @param result The intersection rectangle + * + * @return True if there is an intersection, else false. +*/ +#define intersect_frect(A, B, result) SDL_IntersectFRect(A, B, result) + +#endif // VECTOR2D_H \ No newline at end of file diff --git a/src/linked_list.c b/src/linked_list.c new file mode 100644 index 0000000..6d7cf42 --- /dev/null +++ b/src/linked_list.c @@ -0,0 +1,377 @@ +#include +#include "memory_alloc.h" +#include "linked_list.h" + +elem_t *elem_create(const linked_list_t *linked_list) +{ + elem_t *tmp; + tmp = malloc(sizeof(elem_t)); + if(!tmp) return NULL; + + tmp->data = malloc(linked_list->data_size); + if(!tmp->data) + { + free(tmp); + return NULL; + } + + return tmp; +} + +inline void destroy_elem(elem_t *elem, const deleter_t elem_deleter) +{ + if(!elem) return; + + if(elem_deleter) + elem_deleter(elem->data); + else + free(elem->data); + + free(elem); +} + +void linked_list_init(linked_list_t *linked_list, const size_t data_size, const deleter_t elem_deleter) +{ + linked_list->first = NULL; + linked_list->last = NULL; + linked_list->size = 0; + + linked_list->data_size = data_size; + linked_list->elem_deleter = elem_deleter; +} + +void linked_list_push_back_elem(linked_list_t *linked_list, elem_t *elem) +{ + if(!elem) return; + + elem->prev = linked_list->last; + elem->next = NULL; + + if(linked_list->last) + linked_list->last->next = elem; + else + linked_list->first = elem; + + linked_list->last = elem; + + linked_list->size++; +} + +void linked_list_push_front_elem(linked_list_t *linked_list, elem_t *elem) +{ + if(!elem) return; + + elem->next = linked_list->first; + elem->prev = NULL; + + if(linked_list->first) + linked_list->first->prev = elem; + else + linked_list->last = elem; + + linked_list->first = elem; + + linked_list->size++; +} + +void linked_list_push_back(linked_list_t *linked_list, void *data) +{ + elem_t *tmp = malloc(sizeof(elem_t)); + if(!tmp) return; + tmp->data = data; + + linked_list_push_back_elem(linked_list, tmp); +} + +void linked_list_push_front(linked_list_t *linked_list, void *data) +{ + elem_t *tmp = malloc(sizeof(elem_t)); + if(!tmp) return; + tmp->data = data; + + linked_list_push_front_elem(linked_list, tmp); +} + +void linked_list_pop_back(linked_list_t *linked_list) +{ + elem_t *tmp = linked_list->last; + if(!tmp) return; + + linked_list->last = tmp->prev; + + if(linked_list->last) + linked_list->last->next = NULL; + else + linked_list->first = NULL; + + destroy_elem(tmp, linked_list->elem_deleter); + + linked_list->size--; +} + +void linked_list_pop_front(linked_list_t *linked_list) +{ + elem_t *tmp = linked_list->first; + if(!tmp) return; + + linked_list->first = tmp->next; + + if(linked_list->first) + linked_list->first->prev = NULL; + else + linked_list->last = NULL; + + destroy_elem(tmp, linked_list->elem_deleter); + + linked_list->size--; +} + +void linked_list_clear(linked_list_t *linked_list) +{ + elem_t *actual_elem = linked_list->first; + elem_t *tmp; + + while(actual_elem) + { + tmp = actual_elem; + + actual_elem = actual_elem->next; + + destroy_elem(tmp, linked_list->elem_deleter); + } + + linked_list->first = NULL; + linked_list->last = NULL; + + linked_list->size = 0; +} + +inline bool linked_list_is_empty(const linked_list_t *linked_list) +{ + return !linked_list->first; +} + +inline bool linked_list_is_in_bound(const linked_list_t *linked_list, size_t index) +{ + return index < linked_list->size; +} + +elem_t *linked_list_get_elem(const linked_list_t *linked_list, size_t index) +{ + if(!linked_list_is_in_bound(linked_list, index)) return NULL; + + if(index == 0) + return linked_list->first; + if(index == linked_list->size - 1) + return linked_list->last; + + elem_t *actual_elem = linked_list->first; + if(!actual_elem) return NULL; + + for (size_t i = 0; i < index; i++) + { + actual_elem = actual_elem->next; + } + + return actual_elem; +} + +void *linked_list_get(const linked_list_t *linked_list, size_t index) +{ + elem_t *tmp = linked_list_get_elem(linked_list, index); + if(!tmp) return NULL; + return tmp->data; +} + +void linked_list_insert_elem(linked_list_t *linked_list, elem_t *elem, size_t index) +{ + if(!elem) return; + if(!linked_list_is_in_bound(linked_list, index)) return; + + if(index == 0) + { + linked_list_push_front_elem(linked_list, elem); + } + else if(index == (linked_list->size - 1)) + { + linked_list_push_back_elem(linked_list, elem); + } + else + { + elem_t *next_insert_elem = linked_list_get_elem(linked_list, index); + elem_t *prev_insert_elem = next_insert_elem->prev; + + elem->prev = prev_insert_elem; + elem->next = next_insert_elem; + + prev_insert_elem->next = elem; + next_insert_elem->prev = elem; + + linked_list->size++; + } +} + +void linked_list_insert(linked_list_t *linked_list, void *data, size_t index) +{ + elem_t *tmp = malloc(sizeof(elem_t)); + if(!tmp) return; + tmp->data = data; + + linked_list_insert_elem(linked_list, tmp, index); +} + +void linked_list_remove_elem(linked_list_t *linked_list, elem_t *elem) +{ + if(!elem) return; + + if(elem == linked_list->first) + { + linked_list_pop_front(linked_list); + } + else if(elem == linked_list->last) + { + linked_list_pop_back(linked_list); + } + else + { + elem_t *prev_insert_elem = elem->prev; + elem_t *next_insert_elem = elem->next; + + prev_insert_elem->next = next_insert_elem; + next_insert_elem->prev = prev_insert_elem; + + destroy_elem(elem, linked_list->elem_deleter); + + linked_list->size--; + } +} + +void linked_list_remove(linked_list_t *linked_list, size_t index) +{ + elem_t *tmp = linked_list_get_elem(linked_list, index); + if(tmp) linked_list_remove_elem(linked_list, tmp); +} + +elem_t *linked_list_get_elem_if(const linked_list_t *linked_list, const condition_t condition, ...) +{ + if(!condition) return NULL; + + va_list args; + va_start(args, condition); + + elem_t *actual_elem = linked_list->first; + elem_t *next_elem; + + while(actual_elem) + { + next_elem = actual_elem->next; + + va_list args_copy; + va_copy(args_copy, args); + + if(condition(actual_elem, args_copy)) + { + va_end(args_copy); + va_end(args); + + return actual_elem; + } + + va_end(args_copy); + + actual_elem = next_elem; + } + + va_end(args); + + return NULL; +} + +void *linked_list_get_if(const linked_list_t *linked_list, const condition_t condition, ...) +{ + if(!condition) return NULL; + + va_list args; + va_start(args, condition); + + elem_t *actual_elem = linked_list->first; + elem_t *next_elem; + + while(actual_elem) + { + next_elem = actual_elem->next; + + va_list args_copy; + va_copy(args_copy, args); + + if(condition(actual_elem, args_copy)) + { + va_end(args_copy); + va_end(args); + + return actual_elem->data; + } + + va_end(args_copy); + + actual_elem = next_elem; + } + + va_end(args); + + return NULL; +} + +void linked_list_remove_if(linked_list_t *linked_list, const condition_t condition, ...) +{ + if(!condition) return; + + va_list args; + va_start(args, condition); + + elem_t *actual_elem = linked_list->first; + elem_t *next_elem; + + while(actual_elem) + { + next_elem = actual_elem->next; + + va_list args_copy; + va_copy(args_copy, args); + + if(condition(actual_elem, args_copy)) + { + linked_list_remove_elem(linked_list, actual_elem); + } + + va_end(args_copy); + + actual_elem = next_elem; + } + + va_end(args); +} + +void linked_list_for_each(const linked_list_t *linked_list, const action_t action, ...) +{ + if(!action) return; + + va_list args; + va_start(args, action); + + elem_t *actual_elem = linked_list->first; + + while(actual_elem) + { + va_list args_copy; + va_copy(args_copy, args); + + action(actual_elem, args_copy); + + va_end(args_copy); + + actual_elem = actual_elem->next; + } + + va_end(args); +} diff --git a/src/texture_manager.c b/src/texture_manager.c new file mode 100644 index 0000000..eee2f8c --- /dev/null +++ b/src/texture_manager.c @@ -0,0 +1,65 @@ +#include +#include +#include +#include "texture_manager.h" + +texture_t *create_texture(image_t *image, const char *name) +{ + if(!image) return NULL; + + texture_t *texture = malloc(sizeof(texture_t)); + if (!texture) return NULL; + + texture->name = name; + texture->image = image; + + return texture; +} + +inline void destroy_texture(texture_t *texture) +{ + free(texture); +} + +inline void draw_texture(const texture_t *texture, const rect_t *src_rect, const rect_t *dst_rect, bool flip) +{ + //display_subimage(texture->image, src_rect, dst_rect, flip); +} + +inline void texture_manager_init(texture_manager_t *texture_manager) +{ + linked_list_init(&texture_manager->textures, sizeof(texture_t), NULL); +} + +inline void texture_manager_add_texture(texture_manager_t *texture_manager, texture_t *texture) +{ + linked_list_push_back(&texture_manager->textures, texture); +} + +// Only for this file +// Arg : const char *name +static inline bool is_texture_name(elem_t *elem, va_list args) +{ + return !strcmp(((texture_t *)elem->data)->name, va_arg(args, const char*)); +} + +texture_t *texture_manager_get_texture(texture_manager_t *texture_manager, const char *name) +{ + texture_t *texture = linked_list_get_if(&texture_manager->textures, is_texture_name, name); + return texture; +} + +inline void texture_manager_remove_texture(texture_manager_t *texture_manager, const char *name) +{ + linked_list_remove_if(&texture_manager->textures, is_texture_name, name); +} + +inline void texture_manager_clear(texture_manager_t *texture_manager) +{ + linked_list_clear(&texture_manager->textures); +} + +inline void texture_manager_draw_texture(texture_manager_t *texture_manager, const char *name, const rect_t *src, const rect_t *dst, bool flip) +{ + draw_texture(texture_manager_get_texture(texture_manager, name), src, dst, flip); +} diff --git a/src/vector2d.c b/src/vector2d.c new file mode 100644 index 0000000..77a99ad --- /dev/null +++ b/src/vector2d.c @@ -0,0 +1,9 @@ +#include "vector2d.h" + +void frect_to_rect(const frect_t *frect, rect_t *rect) +{ + rect->x = (int)frect->x; + rect->y = (int)frect->y; + rect->w = (int)frect->w; + rect->h = (int)frect->h; +}