diff --git a/.reuse/dep5 b/.reuse/dep5 deleted file mode 100644 index 63a5856..0000000 --- a/.reuse/dep5 +++ /dev/null @@ -1,17 +0,0 @@ -Format: https://www.debian.org/doc/packaging-manuals/copyright-format/1.0/ -Upstream-Name: clib -Upstream-Contact: Alisa Lain -Source: https://github.com/al1-ce/clib - -Files: test/* readme/* -Copyright: (C) 2022 Alisa Lain -License: GPL-3.0-or-later - -Files: .github/* dub.sdl .dub/* .gitignore .pre-commit-config.yaml dscanner.ini -Copyright: (C) 2023 Alisa Lain -License: CC0-1.0 - -Files: .todo.md AUTHORS.md CHANGEDLOG.md CONTRIBUTING.md README.md justfile -Copyright: (C) 2023 Alisa Lain -License: CC0-1.0 - diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md index 27dabf9..6268909 100644 --- a/CONTRIBUTING.md +++ b/CONTRIBUTING.md @@ -28,8 +28,9 @@ clib mostly follows [D style](https://dlang.org/dstyle.html). Essential rules ar * Use spaces instead of tabs. Each indentation level is 4 spaces * There's always a space after control statements (`if`, `while`, `for`, etc...) * Opening curly bracket should be on a **same** line -* Functions and variables should be in `camelCase` +* Functions and variables should be in `snake_case` * Classes, structs and enums should be in `PascalCase` +* Enum members, consts and macro-like templates and functions can be in `SCREAMING_SNAKE_CASE` * Module names should be in lowercase * `if () else if ()` can be split as `if () else\n if ()` * If method or function is used as property parenthesis can be dropped @@ -46,11 +47,11 @@ clib mostly follows [D style](https://dlang.org/dstyle.html). Essential rules ar 3. Constructors 4. Public methods 5. Private methods -* Name prefixes are: - - ` ` - none for any kind of properties except ones below (`public static const int normalProperty`) - - `_` - for private/protected properties (`private int _privateProperty`) - - `s_` - for private/protected static properties (`private static int s_staticInt`) - - `t_` - for private/protected thread static properties (`private shared int t_staticInt`) +* Property name prefixes are (does not apply to methods): + - ` ` - none for any kind of properties except ones below (`public static const int normal_property`) + - `_` - for private/protected properties (`private int _private_property`) + - `s_` - for private/protected static properties (`private static int s_static_int`) + - `t_` - for private/protected thread static properties (`private shared int t_static_int`) - `_` - as postfix when name is a keyword (`bool bool_`) * Function signature preferred to be in order: 1. attributes (@property) @@ -61,33 +62,33 @@ clib mostly follows [D style](https://dlang.org/dstyle.html). Essential rules ar 6. type qualifiers and type (int, bool...) 7. name and params 8. attributes (const, nothrow, pure, @nogc, @safe) - 9. i.e `@property private static override int myMethod(int* ptr) @safe @nogc nothrow {}` + 9. i.e `@property private static override int my_method(int* ptr) @safe @nogc nothrow {}` * Interfaces must be prefixed with `I`, i.e. `IEntity` * When declaring properties, methods, etc... visibility modifier can be dropped in favor of global visibility modifier, i.e `private:`. This type of declaration is valid but should be avoided since it's considered implicit - Example: ``` class MyClass { public: - int myPublicInt; - string myPublicString; + int my_public_int; + string my_public_string; private: - int myPrivateInt; + int _my_private_int; public: - int myPublicIntMethod() {} + int my_public_int_method() {} ... } ``` * Always describe symbols with ddoc unless name is self-descriptive (for properties) -* **Avoid exceptions at all costs.** Prefer status return checks and if needed to return nullable -* Include copyright line at top of source file or in `.reuse/dep5` for resource files or meta files +* **Avoid exceptions at all costs.** Prefer status return checks and if needed to return `clib.optional` +* Include copyright line at top of source file or in `REUSE.toml` for resource files or meta files * Copyright line is subject to change! Example of how a module would look like when adhering to those rules: ```d -// SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 /++ Custom clib module. @@ -107,27 +108,27 @@ public import clib.queue; /// CustomStruct isCustom type enum enum CustomEnum { - enumKey1, - enumKey2 + ENUM_KEY_1, + ENUM_KEY_1 } /// Structure to do custom things struct CustomStruct { /// Is custom struct - CustomEnum isCustom; + CustomEnum is_custom; /// Struct index static int index; - private int _privateIndex; - private shared bool t_isInit; + private int _private_index; + private shared bool t_is_init; /// Returns private name - @property cstring getName() const { - return privateName(); + @property cstring get_name() const { + return private_name(); } /// Ditto - private cstring privateName() const { + private cstring private_name() const { return cstring("my private name"); } } diff --git a/LICENSE b/LICENSE index f288702..2e8fa27 100644 --- a/LICENSE +++ b/LICENSE @@ -1,674 +1,47 @@ - GNU GENERAL PUBLIC LICENSE - Version 3, 29 June 2007 +Open Software License v. 3.0 (OSL-3.0) - 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. +This Open Software License (the "License") applies to any original work of authorship (the "Original Work") whose owner (the "Licensor") has placed the following licensing notice adjacent to the copyright notice for the Original Work: - Preamble + Licensed under the Open Software License version 3.0 - The GNU General Public License is a free, copyleft license for -software and other kinds of works. +1) Grant of Copyright License. Licensor grants You a worldwide, royalty-free, non-exclusive, sublicensable license, for the duration of the copyright, to do the following: - 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. + a) to reproduce the Original Work in copies, either alone or as part of a collective work; - 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. + b) to translate, adapt, alter, transform, modify, or arrange the Original Work, thereby creating derivative works ("Derivative Works") based upon the Original Work; - 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. + c) to distribute or communicate copies of the Original Work and Derivative Works to the public, with the proviso that copies of Original Work or Derivative Works that You distribute or communicate shall be licensed under this Open Software License; - 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. + d) to perform the Original Work publicly; and - 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. + e) to display the Original Work publicly. - 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. +2) Grant of Patent License. Licensor grants You a worldwide, royalty-free, non-exclusive, sublicensable license, under patent claims owned or controlled by the Licensor that are embodied in the Original Work as furnished by the Licensor, for the duration of the patents, to make, use, sell, offer for sale, have made, and import the Original Work and Derivative Works. - 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. +3) Grant of Source Code License. The term "Source Code" means the preferred form of the Original Work for making modifications to it and all available documentation describing how to modify the Original Work. Licensor agrees to provide a machine-readable copy of the Source Code of the Original Work along with each copy of the Original Work that Licensor distributes. Licensor reserves the right to satisfy this obligation by placing a machine-readable copy of the Source Code in an information repository reasonably calculated to permit inexpensive and convenient access by You for as long as Licensor continues to distribute the Original Work. - 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. +4) Exclusions From License Grant. Neither the names of Licensor, nor the names of any contributors to the Original Work, nor any of their trademarks or service marks, may be used to endorse or promote products derived from this Original Work without express prior permission of the Licensor. Except as expressly stated herein, nothing in this License grants any license to Licensor’s trademarks, copyrights, patents, trade secrets or any other intellectual property. No patent license is granted to make, use, sell, offer for sale, have made, or import embodiments of any patent claims other than the licensed claims defined in Section 2. No license is granted to the trademarks of Licensor even if such marks are included in the Original Work. Nothing in this License shall be interpreted to prohibit Licensor from licensing under terms different from this License any Original Work that Licensor otherwise would have a right to license. - The precise terms and conditions for copying, distribution and -modification follow. +5) External Deployment. The term "External Deployment" means the use, distribution, or communication of the Original Work or Derivative Works in any way such that the Original Work or Derivative Works may be used by anyone other than You, whether those works are distributed or communicated to those persons or made available as an application intended for use over a network. As an express condition for the grants of license hereunder, You must treat any External Deployment by You of the Original Work or a Derivative Work as a distribution under section 1(c). - TERMS AND CONDITIONS +6) Attribution Rights. You must retain, in the Source Code of any Derivative Works that You create, all copyright, patent, or trademark notices from the Source Code of the Original Work, as well as any notices of licensing and any descriptive text identified therein as an "Attribution Notice." You must cause the Source Code for any Derivative Works that You create to carry a prominent Attribution Notice reasonably calculated to inform recipients that You have modified the Original Work. - 0. Definitions. +7) Warranty of Provenance and Disclaimer of Warranty. Licensor warrants that the copyright in and to the Original Work and the patent rights granted herein by Licensor are owned by the Licensor or are sublicensed to You under the terms of this License with the permission of the contributor(s) of those copyrights and patent rights. Except as expressly stated in the immediately preceding sentence, the Original Work is provided under this License on an "AS IS" BASIS and WITHOUT WARRANTY, either express or implied, including, without limitation, the warranties of non-infringement, merchantability or fitness for a particular purpose. THE ENTIRE RISK AS TO THE QUALITY OF THE ORIGINAL WORK IS WITH YOU. This DISCLAIMER OF WARRANTY constitutes an essential part of this License. No license to the Original Work is granted by this License except under this disclaimer. - "This License" refers to version 3 of the GNU General Public License. +8) Limitation of Liability. Under no circumstances and under no legal theory, whether in tort (including negligence), contract, or otherwise, shall the Licensor be liable to anyone for any indirect, special, incidental, or consequential damages of any character arising as a result of this License or the use of the Original Work including, without limitation, damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses. This limitation of liability shall not apply to the extent applicable law prohibits such limitation. - "Copyright" also means copyright-like laws that apply to other kinds of -works, such as semiconductor masks. +9) Acceptance and Termination. If, at any time, You expressly assented to this License, that assent indicates your clear and irrevocable acceptance of this License and all of its terms and conditions. If You distribute or communicate copies of the Original Work or a Derivative Work, You must make a reasonable effort under the circumstances to obtain the express assent of recipients to the terms of this License. This License conditions your rights to undertake the activities listed in Section 1, including your right to create Derivative Works based upon the Original Work, and doing so without honoring these terms and conditions is prohibited by copyright law and international treaty. Nothing in this License is intended to affect copyright exceptions and limitations (including “fair use” or “fair dealing”). This License shall terminate immediately and You may no longer exercise any of the rights granted to You by this License upon your failure to honor the conditions in Section 1(c). - "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. +10) Termination for Patent Action. This License shall terminate automatically and You may no longer exercise any of the rights granted to You by this License as of the date You commence an action, including a cross-claim or counterclaim, against Licensor or any licensee alleging that the Original Work infringes a patent. This termination provision shall not apply for an action alleging patent infringement by combinations of the Original Work with other software or hardware. - 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. +11) Jurisdiction, Venue and Governing Law. Any action or suit relating to this License may be brought only in the courts of a jurisdiction wherein the Licensor resides or in which Licensor conducts its primary business, and under the laws of that jurisdiction excluding its conflict-of-law provisions. The application of the United Nations Convention on Contracts for the International Sale of Goods is expressly excluded. Any use of the Original Work outside the scope of this License or after its termination shall be subject to the requirements and penalties of copyright or patent law in the appropriate jurisdiction. This section shall survive the termination of this License. - A "covered work" means either the unmodified Program or a work based -on the Program. +12) Attorneys' Fees. In any action to enforce the terms of this License or seeking damages relating thereto, the prevailing party shall be entitled to recover its costs and expenses, including, without limitation, reasonable attorneys' fees and costs incurred in connection with such action, including any appeal of such action. This section shall survive the termination of this License. - 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. +13) Miscellaneous. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it enforceable. - 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. +14) Definition of "You" in This License. "You" throughout this License, whether in upper or lower case, means an individual or a legal entity exercising rights under, and complying with all of the terms of, this License. For legal entities, "You" includes any entity that controls, is controlled by, or is under common control with you. For purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. - 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. +15) Right to Use. You may use the Original Work in all ways not otherwise restricted or conditioned by this License or by law, and Licensor promises not to interfere with or be responsible for such uses by You. - 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 -. +16) Modification of This License. This License is Copyright (c) 2005 Lawrence Rosen. Permission is granted to copy, distribute, or communicate this License without modification. Nothing in this License permits You to modify this License as applied to the Original Work or to Derivative Works. However, You may modify the text of this License and copy, distribute or communicate your modified version (the "Modified License") and apply it to other original works of authorship subject to the following conditions: (i) You may not indicate in any way that your Modified License is the "Open Software License" or "OSL" and you may not use those names in the name of your Modified License; (ii) You must replace the notice specified in the first paragraph above with the notice "Licensed under " or with a notice of your own that is not confusingly similar to the notice in this License; and (iii) You may not claim that your original works are open source software unless your Modified License has been approved by Open Source Initiative (OSI) and You comply with its license review and certification process. diff --git a/LICENSES/GPL-3.0-or-later.txt b/LICENSES/GPL-3.0-or-later.txt deleted file mode 100644 index f6cdd22..0000000 --- a/LICENSES/GPL-3.0-or-later.txt +++ /dev/null @@ -1,232 +0,0 @@ -GNU GENERAL PUBLIC LICENSE -Version 3, 29 June 2007 - -Copyright © 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/LICENSES/OSL-3.0.txt b/LICENSES/OSL-3.0.txt new file mode 100644 index 0000000..2e8fa27 --- /dev/null +++ b/LICENSES/OSL-3.0.txt @@ -0,0 +1,47 @@ +Open Software License v. 3.0 (OSL-3.0) + +This Open Software License (the "License") applies to any original work of authorship (the "Original Work") whose owner (the "Licensor") has placed the following licensing notice adjacent to the copyright notice for the Original Work: + + Licensed under the Open Software License version 3.0 + +1) Grant of Copyright License. Licensor grants You a worldwide, royalty-free, non-exclusive, sublicensable license, for the duration of the copyright, to do the following: + + a) to reproduce the Original Work in copies, either alone or as part of a collective work; + + b) to translate, adapt, alter, transform, modify, or arrange the Original Work, thereby creating derivative works ("Derivative Works") based upon the Original Work; + + c) to distribute or communicate copies of the Original Work and Derivative Works to the public, with the proviso that copies of Original Work or Derivative Works that You distribute or communicate shall be licensed under this Open Software License; + + d) to perform the Original Work publicly; and + + e) to display the Original Work publicly. + +2) Grant of Patent License. Licensor grants You a worldwide, royalty-free, non-exclusive, sublicensable license, under patent claims owned or controlled by the Licensor that are embodied in the Original Work as furnished by the Licensor, for the duration of the patents, to make, use, sell, offer for sale, have made, and import the Original Work and Derivative Works. + +3) Grant of Source Code License. The term "Source Code" means the preferred form of the Original Work for making modifications to it and all available documentation describing how to modify the Original Work. Licensor agrees to provide a machine-readable copy of the Source Code of the Original Work along with each copy of the Original Work that Licensor distributes. Licensor reserves the right to satisfy this obligation by placing a machine-readable copy of the Source Code in an information repository reasonably calculated to permit inexpensive and convenient access by You for as long as Licensor continues to distribute the Original Work. + +4) Exclusions From License Grant. Neither the names of Licensor, nor the names of any contributors to the Original Work, nor any of their trademarks or service marks, may be used to endorse or promote products derived from this Original Work without express prior permission of the Licensor. Except as expressly stated herein, nothing in this License grants any license to Licensor’s trademarks, copyrights, patents, trade secrets or any other intellectual property. No patent license is granted to make, use, sell, offer for sale, have made, or import embodiments of any patent claims other than the licensed claims defined in Section 2. No license is granted to the trademarks of Licensor even if such marks are included in the Original Work. Nothing in this License shall be interpreted to prohibit Licensor from licensing under terms different from this License any Original Work that Licensor otherwise would have a right to license. + +5) External Deployment. The term "External Deployment" means the use, distribution, or communication of the Original Work or Derivative Works in any way such that the Original Work or Derivative Works may be used by anyone other than You, whether those works are distributed or communicated to those persons or made available as an application intended for use over a network. As an express condition for the grants of license hereunder, You must treat any External Deployment by You of the Original Work or a Derivative Work as a distribution under section 1(c). + +6) Attribution Rights. You must retain, in the Source Code of any Derivative Works that You create, all copyright, patent, or trademark notices from the Source Code of the Original Work, as well as any notices of licensing and any descriptive text identified therein as an "Attribution Notice." You must cause the Source Code for any Derivative Works that You create to carry a prominent Attribution Notice reasonably calculated to inform recipients that You have modified the Original Work. + +7) Warranty of Provenance and Disclaimer of Warranty. Licensor warrants that the copyright in and to the Original Work and the patent rights granted herein by Licensor are owned by the Licensor or are sublicensed to You under the terms of this License with the permission of the contributor(s) of those copyrights and patent rights. Except as expressly stated in the immediately preceding sentence, the Original Work is provided under this License on an "AS IS" BASIS and WITHOUT WARRANTY, either express or implied, including, without limitation, the warranties of non-infringement, merchantability or fitness for a particular purpose. THE ENTIRE RISK AS TO THE QUALITY OF THE ORIGINAL WORK IS WITH YOU. This DISCLAIMER OF WARRANTY constitutes an essential part of this License. No license to the Original Work is granted by this License except under this disclaimer. + +8) Limitation of Liability. Under no circumstances and under no legal theory, whether in tort (including negligence), contract, or otherwise, shall the Licensor be liable to anyone for any indirect, special, incidental, or consequential damages of any character arising as a result of this License or the use of the Original Work including, without limitation, damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses. This limitation of liability shall not apply to the extent applicable law prohibits such limitation. + +9) Acceptance and Termination. If, at any time, You expressly assented to this License, that assent indicates your clear and irrevocable acceptance of this License and all of its terms and conditions. If You distribute or communicate copies of the Original Work or a Derivative Work, You must make a reasonable effort under the circumstances to obtain the express assent of recipients to the terms of this License. This License conditions your rights to undertake the activities listed in Section 1, including your right to create Derivative Works based upon the Original Work, and doing so without honoring these terms and conditions is prohibited by copyright law and international treaty. Nothing in this License is intended to affect copyright exceptions and limitations (including “fair use” or “fair dealing”). This License shall terminate immediately and You may no longer exercise any of the rights granted to You by this License upon your failure to honor the conditions in Section 1(c). + +10) Termination for Patent Action. This License shall terminate automatically and You may no longer exercise any of the rights granted to You by this License as of the date You commence an action, including a cross-claim or counterclaim, against Licensor or any licensee alleging that the Original Work infringes a patent. This termination provision shall not apply for an action alleging patent infringement by combinations of the Original Work with other software or hardware. + +11) Jurisdiction, Venue and Governing Law. Any action or suit relating to this License may be brought only in the courts of a jurisdiction wherein the Licensor resides or in which Licensor conducts its primary business, and under the laws of that jurisdiction excluding its conflict-of-law provisions. The application of the United Nations Convention on Contracts for the International Sale of Goods is expressly excluded. Any use of the Original Work outside the scope of this License or after its termination shall be subject to the requirements and penalties of copyright or patent law in the appropriate jurisdiction. This section shall survive the termination of this License. + +12) Attorneys' Fees. In any action to enforce the terms of this License or seeking damages relating thereto, the prevailing party shall be entitled to recover its costs and expenses, including, without limitation, reasonable attorneys' fees and costs incurred in connection with such action, including any appeal of such action. This section shall survive the termination of this License. + +13) Miscellaneous. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it enforceable. + +14) Definition of "You" in This License. "You" throughout this License, whether in upper or lower case, means an individual or a legal entity exercising rights under, and complying with all of the terms of, this License. For legal entities, "You" includes any entity that controls, is controlled by, or is under common control with you. For purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. + +15) Right to Use. You may use the Original Work in all ways not otherwise restricted or conditioned by this License or by law, and Licensor promises not to interfere with or be responsible for such uses by You. + +16) Modification of This License. This License is Copyright (c) 2005 Lawrence Rosen. Permission is granted to copy, distribute, or communicate this License without modification. Nothing in this License permits You to modify this License as applied to the Original Work or to Derivative Works. However, You may modify the text of this License and copy, distribute or communicate your modified version (the "Modified License") and apply it to other original works of authorship subject to the following conditions: (i) You may not indicate in any way that your Modified License is the "Open Software License" or "OSL" and you may not use those names in the name of your Modified License; (ii) You must replace the notice specified in the first paragraph above with the notice "Licensed under " or with a notice of your own that is not confusingly similar to the notice in this License; and (iii) You may not claim that your original works are open source software unless your Modified License has been approved by Open Source Initiative (OSI) and You comply with its license review and certification process. diff --git a/README.md b/README.md index 7b6e0f8..d8011c3 100644 --- a/README.md +++ b/README.md @@ -11,10 +11,13 @@ And why it's called clib? Because it's a better**CLib**rary. But, despite the na ## Most of clib's C++ STL features are PRE C++11 I consider those features to be most essential. C++11 features will probably come after base features. Same for later C++ versions. +## C STL +This library includes all (almost?) "aliases" to `core.stdc.*` modules in respective `clib.*` modules, some of which contain their own code (i.e `clib.string`). + ## C++ STL implementation list - [ ] algorithm - [ ] complex -- [-] exception (partially implemented, but more as release-compatible asserts) +- [x] exception (partially implemented, but more as release-compatible asserts) - [ ] fstream - [ ] functional - [ ] iomanip @@ -25,7 +28,7 @@ I consider those features to be most essential. C++11 features will probably com - [ ] iterator - [ ] limits - [ ] locale -- [-] memory (partially implemented, has Mallocator, `_new` and `_free`) +- [x] memory (partially implemented, has Mallocator, `_new` and `_free`) - [ ] numeric - [ ] ostream - [ ] sstream @@ -40,19 +43,19 @@ I consider those features to be most essential. C++11 features will probably com - [x] optional ## C++ containers implementation -- [-] deque (do not plan to implement it, not sure how to be completely honest, PR's are welcome though) +- [x] deque (do not plan to implement it, not sure how to be completely honest, PR's are welcome though) - [ ] list - [ ] map - [x] queue - [x] set - [x] stack - [x] string (technically is an alias to `vector!char` with static if shenanigans. WIP) -- [-] valarray (same as deque) +- [x] valarray (same as deque) - [x] vector # Custom modules -- [-] format (exists in C++20 specs, but my version currently is for emulating c's format function) -- [-] conv (just your normal type conversion) +- [x] format (exists in C++20 specs, but my version currently is for emulating c's format function) +- [ ] conv (just your normal type conversion) ## On classes D's keyword `new` can't be used with noGC and to "fix" that there's two functions: `_new` and `_free` in `clib.memory` which can be used to create classes with noGC. diff --git a/REUSE.toml b/REUSE.toml new file mode 100644 index 0000000..55c799e --- /dev/null +++ b/REUSE.toml @@ -0,0 +1,20 @@ +version = 1 + +[[annotations]] +path = ["test/**", "readme/**"] +precedence = "aggregate" +SPDX-FileCopyrightText = "(C) 2024 Alisa Lain " +SPDX-License-Identifier = "OSL-3.0" + +[[annotations]] +path = [".github/**", "dub.sdl", ".dub/**", ".gitignore", ".pre-commit-config.yaml", "dscanner.ini"] +precedence = "aggregate" +SPDX-FileCopyrightText = "(C) 2024 Alisa Lain " +SPDX-License-Identifier = "CC0-1.0" + +[[annotations]] +path = [".todo.md", "AUTHORS.md", "CHANGEDLOG.md", "CONTRIBUTING.md", "README.md", "justfile", "REUSE.toml"] +precedence = "aggregate" +SPDX-FileCopyrightText = "(C) 2024 Alisa Lain " +SPDX-License-Identifier = "CC0-1.0" + diff --git a/src/clib/assert_.d b/src/clib/assert_.d new file mode 100644 index 0000000..11da7a2 --- /dev/null +++ b/src/clib/assert_.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.assert_; + +public import core.stdc.assert_; diff --git a/src/clib/complex.d b/src/clib/complex.d new file mode 100644 index 0000000..1743e53 --- /dev/null +++ b/src/clib/complex.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.complex; + +public import core.stdc.complex; diff --git a/src/clib/ctype.d b/src/clib/ctype.d new file mode 100644 index 0000000..a893d8b --- /dev/null +++ b/src/clib/ctype.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.ctype; + +public import core.stdc.ctype; diff --git a/src/clib/errno.d b/src/clib/errno.d new file mode 100644 index 0000000..be709b5 --- /dev/null +++ b/src/clib/errno.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.errno; + +public import core.stdc.errno; diff --git a/src/clib/exception.d b/src/clib/exception.d index 0cdb79b..3c2c51d 100644 --- a/src/clib/exception.d +++ b/src/clib/exception.d @@ -1,5 +1,5 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /++ Exceptions and exception accessories (not really) @@ -12,8 +12,8 @@ without knowing where they coming from +/ module clib.exception; -import core.stdc.stdlib: exit, EXIT_FAILURE; -import core.stdc.stdio: stderr, fprintf; +import clib.stdlib: exit, EXIT_FAILURE; +import clib.stdio: stderr, fprintf; import clib.memory; import clib.format; @@ -70,10 +70,10 @@ Params: release = Should free message? (to shush valgrind) +/ void _throw(E: exception)(E e) @nogc nothrow { - if (__isCatchingException) { - if (__caughtException is null) { - __caughtException = cast(exception) cast(void*) e; - __caughtException.type = e.what; + if (__is_catching_exception) { + if (__caught_exception is null) { + __caught_exception = cast(exception) cast(void*) e; + __caught_exception.type = e.what; } return; } @@ -122,38 +122,38 @@ _try(() { })._finally(); --- +/ -TryCatchBlock _try(void delegate() @nogc nothrow tryBlock) @nogc nothrow { - if (tryBlock is null) return TryCatchBlock(); - __isCatchingException = true; - tryBlock(); - __isCatchingException = false; - TryCatchBlock b = { __caughtException }; - __caughtException = null; +TryCatchBlock _try(void delegate() @nogc nothrow try_block) @nogc nothrow { + if (try_block is null) return TryCatchBlock(); + __is_catching_exception = true; + try_block(); + __is_catching_exception = false; + TryCatchBlock b = { __caught_exception }; + __caught_exception = null; return b; } /// Ditto -TryCatchBlock _catch(E: exception)(TryCatchBlock b, void delegate(E) @nogc nothrow catchBlock) @nogc nothrow { - if (b.e is null || b.handled == true || catchBlock is null) return b; - import core.stdc.stdio; +TryCatchBlock _catch(E: exception)(TryCatchBlock b, void delegate(E) @nogc nothrow catch_block) @nogc nothrow { + if (b.e is null || b.handled == true || catch_block is null) return b; + import clib.stdio; if (E.what == "Exception" || E.what == b.e.type) { - catchBlock(cast(E) cast(void*) b.e); + catch_block(cast(E) cast(void*) b.e); b.handled = true; } return b; } /// Ditto -void _finally()(TryCatchBlock b, void delegate() @nogc nothrow finallyBlock = null) @nogc nothrow { +void _finally()(TryCatchBlock b, void delegate() @nogc nothrow finally_block = null) @nogc nothrow { if (b.e !is null) { if (b.handled == false) _throw!(exception)(b.e); - if (finallyBlock !is null) finallyBlock(); + if (finally_block !is null) finally_block(); _free(b.e); } } -private __gshared bool __isCatchingException = false; -private __gshared exception __caughtException = null; +private __gshared bool __is_catching_exception = false; +private __gshared exception __caught_exception = null; private struct TryCatchBlock { private exception e = null; @@ -168,24 +168,24 @@ private struct TryCatchBlock { private int line; private bool lfset = false; this(char* p_msg = null) @nogc nothrow { msg = p_msg; } - ~this() @nogc nothrow { import core.stdc.stdlib; free(msg); } + ~this() @nogc nothrow { import clib.stdlib; free(msg); } } -class logic_error: exception { mixin exctor!("Logic Error"); } -class invalid_argument: logic_error { mixin exctor!("Invalid Argument"); } -class out_of_bounds: logic_error { mixin exctor!("Out of Bounds"); } +class logic_error: exception { mixin EXCTOR!("Logic Error"); } +class invalid_argument: logic_error { mixin EXCTOR!("Invalid Argument"); } +class out_of_bounds: logic_error { mixin EXCTOR!("Out of Bounds"); } -class runtime_error: exception { mixin exctor!("Runtime Error"); } -class overflow_error: runtime_error { mixin exctor!("Overflow Error"); } -class underflow_error: runtime_error { mixin exctor!("Underflow Error"); } +class runtime_error: exception { mixin EXCTOR!("Runtime Error"); } +class overflow_error: runtime_error { mixin EXCTOR!("Overflow Error"); } +class underflow_error: runtime_error { mixin EXCTOR!("Underflow Error"); } -class bad_alloc: exception { mixin exctor!("Bad Memory Allocation"); } +class bad_alloc: exception { mixin EXCTOR!("Bad Memory Allocation"); } -class bad_cast: exception { mixin exctor!("Bad Cast"); } +class bad_cast: exception { mixin EXCTOR!("Bad Cast"); } -class bad_typeid: exception { mixin exctor!("Bad TypeID"); } +class bad_typeid: exception { mixin EXCTOR!("Bad TypeID"); } -private mixin template exctor(string p_what) { +private mixin template EXCTOR(string p_what) { this(char* p_msg = null) @nogc nothrow { super(p_msg); } static const string what = p_what; } diff --git a/src/clib/fenv.d b/src/clib/fenv.d new file mode 100644 index 0000000..7d29086 --- /dev/null +++ b/src/clib/fenv.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.fenv; + +public import core.stdc.fenv; diff --git a/src/clib/float_.d b/src/clib/float_.d new file mode 100644 index 0000000..b1a4a3a --- /dev/null +++ b/src/clib/float_.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.float_; + +public import core.stdc.float_; diff --git a/src/clib/format.d b/src/clib/format.d index 2b32abb..9d199fb 100644 --- a/src/clib/format.d +++ b/src/clib/format.d @@ -1,11 +1,11 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /// NoGC compatible format module clib.format; -import core.stdc.stdio: snprintf; -import core.stdc.stdlib: malloc; +import clib.stdio: snprintf; +import clib.stdlib: malloc; import clib.string; diff --git a/src/clib/inttypes.d b/src/clib/inttypes.d new file mode 100644 index 0000000..249e1ca --- /dev/null +++ b/src/clib/inttypes.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.inttypes; + +public import core.stdc.inttypes; diff --git a/src/clib/iterator.d b/src/clib/iterator.d index bf0c04b..3260f2b 100644 --- a/src/clib/iterator.d +++ b/src/clib/iterator.d @@ -1,12 +1,12 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /// Iterator/Range for internal use module clib.iterator; import clib.traits; -struct forward_iterator(I, T) if (isValidIterable!I) { +struct forward_iterator(I, T) if (IS_VALID_ITERABLE!I) { private I iterable; private size_t size = 0; private size_t index = 0; @@ -22,7 +22,7 @@ struct forward_iterator(I, T) if (isValidIterable!I) { void popFront() @nogc nothrow { ++index; } } -struct backward_iterator(I, T) if (isValidIterable!I) { +struct backward_iterator(I, T) if (IS_VALID_ITERABLE!I) { private I iterable; private size_t size = 0; private size_t index = 0; @@ -38,8 +38,8 @@ struct backward_iterator(I, T) if (isValidIterable!I) { void popBack() @nogc nothrow { ++index; } } -private bool isValidIterable(T)() @nogc nothrow { - static if (isArray!T) { +private bool IS_VALID_ITERABLE(T)() @nogc nothrow { + static if (IS_ARRAY!T) { return true; } else { return __traits(hasMember, T, "opIndex"); diff --git a/src/clib/limits.d b/src/clib/limits.d new file mode 100644 index 0000000..77b2f0e --- /dev/null +++ b/src/clib/limits.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.limits; + +public import core.stdc.limits; diff --git a/src/clib/list.d b/src/clib/list.d index 82002ae..0827f7b 100644 --- a/src/clib/list.d +++ b/src/clib/list.d @@ -1,5 +1,5 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /// NoGC compatible double ended container module clib.list; @@ -20,7 +20,7 @@ struct list(T, A: IAllocator!T = allocator!T) { private Node* _root = null; private Node* _end = null; private size_t _size = 0; - private size_t _sizeLimit = -1; + private size_t _size_limit = -1; private A _allocator = null; /// Length of list @@ -53,20 +53,20 @@ struct list(T, A: IAllocator!T = allocator!T) { /// Creates list filled with vals this(T[] vals...) @nogc nothrow { _allocator = _new!A(); - pushBack(vals); + push_back(vals); } // Copy ctor (slow) this(ref scope list!(T, A) other) @nogc nothrow { for (int i = 0; i < other.size; ++i) { - pushBack(other[i]); + push_back(other[i]); } - _sizeLimit = other._sizeLimit; + _size_limit = other._size_limit; _size = other._size; } ~this() @nogc nothrow { - while (_size > 0) popFront(); + while (_size > 0) pop_front(); _free(_allocator); } @@ -74,22 +74,22 @@ struct list(T, A: IAllocator!T = allocator!T) { scope list!(T, A) clone() @nogc nothrow { list!(T, A) l; for (int i = 0; i < _size; ++i) { - l.pushBack(getNodeAt(i).value); + l.push_back(get_node_at(i).value); } - l._sizeLimit = _sizeLimit; + l._size_limit = _size_limit; l._size = _size; return l; } /// Returns true if has element (slow) bool has(T val) @nogc nothrow { - for (int i = 0; i < _size; ++i) if (val == getNodeAt(i).value) return true; + for (int i = 0; i < _size; ++i) if (val == get_node_at(i).value) return true; return false; } /// Returns index of value or -1 (size_t.max == -1) (slow) size_t find(T val) @nogc nothrow { - for (int i = 0; i < _size; ++i) if (val == getNodeAt(i).value) return i; + for (int i = 0; i < _size; ++i) if (val == get_node_at(i).value) return i; return -1; } @@ -97,17 +97,17 @@ struct list(T, A: IAllocator!T = allocator!T) { size_t opDollar() @nogc nothrow const { return _size; } void opOpAssign(string op: "~")( in T b ) @nogc nothrow { - pushBack(b); + push_back(b); } void opOpAssign(string op: "~")( in T[] b ) @nogc nothrow { - pushBack(b); + push_back(b); } /// Ditto void opIndexAssign(T val, size_t index) @nogc nothrow { if (index >= _size || _size == 0) return; - Node* n = getNodeAt(index); + Node* n = get_node_at(index); import std.format: format; if (n != null) (*n).value = val; } @@ -115,7 +115,7 @@ struct list(T, A: IAllocator!T = allocator!T) { /// Returns element of vector or T.init T opIndex(size_t index) @nogc nothrow { if (index >= _size || _size == 0) return T.init; - Node* n = getNodeAt(index); + Node* n = get_node_at(index); if (n == null) return T.init; return (*n).value; } @@ -124,9 +124,9 @@ struct list(T, A: IAllocator!T = allocator!T) { /// If `pos >= size` then it will do nothing void erase(size_t index) @nogc nothrow { if (index >= _size || _size == 0) return; - if (index == 0) { popFront(); return; } - if (index == _size - 1) { popBack(); return; } - Node* n = getNodeAt(index); + if (index == 0) { pop_front(); return; } + if (index == _size - 1) { pop_back(); return; } + Node* n = get_node_at(index); if (n == null) return; Node* p = (*n).prev; Node* x = (*n).next; @@ -144,12 +144,12 @@ struct list(T, A: IAllocator!T = allocator!T) { if (p_end == p_start) { erase(p_start); return; } if (p_end >= _size - 1) p_end = _size - 1; if (p_start == 0 && p_end == _size - 1) { - while (_size > 0) popFront(); + while (_size > 0) pop_front(); return; } size_t diff = p_end - p_start + 1; - Node* n = getNodeAt(p_start); + Node* n = get_node_at(p_start); if (n == null) return; Node* ns = (*n).prev; for (size_t i = 0; i < diff; ++i) { @@ -184,10 +184,10 @@ struct list(T, A: IAllocator!T = allocator!T) { /// Inserts value into vector at `p_pos` void insert(size_t pos, T val) @nogc nothrow { - if (_size == 0) pushBack(val); - if (pos == 0) { pushFront(val); return; } - if (pos >= _size) { pushBack(val); return; } - Node* n = getNodeAt(pos - 1); + if (_size == 0) push_back(val); + if (pos == 0) { push_front(val); return; } + if (pos >= _size) { push_back(val); return; } + Node* n = get_node_at(pos - 1); if (n == null) return; Node* x = (*n).next; Node* v = cast(Node*) _allocator.allocate_vptr(Node.sizeof); @@ -199,13 +199,13 @@ struct list(T, A: IAllocator!T = allocator!T) { } /// Adds vals at end of list (last val becomes back) - void pushBack(T[] vals...) @nogc nothrow { + void push_back(T[] vals...) @nogc nothrow { if (_allocator is null) _allocator = _new!A(); if (vals.length == 0) return; - if (_size >= _sizeLimit) return; + if (_size >= _size_limit) return; int i = 0; - if (_root == null && _size < _sizeLimit) { + if (_root == null && _size < _size_limit) { Node* ptr = cast(Node*) _allocator.allocate_vptr(Node.sizeof); (*ptr).value = vals[i]; (*ptr).next = null; @@ -217,7 +217,7 @@ struct list(T, A: IAllocator!T = allocator!T) { } for (;i < vals.length; ++i) { - if (_size >= _sizeLimit) break; + if (_size >= _size_limit) break; Node* ptr = cast(Node*) _allocator.allocate_vptr(Node.sizeof); (*ptr).value = vals[i]; (*ptr).next = null; @@ -229,13 +229,13 @@ struct list(T, A: IAllocator!T = allocator!T) { } /// Adds vals at start of list (last val becomes front) - void pushFront(T[] vals...) @nogc nothrow { + void push_front(T[] vals...) @nogc nothrow { if (_allocator is null) _allocator = _new!A(); if (vals.length == 0) return; - if (_size >= _sizeLimit) return; + if (_size >= _size_limit) return; int i = 0; - if (_root == null && _size < _sizeLimit) { + if (_root == null && _size < _size_limit) { Node* ptr = cast(Node*) _allocator.allocate_vptr(Node.sizeof); (*ptr).value = vals[i]; (*ptr).next = null; @@ -247,7 +247,7 @@ struct list(T, A: IAllocator!T = allocator!T) { } for (;i < vals.length; ++i) { - if (_size >= _sizeLimit) break; + if (_size >= _size_limit) break; Node* ptr = cast(Node*) _allocator.allocate_vptr(Node.sizeof); (*ptr).value = vals[i]; (*ptr).next = _root; @@ -259,7 +259,7 @@ struct list(T, A: IAllocator!T = allocator!T) { } /// Returns first value and removes it from list or returns T.init if empty - T popFront() @nogc nothrow { + T pop_front() @nogc nothrow { if (_root == null) { return T.init; } T val = (*_root).value; --_size; @@ -277,7 +277,7 @@ struct list(T, A: IAllocator!T = allocator!T) { } /// Returns first value and removes it from list or returns T.init if empty - T popBack() @nogc nothrow { + T pop_back() @nogc nothrow { if (_end == null) { return T.init; } T val = (*_end).value; --_size; @@ -299,10 +299,10 @@ struct list(T, A: IAllocator!T = allocator!T) { If length is limited and new element is attempted to be pushed when list is overfilled nothing will happen. +/ - void limitLength(size_t len) @nogc nothrow { + void limit_length(size_t len) @nogc nothrow { if (_root == null) return; if (len == 0) { - while (_size > 0) popFront(); + while (_size > 0) pop_front(); return; } if (len >= _size) return; @@ -323,12 +323,12 @@ struct list(T, A: IAllocator!T = allocator!T) { } } _size = len; - _sizeLimit = len; + _size_limit = len; } /// Removes all elements from list void clear() @nogc nothrow { - while (_size > 0) popFront(); + while (_size > 0) pop_front(); _root = null; _end = null; _size = 0; @@ -349,7 +349,7 @@ struct list(T, A: IAllocator!T = allocator!T) { return arr; } - private Node* getNodeAt(size_t pos) @nogc nothrow { + private Node* get_node_at(size_t pos) @nogc nothrow { if (_size == 0 || _root == null) return null; if (pos >= _size - 1) return _end; if (pos == 0) return _root; @@ -385,8 +385,8 @@ unittest { assert(q.size == 4); assert(q.front == 1); assert(q.back == 4); - assert(q.popFront() == 1); - assert(q.popBack() == 4); + assert(q.pop_front() == 1); + assert(q.pop_back() == 4); assert(q.front == 2); assert(q.back == 3); assert(q.size == 2); @@ -398,11 +398,11 @@ unittest { assert(q.empty); assert(q.front == int.init); assert(q.back == int.init); - q.pushFront(3, 2, 1); + q.push_front(3, 2, 1); assert(q.front == 1); assert(q.back == 3); q ~= 3; - q.pushBack(2); + q.push_back(2); assert(q.front == 1); assert(q.array == [1, 2, 3, 3, 2]); } @@ -411,14 +411,14 @@ unittest { list!int q = list!int(1, 2, 3, 4); q.clear(); assert(q.size == 0); - assert(q.popFront() == int.init); - assert(q.popBack() == int.init); + assert(q.pop_front() == int.init); + assert(q.pop_back() == int.init); } unittest { list!int q = list!int(1, 2, 3, 4); - q.pushBack(5, 6, 7, 8, 9, 10); - q.limitLength(7); + q.push_back(5, 6, 7, 8, 9, 10); + q.limit_length(7); assert(q.size == 7); assert(q.array == [1, 2, 3, 4, 5, 6, 7]); } diff --git a/src/clib/locale.d b/src/clib/locale.d new file mode 100644 index 0000000..a7aedf5 --- /dev/null +++ b/src/clib/locale.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.locale; + +public import core.stdc.locale; diff --git a/src/clib/map.d b/src/clib/map.d index aab2fd6..f1b51ea 100644 --- a/src/clib/map.d +++ b/src/clib/map.d @@ -1,13 +1,13 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /++ noGC compatible associative array. +/ module clib.map; -// import core.stdc.stdlib: free, malloc, calloc, realloc; -import core.stdc.string: memcpy; +// import clib.stdlib: free, malloc, calloc, realloc; +import clib.string: memcpy; import clib.memory; @@ -23,12 +23,12 @@ struct map(K, V, A: IAllocator!V = allocator!V) { A _allocator; void insert(K key, V value) @nogc nothrow { - if (root is null) { root = allocNode(); } + if (root is null) { root = alloc_node(); } - insertImpl(root, pair, null); + insert_impl(root, pair, null); } - private Node* insertImpl(Node* root, Pair pair, Node* parent) { + private Node* insert_impl(Node* root, Pair pair, Node* parent) { // Root is empty can safely insert if (root.filled == 0) { root.filled = 1; @@ -36,7 +36,7 @@ struct map(K, V, A: IAllocator!V = allocator!V) { return root; } - if (root.isLeaf) { + if (root.is_leaf) { // Root is leaf, have to explore in // Check if any pairs are already there for (size_t i = 0; i < root.filled; ++i) { @@ -50,7 +50,7 @@ struct map(K, V, A: IAllocator!V = allocator!V) { for (i = 0; i < root.filled; ++i) { if (root.pairs[i].key > pair.key) { // found leaf - insertImpl(root.children[i], pair, root); + insert_impl(root.children[i], pair, root); // TODO: what to do if fails } } @@ -84,8 +84,8 @@ struct map(K, V, A: IAllocator!V = allocator!V) { } // Root is full - Node* left = allocNode(); - Node* right = allocNode(); + Node* left = alloc_node(); + Node* right = alloc_node(); const size_t split = (Node.N - 1) / 2; // TODO: move leafs LR // 0 .. N-1 / 2 go left @@ -107,7 +107,7 @@ struct map(K, V, A: IAllocator!V = allocator!V) { root.children[0] = left; root.children[1] = right; root.filled = 1; - root.isLeaf = true; + root.is_leaf = true; // TODO: insert pair into either left or right } else { if (parent.filled == Node.N - 1) { @@ -116,10 +116,10 @@ struct map(K, V, A: IAllocator!V = allocator!V) { root.children[0] = left; root.children[1] = right; root.filled = 1; - root.isLeaf = true; + root.is_leaf = true; // TODO: same } else { - Node* n = allocNode(); + Node* n = alloc_node(); // TODO: insert into parent and rearrange leafs } } @@ -137,7 +137,7 @@ struct map(K, V, A: IAllocator!V = allocator!V) { // if (_tree.root is null) return T.init; } - private Node* allocNode() @nogc nothrow { + private Node* alloc_node() @nogc nothrow { if (_allocator is null) _allocator = _new!A(); return cast(Node*) _allocator.allocate_vptr(Node.sizeof); } @@ -151,7 +151,7 @@ private struct TreeNode(K, V) { TreeNode!(K, V)* parent = null; TreeNode!(K, V)*[N] children = null; - bool isLeaf = false; + bool is_leaf = false; size_t filled; void free(A: IAllocator!T, T)(A alloc) @nogc nothrow { diff --git a/src/clib/math/package.d b/src/clib/math/package.d index 0ad43e3..3995362 100644 --- a/src/clib/math/package.d +++ b/src/clib/math/package.d @@ -1,5 +1,5 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /++ NoGC math @@ -10,4 +10,5 @@ module clib.math; // TODO: implement +public import core.stdc.math; public import clib.math.traits; diff --git a/src/clib/math/traits.d b/src/clib/math/traits.d index ae71010..d3696a2 100644 --- a/src/clib/math/traits.d +++ b/src/clib/math/traits.d @@ -1,13 +1,13 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /// Math traits module clib.math.traits; -import clib.traits : isFloatingPoint, isIntegral, isNumeric, isSigned; +import clib.traits : IS_FLOATING_POINT; /// Determines if X is NaN -bool isNaN(X)(X x) @nogc @trusted pure nothrow if (isFloatingPoint!(X)) { +bool is_nan(X)(X x) @nogc @trusted pure nothrow if (IS_FLOATING_POINT!(X)) { return x != x; } diff --git a/src/clib/memory.d b/src/clib/memory.d index a4ef855..a380f20 100644 --- a/src/clib/memory.d +++ b/src/clib/memory.d @@ -1,12 +1,12 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /++ Utilities for memory management +/ module clib.memory; -import core.stdc.stdlib: malloc, realloc, free; +import clib.stdlib: malloc, realloc, free; /++ Used to allocate/deallocate memory for classes @@ -32,7 +32,7 @@ T _new(T, Args...)(auto ref Args args) @nogc nothrow { import core.memory : pureMalloc; auto _t = cast(T) pureMalloc(tsize); if (_t is null) return null; - import core.stdc.string : memcpy; + import clib.string : memcpy; // Copies initial state of T (initSymbol -> const(void)[]) into _t memcpy(cast(void*) _t, __traits(initSymbol, T).ptr, tsize); return _t; @@ -59,7 +59,7 @@ void _free(T)(ref T t) @nogc nothrow { alias allocator = Mallocator; /// Unmanaged allocator (a wrapper over malloc) -class Mallocator(T): IAllocator!T if (isValidAlloccatorType!T()) { +class Mallocator(T): IAllocator!T if (IS_VALID_ALLOCATOR_TYPE!T()) { /// Allocator has no state this() @nogc nothrow {} @@ -112,7 +112,7 @@ interface IAllocator(T) { void deallocate_vptr(void* ptr) @nogc nothrow; } -private bool isValidAlloccatorType(T)() @nogc nothrow { +private bool IS_VALID_ALLOCATOR_TYPE(T)() @nogc nothrow { return !is(T == const) && !is(T == immutable); } diff --git a/src/clib/optional.d b/src/clib/optional.d index e6aad08..b9e57d5 100644 --- a/src/clib/optional.d +++ b/src/clib/optional.d @@ -1,5 +1,5 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /++ Simple alternative to std.typecons: Nullable @@ -15,33 +15,33 @@ p[0] = 1; // SEGFAULT +/ module clib.optional; -import core.stdc.stddef: nullptr_t; +import clib.stddef: nullptr_t; /// Optional type struct optional(T) { private T _value; - private bool _hasValue = false; + private bool _has_value = false; /// Returns true if value is set - @property bool hasValue() @nogc nothrow { return _hasValue; } + @property bool has_value() @nogc nothrow { return _has_value; } /// Returns value @property T value() @nogc nothrow { return _value; } /// Returns value or T val - T valueOr(T val) @nogc nothrow { return _hasValue ? _value : val; } + T valueOr(T val) @nogc nothrow { return _has_value ? _value : val; } /// Constructs optional as null this(nullptr_t _null) @nogc nothrow {} /// Constructs optional as value this(T p_val) @nogc nothrow { _value = p_val; - _hasValue = true; + _has_value = true; } /// Constructs optional from other optional this(ref scope optional!T p_other) @nogc nothrow { _value = p_other._value; - _hasValue = p_other._hasValue; + _has_value = p_other._has_value; } ~this() @nogc nothrow { @@ -52,43 +52,43 @@ struct optional(T) { scope optional!T clone() @nogc nothrow { optional!T o; o._value = _value; - o._hasValue = _hasValue; + o._has_value = _has_value; return o; } void opAssign(T val) @nogc nothrow { destroy!true(_value); _value = val; - _hasValue = true; + _has_value = true; } void opAssign(nullptr_t _null) @nogc nothrow { destroy!true(_value); - _hasValue = false; + _has_value = false; } void opAssign(optional!T other) @nogc nothrow { destroy!true(_value); _value = other._value; - _hasValue = other._hasValue; + _has_value = other._has_value; } bool opEquals(const T other) const @nogc nothrow { - return _hasValue ? (_value == other) : false; + return _has_value ? (_value == other) : false; } bool opEquals(const nullptr_t _null) const @nogc nothrow { - return !_hasValue; + return !_has_value; } bool opEquals(ref const optional!T other) const @nogc nothrow { - if (!other._hasValue && !_hasValue) return true; - if (other._hasValue != _hasValue) return false; + if (!other._has_value && !_has_value) return true; + if (other._has_value != _has_value) return false; return other._value == _value; } size_t toHash() const @nogc nothrow { - if (!_hasValue) return 0; + if (!_has_value) return 0; static if (__traits(hasMember, T, "toHash")) { return _value.toHash(); } else { @@ -99,17 +99,17 @@ struct optional(T) { /// Exchanges contents void swap(ref optional!T other) @nogc nothrow { T val = _value; - bool has = _hasValue; + bool has = _has_value; _value = other._value; - _hasValue = other._hasValue; + _has_value = other._has_value; other._value = val; - other._hasValue = has; + other._has_value = has; } /// Destroys contained value void reset() @nogc nothrow { destroy!true(_value); - _hasValue = false; + _has_value = false; } } @@ -118,10 +118,10 @@ struct optional(T) { unittest { optional!int opt; - assert(opt.hasValue == false); + assert(opt.has_value == false); assert(opt.valueOr(5) == 5); opt = 1; - assert(opt.hasValue == true); + assert(opt.has_value == true); assert(opt.value == 1); } @@ -129,7 +129,7 @@ unittest { optional!int opt; opt = 2; opt = null; - assert(opt.hasValue == false); + assert(opt.has_value == false); assert(opt.valueOr(5) == 5); opt = optional!int(3); assert(opt == 3); @@ -153,25 +153,25 @@ unittest { optional!(vector!int) a; vector!int v = vector!int(1, 2, 3, 4); a = v; - assert(a.hasValue); + assert(a.has_value); assert(a.value == [1, 2, 3, 4]); optional!(vector!int) b; b = a; - assert(a.hasValue); + assert(a.has_value); assert(a.value == [1, 2, 3, 4]); - assert(b.hasValue); + assert(b.has_value); assert(b.value == [1, 2, 3, 4]); assert(a == b); - import core.stdc.stdlib; + import clib.stdlib; void test1(optional!(vector!int) o) { free(o.value.release()); } void test2(vector!int v) { free(v.release()); } test1(a); test2(a.value); - assert(a.hasValue); + assert(a.has_value); assert(a.value == [1, 2, 3, 4]); - assert(b.hasValue); + assert(b.has_value); assert(b.value == [1, 2, 3, 4]); assert(a == b); } diff --git a/src/clib/package.d b/src/clib/package.d index ee16f67..bd87c25 100644 --- a/src/clib/package.d +++ b/src/clib/package.d @@ -1,18 +1,16 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 module clib; // Interesting article indeed // LINK: https://www.auburnsounds.com/blog/2016-11-10_Running-D-without-its-runtime.html -// C++ STL public import // clib.algorithm, // clib.bitset, // clib.complex, // clib.deque, // nope - clib.exception, // clib.fstream, // clib.functional, // clib.iomanip, @@ -21,32 +19,50 @@ public import // clib.iostream, // clib.iterator, // clib.limits, - clib.list, - // clib.locale, - clib.map, - clib.memory, // clib.numeric, - clib.optional, // clib.ostream, - clib.queue, - clib.set, // clib.sstream, - clib.stack, // clib.stdexcept, // clib.streambuf, - clib.string, // clib.strstream, - clib.typeinfo, // with custom version only // clib.utility, // clib.valarray, // nope - clib.vector - ; - -// Own additions to STL -public import + clib.assert_, + clib.complex, + clib.ctype, + clib.errno, + clib.exception, + clib.fenv, + clib.float_, clib.format, - clib.math - // clib.iterator // internal no public import + clib.inttypes, + // clib.iterator, // internal + clib.limits, + clib.list, + clib.locale, + clib.map, + clib.math, + clib.memory, + clib.optional, + clib.queue, + clib.set, + clib.signal, + clib.stack, + clib.stdarg, + clib.stdatomic, + clib.stddef, + clib.stdint, + clib.stdio, + clib.stdlib, + clib.string, + clib.tgmath, + clib.thread, + clib.time, + clib.traits, + clib.typeinfo, // with custom version only + clib.vector, + clib.wchar_, + clib.wctype ; diff --git a/src/clib/queue.d b/src/clib/queue.d index 153025a..2b22a6c 100644 --- a/src/clib/queue.d +++ b/src/clib/queue.d @@ -1,5 +1,5 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /// NoGC compatible FCFS container module clib.queue; @@ -18,7 +18,7 @@ struct queue(T, A: IAllocator!T = allocator!T) { private Node* _root = null; private Node* _end = null; private size_t _size = 0; - private size_t _sizeLimit = -1; + private size_t _size_limit = -1; private A _allocator = null; /// Length of queue @@ -46,7 +46,7 @@ struct queue(T, A: IAllocator!T = allocator!T) { n = n.next; } _size = other._size; - _sizeLimit = other._sizeLimit; + _size_limit = other._size_limit; } ~this() @nogc nothrow { @@ -62,7 +62,7 @@ struct queue(T, A: IAllocator!T = allocator!T) { n = n.next; } q._size = _size; - q._sizeLimit = _sizeLimit; + q._size_limit = _size_limit; return q; } @@ -75,10 +75,10 @@ struct queue(T, A: IAllocator!T = allocator!T) { void push(T[] vals...) @nogc nothrow { if (_allocator is null) _allocator = _new!A(); if (vals.length == 0) return; - if (_size >= _sizeLimit) return; + if (_size >= _size_limit) return; int i = 0; - if (_root == null && _size < _sizeLimit) { + if (_root == null && _size < _size_limit) { Node* ptr = cast(Node*) _allocator.allocate_vptr(Node.sizeof); (*ptr).value = vals[i]; (*ptr).next = null; @@ -89,7 +89,7 @@ struct queue(T, A: IAllocator!T = allocator!T) { } for (;i < vals.length; ++i) { - if (_size >= _sizeLimit) break; + if (_size >= _size_limit) break; Node* ptr = cast(Node*) _allocator.allocate_vptr(Node.sizeof); (*ptr).value = vals[i]; (*ptr).next = null; @@ -121,7 +121,7 @@ struct queue(T, A: IAllocator!T = allocator!T) { If length is limited and new element is attempted to be pushed when Queue is overfilled nothing will happen. +/ - void limitLength(size_t len) @nogc nothrow { + void limit_length(size_t len) @nogc nothrow { if (_root == null) return; if (len == 0) { while (_size > 0) pop(); @@ -145,7 +145,7 @@ struct queue(T, A: IAllocator!T = allocator!T) { } } _size = len; - _sizeLimit = len; + _size_limit = len; } /// Removes all elements from queue @@ -210,7 +210,7 @@ unittest { unittest { queue!int q = queue!int(1, 2, 3, 4); q.push(5, 6, 7, 8, 9, 10); - q.limitLength(7); + q.limit_length(7); assert(q.size == 7); assert(q.array == [1, 2, 3, 4, 5, 6, 7]); } diff --git a/src/clib/set.d b/src/clib/set.d index 65faebe..0f98dee 100644 --- a/src/clib/set.d +++ b/src/clib/set.d @@ -1,12 +1,12 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /++ noGC compatible associative container that contains a sorted set of unique objects +/ module clib.set; -import core.stdc.string: memcmp; +import clib.string: memcmp; import clib.memory; import clib.typeinfo; @@ -19,7 +19,7 @@ Default sorting algorithm is bubble sort. Prefer inserting values by bulk because it sorts after each `insert` call. ++/ -struct set(T, alias Compare = sortFunction, A: IAllocator!T = allocator!T) { +struct set(T, alias COMPARE = sort_function, A: IAllocator!T = allocator!T) { private T* _data = null; private A _allocator = null; @@ -96,13 +96,13 @@ struct set(T, alias Compare = sortFunction, A: IAllocator!T = allocator!T) { /// Inserts values into set if `!has(val)` void insert(T[] vals...) @nogc nothrow { for (size_t i = 0; i < vals.length; ++i) { - if (!has(vals[i])) insertOne(vals[i]); + if (!has(vals[i])) insert_one(vals[i]); } sort(); } /// Ditto - private void insertOne(T val) @nogc nothrow { + private void insert_one(T val) @nogc nothrow { if (_size >= _capacity) reserve(_capacity * 2 + 2); _data[_size] = val; ++_size; @@ -124,7 +124,7 @@ struct set(T, alias Compare = sortFunction, A: IAllocator!T = allocator!T) { for (size_t i = 0; i < _size - 1; ++i) { swapped = false; for (size_t j = 0; j < _size - i - 1; ++j) { - if (Compare(_data[j], _data[j + 1])) { + if (COMPARE(_data[j], _data[j + 1])) { T temp = _data[j]; _data[j] = data[j + 1]; _data[j + 1] = temp; @@ -182,7 +182,7 @@ struct set(T, alias Compare = sortFunction, A: IAllocator!T = allocator!T) { if (newData is null) return; if (_data !is null) { - freeData(); + free_data(); _allocator.deallocate(_data); } @@ -192,7 +192,7 @@ struct set(T, alias Compare = sortFunction, A: IAllocator!T = allocator!T) { void free() @nogc nothrow { if (_data !is null) { - freeData(); + free_data(); _allocator.deallocate(_data); } if (_allocator !is null) _allocator._free(); @@ -201,16 +201,16 @@ struct set(T, alias Compare = sortFunction, A: IAllocator!T = allocator!T) { _capacity = 0; } - private void freeData() @nogc nothrow { + private void free_data() @nogc nothrow { if (_data !is null) { for (size_t i = 0; i < _size; ++i) destroy!false(_data[i]); } } } -private bool sortFunction(T)(T a, T b) @nogc nothrow { +private bool sort_function(T)(T a, T b) @nogc nothrow { static if (is(T == char*)) { - import core.stdc.string: strcmp; + import clib.string: strcmp; return strcmp(a, b) > 0; } else { return a > b; @@ -276,7 +276,7 @@ unittest { cast(char*)"dcba".ptr, cast(char*)"remove".ptr ]; - import core.stdc.string: strcmp; + import clib.string: strcmp; assert(strcmp(s[0], cast(char*) "abcd".ptr) == 0); assert(strcmp(s[1], cast(char*) "add".ptr) == 0); } diff --git a/src/clib/signal.d b/src/clib/signal.d new file mode 100644 index 0000000..cc19116 --- /dev/null +++ b/src/clib/signal.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.signal; + +public import core.stdc.signal; diff --git a/src/clib/stack.d b/src/clib/stack.d index 810550a..e534781 100644 --- a/src/clib/stack.d +++ b/src/clib/stack.d @@ -1,5 +1,5 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /// NoGC compatible LCFS container module clib.stack; @@ -16,7 +16,7 @@ struct stack(T, A: IAllocator!T = allocator!T) { private Node* _root = null; private size_t _size = 0; - private size_t _sizeLimit = -1; + private size_t _size_limit = -1; private A _allocator = null; /// Length of stack @@ -50,7 +50,7 @@ struct stack(T, A: IAllocator!T = allocator!T) { } _allocator.deallocate(tmp); _size = other._size; - _sizeLimit = other._sizeLimit; + _size_limit = other._size_limit; } ~this() @nogc nothrow { @@ -72,7 +72,7 @@ struct stack(T, A: IAllocator!T = allocator!T) { } _allocator.deallocate(tmp); q._size = _size; - q._sizeLimit = _sizeLimit; + q._size_limit = _size_limit; return q; } @@ -86,10 +86,10 @@ struct stack(T, A: IAllocator!T = allocator!T) { void push(T[] vals...) @nogc nothrow { if (_allocator is null) _allocator = _new!A(); if (vals.length == 0) return; - if (_size >= _sizeLimit) return; + if (_size >= _size_limit) return; int i = 0; - if (_root == null && _size < _sizeLimit) { + if (_root == null && _size < _size_limit) { Node* ptr = cast(Node*) _allocator.allocate_vptr(Node.sizeof); (*ptr).value = vals[i]; (*ptr).next = null; @@ -99,7 +99,7 @@ struct stack(T, A: IAllocator!T = allocator!T) { } for (;i < vals.length; ++i) { - if (_size >= _sizeLimit) break; + if (_size >= _size_limit) break; Node* ptr = cast(Node*) _allocator.allocate_vptr(Node.sizeof); (*ptr).value = vals[i]; (*ptr).next = _root; @@ -129,7 +129,7 @@ struct stack(T, A: IAllocator!T = allocator!T) { If length is limited and new element is attempted to be pushed when Queue is overfilled nothing will happen. +/ - void limitLength(size_t len) @nogc nothrow { + void limit_length(size_t len) @nogc nothrow { if (_root == null) return; if (len == 0) { while (_size > 0) pop(); @@ -152,7 +152,7 @@ struct stack(T, A: IAllocator!T = allocator!T) { } } _size = len; - _sizeLimit = len; + _size_limit = len; } /// Removes all elements from stack @@ -216,7 +216,7 @@ unittest { unittest { stack!int q = stack!int(1, 2, 3, 4); q.push(5, 6, 7, 8, 9, 10); - q.limitLength(7); + q.limit_length(7); assert(q.size == 7); assert(q.array == [10, 9, 8, 7, 6, 5, 4]); } diff --git a/src/clib/stdarg.d b/src/clib/stdarg.d new file mode 100644 index 0000000..cca8a81 --- /dev/null +++ b/src/clib/stdarg.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.stdarg; + +public import core.stdc.stdarg; diff --git a/src/clib/stdatomic.d b/src/clib/stdatomic.d new file mode 100644 index 0000000..09d012c --- /dev/null +++ b/src/clib/stdatomic.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.stdatomic; + +public import core.stdc.stdatomic; diff --git a/src/clib/stddef.d b/src/clib/stddef.d new file mode 100644 index 0000000..5b69e5d --- /dev/null +++ b/src/clib/stddef.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.stddef; + +public import core.stdc.stddef; diff --git a/src/clib/stdint.d b/src/clib/stdint.d new file mode 100644 index 0000000..81dfa2a --- /dev/null +++ b/src/clib/stdint.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.stdint; + +public import core.stdc.stdint; diff --git a/src/clib/stdio.d b/src/clib/stdio.d new file mode 100644 index 0000000..0f764c9 --- /dev/null +++ b/src/clib/stdio.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.stdio; + +public import core.stdc.stdio; diff --git a/src/clib/stdlib.d b/src/clib/stdlib.d new file mode 100644 index 0000000..e47ad39 --- /dev/null +++ b/src/clib/stdlib.d @@ -0,0 +1,7 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.stdlib; + +public import core.stdc.stdlib; + diff --git a/src/clib/string.d b/src/clib/string.d index e85709e..899e12d 100644 --- a/src/clib/string.d +++ b/src/clib/string.d @@ -1,5 +1,5 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /++ noGC compatible string. @@ -9,6 +9,8 @@ that cstring needs (using static if) +/ module clib.string; +public import core.stdc.string; + import clib.vector; alias cstring = vector!char; diff --git a/src/clib/tgmath.d b/src/clib/tgmath.d new file mode 100644 index 0000000..44c1545 --- /dev/null +++ b/src/clib/tgmath.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.tgmath; + +public import core.stdc.tgmath; diff --git a/src/clib/thread.d b/src/clib/thread.d new file mode 100644 index 0000000..0768871 --- /dev/null +++ b/src/clib/thread.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.thread; + +public import core.thread; diff --git a/src/clib/time.d b/src/clib/time.d new file mode 100644 index 0000000..d0c290c --- /dev/null +++ b/src/clib/time.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.time; + +public import core.stdc.time; diff --git a/src/clib/traits.d b/src/clib/traits.d index e69dd42..e04619b 100644 --- a/src/clib/traits.d +++ b/src/clib/traits.d @@ -1,5 +1,5 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /++ NoGC traits @@ -13,12 +13,12 @@ However normally it's safe to use std.traits and std.meta with nogc +/ module clib.traits; -auto assume_nogc_nothrow(T)(T t) if (isFunctionPointer!T || isDelegate!T) { +auto assume_nogc_nothrow(T)(T t) if (IS_FUNCTION_POINTER!T || IS_DELEGATE!T) { import std.traits; - enum attrs = functionAttributes!T + enum attrs = FUNCTION_ATTRIBUTES!T | FunctionAttribute.nogc | FunctionAttribute.nothrow_; - return cast(SetFunctionAttributes!(T, functionLinkage!T, attrs)) t; + return cast(SET_FUNCTION_ATTRIBUTES!(T, iFUNCTION_LINKAGE!T, attrs)) t; } @nogc nothrow: @@ -26,7 +26,7 @@ auto assume_nogc_nothrow(T)(T t) if (isFunctionPointer!T || isDelegate!T) { /** * Detect whether `T` is a built-in boolean type or enum of boolean base type. */ -enum bool isBoolean(T) = __traits(isUnsigned, T) && is(T : bool); +enum bool IS_BOOLEAN(T) = __traits(isUnsigned, T) && is(T : bool); /** * Detect whether `T` is a built-in integral type. @@ -37,16 +37,16 @@ enum bool isBoolean(T) = __traits(isUnsigned, T) && is(T : bool); * Returns: * `true` if `T` is an integral type * Note: - * this is not the same as $(LINK2 https://dlang.org/spec/traits.html#isIntegral, `__traits(isIntegral)`) + * this is not the same as $(LINK2 https://dlang.org/spec/traits.html#IS_INTEGRAL, `__traits(IS_INTEGRAL)`) */ -template isIntegral(T) +template IS_INTEGRAL(T) { static if (!__traits(isIntegral, T)) - enum isIntegral = false; + enum IS_INTEGRAL = false; else static if (is(T U == enum)) - enum isIntegral = isIntegral!U; + enum IS_INTEGRAL = IS_INTEGRAL!U; else - enum isIntegral = __traits(isZeroInit, T) // Not char, wchar, or dchar. + enum IS_INTEGRAL = __traits(isZeroInit, T) // Not char, wchar, or dchar. && !is(immutable T == immutable bool) && !is(T == __vector); } @@ -56,22 +56,22 @@ template isIntegral(T) * See also: $(DDSUBLINK spec/traits, isFloating, `__traits(isFloating, T)`) */ // is(T : real) to discount complex types -enum bool isFloatingPoint(T) = __traits(isFloating, T) && is(T : real); +enum bool IS_FLOATING_POINT(T) = __traits(isFloating, T) && is(T : real); /** * Detect whether `T` is a built-in numeric type (integral or floating * point). */ -template isNumeric(T) +template IS_NUMERIC(T) { static if (!__traits(isArithmetic, T)) - enum isNumeric = false; + enum IS_NUMERIC = false; else static if (__traits(isFloating, T)) - enum isNumeric = is(T : real); // Not __vector, imaginary, or complex. + enum IS_NUMERIC = is(T : real); // Not __vector, imaginary, or complex. else static if (is(T U == enum)) - enum isNumeric = isNumeric!U; + enum IS_NUMERIC = IS_NUMERIC!U; else - enum isNumeric = __traits(isZeroInit, T) // Not char, wchar, or dchar. + enum IS_NUMERIC = __traits(isZeroInit, T) // Not char, wchar, or dchar. && !is(immutable T == immutable bool) && !is(T == __vector); } @@ -82,31 +82,31 @@ template isNumeric(T) * See also: $(DDSUBLINK spec/traits, isScalar, `__traits(isScalar, T)`) */ // is(T : real) to discount complex types -enum bool isScalarType(T) = __traits(isScalar, T) && is(T : real); +enum bool IS_SCALAR_TYPE(T) = __traits(isScalar, T) && is(T : real); /** * Detect whether `T` is a basic type (scalar type or void). */ -enum bool isBasicType(T) = isScalarType!T || is(immutable T == immutable void); +enum bool IS_BASIC_TYPE(T) = IS_SCALAR_TYPE!T || is(immutable T == immutable void); /** * Detect whether `T` is a built-in unsigned numeric type. */ -template isUnsigned(T) +template IS_UNSIGNED(T) { static if (!__traits(isUnsigned, T)) - enum isUnsigned = false; + enum IS_UNSIGNED = false; else static if (is(T U == enum)) - enum isUnsigned = isUnsigned!U; + enum IS_UNSIGNED = IS_UNSIGNED!U; else - enum isUnsigned = __traits(isZeroInit, T) // Not char, wchar, or dchar. + enum IS_UNSIGNED = __traits(isZeroInit, T) // Not char, wchar, or dchar. && !is(immutable T == immutable bool) && !is(T == __vector); } /** * Detect whether `T` is a built-in signed numeric type. */ -enum bool isSigned(T) = __traits(isArithmetic, T) && !__traits(isUnsigned, T) +enum bool IS_SIGNED(T) = __traits(isArithmetic, T) && !__traits(isUnsigned, T) && is(T : real); /** @@ -115,14 +115,14 @@ enum bool isSigned(T) = __traits(isArithmetic, T) && !__traits(isUnsigned, T) * The built-in char types are any of `char`, `wchar` or `dchar`, with * or without qualifiers. */ -template isSomeChar(T) +template IS_SOME_CHAR(T) { static if (!__traits(isUnsigned, T)) - enum isSomeChar = false; + enum IS_SOME_CHAR = false; else static if (is(T U == enum)) - enum isSomeChar = isSomeChar!U; + enum IS_SOME_CHAR = IS_SOME_CHAR!U; else - enum isSomeChar = !__traits(isZeroInit, T); + enum IS_SOME_CHAR = !__traits(isZeroInit, T); } /** @@ -134,7 +134,7 @@ The built-in string types are `Char[]`, where `Char` is any of `char`, Static arrays of characters (like `char[80]`) are not considered built-in string types. */ -enum bool isSomeString(T) = is(immutable T == immutable C[], C) && (is(C == char) || is(C == wchar) || is(C == dchar)); +enum bool IS_SOME_STRING(T) = is(immutable T == immutable C[], C) && (is(C == char) || is(C == wchar) || is(C == dchar)); /** * Detect whether type `T` is a narrow string. @@ -142,73 +142,73 @@ enum bool isSomeString(T) = is(immutable T == immutable C[], C) && (is(C == char * All arrays that use char, wchar, and their qualified versions are narrow * strings. (Those include string and wstring). */ -enum bool isNarrowString(T) = is(immutable T == immutable C[], C) && (is(C == char) || is(C == wchar)); +enum bool IS_NARROW_STRING(T) = is(immutable T == immutable C[], C) && (is(C == char) || is(C == wchar)); /** * Detects whether `T` is a comparable type. Basic types and structs and * classes that implement opCmp are ordering comparable. */ -enum bool isOrderingComparable(T) = is(typeof((ref T a) => a < a ? 1 : 0)); +enum bool IS_ORDERING_COMPARABLE(T) = is(typeof((ref T a) => a < a ? 1 : 0)); /// ditto -enum bool isEqualityComparable(T) = is(typeof((ref T a) => a == a ? 1 : 0)); +enum bool IS_EQUALITY_COMPARABLE(T) = is(typeof((ref T a) => a == a ? 1 : 0)); /** * Detect whether type `T` is a static array. * - * See also: $(DDSUBLINK spec/traits, isStaticArray, `__traits(isStaticArray, T)`) + * See also: $(DDSUBLINK spec/traits, IS_STATIC_ARRAY, `__traits(isStaticArray, T)`) */ -enum bool isStaticArray(T) = __traits(isStaticArray, T); +enum bool IS_STATIC_ARRAY(T) = __traits(isStaticArray, T); /** * Detect whether type `T` is a dynamic array. */ -template isDynamicArray(T) +template IS_DYNAMIC_ARRAY(T) { static if (is(T == U[], U)) - enum bool isDynamicArray = true; + enum bool IS_DYNAMIC_ARRAY = true; else static if (is(T U == enum)) - // BUG: isDynamicArray / isStaticArray considers enums + // BUG: IS_DYNAMIC_ARRAY / IS_STATIC_ARRAY considers enums // with appropriate base types as dynamic/static arrays // Retain old behaviour for now, see // https://github.com/dlang/phobos/pull/7574 - enum bool isDynamicArray = isDynamicArray!U; + enum bool IS_DYNAMIC_ARRAY = IS_DYNAMIC_ARRAY!U; else - enum bool isDynamicArray = false; + enum bool IS_DYNAMIC_ARRAY = false; } /** * Detect whether type `T` is an array (static or dynamic; for associative - * arrays see $(LREF isAssociativeArray)). + * arrays see $(LREF IS_ASSOCIATIVE_ARRAY)). */ -enum bool isArray(T) = isStaticArray!T || isDynamicArray!T; +enum bool IS_ARRAY(T) = IS_STATIC_ARRAY!T || IS_DYNAMIC_ARRAY!T; /** * Detect whether `T` is an associative array type * - * See also: $(DDSUBLINK spec/traits, isAssociativeArray, `__traits(isAssociativeArray, T)`) + * See also: $(DDSUBLINK spec/traits, IS_ASSOCIATIVE_ARRAY, `__traits(isAssociativeArray, T)`) */ -enum bool isAssociativeArray(T) = __traits(isAssociativeArray, T); +enum bool IS_ASSOCIATIVE_ARRAY(T) = __traits(isAssociativeArray, T); /** * Detect whether type `T` is a builtin type. */ -enum bool isBuiltinType(T) = is(BuiltinTypeOf!T) && !isAggregateType!T; +enum bool IS_BUILTIN_TYPE(T) = is(BUILTIN_TYPE_OF!T) && !IS_AGGREGATE_TYPE!T; /** * Detect whether type `T` is a pointer. */ -enum bool isPointer(T) = is(T == U*, U); +enum bool IS_POINTER(T) = is(T == U*, U); /** Returns the target type of a pointer. */ -alias PointerTarget(T : T*) = T; +alias POINTER_TARGET(T : T*) = T; /** * Detect whether type `T` is an aggregate type. */ -enum bool isAggregateType(T) = is(T == struct) || is(T == union) || +enum bool IS_AGGREGATE_TYPE(T) = is(T == struct) || is(T == union) || is(T == class) || is(T == interface); /** @@ -218,45 +218,45 @@ enum bool isAggregateType(T) = is(T == struct) || is(T == union) || * that define `opApply` with a single loop variable, and builtin dynamic, * static and associative arrays. */ -enum bool isIterable(T) = is(typeof({ foreach (elem; T.init) {} })); +enum bool IS_ITERABLE(T) = is(typeof({ foreach (elem; T.init) {} })); /** - * Returns true if T is not const or immutable. Note that isMutable is true for + * Returns true if T is not const or immutable. Note that IS_MUTABLE is true for * string, or immutable(char)[], because the 'head' is mutable. */ -enum bool isMutable(T) = !is(T == const) && !is(T == immutable) && !is(T == inout); +enum bool IS_MUTABLE(T) = !is(T == const) && !is(T == immutable) && !is(T == inout); /** * Returns true if T is an instance of the template S. */ -enum bool isInstanceOf(alias S, T) = is(T == S!Args, Args...); +enum bool IS_INSTANCE_OF(alias S, T) = is(T == S!Args, Args...); /// ditto -template isInstanceOf(alias S, alias T) +template IS_INSTANCE_OF(alias S, alias T) { enum impl(alias T : S!Args, Args...) = true; enum impl(alias T) = false; - enum isInstanceOf = impl!T; + enum IS_INSTANCE_OF = impl!T; } /** * Check whether the tuple T is an expression tuple. * An expression tuple only contains expressions. * - * See_Also: $(LREF isTypeTuple). + * See_Also: $(LREF IS_TYPE_TUPLE). */ -template isExpressions(T...) +template IS_EXPRESSION(T...) { static foreach (Ti; T) { - static if (!is(typeof(isExpressions) == bool) && // not yet defined + static if (!is(typeof(IS_EXPRESSION) == bool) && // not yet defined (is(Ti) || !__traits(compiles, { auto ex = Ti; }))) { - enum isExpressions = false; + enum IS_EXPRESSION = false; } } - static if (!is(typeof(isExpressions) == bool)) // if not yet defined + static if (!is(typeof(IS_EXPRESSION) == bool)) // if not yet defined { - enum isExpressions = true; + enum IS_EXPRESSION = true; } } @@ -264,9 +264,9 @@ template isExpressions(T...) * Check whether the tuple `T` is a type tuple. * A type tuple only contains types. * - * See_Also: $(LREF isExpressions). + * See_Also: $(LREF IS_EXPRESSION). */ -enum isTypeTuple(T...) = +enum IS_TYPE_TUPLE(T...) = { static foreach (U; T) static if (!is(U)) @@ -278,12 +278,12 @@ enum isTypeTuple(T...) = /** Detect whether symbol or type `T` is a function pointer. */ -enum bool isFunctionPointer(alias T) = is(typeof(*T) == function); +enum bool IS_FUNCTION_POINTER(alias T) = is(typeof(*T) == function); /** Detect whether symbol or type `T` is a delegate. */ -enum bool isDelegate(alias T) = is(typeof(T) == delegate) || is(T == delegate); +enum bool IS_DELEGATE(alias T) = is(typeof(T) == delegate) || is(T == delegate); /** Detect whether symbol or type `T` is a function, a function pointer or a delegate. @@ -293,7 +293,7 @@ Params: Returns: A `bool` */ -enum bool isSomeFunction(alias T) = +enum bool IS_SOME_FUNCTION(alias T) = is(T == return) || is(typeof(T) == return) || is(typeof(&T) == return); // @property @@ -302,45 +302,45 @@ enum bool isSomeFunction(alias T) = Detect whether `T` is a callable object, which can be called with the function call operator `$(LPAREN)...$(RPAREN)`. */ -template isCallable(alias callable) +template IS_CALLABLE(alias callable) { static if (is(typeof(&callable.opCall) == delegate)) // T is a object which has a member function opCall(). - enum bool isCallable = true; + enum bool IS_CALLABLE = true; else static if (is(typeof(&callable.opCall) V : V*) && is(V == function)) // T is a type which has a static member function opCall(). - enum bool isCallable = true; - else static if (is(typeof(&callable.opCall!()) TemplateInstanceType)) + enum bool IS_CALLABLE = true; + else static if (is(typeof(&callable.opCall!()) TEMPLATE_INSTANCE_TYPW)) { - enum bool isCallable = isCallable!TemplateInstanceType; + enum bool IS_CALLABLE = IS_CALLABLE!TEMPLATE_INSTANCE_TYPW; } - else static if (is(typeof(&callable!()) TemplateInstanceType)) + else static if (is(typeof(&callable!()) TEMPLATE_INSTANCE_TYPW)) { - enum bool isCallable = isCallable!TemplateInstanceType; + enum bool IS_CALLABLE = IS_CALLABLE!TEMPLATE_INSTANCE_TYPW; } else { - enum bool isCallable = isSomeFunction!callable; + enum bool IS_CALLABLE = IS_SOME_FUNCTION!callable; } } /** Detect whether `S` is an abstract function. -See also: $(DDSUBLINK spec/traits, isAbstractFunction, `__traits(isAbstractFunction, S)`) +See also: $(DDSUBLINK spec/traits, IS_ABSTRACT_FUNCTION, `__traits(isAbstractFunction, S)`) Params: S = The symbol to check Returns: A `bool` */ -enum isAbstractFunction(alias S) = __traits(isAbstractFunction, S); +enum IS_ABSTRACT_FUNCTION(alias S) = __traits(isAbstractFunction, S); /** * Detect whether `S` is a final function. * - * See also: $(DDSUBLINK spec/traits, isFinalFunction, `__traits(isFinalFunction, S)`) + * See also: $(DDSUBLINK spec/traits, IS_FINAL_FUNCTION, `__traits(isFinalFunction, S)`) */ -enum isFinalFunction(alias S) = __traits(isFinalFunction, S); +enum IS_FINAL_FUNCTION(alias S) = __traits(isFinalFunction, S); /** Determines if `f` is a function that requires a context pointer. @@ -350,48 +350,48 @@ Params: Returns A `bool` */ -template isNestedFunction(alias f) +template IS_NESTED_FUNCTION(alias f) { - enum isNestedFunction = __traits(isNested, f) && isSomeFunction!(f); + enum IS_NESTED_FUNCTION = __traits(isNested, f) && IS_SOME_FUNCTION!(f); } /** * Detect whether `S` is an abstract class. * - * See also: $(DDSUBLINK spec/traits, isAbstractClass, `__traits(isAbstractClass, S)`) + * See also: $(DDSUBLINK spec/traits, IS_ABSTRACT_CLASS, `__traits(isAbstractClass, S)`) */ -enum isAbstractClass(alias S) = __traits(isAbstractClass, S); +enum IS_ABSTRACT_CLASS(alias S) = __traits(isAbstractClass, S); /** * Detect whether `S` is a final class. * - * See also: $(DDSUBLINK spec/traits, isFinalClass, `__traits(isFinalClass, S)`) + * See also: $(DDSUBLINK spec/traits, IS_FINAL_CLASS, `__traits(isFinalClass, S)`) */ -enum isFinalClass(alias S) = __traits(isFinalClass, S); +enum IS_FINAL_CLASS(alias S) = __traits(isFinalClass, S); //:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::// // General Types //:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::// import core.internal.traits : CoreUnconst = Unconst; -alias Unconst = CoreUnconst; +alias UNCONST = CoreUnconst; /++ Removes `shared` qualifier, if any, from type `T`. Note that while `immutable` is implicitly `shared`, it is unaffected by - Unshared. Only explict `shared` is removed. + UNSHARED. Only explict `shared` is removed. +/ -template Unshared(T) +template UNSHARED(T) { static if (is(T == shared U, U)) - alias Unshared = U; + alias UNSHARED = U; else - alias Unshared = T; + alias UNSHARED = T; } import core.internal.traits : CoreUnqual = Unqual; -alias Unqual = CoreUnqual; +alias UNQUAL = CoreUnqual; /** Returns the inferred type of the loop variable when a variable of type T @@ -400,9 +400,9 @@ automatically inferred return type. Note that this may not be the same as `std.range.ElementType!Range` in the case of narrow strings, or if T has both opApply and a range interface. */ -template ForeachType(T) +template FOREACH_TYPE(T) { - alias ForeachType = typeof( + alias FOREACH_TYPE = typeof( (inout int x = 0) { foreach (elem; T.init) @@ -416,10 +416,10 @@ template ForeachType(T) /** * Strips off all `enum`s from type `T`. */ -template OriginalType(T) +template ORIGINAL_TYPE(T) { - import core.internal.traits : _OriginalType = OriginalType; - alias OriginalType = _OriginalType!T; + import core.internal.traits : _ORIGINAL_TYPE = OriginalType; + alias ORIGINAL_TYPE = _ORIGINAL_TYPE!T; } /** @@ -432,28 +432,28 @@ Returns: If `T` is not a integral or vector, a compile-time error is given. */ -template Unsigned(T) +template UNSIGNED(T) { - template Impl(T) + template IMPL(T) { static if (is(T : __vector(V[N]), V, size_t N)) - alias Impl = __vector(Impl!V[N]); - else static if (isUnsigned!T) - alias Impl = T; - else static if (isSigned!T && !isFloatingPoint!T) + alias IMPL = __vector(IMPL!V[N]); + else static if (IS_UNSIGNED!T) + alias IMPL = T; + else static if (IS_SIGNED!T && !IS_FLOATING_POINT!T) { - static if (is(T == byte )) alias Impl = ubyte; - static if (is(T == short)) alias Impl = ushort; - static if (is(T == int )) alias Impl = uint; - static if (is(T == long )) alias Impl = ulong; - static if (is(ucent) && is(T == cent )) alias Impl = ucent; + static if (is(T == byte )) alias IMPL = ubyte; + static if (is(T == short)) alias IMPL = ushort; + static if (is(T == int )) alias IMPL = uint; + static if (is(T == long )) alias IMPL = ulong; + static if (is(ucent) && is(T == cent )) alias IMPL = ucent; } else static assert(false, "Type " ~ T.stringof ~ - " does not have an Unsigned counterpart"); + " does not have an UNSIGNED counterpart"); } - alias Unsigned = ModifyTypePreservingTQ!(Impl, OriginalType!T); + alias UNSIGNED = MODIFY_TYPE_PRESERVING_TO!(IMPL, ORIGINAL_TYPE!T); } /** @@ -461,64 +461,64 @@ Returns the largest type, i.e. T such that T.sizeof is the largest. If more than one type is of the same size, the leftmost argument of these in will be returned. */ -template Largest(T...) +template LARGEST(T...) if (T.length >= 1) { - alias Largest = T[0]; + alias LARGEST = T[0]; static foreach (U; T[1 .. $]) - Largest = Select!(U.sizeof > Largest.sizeof, U, Largest); + LARGEST = SELECT!(U.sizeof > LARGEST.sizeof, U, LARGEST); } /** Returns the corresponding signed type for T. T must be a numeric integral type, otherwise a compile-time error occurs. */ -template Signed(T) +template SIGNED(T) { - template Impl(T) + template IMPL(T) { static if (is(T : __vector(V[N]), V, size_t N)) - alias Impl = __vector(Impl!V[N]); - else static if (isSigned!T) - alias Impl = T; - else static if (isUnsigned!T) + alias IMPL = __vector(IMPL!V[N]); + else static if (IS_SIGNED!T) + alias IMPL = T; + else static if (IS_UNSIGNED!T) { - static if (is(T == ubyte )) alias Impl = byte; - static if (is(T == ushort)) alias Impl = short; - static if (is(T == uint )) alias Impl = int; - static if (is(T == ulong )) alias Impl = long; - static if (is(ucent) && is(T == ucent )) alias Impl = cent; + static if (is(T == ubyte )) alias IMPL = byte; + static if (is(T == ushort)) alias IMPL = short; + static if (is(T == uint )) alias IMPL = int; + static if (is(T == ulong )) alias IMPL = long; + static if (is(ucent) && is(T == ucent )) alias IMPL = cent; } else static assert(false, "Type " ~ T.stringof ~ - " does not have an Signed counterpart"); + " does not have an SIGNED counterpart"); } - alias Signed = ModifyTypePreservingTQ!(Impl, OriginalType!T); + alias SIGNED = MODIFY_TYPE_PRESERVING_TO!(IMPL, ORIGINAL_TYPE!T); } /** Returns the most negative value of the numeric type T. */ -template mostNegative(T) -if (isNumeric!T || isSomeChar!T || isBoolean!T) +template MOST_NEGATIVE(T) +if (IS_NUMERIC!T || IS_SOME_CHAR!T || IS_BOOLEAN!T) { static if (is(typeof(T.min_normal))) - enum mostNegative = -T.max; + enum MOST_NEGATIVE = -T.max; else static if (T.min == 0) - enum byte mostNegative = 0; + enum byte MOST_NEGATIVE = 0; else - enum mostNegative = T.min; + enum MOST_NEGATIVE = T.min; } /** Get the type that a scalar type `T` will $(LINK2 $(ROOT_DIR)spec/type.html#integer-promotions, promote) to in multi-term arithmetic expressions. */ -template Promoted(T) -if (isScalarType!T) +template PROMOTED(T) +if (IS_SCALAR_TYPE!T) { - alias Promoted = CopyTypeQualifiers!(T, typeof(T.init + T.init)); + alias PROMOTED = COPY_TYPE_QUALIFIERS!(T, typeof(T.init + T.init)); } /++ @@ -526,9 +526,9 @@ if (isScalarType!T) $(DDSUBLINK spec/attribute, uda, user-defined attribute). See_Also: - $(LREF getUDAs) + $(LREF GET_UDAS) +/ -enum hasUDA(alias symbol, alias attribute) = getUDAs!(symbol, attribute).length != 0; +enum HAS_UDA(alias symbol, alias attribute) = GET_UDAS!(symbol, attribute).length != 0; /++ Gets the matching $(DDSUBLINK spec/attribute, uda, user-defined attributes) @@ -540,37 +540,37 @@ enum hasUDA(alias symbol, alias attribute) = getUDAs!(symbol, attribute).length then any UDAs on the symbol which are equal to that value will match. See_Also: - $(LREF hasUDA) + $(LREF HAS_UDA) +/ -template getUDAs(alias symbol, alias attribute) +template GET_UDAS(alias symbol, alias attribute) { import std.meta : Filter; - alias getUDAs = Filter!(isDesiredUDA!attribute, __traits(getAttributes, symbol)); + alias GET_UDAS = Filter!(IS_DESIRED_UDA!attribute, __traits(getAttributes, symbol)); } -private template isDesiredUDA(alias attribute) +private template IS_DESIRED_UDA(alias attribute) { - template isDesiredUDA(alias toCheck) + template IS_DESIRED_UDA(alias TO_CHECK) { static if (is(typeof(attribute)) && !__traits(isTemplate, attribute)) { - static if (__traits(compiles, toCheck == attribute)) - enum isDesiredUDA = toCheck == attribute; + static if (__traits(compiles, TO_CHECK == attribute)) + enum IS_DESIRED_UDA = TO_CHECK == attribute; else - enum isDesiredUDA = false; + enum IS_DESIRED_UDA = false; } - else static if (is(typeof(toCheck))) + else static if (is(typeof(TO_CHECK))) { static if (__traits(isTemplate, attribute)) - enum isDesiredUDA = isInstanceOf!(attribute, typeof(toCheck)); + enum IS_DESIRED_UDA = IS_INSTANCE_OF!(attribute, typeof(TO_CHECK)); else - enum isDesiredUDA = is(typeof(toCheck) == attribute); + enum IS_DESIRED_UDA = is(typeof(TO_CHECK) == attribute); } else static if (__traits(isTemplate, attribute)) - enum isDesiredUDA = isInstanceOf!(attribute, toCheck); + enum IS_DESIRED_UDA = IS_INSTANCE_OF!(attribute, TO_CHECK); else - enum isDesiredUDA = is(toCheck == attribute); + enum IS_DESIRED_UDA = is(TO_CHECK == attribute); } } @@ -586,32 +586,32 @@ Note: This is not recursive; it will not search for symbols within symbols such as nested structs or unions. */ -template getSymbolsByUDA(alias symbol, alias attribute) +template GET_SYMBOLS_BY_UDA(alias symbol, alias attribute) { - alias membersWithUDA = getSymbolsByUDAImpl!(symbol, attribute, __traits(allMembers, symbol)); + alias MEMBERS_WITH_UDA = GET_SYMBOLS_BY_UDAIMPL!(symbol, attribute, __traits(allMembers, symbol)); // if the symbol itself has the UDA, tack it on to the front of the list - static if (hasUDA!(symbol, attribute)) - alias getSymbolsByUDA = AliasSeq!(symbol, membersWithUDA); + static if (HAS_UDA!(symbol, attribute)) + alias GET_SYMBOLS_BY_UDA = AliasSeq!(symbol, MEMBERS_WITH_UDA); else - alias getSymbolsByUDA = membersWithUDA; + alias GET_SYMBOLS_BY_UDA = MEMBERS_WITH_UDA; } -private template getSymbolsByUDAImpl(alias symbol, alias attribute, names...) +private template GET_SYMBOLS_BY_UDAIMPL(alias symbol, alias attribute, names...) { import std.meta : Alias, AliasSeq, Filter; static if (names.length == 0) { - alias getSymbolsByUDAImpl = AliasSeq!(); + alias GET_SYMBOLS_BY_UDAIMPL = AliasSeq!(); } else { - alias tail = getSymbolsByUDAImpl!(symbol, attribute, names[1 .. $]); + alias tail = GET_SYMBOLS_BY_UDAIMPL!(symbol, attribute, names[1 .. $]); // Filtering inaccessible members. static if (!__traits(compiles, __traits(getMember, symbol, names[0]))) { - alias getSymbolsByUDAImpl = tail; + alias GET_SYMBOLS_BY_UDAIMPL = tail; } else { @@ -619,24 +619,24 @@ private template getSymbolsByUDAImpl(alias symbol, alias attribute, names...) // Filtering not compiled members such as alias of basic types. static if (isAliasSeq!member || - (isType!member && !isAggregateType!member && !is(member == enum))) + (IS_TYPE!member && !IS_AGGREGATE_TYPE!member && !is(member == enum))) { - alias getSymbolsByUDAImpl = tail; + alias GET_SYMBOLS_BY_UDAIMPL = tail; } // If a symbol is overloaded, get UDAs for each overload (including templated overlaods). else static if (__traits(getOverloads, symbol, names[0], true).length > 0) { - enum hasSpecificUDA(alias member) = hasUDA!(member, attribute); - alias overloadsWithUDA = Filter!(hasSpecificUDA, __traits(getOverloads, symbol, names[0])); - alias getSymbolsByUDAImpl = AliasSeq!(overloadsWithUDA, tail); + enum HAS_SPECIFIC_UDA(alias member) = HAS_UDA!(member, attribute); + alias OVERLOADS_WITH_UDA = Filter!(HAS_SPECIFIC_UDA, __traits(getOverloads, symbol, names[0])); + alias GET_SYMBOLS_BY_UDAIMPL = AliasSeq!(OVERLOADS_WITH_UDA, tail); } - else static if (hasUDA!(member, attribute)) + else static if (HAS_UDA!(member, attribute)) { - alias getSymbolsByUDAImpl = AliasSeq!(member, tail); + alias GET_SYMBOLS_BY_UDAIMPL = AliasSeq!(member, tail); } else { - alias getSymbolsByUDAImpl = tail; + alias GET_SYMBOLS_BY_UDAIMPL = tail; } } } @@ -645,7 +645,7 @@ private template getSymbolsByUDAImpl(alias symbol, alias attribute, names...) /** Returns: `true` iff all types `Ts` are the same. */ -enum bool allSameType(Ts...) = +enum bool ALL_SAME_TYPE(Ts...) = { static foreach (T; Ts[Ts.length > 1 .. $]) static if (!is(Ts[0] == T)) @@ -656,12 +656,12 @@ enum bool allSameType(Ts...) = /** * Detect whether `X` is a type. Analogous to `is(X)`. This is useful when used - * in conjunction with other templates, e.g. `allSatisfy!(isType, X)`. + * in conjunction with other templates, e.g. `allSatisfy!(IS_TYPE, X)`. * * Returns: * `true` if `X` is a type, `false` otherwise */ -enum isType(alias X) = is(X); +enum IS_TYPE(alias X) = is(X); /** * Detect whether symbol or type `X` is a function. This is different that finding @@ -673,24 +673,24 @@ enum isType(alias X) = is(X); * `true` if `X` is a function, `false` otherwise * * See_Also: - * Use $(LREF isFunctionPointer) or $(LREF isDelegate) for detecting those types + * Use $(LREF IS_FUNCTION_POINTER) or $(LREF IS_DELEGATE) for detecting those types * respectively. */ -template isFunction(alias X) +template IS_FUNCTION(alias X) { static if (is(typeof(&X) U : U*) && (is(U == function) || is(typeof(&X) U == delegate))) { // x is a (nested) function symbol. - enum isFunction = true; + enum IS_FUNCTION = true; } else static if (is(X T)) { // x is a type. Take the type of it and examine. - enum isFunction = is(T == function); + enum IS_FUNCTION = is(T == function); } else - enum isFunction = false; + enum IS_FUNCTION = false; } /** @@ -699,14 +699,14 @@ template isFunction(alias X) * Returns: * `true` if `X` is final, `false` otherwise */ -template isFinal(alias X) +template IS_FINAL(alias X) { static if (is(X == class)) - enum isFinal = __traits(isFinalClass, X); - else static if (isFunction!X) - enum isFinal = __traits(isFinalFunction, X); + enum IS_FINAL = __traits(isFinalClass, X); + else static if (IS_FUNCTION!X) + enum IS_FINAL = __traits(isFinalFunction, X); else - enum isFinal = false; + enum IS_FINAL = false; } /++ @@ -714,12 +714,12 @@ template isFinal(alias X) + If a type cannot be copied, then code such as `MyStruct x; auto y = x;` will fail to compile. + Copying for structs can be disabled by using `@disable this(this)`. + - + See also: $(DDSUBLINK spec/traits, isCopyable, `__traits(isCopyable, S)`) + + See also: $(DDSUBLINK spec/traits, IS_COPYABLE, `__traits(isCopyable, S)`) + Params: + S = The type to check. + + Returns: + `true` if `S` can be copied. `false` otherwise. +/ -enum isCopyable(S) = __traits(isCopyable, S); +enum IS_COPYABLE(S) = __traits(isCopyable, S); diff --git a/src/clib/typeinfo.d b/src/clib/typeinfo.d index 4b1beaf..87a4ff6 100644 --- a/src/clib/typeinfo.d +++ b/src/clib/typeinfo.d @@ -1,5 +1,5 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /// extern(C++) TypeInfo alternative module clib.typeinfo; @@ -8,7 +8,7 @@ module clib.typeinfo; version(D_BetterC) { version = CLIB_USE_TYPEINFO; } version(CLIB_USE_TYPEINFO): -import core.stdc.string: strcmp; +import clib.string: strcmp; import clib.traits; import clib.memory; @@ -102,7 +102,7 @@ struct type_info { /// Ditto bool isBaseOf(T)() @nogc nothrow { if (isPointer || isFunction) return false; - import core.stdc.string: strlen, memcmp; + import clib.string: strlen, memcmp; if (!isSubclassOfCppObject!T) return false; if (_isACppObject) return true; char[200] s = ' '; @@ -174,7 +174,7 @@ mixin template RTTI(T) if ((isSubclassOfCppObject!T || is(T == interface)) && !i } char[200] __cpp_class_inheritance_generator(T)() { - import core.stdc.string: strlen; + import clib.string: strlen; char[200] s = ' '; char[] t = cast(char[]) __traits(fullyQualifiedName, T); diff --git a/src/clib/vector.d b/src/clib/vector.d index 8485c35..f4389c8 100644 --- a/src/clib/vector.d +++ b/src/clib/vector.d @@ -1,5 +1,5 @@ // SPDX-FileCopyrightText: (C) 2023 Alisa Lain -// SPDX-License-Identifier: GPL-3.0-or-later +// SPDX-License-Identifier: OSL-3.0 /++ noGC compatible dynamic size container. @@ -8,8 +8,8 @@ Most of functionality is taken directly from cpp's std::vector with minor change +/ module clib.vector; -// import core.stdc.stdlib: free, malloc, calloc, realloc; -import core.stdc.string: memcpy, memcmp, strcpy, strcmp; +// import clib.stdlib: free, malloc, calloc, realloc; +import clib.string: memcpy, memcmp, strcpy, strcmp; import clib.memory; import clib.iterator; @@ -118,7 +118,7 @@ struct vector(T, A: IAllocator!T = allocator!T) if (!is(T == bool)) { // // Make type be passed by reference // // Fun stuff, but probably no // if (other._refCounter is null) { - // import core.stdc.stdlib; + // import clib.stdlib; // other._refCounter = cast(size_t*) malloc(size_t.sizeof); // if (other_refCounter is null) {} // handle fail // other._refCounter[0] = 1; @@ -136,7 +136,7 @@ struct vector(T, A: IAllocator!T = allocator!T) if (!is(T == bool)) { // if (_refCounter is null) return; // _refCounter[0] -= 1; // if (_refCounter[0] == 0) { - // import core.stdc.stdlib: cfree = free; + // import clib.stdlib: cfree = free; // cfree(_refCounter); // free(); // } @@ -590,8 +590,8 @@ unittest { assert(k[0..$] == [1, 2, 3, 4]); k.free(); - import core.stdc.string; - import core.stdc.stdlib; + import clib.string; + import clib.stdlib; int* d = cast(int*) malloc(4 * int.sizeof); memcpy(d, data.ptr, 4 * int.sizeof); vector!int v; @@ -716,11 +716,11 @@ unittest { unittest { vector!char v = "test"; char[5] a = ['t', 'e', 's', 't', '\0']; - import core.stdc.string: strcmp; + import clib.string: strcmp; assert(strcmp(v.stringz.data, a.ptr) == 0); char* sz = v.stringz.release(); assert(strcmp(sz, a.ptr) == 0); - import core.stdc.stdlib; + import clib.stdlib; free(sz); } diff --git a/src/clib/wchar_.d b/src/clib/wchar_.d new file mode 100644 index 0000000..edf26aa --- /dev/null +++ b/src/clib/wchar_.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.wchar_; + +public import core.stdc.wchar_; diff --git a/src/clib/wctype.d b/src/clib/wctype.d new file mode 100644 index 0000000..cd9e99f --- /dev/null +++ b/src/clib/wctype.d @@ -0,0 +1,6 @@ +// SPDX-FileCopyrightText: (C) 2024 Alisa Lain +// SPDX-License-Identifier: OSL-3.0 + +module clib.wctype; + +public import core.stdc.wctype; diff --git a/test/test.d b/test/test.d index 1119acc..f3d3c6e 100644 --- a/test/test.d +++ b/test/test.d @@ -9,7 +9,7 @@ dependency "clib" path="../" import clib; // import clib.memory; -import core.stdc.stdio; +// import core.stdc.stdio; extern(C) __gshared string[] rt_options = [ "gcopt=disable:1" ]; void main(string[] args)