From 06e60056232709831f2923080884ad32888fa866 Mon Sep 17 00:00:00 2001 From: Karl Berry Date: Sun, 3 Sep 2017 23:01:37 +0000 Subject: algobox (3sep17) git-svn-id: svn://tug.org/texlive/trunk@45207 c570f23f-e606-0410-a88d-b1316a301751 --- Master/texmf-dist/doc/latex/algobox/LICENSE | 674 +++++++++++++++++++++ Master/texmf-dist/doc/latex/algobox/README.md | 16 + Master/texmf-dist/doc/latex/algobox/algobox.pdf | Bin 0 -> 130422 bytes Master/texmf-dist/source/latex/algobox/algobox.dtx | 562 +++++++++++++++++ Master/texmf-dist/source/latex/algobox/algobox.ins | 24 + Master/texmf-dist/tex/latex/algobox/algobox.sty | 344 +++++++++++ Master/tlpkg/bin/tlpkg-ctan-check | 2 +- Master/tlpkg/tlpsrc/algobox.tlpsrc | 0 Master/tlpkg/tlpsrc/collection-mathscience.tlpsrc | 1 + 9 files changed, 1622 insertions(+), 1 deletion(-) create mode 100644 Master/texmf-dist/doc/latex/algobox/LICENSE create mode 100644 Master/texmf-dist/doc/latex/algobox/README.md create mode 100644 Master/texmf-dist/doc/latex/algobox/algobox.pdf create mode 100644 Master/texmf-dist/source/latex/algobox/algobox.dtx create mode 100644 Master/texmf-dist/source/latex/algobox/algobox.ins create mode 100644 Master/texmf-dist/tex/latex/algobox/algobox.sty create mode 100644 Master/tlpkg/tlpsrc/algobox.tlpsrc diff --git a/Master/texmf-dist/doc/latex/algobox/LICENSE b/Master/texmf-dist/doc/latex/algobox/LICENSE new file mode 100644 index 00000000000..b89b5dd20de --- /dev/null +++ b/Master/texmf-dist/doc/latex/algobox/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + algobox + Copyright (C) 2017 frnchfrgg-latex + + 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: + + algobox Copyright (C) 2017 frnchfrgg-latex + 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/Master/texmf-dist/doc/latex/algobox/README.md b/Master/texmf-dist/doc/latex/algobox/README.md new file mode 100644 index 00000000000..f31a1c268a4 --- /dev/null +++ b/Master/texmf-dist/doc/latex/algobox/README.md @@ -0,0 +1,16 @@ +# The algobox package + +This small package can typeset Algobox programs almost exactly as displayed +when editing with Algobox itself (http://www.xm1math.net/algobox/), using an +input syntax very similar to the actual Algobox program text. + +It is far better than the LaTeX export of Algobox which does not look like the +editor rendition, has arbitrary and inconsistent differences with the program +text, is not very easy to customize and produces standalone documents. + +The dependencies of the algobox package are TikZ and kernel3. You can change a +lot of things by changing TikZ styles. + +This package may be distributed and/or modified under the conditions of the +General Public License (GPL), either version 3 of this license or (at your +option) any later version. diff --git a/Master/texmf-dist/doc/latex/algobox/algobox.pdf b/Master/texmf-dist/doc/latex/algobox/algobox.pdf new file mode 100644 index 00000000000..927b4e9966e Binary files /dev/null and b/Master/texmf-dist/doc/latex/algobox/algobox.pdf differ diff --git a/Master/texmf-dist/source/latex/algobox/algobox.dtx b/Master/texmf-dist/source/latex/algobox/algobox.dtx new file mode 100644 index 00000000000..b20a17a29c9 --- /dev/null +++ b/Master/texmf-dist/source/latex/algobox/algobox.dtx @@ -0,0 +1,562 @@ +% \iffalse meta-comment +% vim: tw=80 +% +%% File: algobox.dtx (C) Copyright 2016 RIVAUD Julien +%% +%% It may be distributed and/or modified under the conditions of the +%% General Public License (GPL), either version 3 of this +%% license or (at your option) any later version. +% +%<*driver|package> +% The version of expl3 required is tested as early as possible, as +% some really old versions do not define \ProvidesExplPackage. +\NeedsTeXFormat{LaTeX2e}[1995/12/01] +\RequirePackage{expl3}[2016/01/19] +\def\ExplFileName{algobox} +\def\ExplFileDescription{Typeset Algobox programs} +\def\ExplFileDate{2017/09/03} +\def\ExplFileVersion{1.1} +% +%<*driver> +\documentclass[full]{l3doc} +\usepackage{fontspec} +\usepackage{algobox} +\usepackage{url} +\begin{document} + \def\Algobox{\textsc{Algobox}} + \DocInput{\jobname.dtx} +\end{document} +% +% \fi +% +% \title{^^A +% The \textsf{\ExplFileName} package\\ \ExplFileDescription^^A +% \thanks{This file describes v\ExplFileVersion, +% last revised \ExplFileDate.}^^A +% } +% +% \author{^^A +% Julien ``\_FrnchFrgg\_'' \textsc{Rivaud}\thanks +% {^^A +% E-mail: +% \href{mailto:frnchfrgg@free.fr} +% {frnchfrgg@free.fr}^^A +% }^^A +% } +% +% \date{Released \ExplFileDate} +% +% \maketitle +% +% \begin{documentation} +% +% \section{Documentation} +% +% \subsection{Getting support} +% +% If you find bugs or keywords not recognized by the package, you can report it +% at the address \url{https://gitlab.com/frnchfrgg-latex/algobox/issues}. +% +% \subsection{Rationale} +% +% French mathematics and/or computer science teachers can use \Algobox\ +% (\url{http://www.xm1math.net/algobox/}) to teach algorithmics to beginners. +% It uses tree-like indentation, fixed-form structures entered by buttons and +% dialogs rather than free text. This prevents most typos or small beginner +% mistakes that are often hard to detect. +% +% \Algobox\ can save a project in its own format, and export in a variety of +% formats, including \LaTeX. Several problems arise: +% \begin{itemize} +% \item The output is not similar to what \Algobox\ displays itself. +% \item The generated code is standalone and uses dependencies that might not +% be wanted, like \textsf{algorithm} and \textsf{algpseudocode} that can +% clash with other algorithm-like packages. +% \item The algorithm part of the generated code does not look like \Algobox\ +% code and can thus be annoying to modify by hand if needed. +% \end{itemize} +% +% This small package intends to solve the problem by using a syntax very close +% to the real \Algobox\ syntax and having a typeset output of the best quality +% possible, resembling the most to what \Algobox\ displays in its editing +% window. +% +% \subsection{Simple usage} +% +% To convert an \Algobox\ program to input suitable for this package you just +% have to: +% +% \begin{enumerate} +% \item Copy the program from the \string"Tester l'algorithme\string" +% window and remove the line numbers. +% \item Add \cs{;} at the end of each line (or at the beginning of each line +% if like me you prefer to have those out of the way). The reason is that +% some constructs in \Algobox\ programs depend on the line cuts whereas +% \TeX\ treats those as normal spaces by default. Of course, one can setup +% \TeX\ so that it temporarily obeys lines, but it \emph{cannot work} if +% the algorithm is between braces (if you put in in a macro like +% \cs{fbox}). +% \item Add a backslash at the beginning of all \Algobox\ keywords, like +% "VARIABLES", "SI", "DEBUT_SINON" and so on. +% \item Remove all underscores in \Algobox\ keywords. You probably want to +% remove them in all cases because \Algobox\ programs are not typeset in +% math mode and \TeX\ will complain that you tried to use a subscript. If +% you really want an underscore, replace it by \cs{_} \emph{but not in +% keywords} or they will not be recognized anymore. +% \item Put everything between "\begin{algobox}" and +% "\end{algobox}". +% \end{enumerate} +% +% Here is an example of the result: +% +% \begin{verbatim} +% \begin{algobox} +% \; \VARIABLES +% \; a1 \ESTDUTYPE NOMBRE +% \; b1 \ESTDUTYPE NOMBRE +% \; a2 \ESTDUTYPE NOMBRE +% \; b2 \ESTDUTYPE NOMBRE +% \; \DEBUTALGORITHME +% \; \LIRE a1 +% \; \LIRE b1 +% \; \LIRE a2 +% \; \LIRE b2 +% \; \SI (a1 == a2) \ALORS +% \; \DEBUTSI +% \; \SI (b1 == b2) \ALORS +% \; \DEBUTSI +% \; \AFFICHER "Les droites sont parallèles" +% \; \FINSI +% \; \SINON +% \; \DEBUTSINON +% \; \AFFICHER "Les droites sont sécantes" +% \; \FINSINON +% \; \FINSI +% \; \SINON +% \; \DEBUTSINON +% \; \AFFICHER "Les droites sont confondues" +% \; \FINSINON +% \; \FINALGORITHME +% \end{algobox} +% \end{verbatim} +% +% The spacing is only for your convenience as \TeX\ treats any number of +% consecutive spaces as a single one. +% +% Typesetting the previous example gives: +% +% \begin{algobox} +% \def"{\string"} +% \; \VARIABLES +% \; a1 \ESTDUTYPE NOMBRE +% \; b1 \ESTDUTYPE NOMBRE +% \; a2 \ESTDUTYPE NOMBRE +% \; b2 \ESTDUTYPE NOMBRE +% \; \DEBUTALGORITHME +% \; \LIRE a1 +% \; \LIRE b1 +% \; \LIRE a2 +% \; \LIRE b2 +% \; \SI (a1 == a2) \ALORS +% \; \DEBUTSI +% \; \SI (b1 == b2) \ALORS +% \; \DEBUTSI +% \; \AFFICHER "Les droites sont parallèles" +% \; \FINSI +% \; \SINON +% \; \DEBUTSINON +% \; \AFFICHER "Les droites sont sécantes" +% \; \FINSINON +% \; \FINSI +% \; \SINON +% \; \DEBUTSINON +% \; \AFFICHER "Les droites sont confondues" +% \; \FINSINON +% \; \FINALGORITHME +% \end{algobox} +% +% The algorithm is typeset as a TikZ picture, so is not breakable between pages. +% +% You can of course put the environment in anything you deem fit, like a "\fbox" +% for instance. Here is an example: +% +% \fbox{ +% \begin{algobox} +% \def"{\string"} +% \; \VARIABLES +% \; note \ESTDUTYPE NOMBRE +% \; \DEBUTALGORITHME +% \; \LIRE note +% \; \SI (note<10) \ALORS +% \; \DEBUTSI +% \; \AFFICHER "Il y a encore du travail" +% \; \FINSI +% \; \AFFICHER "On ne se relâche pas" +% \; \POUR j \ALLANTDE 1 \A 25 +% \; \DEBUTPOUR +% \; \AFFICHERCALCUL i+3 +% \; \FINPOUR +% \; \FINALGORITHME +% \end{algobox} +% } +% +% \subsection{Customizing the appearance} +% +% TODO +% +% \end{documentation} +% +% \begin{implementation} +% +% \section{\pkg{\ExplFileName} implementation} +% +% \begin{macrocode} +%<*package> +%<@@=algobox> +% \end{macrocode} +% +% \begin{macrocode} +\ProvidesExplPackage + {\ExplFileName}{\ExplFileDate}{\ExplFileVersion}{\ExplFileDescription} +% \end{macrocode} +% \begin{macrocode} +\RequirePackage{xparse} +\RequirePackage{environ} +\RequirePackage{tikz} + +\ExplSyntaxOff +\usetikzlibrary{calc} +\ExplSyntaxOn + +\RequirePackage{xcolor} + +\int_new:N \l_@@_level_int + +\definecolor{algoboxarbre}{RGB}{146,146,146} +\colorlet {algoboxcommentaire}{algoboxarbre!70!black} +\definecolor{algoboxstructure}{RGB}{134,0,0} +\definecolor{algoboxmotclef}{RGB}{25,3,180} +\definecolor{algoboxsialors}{RGB}{147,0,128} +\definecolor{algoboxpour}{RGB}{187,136,0} +\definecolor{algoboxtantque}{RGB}{222,111,6} +\definecolor{algoboxnormal}{RGB}{0,0,0} + +\tikzset{ + every~algobox/.style=, + every~smalgobox/.style={baseline=(block.base)}, + algobox~ligne/.style={ + xshift=1em, text~depth=0pt, + inner~xsep=0.1ex, inner~ysep=0.5ex + }, + algobox~arbre/.style={ultra~thick, color=algoboxarbre}, + algobox~indentsymb/.style={x=1ex, y=0.6ex, color=algoboxarbre}, + algobox~indent/.style={xshift=2em}, + algobox~normal/.style={ + font=\sffamily, + color=algoboxnormal, + }, + algobox~commentaire/.style={ + algobox~normal/.try, + color=algoboxcommentaire, + }, + algobox~motclef/.style={ + algobox~normal/.try, + color=algoboxmotclef, + }, + algobox~structure/.style={ + font=\sffamily\bfseries, + color=algoboxstructure + }, + algobox~sialors/.style={ + algobox~structure/.try, + color=algoboxsialors, + }, + algobox~pour/.style={ + algobox~structure/.try, + color=algoboxpour, + }, + algobox~tantque/.style={ + algobox~structure/.try, + color=algoboxtantque, + }, +} + +% \end{macrocode} +% \subsection{Formatting commands} +% \begin{macrocode} + + +\tl_new:N \l_@@_lastnode_tl +\cs_new_protected:Nn \@@_block:nn { + \node[algobox~ligne/.try, + \tl_if_empty:nF{#1}{algobox~#1/.try}, + anchor=north~west + ] + (block) at (A\int_use:N \l_@@_level_int |- H) + {\vphantom{A}#2}; + \draw[algobox~arbre/.try] + (A\int_use:N \l_@@_level_int) + -- (A\int_use:N \l_@@_level_int |- block.west) + coordinate (A\int_use:N \l_@@_level_int) + -- (block.west); + \coordinate (H) at (block.south); + \tl_set:Nn \l_@@_lastnode_tl {block} +} + +\cs_new_protected:Nn \@@_indent:nn { + \node[algobox~ligne/.try, + \tl_if_empty:nF{#1}{algobox~#1/.try}, + anchor=north~west + ] + (block) at (A\int_use:N \l_@@_level_int |- H) + {\vphantom{A}#2}; + \draw[algobox~arbre/.try] + (A\int_use:N \l_@@_level_int) + -- (A\int_use:N \l_@@_level_int |- H); + \fill[algobox~indentsymb/.try] + (A\int_use:N \l_@@_level_int |- block.west) + +(0,-1) -- +(1,1) -- +(-1,1) -- cycle; + \coordinate (H) at (block.south); + \coordinate (T) at (A\int_use:N \l_@@_level_int |- H); + \coordinate (A\int_use:N \l_@@_level_int) at (T); + \int_incr:N \l_@@_level_int + \coordinate[algobox~indent/.try] (A\int_use:N \l_@@_level_int) at (T); + \tl_set:Nn \l_@@_lastnode_tl {block} +} +\cs_new_protected:Nn \@@_unindent: { + \int_decr:N \l_@@_level_int +} + +\cs_new_protected:Nn \@@_node:nn { + \node[algobox~#1/.try, anchor=base~west, inner~xsep=0pt] + (node) at (\l_@@_lastnode_tl.base~east) {#2}; + \tl_set:Nn \l_@@_lastnode_tl {node} +} + +% \end{macrocode} +% \subsection{Parsing helpers} +% \begin{macrocode} + + +\cs_new_protected:Nn \@@_parseall:n { + \tl_set:Nn \l_tmpa_tl {#1} + \seq_set_split:NnV \l_tmpa_seq {\;} \l_tmpa_tl + % Now build up the algorithm body, working around the few infix notations. + \tl_clear:N \l_@@_body_tl + \seq_map_variable:NNn \l_tmpa_seq \l_tmpa_tl { + \tl_if_in:NnT \l_tmpa_tl {\ESTDUTYPE} { + \tl_put_left:Nn \l_tmpa_tl {\@@_ESTDUTYPE:w} + } + \tl_if_in:NnT \l_tmpa_tl {\PRENDLAVALEUR} { + \tl_put_left:Nn \l_tmpa_tl {\@@_PRENDLAVALEUR:w} + } + \tl_put_right:Nn \l_tmpa_tl { \; } + \tl_put_right:NV \l_@@_body_tl \l_tmpa_tl + } + \tl_use:N \l_@@_body_tl +} + +\bool_new:N \l_@@_balanced_first_bool +\cs_new_protected:Npn \@@_new_balanced_command:nNNnn #1#2#3 { + \cs_new_protected:cpn {#1} ##1 #2 { + \tl_set:Nn \l_@@_prefix_tl { ##1 } + \tl_clear:N \l_@@_balanced_tl + \bool_set_true:N \l_@@_balanced_first_bool + \use:c {#1_stage2} #2 + } + \cs_new_protected:cpn {#1_stage2} ##1 #2 ##2 #3 { + \tl_put_right:Nn \l_@@_balanced_tl { ##1 } + \bool_if:NF \l_@@_balanced_first_bool { + \tl_put_right:Nn \l_@@_balanced_tl { #2 } + } + \tl_if_in:nnTF {##2} {#2} { + \bool_set_false:N \l_@@_balanced_first_bool + \use:c {#1_stage2} ##2 \q_mark + }{ + \tl_put_right:Nn \l_@@_balanced_tl { ##2 } + \tl_replace_all:Nnn \l_@@_balanced_tl {\q_mark} {#3} + \tl_set:Nx \l_tmpa_tl { + \exp_not:c {#1_stage3} + \exp_not:V \l_@@_prefix_tl + \exp_not:n {#2} + { + \exp_not:V \l_@@_balanced_tl + } + } + \tl_use:N \l_tmpa_tl + } + } + \exp_args:Nc \NewDocumentCommand {#1_stage3} +} + +\cs_new_protected:Npn \@@_if_next:NTF #1#2#3 { + \peek_meaning_remove_ignore_spaces:NTF \; { + \@@_if_next:NTF #1 {#2} {#3} + }{ + \peek_meaning_remove_ignore_spaces:NTF \par { + \@@_if_next:NTF #1 {#2} {#3} + }{ + \peek_meaning_ignore_spaces:NTF #1 {#2} {#3} + } + } +} +% \end{macrocode} +% \subsection{Parsing/typesetting commands} +% \begin{macrocode} + +\NewDocumentCommand \@@_VARIABLES:w {} { + \@@_indent:nn {structure} {VARIABLES} +} + +\NewDocumentCommand \@@_ESTDUTYPE:w { +u{\ESTDUTYPE} +u{\;} } { + \@@_block:nn {normal} { + \ignorespaces #1 \unskip\c_space_token\null + } + \@@_node:nn {motclef}{EST_DU_TYPE} + \@@_node:nn {normal}{\null\c_space_token#2} +} + +\NewDocumentCommand \@@_DEBUTALGORITHME:w {} { + \int_compare:nNnT \l_@@_level_int = \c_one { + % if there was a VARIABLES before + \@@_unindent: + } + \@@_indent:nn {structure} {DEBUT_ALGORITHME} +} + +\NewDocumentCommand \@@_FINALGORITHME:w {} { + \int_compare:nNnT \l_@@_level_int = \c_one { + \@@_unindent: + \@@_block:nn {structure} {FIN_ALGORITHME} + } +} + +\NewDocumentCommand \@@_PRENDLAVALEUR:w { u{\PRENDLAVALEUR} m } { + \@@_block:nn {normal} { + \ignorespaces#1\unskip\c_space_token\null + } + \@@_node:nn {motclef}{PREND_LA_VALEUR} + \@@_node:nn {normal}{\null\c_space_token#2} +} + +\@@_new_balanced_command:nNNnn + {@@_SI:w} \DEBUTSI \FINSI { r() u{\DEBUTSI} +m } +{ + \@@_indent:nn {sialors} {SI} + \@@_node:nn {normal}{\null\c_space_token(#1)\c_space_token\null} + \@@_node:nn {sialors}{ALORS} + \@@_block:nn {sialors} {DEBUT_SI} + #3 + \@@_block:nn {sialors} {FIN_SI} + \@@_if_next:NTF \SINON { + \@@_SINON:w + }{ + \@@_unindent: + } +} +\@@_new_balanced_command:nNNnn + {@@_SINON:w} \DEBUTSINON \FINSINON { u{\DEBUTSINON} +m } { + \@@_indent:nn {sialors} {SINON} + \@@_block:nn {sialors} {DEBUT_SINON} + #2 + \@@_block:nn {sialors} {FIN_SINON} + \@@_unindent: + \@@_unindent: +} + +\@@_new_balanced_command:nNNnn + {@@_POUR:w} \DEBUTPOUR \FINPOUR + { u{\ALLANTDE} u{\A} u{\DEBUTPOUR} +m } { + \@@_indent:nn {pour} {POUR} + \@@_node:nn {normal}{\null\c_space_token #1\unskip\c_space_token\null} + \@@_node:nn {pour}{ALLANT_DE} + \@@_node:nn {normal}{\null\c_space_token #2\unskip + \c_space_token A~#3\unskip\c_space_token\null} + \@@_block:nn {pour} {DEBUT_POUR} + #4 + \@@_block:nn {pour} {FIN_POUR} + \@@_unindent: +} + +\@@_new_balanced_command:nNNnn {@@_TANTQUE:w} \DEBUTTANTQUE \FINTANTQUE + { r() u{\DEBUTTANTQUE} +m } +{ + \@@_indent:nn {tantque} {TANT_QUE} + \@@_node:nn {normal}{\null\c_space_token(#1)\c_space_token\null} + \@@_node:nn {tantque}{FAIRE} + \@@_block:nn {tantque} {DEBUT_TANT_QUE} + #3 + \@@_block:nn {tantque} {FIN_TANT_QUE} + \@@_unindent: +} + +\NewDocumentCommand \@@_LINE:w { s O{normal} m } { + \IfBooleanTF {#1} { + \@@_indent:nn {#2} {#3} + \@@_unindent: + }{ + \@@_block:nn {#2} {#3} + } +} + +\NewDocumentCommand \@@_NODE:w { O{normal} m } { + \@@_node:nn {#1} {#2} +} + +% \end{macrocode} +% \subsection{User commands and environment} +% \begin{macrocode} + + +\cs_new_protected_nopar:Nn \@@_begincode:n { + \int_zero:N \l_@@_level_int + \begin{tikzpicture}[#1] + \coordinate (H) at (0,0); + \coordinate (A\int_use:N \l_@@_level_int) at (0,0); + \cs_set_eq:NN \par \prg_do_nothing: + \cs_set_eq:NN \; \prg_do_nothing: + \cs_set_eq:NN \LINE \@@_LINE:w + \cs_set_eq:NN \NODE \@@_NODE:w + \cs_set_eq:NN \VARIABLES \@@_VARIABLES:w + \cs_set_eq:NN \DEBUTALGORITHME \@@_DEBUTALGORITHME:w + \cs_set_eq:NN \FINALGORITHME \@@_FINALGORITHME:w + \cs_set_eq:NN \SI \@@_SI:w + \cs_set_eq:NN \POUR \@@_POUR:w + \cs_set_eq:NN \TANTQUE \@@_TANTQUE:w + \cs_set:Npn \AFFICHER {\@@_keyword:nw {AFFICHER}} + \cs_set:Npn \AFFICHERCALCUL {\@@_keyword:nw {AFFICHERCALCUL}} + \cs_set:Npn \LIRE {\@@_keyword:nw {LIRE}} + \cs_set:Npn \PAUSE {\@@_block:nn{motclef}{PAUSE}} + \cs_set:Npn \//##1\; {\@@_block:nn{commentaire}{//##1}} +} +\cs_new_protected_nopar:Nn \@@_closecode: { + \end{tikzpicture} +} + +\NewDocumentCommand \@@_keyword:nw {m +u{\;}} { + \@@_block:nn {motclef} {#1} + \@@_node:nn {normal}{\null\c_space_token#2} +} + + +\NewDocumentCommand \smalgobox { O{} m } { + \group_begin: + \@@_begincode:n {every~smalgobox/.try,#1} + \@@_parseall:n {#2} + \@@_closecode: + \group_end: +} + +\NewDocumentEnvironment {algobox} {O{}} { + \cs_set_protected:Nn \@@_algobox:n { + \@@_begincode:n {every~algobox/.try,#1} + \@@_parseall:n {##1} + \@@_closecode: + } + \Collect@Body\@@_algobox:n +}{ +} +% +% \end{macrocode} +% +% \end{implementation} diff --git a/Master/texmf-dist/source/latex/algobox/algobox.ins b/Master/texmf-dist/source/latex/algobox/algobox.ins new file mode 100644 index 00000000000..60f63628e77 --- /dev/null +++ b/Master/texmf-dist/source/latex/algobox/algobox.ins @@ -0,0 +1,24 @@ +\iffalse meta-comment + +File algobox.ins (C) Copyright 2016 RIVAUD Julien + +It may be distributed and/or modified under the conditions of the +General Public License (GPL), either version 3 of this +license or (at your option) any later version. + +\fi + +\input l3docstrip.tex +\askforoverwritefalse + +\preamble +\endpreamble +% stop docstrip adding \endinput +\postamble +\endpostamble + +\keepsilent + +\generate{\file{algobox.sty} {\from{algobox.dtx} {package}}} + +\endbatchfile diff --git a/Master/texmf-dist/tex/latex/algobox/algobox.sty b/Master/texmf-dist/tex/latex/algobox/algobox.sty new file mode 100644 index 00000000000..86be6ae0a29 --- /dev/null +++ b/Master/texmf-dist/tex/latex/algobox/algobox.sty @@ -0,0 +1,344 @@ +%% +%% This is file `algobox.sty', +%% generated with the docstrip utility. +%% +%% The original source files were: +%% +%% algobox.dtx (with options: `package') +%% +%% File: algobox.dtx (C) Copyright 2016 RIVAUD Julien +%% +%% It may be distributed and/or modified under the conditions of the +%% General Public License (GPL), either version 3 of this +%% license or (at your option) any later version. +\NeedsTeXFormat{LaTeX2e}[1995/12/01] +\RequirePackage{expl3}[2016/01/19] +\def\ExplFileName{algobox} +\def\ExplFileDescription{Typeset Algobox programs} +\def\ExplFileDate{2017/09/03} +\def\ExplFileVersion{1.1} +\ProvidesExplPackage + {\ExplFileName}{\ExplFileDate}{\ExplFileVersion}{\ExplFileDescription} +\RequirePackage{xparse} +\RequirePackage{environ} +\RequirePackage{tikz} + +\ExplSyntaxOff +\usetikzlibrary{calc} +\ExplSyntaxOn + +\RequirePackage{xcolor} + +\int_new:N \l__algobox_level_int + +\definecolor{algoboxarbre}{RGB}{146,146,146} +\colorlet {algoboxcommentaire}{algoboxarbre!70!black} +\definecolor{algoboxstructure}{RGB}{134,0,0} +\definecolor{algoboxmotclef}{RGB}{25,3,180} +\definecolor{algoboxsialors}{RGB}{147,0,128} +\definecolor{algoboxpour}{RGB}{187,136,0} +\definecolor{algoboxtantque}{RGB}{222,111,6} +\definecolor{algoboxnormal}{RGB}{0,0,0} + +\tikzset{ + every~algobox/.style=, + every~smalgobox/.style={baseline=(block.base)}, + algobox~ligne/.style={ + xshift=1em, text~depth=0pt, + inner~xsep=0.1ex, inner~ysep=0.5ex + }, + algobox~arbre/.style={ultra~thick, color=algoboxarbre}, + algobox~indentsymb/.style={x=1ex, y=0.6ex, color=algoboxarbre}, + algobox~indent/.style={xshift=2em}, + algobox~normal/.style={ + font=\sffamily, + color=algoboxnormal, + }, + algobox~commentaire/.style={ + algobox~normal/.try, + color=algoboxcommentaire, + }, + algobox~motclef/.style={ + algobox~normal/.try, + color=algoboxmotclef, + }, + algobox~structure/.style={ + font=\sffamily\bfseries, + color=algoboxstructure + }, + algobox~sialors/.style={ + algobox~structure/.try, + color=algoboxsialors, + }, + algobox~pour/.style={ + algobox~structure/.try, + color=algoboxpour, + }, + algobox~tantque/.style={ + algobox~structure/.try, + color=algoboxtantque, + }, +} + + +\tl_new:N \l__algobox_lastnode_tl +\cs_new_protected:Nn \__algobox_block:nn { + \node[algobox~ligne/.try, + \tl_if_empty:nF{#1}{algobox~#1/.try}, + anchor=north~west + ] + (block) at (A\int_use:N \l__algobox_level_int |- H) + {\vphantom{A}#2}; + \draw[algobox~arbre/.try] + (A\int_use:N \l__algobox_level_int) + -- (A\int_use:N \l__algobox_level_int |- block.west) + coordinate (A\int_use:N \l__algobox_level_int) + -- (block.west); + \coordinate (H) at (block.south); + \tl_set:Nn \l__algobox_lastnode_tl {block} +} + +\cs_new_protected:Nn \__algobox_indent:nn { + \node[algobox~ligne/.try, + \tl_if_empty:nF{#1}{algobox~#1/.try}, + anchor=north~west + ] + (block) at (A\int_use:N \l__algobox_level_int |- H) + {\vphantom{A}#2}; + \draw[algobox~arbre/.try] + (A\int_use:N \l__algobox_level_int) + -- (A\int_use:N \l__algobox_level_int |- H); + \fill[algobox~indentsymb/.try] + (A\int_use:N \l__algobox_level_int |- block.west) + +(0,-1) -- +(1,1) -- +(-1,1) -- cycle; + \coordinate (H) at (block.south); + \coordinate (T) at (A\int_use:N \l__algobox_level_int |- H); + \coordinate (A\int_use:N \l__algobox_level_int) at (T); + \int_incr:N \l__algobox_level_int + \coordinate[algobox~indent/.try] (A\int_use:N \l__algobox_level_int) at (T); + \tl_set:Nn \l__algobox_lastnode_tl {block} +} +\cs_new_protected:Nn \__algobox_unindent: { + \int_decr:N \l__algobox_level_int +} + +\cs_new_protected:Nn \__algobox_node:nn { + \node[algobox~#1/.try, anchor=base~west, inner~xsep=0pt] + (node) at (\l__algobox_lastnode_tl.base~east) {#2}; + \tl_set:Nn \l__algobox_lastnode_tl {node} +} + + +\cs_new_protected:Nn \__algobox_parseall:n { + \tl_set:Nn \l_tmpa_tl {#1} + \seq_set_split:NnV \l_tmpa_seq {\;} \l_tmpa_tl + % Now build up the algorithm body, working around the few infix notations. + \tl_clear:N \l__algobox_body_tl + \seq_map_variable:NNn \l_tmpa_seq \l_tmpa_tl { + \tl_if_in:NnT \l_tmpa_tl {\ESTDUTYPE} { + \tl_put_left:Nn \l_tmpa_tl {\__algobox_ESTDUTYPE:w} + } + \tl_if_in:NnT \l_tmpa_tl {\PRENDLAVALEUR} { + \tl_put_left:Nn \l_tmpa_tl {\__algobox_PRENDLAVALEUR:w} + } + \tl_put_right:Nn \l_tmpa_tl { \; } + \tl_put_right:NV \l__algobox_body_tl \l_tmpa_tl + } + \tl_use:N \l__algobox_body_tl +} + +\bool_new:N \l__algobox_balanced_first_bool +\cs_new_protected:Npn \__algobox_new_balanced_command:nNNnn #1#2#3 { + \cs_new_protected:cpn {#1} ##1 #2 { + \tl_set:Nn \l__algobox_prefix_tl { ##1 } + \tl_clear:N \l__algobox_balanced_tl + \bool_set_true:N \l__algobox_balanced_first_bool + \use:c {#1_stage2} #2 + } + \cs_new_protected:cpn {#1_stage2} ##1 #2 ##2 #3 { + \tl_put_right:Nn \l__algobox_balanced_tl { ##1 } + \bool_if:NF \l__algobox_balanced_first_bool { + \tl_put_right:Nn \l__algobox_balanced_tl { #2 } + } + \tl_if_in:nnTF {##2} {#2} { + \bool_set_false:N \l__algobox_balanced_first_bool + \use:c {#1_stage2} ##2 \q_mark + }{ + \tl_put_right:Nn \l__algobox_balanced_tl { ##2 } + \tl_replace_all:Nnn \l__algobox_balanced_tl {\q_mark} {#3} + \tl_set:Nx \l_tmpa_tl { + \exp_not:c {#1_stage3} + \exp_not:V \l__algobox_prefix_tl + \exp_not:n {#2} + { + \exp_not:V \l__algobox_balanced_tl + } + } + \tl_use:N \l_tmpa_tl + } + } + \exp_args:Nc \NewDocumentCommand {#1_stage3} +} + +\cs_new_protected:Npn \__algobox_if_next:NTF #1#2#3 { + \peek_meaning_remove_ignore_spaces:NTF \; { + \__algobox_if_next:NTF #1 {#2} {#3} + }{ + \peek_meaning_remove_ignore_spaces:NTF \par { + \__algobox_if_next:NTF #1 {#2} {#3} + }{ + \peek_meaning_ignore_spaces:NTF #1 {#2} {#3} + } + } +} + +\NewDocumentCommand \__algobox_VARIABLES:w {} { + \__algobox_indent:nn {structure} {VARIABLES} +} + +\NewDocumentCommand \__algobox_ESTDUTYPE:w { +u{\ESTDUTYPE} +u{\;} } { + \__algobox_block:nn {normal} { + \ignorespaces #1 \unskip\c_space_token\null + } + \__algobox_node:nn {motclef}{EST_DU_TYPE} + \__algobox_node:nn {normal}{\null\c_space_token#2} +} + +\NewDocumentCommand \__algobox_DEBUTALGORITHME:w {} { + \int_compare:nNnT \l__algobox_level_int = \c_one { + % if there was a VARIABLES before + \__algobox_unindent: + } + \__algobox_indent:nn {structure} {DEBUT_ALGORITHME} +} + +\NewDocumentCommand \__algobox_FINALGORITHME:w {} { + \int_compare:nNnT \l__algobox_level_int = \c_one { + \__algobox_unindent: + \__algobox_block:nn {structure} {FIN_ALGORITHME} + } +} + +\NewDocumentCommand \__algobox_PRENDLAVALEUR:w { u{\PRENDLAVALEUR} m } { + \__algobox_block:nn {normal} { + \ignorespaces#1\unskip\c_space_token\null + } + \__algobox_node:nn {motclef}{PREND_LA_VALEUR} + \__algobox_node:nn {normal}{\null\c_space_token#2} +} + +\__algobox_new_balanced_command:nNNnn + {__algobox_SI:w} \DEBUTSI \FINSI { r() u{\DEBUTSI} +m } +{ + \__algobox_indent:nn {sialors} {SI} + \__algobox_node:nn {normal}{\null\c_space_token(#1)\c_space_token\null} + \__algobox_node:nn {sialors}{ALORS} + \__algobox_block:nn {sialors} {DEBUT_SI} + #3 + \__algobox_block:nn {sialors} {FIN_SI} + \__algobox_if_next:NTF \SINON { + \__algobox_SINON:w + }{ + \__algobox_unindent: + } +} +\__algobox_new_balanced_command:nNNnn + {__algobox_SINON:w} \DEBUTSINON \FINSINON { u{\DEBUTSINON} +m } { + \__algobox_indent:nn {sialors} {SINON} + \__algobox_block:nn {sialors} {DEBUT_SINON} + #2 + \__algobox_block:nn {sialors} {FIN_SINON} + \__algobox_unindent: + \__algobox_unindent: +} + +\__algobox_new_balanced_command:nNNnn + {__algobox_POUR:w} \DEBUTPOUR \FINPOUR + { u{\ALLANTDE} u{\A} u{\DEBUTPOUR} +m } { + \__algobox_indent:nn {pour} {POUR} + \__algobox_node:nn {normal}{\null\c_space_token #1\unskip\c_space_token\null} + \__algobox_node:nn {pour}{ALLANT_DE} + \__algobox_node:nn {normal}{\null\c_space_token #2\unskip + \c_space_token A~#3\unskip\c_space_token\null} + \__algobox_block:nn {pour} {DEBUT_POUR} + #4 + \__algobox_block:nn {pour} {FIN_POUR} + \__algobox_unindent: +} + +\__algobox_new_balanced_command:nNNnn {__algobox_TANTQUE:w} \DEBUTTANTQUE \FINTANTQUE + { r() u{\DEBUTTANTQUE} +m } +{ + \__algobox_indent:nn {tantque} {TANT_QUE} + \__algobox_node:nn {normal}{\null\c_space_token(#1)\c_space_token\null} + \__algobox_node:nn {tantque}{FAIRE} + \__algobox_block:nn {tantque} {DEBUT_TANT_QUE} + #3 + \__algobox_block:nn {tantque} {FIN_TANT_QUE} + \__algobox_unindent: +} + +\NewDocumentCommand \__algobox_LINE:w { s O{normal} m } { + \IfBooleanTF {#1} { + \__algobox_indent:nn {#2} {#3} + \__algobox_unindent: + }{ + \__algobox_block:nn {#2} {#3} + } +} + +\NewDocumentCommand \__algobox_NODE:w { O{normal} m } { + \__algobox_node:nn {#1} {#2} +} + + +\cs_new_protected_nopar:Nn \__algobox_begincode:n { + \int_zero:N \l__algobox_level_int + \begin{tikzpicture}[#1] + \coordinate (H) at (0,0); + \coordinate (A\int_use:N \l__algobox_level_int) at (0,0); + \cs_set_eq:NN \par \prg_do_nothing: + \cs_set_eq:NN \; \prg_do_nothing: + \cs_set_eq:NN \LINE \__algobox_LINE:w + \cs_set_eq:NN \NODE \__algobox_NODE:w + \cs_set_eq:NN \VARIABLES \__algobox_VARIABLES:w + \cs_set_eq:NN \DEBUTALGORITHME \__algobox_DEBUTALGORITHME:w + \cs_set_eq:NN \FINALGORITHME \__algobox_FINALGORITHME:w + \cs_set_eq:NN \SI \__algobox_SI:w + \cs_set_eq:NN \POUR \__algobox_POUR:w + \cs_set_eq:NN \TANTQUE \__algobox_TANTQUE:w + \cs_set:Npn \AFFICHER {\__algobox_keyword:nw {AFFICHER}} + \cs_set:Npn \AFFICHERCALCUL {\__algobox_keyword:nw {AFFICHERCALCUL}} + \cs_set:Npn \LIRE {\__algobox_keyword:nw {LIRE}} + \cs_set:Npn \PAUSE {\__algobox_block:nn{motclef}{PAUSE}} + \cs_set:Npn \//##1\; {\__algobox_block:nn{commentaire}{//##1}} +} +\cs_new_protected_nopar:Nn \__algobox_closecode: { + \end{tikzpicture} +} + +\NewDocumentCommand \__algobox_keyword:nw {m +u{\;}} { + \__algobox_block:nn {motclef} {#1} + \__algobox_node:nn {normal}{\null\c_space_token#2} +} + +\NewDocumentCommand \smalgobox { O{} m } { + \group_begin: + \__algobox_begincode:n {every~smalgobox/.try,#1} + \__algobox_parseall:n {#2} + \__algobox_closecode: + \group_end: +} + +\NewDocumentEnvironment {algobox} {O{}} { + \cs_set_protected:Nn \__algobox_algobox:n { + \__algobox_begincode:n {every~algobox/.try,#1} + \__algobox_parseall:n {##1} + \__algobox_closecode: + } + \Collect@Body\__algobox_algobox:n +}{ +} +%% +%% +%% End of file `algobox.sty'. diff --git a/Master/tlpkg/bin/tlpkg-ctan-check b/Master/tlpkg/bin/tlpkg-ctan-check index 8484a19b259..46106b33c96 100755 --- a/Master/tlpkg/bin/tlpkg-ctan-check +++ b/Master/tlpkg/bin/tlpkg-ctan-check @@ -32,7 +32,7 @@ my @TLP_working = qw( adrconv adtrees advdate ae aecc aeguill afparticle afthesis aguplus aiaa aichej ajl akktex akletter alegreya alertmessage - alg algolrevived algorithm2e algorithmicx algorithms + alg algobox algolrevived algorithm2e algorithmicx algorithms alkalami allrunes almfixed alnumsec alterqcm altfont ametsoc amiri amsaddr amscls amsfonts amslatex-primer amsldoc-it amsldoc-vn diff --git a/Master/tlpkg/tlpsrc/algobox.tlpsrc b/Master/tlpkg/tlpsrc/algobox.tlpsrc new file mode 100644 index 00000000000..e69de29bb2d diff --git a/Master/tlpkg/tlpsrc/collection-mathscience.tlpsrc b/Master/tlpkg/tlpsrc/collection-mathscience.tlpsrc index 3d47aea65c0..8f3a9409aca 100644 --- a/Master/tlpkg/tlpsrc/collection-mathscience.tlpsrc +++ b/Master/tlpkg/tlpsrc/collection-mathscience.tlpsrc @@ -8,6 +8,7 @@ depend 12many depend SIstyle depend SIunits depend alg +depend algobox depend algorithm2e depend algorithmicx depend algorithms -- cgit v1.2.3