diff --git a/COPYING.LESSER.txt b/COPYING.LESSER.txt deleted file mode 100644 index f0156c5..0000000 --- a/COPYING.LESSER.txt +++ /dev/null @@ -1,165 +0,0 @@ - GNU LESSER 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. - - - This version of the GNU Lesser General Public License incorporates -the terms and conditions of version 3 of the GNU General Public -License, supplemented by the additional permissions listed below. - - 0. Additional Definitions. - - As used herein, "this License" refers to version 3 of the GNU Lesser -General Public License, and the "GNU GPL" refers to version 3 of the GNU -General Public License. - - "The Library" refers to a covered work governed by this License, -other than an Application or a Combined Work as defined below. - - An "Application" is any work that makes use of an interface provided -by the Library, but which is not otherwise based on the Library. -Defining a subclass of a class defined by the Library is deemed a mode -of using an interface provided by the Library. - - A "Combined Work" is a work produced by combining or linking an -Application with the Library. The particular version of the Library -with which the Combined Work was made is also called the "Linked -Version". - - The "Minimal Corresponding Source" for a Combined Work means the -Corresponding Source for the Combined Work, excluding any source code -for portions of the Combined Work that, considered in isolation, are -based on the Application, and not on the Linked Version. - - The "Corresponding Application Code" for a Combined Work means the -object code and/or source code for the Application, including any data -and utility programs needed for reproducing the Combined Work from the -Application, but excluding the System Libraries of the Combined Work. - - 1. Exception to Section 3 of the GNU GPL. - - You may convey a covered work under sections 3 and 4 of this License -without being bound by section 3 of the GNU GPL. - - 2. Conveying Modified Versions. - - If you modify a copy of the Library, and, in your modifications, a -facility refers to a function or data to be supplied by an Application -that uses the facility (other than as an argument passed when the -facility is invoked), then you may convey a copy of the modified -version: - - a) under this License, provided that you make a good faith effort to - ensure that, in the event an Application does not supply the - function or data, the facility still operates, and performs - whatever part of its purpose remains meaningful, or - - b) under the GNU GPL, with none of the additional permissions of - this License applicable to that copy. - - 3. Object Code Incorporating Material from Library Header Files. - - The object code form of an Application may incorporate material from -a header file that is part of the Library. You may convey such object -code under terms of your choice, provided that, if the incorporated -material is not limited to numerical parameters, data structure -layouts and accessors, or small macros, inline functions and templates -(ten or fewer lines in length), you do both of the following: - - a) Give prominent notice with each copy of the object code that the - Library is used in it and that the Library and its use are - covered by this License. - - b) Accompany the object code with a copy of the GNU GPL and this license - document. - - 4. Combined Works. - - You may convey a Combined Work under terms of your choice that, -taken together, effectively do not restrict modification of the -portions of the Library contained in the Combined Work and reverse -engineering for debugging such modifications, if you also do each of -the following: - - a) Give prominent notice with each copy of the Combined Work that - the Library is used in it and that the Library and its use are - covered by this License. - - b) Accompany the Combined Work with a copy of the GNU GPL and this license - document. - - c) For a Combined Work that displays copyright notices during - execution, include the copyright notice for the Library among - these notices, as well as a reference directing the user to the - copies of the GNU GPL and this license document. - - d) Do one of the following: - - 0) Convey the Minimal Corresponding Source under the terms of this - License, and the Corresponding Application Code in a form - suitable for, and under terms that permit, the user to - recombine or relink the Application with a modified version of - the Linked Version to produce a modified Combined Work, in the - manner specified by section 6 of the GNU GPL for conveying - Corresponding Source. - - 1) Use a suitable shared library mechanism for linking with the - Library. A suitable mechanism is one that (a) uses at run time - a copy of the Library already present on the user's computer - system, and (b) will operate properly with a modified version - of the Library that is interface-compatible with the Linked - Version. - - e) Provide Installation Information, but only if you would otherwise - be required to provide such information under section 6 of the - GNU GPL, and only to the extent that such information is - necessary to install and execute a modified version of the - Combined Work produced by recombining or relinking the - Application with a modified version of the Linked Version. (If - you use option 4d0, the Installation Information must accompany - the Minimal Corresponding Source and Corresponding Application - Code. If you use option 4d1, you must provide the Installation - Information in the manner specified by section 6 of the GNU GPL - for conveying Corresponding Source.) - - 5. Combined Libraries. - - You may place library facilities that are a work based on the -Library side by side in a single library together with other library -facilities that are not Applications and are not covered by this -License, and convey such a combined library under terms of your -choice, if you do both of the following: - - a) Accompany the combined library with a copy of the same work based - on the Library, uncombined with any other library facilities, - conveyed under the terms of this License. - - b) Give prominent notice with the combined library that part of it - is a work based on the Library, and explaining where to find the - accompanying uncombined form of the same work. - - 6. Revised Versions of the GNU Lesser General Public License. - - The Free Software Foundation may publish revised and/or new versions -of the GNU Lesser 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 -Library as you received it specifies that a certain numbered version -of the GNU Lesser General Public License "or any later version" -applies to it, you have the option of following the terms and -conditions either of that published version or of any later version -published by the Free Software Foundation. If the Library as you -received it does not specify a version number of the GNU Lesser -General Public License, you may choose any version of the GNU Lesser -General Public License ever published by the Free Software Foundation. - - If the Library as you received it specifies that a proxy can decide -whether future versions of the GNU Lesser General Public License shall -apply, that proxy's public statement of acceptance of any version is -permanent authorization for you to choose that version for the -Library. \ No newline at end of file diff --git a/COPYING.txt b/COPYING.txt deleted file mode 100644 index f718b3e..0000000 --- a/COPYING.txt +++ /dev/null @@ -1,621 +0,0 @@ - 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 \ No newline at end of file diff --git a/CREDITS.txt b/CREDITS.txt deleted file mode 100644 index d450512..0000000 --- a/CREDITS.txt +++ /dev/null @@ -1,2 +0,0 @@ -alexjc @ AiGameDev.com: The main 'push' behind this quick little library. He's the guy who got me interested in behavior trees. -amadmonk @ MMOwned.com: The original implementation of the IEnumerable version of the Composite class. Major changes have been made since, but I owe a great deal of code to him. \ No newline at end of file diff --git a/ProjectHome.md b/ProjectHome.md new file mode 100644 index 0000000..c43ebf8 --- /dev/null +++ b/ProjectHome.md @@ -0,0 +1 @@ +A simplistic behavior tree implementation using C# 4.0 \ No newline at end of file diff --git a/TreeSharp/Action.cs b/TreeSharp/Action.cs deleted file mode 100644 index 8e68f55..0000000 --- a/TreeSharp/Action.cs +++ /dev/null @@ -1,82 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System.Collections.Generic; - -namespace TreeSharp -{ - public delegate RunStatus ActionDelegate(object context); - - public delegate void ActionSucceedDelegate(object context); - - /// - /// The base Action class. A simple, easy to use, way to execute actions, and return their status of execution. - /// These are normally considered 'atoms' in that they are executed in their entirety. - /// - public class Action : Composite - { - public Action() - { - } - - public Action(ActionDelegate action) - { - Runner = action; - } - - public Action(ActionSucceedDelegate action) - { - SucceedRunner = action; - } - - public ActionDelegate Runner { get; private set; } - - public ActionSucceedDelegate SucceedRunner { get; private set; } - - /// - /// Runs this action, and returns a describing it's current state of execution. - /// If this method is not overriden, it returns . - /// - /// - protected virtual RunStatus Run(object context) - { - return RunStatus.Failure; - } - - public override sealed IEnumerable Execute(object context) - { - RunStatus status = RunStatus.Running; - while (status == RunStatus.Running) { - if (Runner != null) { - status = Runner(context); - } else if (SucceedRunner != null) { - SucceedRunner(context); - status = RunStatus.Success; - } else { - status = Run(context); - } - - yield return status; - } - } - } -} diff --git a/TreeSharp/Composite.cs b/TreeSharp/Composite.cs deleted file mode 100644 index d0e9b94..0000000 --- a/TreeSharp/Composite.cs +++ /dev/null @@ -1,233 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System; -using System.Collections.Generic; - -namespace TreeSharp -{ - /// - /// The base class of the entire behavior tree system. - /// Nearly all branches derive from this class. - /// - public abstract class Composite : IEquatable - { - // protected static readonly object Locker = new object(); - - private IEnumerator _current; - - protected Composite() - { - Guid = Guid.NewGuid(); - CleanupHandlers = new Stack(); - } - - public RunStatus? LastStatus { get; set; } - - protected ContextChangeHandler ContextChanger { get; set; } - - protected Stack CleanupHandlers { get; set; } - - public Composite Parent { get; set; } - - /// - /// Simply an identifier to make sure each composite is 'unique'. - /// Useful for XML declaration parsing. - /// - protected Guid Guid { get; set; } - - #region IEquatable Members - - /// - /// Indicates whether the current object is equal to another object of the same type. - /// - /// - /// true if the current object is equal to the parameter; otherwise, false. - /// - /// An object to compare with this object. - public bool Equals(Composite other) - { - if (ReferenceEquals(null, other)) - { - return false; - } - if (ReferenceEquals(this, other)) - { - return true; - } - return other.Guid.Equals(Guid); - } - - #endregion - - /// - /// Determines whether the specified is equal to the current . - /// - /// - /// true if the specified is equal to the current ; otherwise, false. - /// - /// The to compare with the current . - /// 2 - public override bool Equals(object obj) - { - if (ReferenceEquals(null, obj)) - { - return false; - } - if (ReferenceEquals(this, obj)) - { - return true; - } - if (obj.GetType() != typeof(Composite)) - { - return false; - } - return Equals((Composite)obj); - } - - /// - /// Serves as a hash function for a particular type. - /// - /// - /// A hash code for the current . - /// - /// 2 - public override int GetHashCode() - { - return Guid.GetHashCode(); - } - - public static bool operator ==(Composite left, Composite right) - { - return Equals(left, right); - } - - public static bool operator !=(Composite left, Composite right) - { - return !Equals(left, right); - } - - public abstract IEnumerable Execute(object context); - - public RunStatus Tick(object context) - { - // lock (Locker) - { - if (LastStatus.HasValue && LastStatus != RunStatus.Running) - { - return LastStatus.Value; - } - if (_current == null) - { - throw new ApplicationException("Cannot run Tick before running Start first!"); - } - if (_current.MoveNext()) - { - LastStatus = _current.Current; - } - else - { - throw new ApplicationException("Nothing to run? Somethings gone terribly, terribly wrong! last: " + LastStatus); - } - - if (LastStatus != RunStatus.Running) - { - Stop(context); - } - - return LastStatus.Value; - } - } - - public virtual void Start(object context) - { - LastStatus = null; - _current = Execute(context).GetEnumerator(); - } - - public virtual void Stop(object context) - { - Cleanup(); - if (_current != null) - { - _current.Dispose(); - _current = null; - } - - if (LastStatus.HasValue && LastStatus.Value == RunStatus.Running) - { - LastStatus = RunStatus.Failure; - } - } - - protected void Cleanup() - { - if (CleanupHandlers.Count != 0) - { - // lock (Locker) - { - while (CleanupHandlers.Count != 0) - { - CleanupHandlers.Pop().Dispose(); - } - } - } - } - - #region Nested type: CleanupHandler - - protected abstract class CleanupHandler : IDisposable - { - protected CleanupHandler(Composite owner, object context) - { - Owner = owner; - Context = context; - } - - protected Composite Owner { get; set; } - - private object Context { get; set; } - - private bool IsDisposed { get; set; } - - #region IDisposable Members - - public void Dispose() - { - if (!IsDisposed) - { - // lock (Locker) - { - IsDisposed = true; - DoCleanup(Context); - } - } - } - - #endregion - - protected abstract void DoCleanup(object context); - } - - #endregion - } -} diff --git a/TreeSharp/Decorator.cs b/TreeSharp/Decorator.cs deleted file mode 100644 index 89f9d3f..0000000 --- a/TreeSharp/Decorator.cs +++ /dev/null @@ -1,94 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System; -using System.Collections.Generic; - -namespace TreeSharp -{ - public delegate bool CanRunDecoratorDelegate(object context); - - public class Decorator : GroupComposite - { - public Decorator(CanRunDecoratorDelegate runFunc, Composite child) - : this(child) - { - Runner = runFunc; - } - - public Decorator(Composite child) - : base(child) - { - } - - protected CanRunDecoratorDelegate Runner { get; private set; } - - public Composite DecoratedChild { get { return Children[0]; } } - - protected virtual bool CanRun(object context) - { - return true; - } - - public override void Start(object context) - { - if (Children.Count != 1) - { - throw new ApplicationException("Decorators must have only one child."); - } - base.Start(context); - } - - public override IEnumerable Execute(object context) - { - if (Runner != null) - { - if (!Runner(context)) - { - yield return RunStatus.Failure; - yield break; - } - } - else if (!CanRun(context)) - { - yield return RunStatus.Failure; - yield break; - } - - DecoratedChild.Start(context); - while (DecoratedChild.Tick(context) == RunStatus.Running) - { - yield return RunStatus.Running; - } - - DecoratedChild.Stop(context); - if (DecoratedChild.LastStatus == RunStatus.Failure) - { - yield return RunStatus.Failure; - yield break; - } - - yield return RunStatus.Success; - yield break; - } - } -} \ No newline at end of file diff --git a/TreeSharp/DecoratorContinue.cs b/TreeSharp/DecoratorContinue.cs deleted file mode 100644 index 700725b..0000000 --- a/TreeSharp/DecoratorContinue.cs +++ /dev/null @@ -1,88 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System.Collections.Generic; - -namespace TreeSharp -{ - /// - /// A decorator that allows you to execute code only if some condition is met. It does not 'break' the current - /// tree if the condition fails, or children fail. - /// - /// This is useful for "if I need to, go ahead, otherwise, ignore" in sequences. - /// - /// It can be thought of as an optional execution. - /// - /// - /// Created 1/13/2011. - /// - public class DecoratorContinue : Decorator - { - public DecoratorContinue(CanRunDecoratorDelegate func, Composite decorated) - : base(func, decorated) - { - } - - public DecoratorContinue(Composite child) - : base(child) - { - } - - private RunStatus GetContinuationStatus() - { - // Selectors run until we fail. - if (Parent is Selector) - { - return RunStatus.Failure; - } - // Everything else, we want to 'succeed'. - return RunStatus.Success; - } - - public override IEnumerable Execute(object context) - { - if (!CanRun(context)) - { - yield return RunStatus.Success; - yield break; - } - - DecoratedChild.Start(context); - while (DecoratedChild.Tick(context) == RunStatus.Running) - { - yield return RunStatus.Running; - } - - DecoratedChild.Stop(context); - if (DecoratedChild.LastStatus == RunStatus.Failure) - { - yield return GetContinuationStatus(); - yield break; - } - - // Note: if the condition was met, and we succeeded in running the children, we HAVE to tell our parent - // that we've ran successfully, or we'll skip down to the next child, regardless of whether we ran, or not. - yield return RunStatus.Success; - yield break; - } - } -} diff --git a/TreeSharp/GroupComposite.cs b/TreeSharp/GroupComposite.cs deleted file mode 100644 index ef377ba..0000000 --- a/TreeSharp/GroupComposite.cs +++ /dev/null @@ -1,89 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System.Collections.Generic; - -namespace TreeSharp -{ - public abstract class GroupComposite : Composite - { - protected GroupComposite(params Composite[] children) - { - Children = new List(children); - foreach (Composite composite in Children) - { - if (composite != null) - { - composite.Parent = this; - } - } - } - - public List Children { get; set; } - - public Composite Selection { get; protected set; } - - public override void Start(object context) - { - CleanupHandlers.Push(new ChildrenCleanupHandler(this, context)); - base.Start(context); - } - - public void AddChild(Composite child) - { - if (child != null) - { - child.Parent = this; - Children.Add(child); - } - } - - public void InsertChild(int index, Composite child) - { - if (child != null) - { - child.Parent = this; - Children.Insert(index, child); - } - } - - #region Nested type: ChildrenCleanupHandler - - protected class ChildrenCleanupHandler : CleanupHandler - { - public ChildrenCleanupHandler(GroupComposite owner, object context) - : base(owner, context) - { - } - - protected override void DoCleanup(object context) - { - foreach (Composite composite in (Owner as GroupComposite).Children) - { - composite.Stop(context); - } - } - } - - #endregion - } -} \ No newline at end of file diff --git a/TreeSharp/Interrupt.cs b/TreeSharp/Interrupt.cs deleted file mode 100644 index 5252b76..0000000 --- a/TreeSharp/Interrupt.cs +++ /dev/null @@ -1,92 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System; -using System.Collections.Generic; - -namespace TreeSharp -{ - public delegate bool InterruptCheckDecoratorDelegate(object context); - - public class Interrupt : GroupComposite - { - public Interrupt(InterruptCheckDecoratorDelegate interruptCondition, Composite child) - : this(child) - { - InterruptCondition = interruptCondition; - } - - public Interrupt(Composite child) - : base(child) - { - } - - protected InterruptCheckDecoratorDelegate InterruptCondition { get; private set; } - - public Composite DecoratedChild { get { return Children[0]; } } - - protected virtual bool InterruptCheck(object context) - { - return false; - } - - public override void Start(object context) - { - if (Children.Count != 1) - { - throw new ApplicationException("Decorators must have only one child."); - } - base.Start(context); - } - - public override IEnumerable Execute(object context) - { - DecoratedChild.Start(context); - while (DecoratedChild.Tick(context) == RunStatus.Running) - { - if (InterruptCondition != null) - { - if (InterruptCondition(context)) - { - break; - } - } - else if (InterruptCheck(context)) - { - break; - } - - yield return RunStatus.Running; - } - - DecoratedChild.Stop(context); - if (DecoratedChild.LastStatus != RunStatus.Success) - { - yield return RunStatus.Failure; - yield break; - } - - yield return RunStatus.Success; - yield break; - } - } -} diff --git a/TreeSharp/Inverter.cs b/TreeSharp/Inverter.cs deleted file mode 100644 index ca48905..0000000 --- a/TreeSharp/Inverter.cs +++ /dev/null @@ -1,65 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System; -using System.Collections.Generic; - -namespace TreeSharp -{ - public class Inverter : GroupComposite - { - public Inverter(Composite child) - : base(child) - { - } - - public Composite DecoratedChild { get { return Children[0]; } } - - public override void Start(object context) - { - if (Children.Count != 1) - { - throw new ApplicationException("Inverter must have only one child."); - } - base.Start(context); - } - - public override IEnumerable Execute(object context) - { - DecoratedChild.Start(context); - while (DecoratedChild.Tick(context) == RunStatus.Running) - { - yield return RunStatus.Running; - } - - DecoratedChild.Stop(context); - if (DecoratedChild.LastStatus == RunStatus.Failure) - { - yield return RunStatus.Success; - yield break; - } - - yield return RunStatus.Failure; - yield break; - } - } -} diff --git a/TreeSharp/Parallel.cs b/TreeSharp/Parallel.cs deleted file mode 100644 index 233b612..0000000 --- a/TreeSharp/Parallel.cs +++ /dev/null @@ -1,125 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System.Collections.Generic; - -namespace TreeSharp -{ - public class Parallel : Composite - { - public Parallel(params Composite[] children) - { - Children = new List(children); - foreach (Composite composite in Children) - { - if (composite != null) - { - composite.Parent = this; - } - } - } - - public List Children { get; set; } - - public override void Start(object context) - { - CleanupHandlers.Push(new ChildrenCleanupHandler(this, context)); - base.Start(context); - } - - public void AddChild(Composite child) - { - if (child != null) - { - child.Parent = this; - Children.Add(child); - } - } - - public void InsertChild(int index, Composite child) - { - if (child != null) - { - child.Parent = this; - Children.Insert(index, child); - } - } - - public override IEnumerable Execute(object context) { - if (ContextChanger != null) - { - context = ContextChanger(context); - } - - foreach (var child in Children) { - child.Start(context); - } - - var runningChildren = new LinkedList(Children); - while (runningChildren.Count > 0) { - for (var it = runningChildren.First; it != null;) { - var child = it.Value; - var result = child.Tick(context); - if (result == RunStatus.Failure) { - yield return RunStatus.Failure; - yield break; - } - - if (result == RunStatus.Success) { - var next = it.Next; - runningChildren.Remove(it); - it = next; - } else { - it = it.Next; - } - } - - if (runningChildren.Count > 0) { - yield return RunStatus.Running; - } - } - - yield return RunStatus.Success; - yield break; - } - - #region Nested type: ChildrenCleanupHandler - - protected class ChildrenCleanupHandler : CleanupHandler - { - public ChildrenCleanupHandler(Parallel owner, object context) - : base(owner, context) - { - } - - protected override void DoCleanup(object context) - { - foreach (Composite composite in (Owner as Parallel).Children) - { - composite.Stop(context); - } - } - } - - #endregion - } -} diff --git a/TreeSharp/ParallelSelector.cs b/TreeSharp/ParallelSelector.cs deleted file mode 100644 index 186c824..0000000 --- a/TreeSharp/ParallelSelector.cs +++ /dev/null @@ -1,125 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System.Collections.Generic; - -namespace TreeSharp -{ - public class ParallelSelector : Composite - { - public ParallelSelector(params Composite[] children) - { - Children = new List(children); - foreach (Composite composite in Children) - { - if (composite != null) - { - composite.Parent = this; - } - } - } - - public List Children { get; set; } - - public override void Start(object context) - { - CleanupHandlers.Push(new ChildrenCleanupHandler(this, context)); - base.Start(context); - } - - public void AddChild(Composite child) - { - if (child != null) - { - child.Parent = this; - Children.Add(child); - } - } - - public void InsertChild(int index, Composite child) - { - if (child != null) - { - child.Parent = this; - Children.Insert(index, child); - } - } - - public override IEnumerable Execute(object context) { - if (ContextChanger != null) - { - context = ContextChanger(context); - } - - foreach (var child in Children) { - child.Start(context); - } - - var runningChildren = new LinkedList(Children); - while (runningChildren.Count > 0) { - for (var it = runningChildren.First; it != null;) { - var child = it.Value; - var result = child.Tick(context); - if (result == RunStatus.Success) { - yield return RunStatus.Success; - yield break; - } - - if (result == RunStatus.Success) { - var next = it.Next; - runningChildren.Remove(it); - it = next; - } else { - it = it.Next; - } - } - - if (runningChildren.Count > 0) { - yield return RunStatus.Running; - } - } - - yield return RunStatus.Failure; - yield break; - } - - #region Nested type: ChildrenCleanupHandler - - protected class ChildrenCleanupHandler : CleanupHandler - { - public ChildrenCleanupHandler(ParallelSelector owner, object context) - : base(owner, context) - { - } - - protected override void DoCleanup(object context) - { - foreach (Composite composite in (Owner as ParallelSelector).Children) - { - composite.Stop(context); - } - } - } - - #endregion - } -} diff --git a/TreeSharp/PrioritySelector.cs b/TreeSharp/PrioritySelector.cs deleted file mode 100644 index 2968c59..0000000 --- a/TreeSharp/PrioritySelector.cs +++ /dev/null @@ -1,89 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System.Collections.Generic; - -namespace TreeSharp -{ - /// - /// Will execute each branch of logic in order, until one succeeds. This composite - /// will fail only if all branches fail as well. - /// - public class PrioritySelector : Selector - { - public PrioritySelector(params Composite[] children) - : base(children) - { - } - - public PrioritySelector(ContextChangeHandler contextChange, params Composite[] children) - : this(children) - { - ContextChanger = contextChange; - } - - public override IEnumerable Execute(object context) - { - // lock (Locker) - { - // Keep in mind; we ARE an enumerator here. So we do execute each child in tandem. - foreach (Composite node in Children) - { - // All behaviors are 'Decorators' by default. This just makes it simple. - // and allows us to not have another class that is nothing but a Decorator : Behavior - // Though; it may be a good idea in the future to add. - // Keep in mind!!! - // Start is called EVERY time we check a behavior! REGARDLESS OF IT'S RETURN VALUE! - // This makes sure we don't end up with a corrupted state that always returns 'Running' - // when it's actualled 'Success' or 'Failed' - node.Start(context); - // If the current node is still running; return so. Don't 'break' the enumerator - while (node.Tick(context) == RunStatus.Running) - { - Selection = node; - yield return RunStatus.Running; - } - - // Clear the selection... since we don't have one! Duh. - Selection = null; - // Call Stop to allow the node to cleanup anything. Since we don't need it anymore. - node.Stop(context); - // If it succeeded (since we're a selector) we return that this GroupNode - // succeeded in executing. - if (node.LastStatus == RunStatus.Success) - { - yield return RunStatus.Success; - yield break; - } - - // XXX - Removed. This would make us use an extra 'tick' just to get to the next child composite. - // Still running, so continue on! - //yield return RunStatus.Running; - } - // We ran out of children, and none succeeded. Return failed. - yield return RunStatus.Failure; - // Make sure we tell our parent composite, that we're finished. - yield break; - } - } - } -} diff --git a/TreeSharp/RandomSelector.cs b/TreeSharp/RandomSelector.cs deleted file mode 100644 index 5785f8e..0000000 --- a/TreeSharp/RandomSelector.cs +++ /dev/null @@ -1,100 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System.Collections.Generic; - -namespace TreeSharp -{ - /// - /// Will execute randomly a branch of logic. If the branch returns running. It will be called again on next run.. - /// - public class RandomSelector : Selector - { - private System.Random _random; - - public RandomSelector(int seed, params Composite[] children) - : base(children) - { - _random = new System.Random(seed); - } - - public RandomSelector(params Composite[] children) - : base(children) - { - _random = new System.Random(); - } - - public RandomSelector(int seed, ContextChangeHandler contextChange, params Composite[] children) - : this(seed, children) - { - ContextChanger = contextChange; - } - - public RandomSelector(ContextChangeHandler contextChange, params Composite[] children) - : this(children) - { - ContextChanger = contextChange; - } - - public override IEnumerable Execute(object context) - { - // lock (Locker) - { - while (Children.Count > 0) { - var node = Children[_random.Next(0, Children.Count)]; - node.Start(context); - - while (node.Tick(context) == RunStatus.Running) - { - Selection = node; - yield return RunStatus.Running; - } - - // Clear the selection... since we don't have one! Duh. - Selection = null; - // Call Stop to allow the node to cleanup anything. Since we don't need it anymore. - node.Stop(context); - // If it succeeded (since we're a selector) we return that this GroupNode - // succeeded in executing. - if (node.LastStatus == RunStatus.Success) - { - yield return RunStatus.Success; - yield break; - } else if (node.LastStatus == RunStatus.Failure) { - yield return RunStatus.Failure; - yield break; - } - - // XXX - Removed. This would make us use an extra 'tick' just to get to the next child composite. - // Still running, so continue on! - //yield return RunStatus.Running; - // - } - - // We ran out of children, and none succeeded. Return failed. - yield return RunStatus.Failure; - // Make sure we tell our parent composite, that we're finished. - yield break; - } - } - } -} diff --git a/TreeSharp/RunStatus.cs b/TreeSharp/RunStatus.cs deleted file mode 100644 index 366c370..0000000 --- a/TreeSharp/RunStatus.cs +++ /dev/null @@ -1,34 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -namespace TreeSharp -{ - /// - /// Values that can be returned from composites and the like. - /// - public enum RunStatus - { - Success, - Failure, - Running, - } -} \ No newline at end of file diff --git a/TreeSharp/Selector.cs b/TreeSharp/Selector.cs deleted file mode 100644 index 5e2a8da..0000000 --- a/TreeSharp/Selector.cs +++ /dev/null @@ -1,76 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System; -using System.Collections.Generic; -using System.Linq; - -namespace TreeSharp -{ - /// - /// The base selector class. This will attempt to execute all branches of logic, until one succeeds. - /// This composite will fail only if all branches fail as well. - /// - public abstract class Selector : GroupComposite - { - public Selector(params Composite[] children) : base(children) - { - } - - public abstract override IEnumerable Execute(object context); - } - - public class ProbabilitySelection - { - public Composite Branch; - - public double ChanceToExecute; - - public ProbabilitySelection(Composite branch, double chanceToExecute) - { - Branch = branch; - ChanceToExecute = chanceToExecute; - } - } - - /// - /// Will execute random branches of logic, until one succeeds. This composite - /// will fail only if all branches fail as well. - /// - public class ProbabilitySelector : Selector - { - public ProbabilitySelector(params ProbabilitySelection[] children) : base(children.Select(c => c.Branch).ToArray()) - { - PossibleBranches = children.OrderBy(c => c.ChanceToExecute).ToArray(); - Randomizer = new Random(); - } - - private ProbabilitySelection[] PossibleBranches { get; set; } - - protected Random Randomizer { get; private set; } - - public override IEnumerable Execute(object context) - { - throw new NotImplementedException(); - } - } -} \ No newline at end of file diff --git a/TreeSharp/Sequence.cs b/TreeSharp/Sequence.cs deleted file mode 100644 index eddd040..0000000 --- a/TreeSharp/Sequence.cs +++ /dev/null @@ -1,75 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System.Collections.Generic; - -namespace TreeSharp -{ - public delegate object ContextChangeHandler(object original); - - /// - /// The base sequence class. This will execute each branch of logic, in order. - /// If all branches succeed, this composite will return a successful run status. - /// If any branch fails, this composite will return a failed run status. - /// - public class Sequence : GroupComposite - { - public Sequence(params Composite[] children) - : base(children) - { - } - - public Sequence(ContextChangeHandler contextChange, params Composite[] children) - : this(children) - { - ContextChanger = contextChange; - } - - public override IEnumerable Execute(object context) - { - if (ContextChanger != null) - { - context = ContextChanger(context); - } - foreach (Composite node in Children) - { - node.Start(context); - while (node.Tick(context) == RunStatus.Running) - { - Selection = node; - yield return RunStatus.Running; - } - - Selection = null; - node.Stop(context); - - if (node.LastStatus == RunStatus.Failure) - { - yield return RunStatus.Failure; - yield break; - } - } - yield return RunStatus.Success; - yield break; - } - } -} \ No newline at end of file diff --git a/TreeSharp/Switch.cs b/TreeSharp/Switch.cs deleted file mode 100644 index 878642b..0000000 --- a/TreeSharp/Switch.cs +++ /dev/null @@ -1,146 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System; -using System.Collections.Generic; -using System.Linq; - -namespace TreeSharp -{ - /// - /// This composite will perform a 'switch' statement to execute a specific branch of logic. - /// This is useful for selecting specific branches, for different types of agents. (e.g. rogue, mage, and warrior branches) - /// - /// - public class Switch : GroupComposite - { - public Switch(Func statement, params SwitchArgument[] args) : base(args.Select(a => a.Branch).ToArray()) - { - Statement = statement; - Arguments = args; - } - - public Switch(Func statement, Composite defaultArgument, params SwitchArgument[] args) : this(statement, args) - { - Default = defaultArgument; - } - - /// - /// The statement assigned to this Switch that will determine which logical branch to take. - /// - protected Func Statement { get; set; } - - /// - /// The switch arguments. - /// - protected SwitchArgument[] Arguments { get; set; } - - /// - /// The 'default' argument to be carried out if no other switch conditions are met. - /// - protected Composite Default { get; set; } - - protected void RunSwitch() - { - if (Arguments == null && Default == null) - { - throw new NullReferenceException("Switch statement has no arguments, and no default statement. Can not run."); - } - - if (Statement == null) - { - throw new NullReferenceException("Switch statement is null."); - } - - // Run the statement, and get the value for our switch. - T value = Statement(); - - // Since we can't do an *actual* switch statement, - // this is the best we can do. It works in the same way, - // except that it's slower, and may cause severe performance - // hits if there are a large number of switch cases. - if (Arguments != null) - { - // Make sure we don't do this query twice. - SwitchArgument arg = Arguments.First(a => a.RequiredValue.Equals(value)); - if (arg != null) - { - Selection = arg.Branch; - - // BUGFIX (http://code.google.com/p/treesharp/issues/detail?id=3) - return; - } - } - - if (Default != null) - { - Selection = Default; - } - } - - public override IEnumerable Execute(object context) - { - RunSwitch(); - - if (Selection == null) - { - throw new IndexOutOfRangeException("No valid statement was found to match the switch value."); - } - - Selection.Start(context); - while (Selection.Tick(context) == RunStatus.Running) - { - yield return RunStatus.Running; - } - - Selection.Stop(context); - - if (Selection.LastStatus == RunStatus.Failure) - { - yield return RunStatus.Failure; - yield break; - } - - yield return RunStatus.Success; - yield break; - } - } - - public class SwitchArgument - { - public SwitchArgument(Composite branch, T requiredValue = default(T)) - { - Branch = branch; - RequiredValue = requiredValue; - } - - /// - /// A branch of logic that will be executed if this argument is the correct switch. - /// - public Composite Branch { get; set; } - - /// - /// The value required for this logic branch to be executed. - /// - public T RequiredValue { get; set; } - } -} \ No newline at end of file diff --git a/TreeSharp/UntilFailure.cs b/TreeSharp/UntilFailure.cs deleted file mode 100644 index c4329b2..0000000 --- a/TreeSharp/UntilFailure.cs +++ /dev/null @@ -1,67 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System; -using System.Collections.Generic; - -namespace TreeSharp -{ - public class UntilFailure : GroupComposite - { - public UntilFailure(Composite child) - : base(child) - { - } - - public Composite DecoratedChild { get { return Children[0]; } } - - public override void Start(object context) - { - if (Children.Count != 1) - { - throw new ApplicationException("Inverter must have only one child."); - } - base.Start(context); - } - - public override IEnumerable Execute(object context) - { - do - { - DecoratedChild.Start(context); - while (DecoratedChild.Tick(context) == RunStatus.Running) - { - yield return RunStatus.Running; - } - - DecoratedChild.Stop(context); - - if (DecoratedChild.LastStatus != RunStatus.Failure) { - yield return RunStatus.Running; - } - } while (DecoratedChild.LastStatus != RunStatus.Failure); - - yield return RunStatus.Success; - yield break; - } - } -} diff --git a/TreeSharp/UntilSuccess.cs b/TreeSharp/UntilSuccess.cs deleted file mode 100644 index 60734c1..0000000 --- a/TreeSharp/UntilSuccess.cs +++ /dev/null @@ -1,68 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System; -using System.Collections.Generic; - -namespace TreeSharp -{ - public class UntilSuccess : GroupComposite - { - public UntilSuccess(Composite child) - : base(child) - { - } - - public Composite DecoratedChild { get { return Children[0]; } } - - public override void Start(object context) - { - if (Children.Count != 1) - { - throw new ApplicationException("Inverter must have only one child."); - } - base.Start(context); - } - - public override IEnumerable Execute(object context) - { - do - { - DecoratedChild.Start(context); - while (DecoratedChild.Tick(context) == RunStatus.Running) - { - yield return RunStatus.Running; - } - - DecoratedChild.Stop(context); - - if (DecoratedChild.LastStatus != RunStatus.Success) { - yield return RunStatus.Running; - } - - } while (DecoratedChild.LastStatus != RunStatus.Success); - - yield return RunStatus.Success; - yield break; - } - } -} diff --git a/TreeSharp/Wait.cs b/TreeSharp/Wait.cs deleted file mode 100644 index 9a4b1b7..0000000 --- a/TreeSharp/Wait.cs +++ /dev/null @@ -1,133 +0,0 @@ -#region License - -// A simplistic Behavior Tree implementation in C# -// Copyright (C) 2010-2011 ApocDev apocdev@gmail.com -// -// This file is part of TreeSharp -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU Lesser 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 . - -#endregion - -using System; -using System.Collections.Generic; - -namespace TreeSharp -{ - /// - /// Implements a 'wait' composite. This composite will return Running until some condition is met, or it has - /// exceeded its alloted wait time. - /// - /// - /// Created 1/13/2011. - /// - public class Wait : Decorator - { - private DateTime _end; - - /// - /// Creates a new Wait decorator using the specified timeout, run delegate, and child composite. - /// - /// - /// - /// - public Wait(int timeoutSeconds, CanRunDecoratorDelegate runFunc, Composite child) - : base(runFunc, child) - { - Timeout = new TimeSpan(0, 0, timeoutSeconds); - } - - /// - /// Creates a new Wait decorator with an 'infinite' timeout, the specified run delegate, and a child composite. - /// - /// - /// - public Wait(CanRunDecoratorDelegate runFunc, Composite child) : this(int.MaxValue, runFunc, child) - { - } - - /// - /// Creates a new Wait decorator with the specified timeout, and child composite. - /// - /// - /// - public Wait(int timeoutSeconds, Composite child) - : base(child) - { - Timeout = new TimeSpan(0, 0, timeoutSeconds); - } - - /// - /// The current timeout for this Wait, as expressed in total seconds. - /// - public TimeSpan Timeout { get; set; } - - public override void Start(object context) - { - _end = DateTime.Now + Timeout; - base.Start(context); - } - - public override void Stop(object context) - { - _end = DateTime.MinValue; - base.Stop(context); - } - - public override IEnumerable Execute(object context) - { - while (DateTime.Now < _end) - { - if (Runner != null) - { - if (Runner(context)) - { - break; - } - } - else - { - if (CanRun(context)) - { - break; - } - } - - yield return RunStatus.Running; - } - - if (DateTime.Now < _end) - { - yield return RunStatus.Failure; - yield break; - } - - DecoratedChild.Start(context); - while (DecoratedChild.Tick(context) == RunStatus.Running) - { - yield return RunStatus.Running; - } - - DecoratedChild.Stop(context); - if (DecoratedChild.LastStatus == RunStatus.Failure) - { - yield return RunStatus.Failure; - yield break; - } - - yield return RunStatus.Success; - yield break; - } - } -} \ No newline at end of file