titan-debug-yampa (empty) → 1.0.0
raw patch · 14 files changed
+1961/−0 lines, 14 filesdep +IfElsedep +SDLdep +SDL-gfxsetup-changed
Dependencies added: IfElse, SDL, SDL-gfx, Yampa, base, network, network-bsd, stm, titan-debug-yampa, transformers
Files
- ChangeLog.md +5/−0
- LICENSE +674/−0
- Setup.hs +2/−0
- examples/BouncingBall.hs +103/−0
- src/Data/Extra.hs +28/−0
- src/FRP/Titan/Debug/Comm.hs +28/−0
- src/FRP/Titan/Debug/CommTCP.hs +218/−0
- src/FRP/Titan/Debug/Command.hs +73/−0
- src/FRP/Titan/Debug/History.hs +254/−0
- src/FRP/Titan/Debug/Predicates.hs +18/−0
- src/FRP/Titan/Debug/Preferences.hs +13/−0
- src/FRP/Titan/Debug/SimMonad.hs +103/−0
- src/FRP/Titan/Debug/Yampa.hs +342/−0
- titan-debug-yampa.cabal +100/−0
+ ChangeLog.md view
@@ -0,0 +1,5 @@+# Revision history for titan-yampa-bridge++## 1.0.0 -- 2020-01-18++* First release on hackage.
+ LICENSE view
@@ -0,0 +1,674 @@+ GNU GENERAL PUBLIC LICENSE+ Version 3, 29 June 2007++ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>+ 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.++ <one line to give the program's name and a brief idea of what it does.>+ Copyright (C) <year> <name of author>++ 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 <http://www.gnu.org/licenses/>.++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:++ <program> Copyright (C) <year> <name of author>+ 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+<http://www.gnu.org/licenses/>.++ 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+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+ Setup.hs view
@@ -0,0 +1,2 @@+import Distribution.Simple+main = defaultMain
+ examples/BouncingBall.hs view
@@ -0,0 +1,103 @@+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE TypeSynonymInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE Arrows #-}+{-# LANGUAGE ForeignFunctionInterface #-}+{-# OPTIONS_GHC -fno-warn-unused-do-bind #-}+import Graphics.UI.SDL as SDL+import Graphics.UI.SDL.Primitives as SDL+import FRP.Yampa as Yampa+import Data.IORef+import FRP.Titan.Debug.Core+import FRP.Titan.Debug.CommTCP++width :: Num a => a+width = 640+height :: Num a => a+height = 480++main = do+ timeRef <- newIORef (0 :: Int)+ bridge <- mkTitanCommTCPBridge+ reactimateControl+ bridge -- Communication channels+ defaultPreferences -- Simulation preferences+ ([] :: [Command PosLowerThan]) -- Initial command queue+ initGraphs+ (\_ -> do+ dtSecs <- yampaSDLTimeSense timeRef+ return (dtSecs, Nothing))+ (\_ e -> display e >> return False)+ bouncingBall++display :: Double -> IO()+display y = do+ -- Obtain surface+ screen <- getVideoSurface++ -- Paint screen green+ let format = surfaceGetPixelFormat screen+ green <- mapRGB format 0xAB 0xA9 0xBF+ fillRect screen Nothing green++ -- Paint small red square, at an angle 'angle' with respect to the center+ red <- mapRGB format 0x34 0x11 0x3F+ let radius = 20+ let x = (width - radius) `div` 2+ filledCircle screen x (height - round y) radius (Pixel 0xFF3411FF)++ putStrLn (show (x, y, radius))+ -- Double buffering+ SDL.flip screen++bouncingBall :: SF () Double+bouncingBall = bouncingBall' (height / 2) 0 >>> arr fst++bouncingBall' :: Double -> Double -> SF () (Double, Double)+bouncingBall' p0 v0 = switch (fallingBall p0 v0 >>> (arr id &&& hitFloor)) (\(p,v) -> bouncingBall' p (-v))++fallingBall p0 v0 = proc () -> do+ v <- (v0+) ^<< integral -< -9.8+ p <- (p0+) ^<< integral -< v+ returnA -< (p, v)++hitFloor =+ arr (\(p,v) -> if p < 0 && v < 0 then Event (p,v) else Yampa.NoEvent)++initGraphs :: IO ()+initGraphs = do+ -- Initialise SDL+ SDL.init [InitVideo]++ -- Create window+ screen <- setVideoMode width height 16 [SWSurface]+ setCaption "Test" ""+-- | Updates the time in an IO Ref and returns the time difference+updateTime :: IORef Int -> Int -> IO Int+updateTime timeRef newTime = do+ previousTime <- readIORef timeRef+ writeIORef timeRef newTime+ return (newTime - previousTime)++yampaSDLTimeSense :: IORef Int -> IO Yampa.DTime+yampaSDLTimeSense timeRef = do+ -- Get time passed since SDL init+ newTime <- fmap fromIntegral SDL.getTicks++ -- Obtain time difference+ dt <- updateTime timeRef newTime+ let dtSecs = fromIntegral dt / 1000+ return dtSecs++newtype PosLowerThan = PosLowerThan { limit :: Double }+ deriving (Read, Show)++instance Pred PosLowerThan () GameOutput where+ evalPred p dt i ey = limit p < ey++-- * Interactive reactimation++type GameOutput = Double -- b (output type of the SF)++myPred dt a ((ey,_),_) = ey < 450+
+ src/Data/Extra.hs view
@@ -0,0 +1,28 @@+-- | Utility functions+module Data.Extra where++import Data.Maybe++-- * Lists++-- takeLast n l = reverse $ take n $ reverse l++appAt :: Int -> (a -> a) -> [a] -> [a]+appAt _ f [] = []+appAt 0 f (x:xs) = f x : xs+appAt n f (x:xs) = x : appAt (n-1) f xs++-- * Maybe++maybeRead :: Read a => String -> Maybe a+maybeRead = fmap fst . listToMaybe . reads++--- * Either++-- TODO: Remove+fromLeft :: Either a b -> a+fromLeft (Left a) = a++-- TODO: Remove+fromRight :: Either a b -> b+fromRight (Right b) = b
+ src/FRP/Titan/Debug/Comm.hs view
@@ -0,0 +1,28 @@+-- | Communication bridges between the debugger running locally attached+-- to a Yampa application and the debugging GUI running remotely on+-- your machine.+module FRP.Titan.Debug.Comm+ ( ExternalBridge(..)+ , getAllMessages+ )+ where++-- | Configuration layer to communicate the FRP app and the debugging GUI.+data ExternalBridge = ExternalBridge+ { ebPrint :: String -> IO () -- ^ Print log messages+ , ebSendMsg :: String -> IO () -- ^ Send a message to the debugger using the sync channel.+ , ebSendEvent :: String -> IO () -- ^ Send a message to the debugger using the async channel.+ , ebGetMsg :: IO String -- ^ Obtain a message from the debugger.+ }++-- | Obtain all pending messages from the debugger.+getAllMessages :: ExternalBridge -> IO [String]+getAllMessages bridge = getAllMessages' bridge []++-- | Obtain all pending messages from the debugger and add them to a queue.+getAllMessages' :: ExternalBridge -> [String] -> IO [String]+getAllMessages' bridge xs = do+ msg <- ebGetMsg bridge+ if null msg+ then return xs+ else getAllMessages' bridge (msg:xs)
+ src/FRP/Titan/Debug/CommTCP.hs view
@@ -0,0 +1,218 @@+{-# LANGUAGE ScopedTypeVariables #-}+-- | Communicate Yampa game and debugging GUI via TCP+module FRP.Titan.Debug.CommTCP+ ( mkTitanCommTCPBridge )+ where++-- External modules+import Control.Concurrent+import Control.Concurrent.STM+import Control.Exception+import Control.Monad+import Data.Maybe+import Network.BSD+import Network.Socket+import System.IO++-- Internal modules+import FRP.Titan.Debug.Comm++-- | Create a communication bridge using a local TCP server.+mkTitanCommTCPBridge :: IO ExternalBridge+mkTitanCommTCPBridge = do++ -- The communication bridge is composed of two TCP sockets:+ -- a sync one and an async one.+ --+ -- To control messages sent and received through these sockets,+ -- three mvars are used:+ -- - One for outgoing, sync messages (out)+ -- - One for outgoing, async messages (event)+ -- - One for incoming, sync message (get)+ --+ -- Sending and receiving messages is controlled via three MVars.+ --+ outChannel <- atomically $ newTChan+ eventChannel <- atomically $ newTChan+ getChannel <- atomically $ newTChan+ forkIO $ mkSendMsg outChannel getChannel+ forkIO $ mkSendEvent eventChannel+ let sendMsg msg = do atomically $ writeTChan outChannel msg+ putStrLn $ "Wrote the sync message " ++ msg+ sendEvent msg = do atomically $ writeTChan eventChannel msg+ putStrLn $ "Wrote the async message " ++ msg+ getMsg = do a <- (fromMaybe "") <$> (atomically $ tryReadTChan getChannel)+ -- getMsg = do a <- atomically $ readTChan getChannel+ when (not (null a)) $ putStrLn $ "Got the sync message " ++ show a+ return a+ return $ ExternalBridge errPrintLn sendMsg sendEvent getMsg++-- | Send communication channel that takes messages from an MVar and pushes+-- them out a socket.+mkSendMsg :: TChan String -> TChan String -> IO ()+mkSendMsg outChannel getChannel = void $+ forkIO $ serveSync "8081" (\msg -> do atomically $ writeTChan getChannel msg) (atomically $ readTChanAll outChannel)++readTChanAll :: TChan a -> STM [a]+readTChanAll tchan = reverse <$> readTChanAll' tchan []++readTChanAll' :: TChan a -> [a] -> STM [a]+readTChanAll' tchan acc = do+ mval <- tryReadTChan tchan+ case mval of+ Nothing -> return acc+ Just val -> readTChanAll' tchan (val : acc)++serveSync :: String -- ^ Port number or name; 514 is default+ -> (String -> IO ()) -- ^ Function to handle incoming messages+ -> (IO [String]) -- ^ Function to obtain outgoing messages+ -> IO ()+serveSync port handlerGet handlerSend = withSocketsDo $+ do -- Look up the port. Either raises an exception or returns+ -- a nonempty list.+ addrinfos <- getAddrInfo+ (Just (defaultHints {addrFlags = [AI_PASSIVE]}))+ Nothing (Just port)+ let serveraddr = head addrinfos++ -- Create a socket+ sock <- socket (addrFamily serveraddr) Stream defaultProtocol++ -- Bind it to the address we're listening to+ bind sock (addrAddress serveraddr)++ -- Start listening for connection requests. Maximum queue size+ -- of 5 connection requests waiting to be accepted.+ listen sock 5++ -- Create a lock to use for synchronizing access to the handler+ lock <- newMVar ()++ -- Loop forever waiting for connections. Ctrl-C to abort.+ procRequests lock sock++ where+ -- | Process incoming connection requests+ procRequests :: MVar () -> Socket -> IO ()+ procRequests lock mastersock = forever $ void $ do+ (connsock, _clientaddr) <- accept mastersock+ -- handle lock clientaddr+ -- "syslogtcpserver.hs: client connnected"+ connhdl <- socketToHandle connsock ReadWriteMode+ putStrLn ("Socket connected.")+ hSetBuffering connhdl LineBuffering+ hPutStrLn connhdl "Hello 0"+ hFlush connhdl+ t1 <- forkIO $ procSend lock connhdl+ t2 <- forkIO $ procGet lock connhdl+ -- hClose connhdl+ return ()++ -- | Process incoming messages+ procGet :: MVar () -> Handle -> IO ()+ procGet lock connhdl = do+ let processMessage = forever $ do+ message <- hGetLine connhdl+ handleGet lock message+ catch processMessage (\(e :: IOException) -> putStrLn "Disconnected")++ -- | Process incoming messages+ procSend :: MVar () -> Handle -> IO ()+ procSend lock connhdl = do+ let processMessage = forever $ do+ responses <- handleSend lock+ mapM_ (\msg -> hPutStrLn connhdl msg >> hFlush connhdl) responses+ catch processMessage (\(e :: IOException) -> putStrLn "Disconnected")++ -- handle lock clientaddr+ -- "syslogtcpserver.hs: client disconnected"++ -- Lock the handler before passing data to it.+ handleGet :: MVar () -> String -> IO ()+ handleGet lock msg =+ withMVarLock lock $ handlerGet msg++ -- Lock the handler before passing data to it.+ handleSend :: MVar () -> IO [String]+ handleSend lock =+ withMVarLock lock $ handlerSend++-- | Event communication channel that takes event messages from an MVar and+-- pushes them out a socket.+mkSendEvent :: TChan String -> IO ()+mkSendEvent channel = void $+ forkIO $ serveAsync "8082" $ \handle -> forever $ do+ response <- atomically $ readTChan channel+ putStrLn $ "Sending to the event log: " ++ show response+ hPutStrLn handle response+ hFlush handle++serveAsync :: String -- ^ Port number or name; 514 is default+ -> (Handle -> IO ()) -- ^ Function to handle incoming messages+ -> IO ()+serveAsync port handlerfunc = withSocketsDo $+ do -- Look up the port. Either raises an exception or returns+ -- a nonempty list.+ addrinfos <- getAddrInfo+ (Just (defaultHints {addrFlags = [AI_PASSIVE]}))+ Nothing (Just port)+ let serveraddr = head addrinfos++ -- Create a socket+ sock <- socket (addrFamily serveraddr) Stream defaultProtocol++ -- Bind it to the address we're listening to+ bind sock (addrAddress serveraddr)++ -- Start listening for connection requests. Maximum queue size+ -- of 5 connection requests waiting to be accepted.+ listen sock 5++ -- Create a lock to use for synchronizing access to the handler+ lock <- newMVar ()++ -- Loop forever waiting for connections. Ctrl-C to abort.+ procRequests lock sock++ where+ -- | Process incoming connection requests+ procRequests :: MVar () -> Socket -> IO ()+ procRequests lock mastersock = forever $ void $ do+ (connsock, _clientaddr) <- accept mastersock+ -- handle lock clientaddr+ -- "syslogtcpserver.hs: client connnected"+ forkIO $ procMessages lock connsock++ -- | Process incoming messages+ procMessages :: MVar () -> Socket -> IO ()+ procMessages lock connsock = do+ connhdl <- socketToHandle connsock ReadWriteMode+ putStrLn ("Socket connected.")+ hSetBuffering connhdl LineBuffering+ hPutStrLn connhdl "DHello 0"+ hFlush connhdl+ handle lock connhdl+ hClose connhdl++ -- Lock the handler before passing data to it.+ handle :: MVar () -> Handle -> IO ()+ -- This type is the same as+ -- handle :: MVar () -> SockAddr -> String -> IO ()+ handle lock handle =+ withMVarLock lock (handlerfunc handle)++-- * Aux++-- | Put a message in an MVar.+putInMVar :: MVar [String] -> String -> IO ()+putInMVar mvar s = modifyMVar_ mvar (return . (++ [s]))++withMVarLock :: MVar a -> IO b -> IO b+withMVarLock lock io = do+ a <- takeMVar lock+ r <- io+ putMVar lock a+ return r++errPrintLn :: String -> IO ()+errPrintLn s = hPutStrLn stderr s >> hFlush stderr
+ src/FRP/Titan/Debug/Command.hs view
@@ -0,0 +1,73 @@+module FRP.Titan.Debug.Command where++-- * Commands++-- | An interactive, debugging command.+data Command p = Step -- ^ Control: Execute a complete simulation cycle+ | StepUntil p -- ^ Control: Execute cycles until a predicate holds+ | SkipUntil p -- ^ Control: Skip cycles until a predicate holds+ | SkipSense -- ^ Control: Skip cycle while sensing the input+ | Redo -- ^ Control: Re-execute the last step+ | SkipBack -- ^ Control: Jump one step back in the simulation+ | JumpTo Int -- ^ Control: Jump to a specific frame+ | TravelToFrame Int -- ^ Control: Simulate up to a particular frame (not implemented yet)+ | DiscardFuture Int -- ^ Control: Simulate up to a particular frame (not implemented yet)+ | Exit -- ^ Control: Stop the simulation and exit the program+ | Play -- ^ Control: Start executing normally+ | Pause -- ^ Control: Pause the simulation+ | Stop -- ^ Control: Stop the simulation+ | LoadTraceFromFile String -- ^ Control: Load the Trace from a file (not implemented yet)+ | LoadTraceFromString String -- ^ Control: Load the Trace from a string (not implemented yet)+ | DeleteTrace -- ^ Control: Discard the whole history+ | IOSense Int -- ^ Control: Sense input (not implemented yet)+ | GetInput Int -- ^ Info: Obtain input at a particular frame+ | SetInput Int String -- ^ Info: Change input at a particular frame+ | GetGTime Int -- ^ Info: Obtain dtime at a particular frame+ | GetDTime Int -- ^ Info: Obtain dtime at a particular frame+ | SetDTime Int String -- ^ Info: Change dtime at a particular frame+ | GetCurrentFrame -- ^ Info: Obtain the current frame+ | GetCurrentTime -- ^ Info: Obtain the current time+ | GetMaxTime -- ^ Info: Obtain the last time that has been explored+ | GetTrace -- ^ Info: Obtain input at a particular frame+ | SummarizeHistory -- ^ Info: Print summary information about the history+ | SetPrefDumpInput Bool -- ^ Preferences: Alter simulation preferences+ | GetPrefDumpInput -- ^ Preferences: Obtain simulation preferences+ | Ping -- ^ Debugging: send a pong back to the GUI+ deriving (Eq, Read, Show)++-- | Convenince to show commands in the debug log+showCommand (LoadTraceFromString s) = "LoadTraceFromString <length: " ++ show (length s) ++ " chars>"+showCommand c = show c++-- True if the command should make the simulator stop playing+stopPlayingCommand :: Command p -> Bool+stopPlayingCommand (Step) = True+stopPlayingCommand (StepUntil p) = True+stopPlayingCommand (SkipUntil p) = True+stopPlayingCommand (SkipSense) = True+stopPlayingCommand (Redo) = True+stopPlayingCommand (SkipBack) = True+stopPlayingCommand (JumpTo _) = True+stopPlayingCommand (TravelToFrame _) = True+stopPlayingCommand (DiscardFuture _) = True+stopPlayingCommand (Exit) = True+stopPlayingCommand (Play) = False+stopPlayingCommand (Pause) = True+stopPlayingCommand (Stop) = True+stopPlayingCommand (LoadTraceFromFile _) = True+stopPlayingCommand (LoadTraceFromString _) = True+stopPlayingCommand (DeleteTrace) = True+stopPlayingCommand (IOSense _) = True+stopPlayingCommand (GetInput _ ) = False+stopPlayingCommand (SetInput _ _) = False+stopPlayingCommand (GetGTime _ ) = False+stopPlayingCommand (GetDTime _ ) = False+stopPlayingCommand (SetDTime _ _) = False+stopPlayingCommand (GetCurrentFrame) = False+stopPlayingCommand (GetCurrentTime) = False+stopPlayingCommand (GetTrace) = False+stopPlayingCommand (SummarizeHistory) = False+stopPlayingCommand (SetPrefDumpInput _) = False+stopPlayingCommand (GetPrefDumpInput) = False+stopPlayingCommand (Ping) = False+stopPlayingCommand (GetMaxTime) = False
+ src/FRP/Titan/Debug/History.hs view
@@ -0,0 +1,254 @@+{-# LANGUAGE MultiWayIf #-}++-- | Execution History+module FRP.Titan.Debug.History where++import Control.Monad+import Data.Maybe+import FRP.Yampa (SF, FutureSF, DTime)++import Data.Extra+import FRP.Titan.Debug.Comm++data History a b = History+ -- { getHistory :: (Maybe (a, Maybe (SF a b)), [(a, DTime, Maybe (FutureSF a b))])+ { getInputHistory :: Maybe (Stream a (DTime, a))+ , getSFHistory :: Stream (SF a b) (FutureSF a b)+ , getPos :: Int+ , getCurSF :: Either (SF a b) (FutureSF a b)+ , getLastInput :: Maybe a+ }++type Stream a a' = (a, [a'])++getCurSF' :: History a b -> Either (SF a b) (FutureSF a b)+getCurSF' history = fromMaybe (Left $ fst $ getSFHistory history) (getSampleAt (getSFHistory history) (getPos (history)))+++-- INV: forall h . isNothing (fst (getHistory h)) \/ isNothing (fst (getFuture h))+-- INV: forall h . not (null (getHistory h)) ==> isNothing (fst (getFuture h))++-- ** Construction++-- | Create empty history pending to run a signal function+mkEmptyHistory :: SF a b -> History a b+mkEmptyHistory sf = History Nothing (sf, []) 0 (Left sf) Nothing++-- | Create empty history with an initial sample and sf, and a next FutureSF+mkHistory :: (a, SF a b) -> FutureSF a b -> History a b+mkHistory (a0, sf0) sf' =+ History (Just (a0, [])) (sf0, [sf']) 1 (Right sf') (Just a0)++-- | Determine if history is currently pointing to a running SF.+historyIsRunning :: History a b -> Bool+historyIsRunning history = ((>0) . getPos) (history)++-- | Replace the input for a given frame/sample+historyReplaceInputAt :: History a b -> Int -> a -> History a b+historyReplaceInputAt history f a+ | ns < f = history+ | f == 0 = if isNothing hs+ then history+ else history { getInputHistory = Just (a, ps)+ , getSFHistory = ((\(x,y) -> (x, [])) $ getSFHistory history)+ }+ | otherwise = history { getInputHistory = Just (a0, appAt (f-1) (\(dt, _) -> (dt, a)) ps)+ , getSFHistory = ((\(x,y) -> (x, take f y)) $ getSFHistory history)+ }+ where+ hs = getInputHistory history+ Just (a0, ps) = hs+ ns = maybe 0 (length.snd) hs++-- | Replace the time for a given frame/sample+historyReplaceDTimeAt :: History a b -> Int -> DTime -> History a b+historyReplaceDTimeAt history f dt =+ let Just (a0, ps) = getInputHistory history+ dts = 0 : map (\(dt,_) -> dt) ps+ in if length dts >= f+ then history+ else if f == 0+ then history+ else history { getInputHistory = Just (a0, appAt (f-1) (\(_,a) -> (dt, a)) ps)+ , getSFHistory = ((\(x,y) -> (x, take f y)) $ getSFHistory history)+ }++-- | Replace the input and the time for a given frame/sample+historyReplaceInputDTimeAt :: History a b -> Int -> DTime -> a -> History a b+historyReplaceInputDTimeAt history f dt a =+ let (Just (a0, ps)) = getInputHistory history+ as = a0 : map (\(_, a) -> a) ps+ in if length as >= f+ then history+ else if f == 0+ then history { getInputHistory = Just (a, ps)+ , getSFHistory = ((\(x,y) -> (x, [])) $ getSFHistory history)}+ else history { getInputHistory = Just (a0, appAt (f-1) (\(_,_) -> (dt, a)) ps)+ , getSFHistory = ((\(x,y) -> (x, take f y)) $ getSFHistory history)}++-- | Get the total time at a given point/frame+historyGetMaxTime :: History a b -> DTime+historyGetMaxTime history =+ case getInputHistory history of+ Nothing -> 0+ Just (a0, ps) -> sum $ map (\(dt,_) -> dt) ps++-- | Get the total time at a given point/frame+historyGetGTime :: History a b -> Int -> Maybe DTime+historyGetGTime history f =+ case getInputHistory history of+ Nothing -> Nothing+ Just (a0, ps) -> let dts = 0 : map fst ps+ l = length dts+ e = if l < f then Nothing else Just (sum (drop (l-f) dts))+ in e++-- | Get the time delta for a given frame+historyGetDTime :: History a b -> Int -> Maybe DTime+historyGetDTime history f =+ case getInputHistory history of+ Nothing -> Nothing+ Just (a0, ps) -> let dts = 0 : map fst ps+ e = if length dts < f || f < 0 then Nothing else Just (dts !! f)+ in e++-- | Get the input for a given frame+historyGetInput :: History a b -> Int -> Maybe a+historyGetInput history f =+ case getInputHistory history of+ Nothing -> Nothing+ Just (a0, ps) -> let as = a0 : map snd ps+ e = if length as < f || f < 0then Nothing else Just (as !! f)+ in e++-- | Get the time for the current frame+historyGetCurrentTime :: History t b -> DTime+historyGetCurrentTime history =+ case getInputHistory history of+ Just (a0, ps) -> sum $ map (\(dt,_) -> dt) (take (getPos history) ps)+ Nothing -> 0++-- | Get the current frame number.+historyGetCurrentFrame :: History a b -> Int+historyGetCurrentFrame history = getPos history++-- | Record a running frame+historyRecordFrame1 :: History a b -> (a, DTime, FutureSF a b) -> History a b+historyRecordFrame1 history (a', dt, sf') = historySF+ where+ historyInput = case getInputHistory history of+ Nothing -> history+ Just (a0, ps) -> if | pos > 0 && pos < length ps -> history { getInputHistory = Just (a0, appAt pos (const (dt, a')) ps) }+ | pos > 0 -> history { getInputHistory = Just (a0, ps ++ [(dt, a')]) }+ | otherwise -> history++ historySF = let (s0, ss) = getSFHistory historyInput+ in if getPos history <= 0+ then historyInput+ else historyInput { getSFHistory = (s0, take (getPos history) ss ++ [sf'])+ , getPos = pos + 1+ }+ pos = getPos history++-- | Get the total number of frames+historyGetNumFrames :: History t b -> Int+historyGetNumFrames history =+ case getInputHistory history of+ Just (a0, ps) -> length ps + 1+ Nothing -> 0++-- | Get the current frame info+--+-- TODO: Partial function+historyGetCurFrame :: History a b -> (a, Maybe DTime, Maybe (Either (SF a b) (FutureSF a b)))+historyGetCurFrame history =+ case curInput of+ Just (Left a0) -> (a0, Nothing, curSF)+ Just (Right (dt, a)) -> (a, Just dt, curSF)+ Nothing -> error "No current frame"+ where+ curInput = (`getSampleAt` (getPos history)) =<< getInputHistory history+ curSF = (`getSampleAt` (getPos history)) (getSFHistory history)++getSampleAt :: Stream a a' -> Int -> Maybe (Either a a')+getSampleAt (s0, ss) 0 = Just (Left s0)+getSampleAt (s0, ss) n+ | n <= length ss = Just (Right (ss!!(n-1)))+ | otherwise = Nothing++-- | Move one step back in history+historyBack :: History a b -> History a b+historyBack history = history { getPos = max 0 (getPos history - 1)}++ -- case getHistory history of+ -- (Just (a0, sf0), _:(_a,_dt, sf'):prevs@((lastInput, _, _):_)) -> (Just $ History (Just (a0, sf0), prevs) (Right sf') (Just lastInput), Right (sf', lastInput))+ -- (Just (a0, sf0), _:(_a,_dt, sf'):[]) -> (Just $ History (Just (a0, sf0), []) (Right sf') (Just a0), Right (sf', a0))+ -- (Just (a0, sf0), _:[]) -> (Just $ History (Just (a0, sf0), []) (Left sf0) Nothing, Left sf0)+ -- (Just (a0, sf0), []) -> (Just $ History (Nothing, []) (Left sf0) Nothing, Left sf0)+ -- TODO: undefined+ -- (Nothing, []) -> (Just $ history, getCurSF history)++-- | Jump to a specific frame number.+-- historyJumpTo :: History a b -> Int -> History a b+-- historyJumpTo history n =+-- case getHistory history of+-- (Nothing,_) -> history+-- (Just (a0, sf0), ps) ->+-- if length ps + 1 > n+-- then if n > 0+-- then let ((_a,_dt, sf'):prevs@((lastInput, _, _):_)) = takeLast n ps+-- in History (Just (a0, sf0), prevs) n (Right (fromJust sf')) (Just lastInput)+-- else mkEmptyHistory (fromMaybe (fromLeft (getCurSF history)) sf0)+-- else history++historyJumpTo :: History a b -> Int -> History a b+historyJumpTo history n =+ case getInputHistory history of+ Nothing -> history+ Just (a0, ps) ->+ if length ps + 1 > n+ then history { getPos = n }+ else history++-- | Discard the future after a given frame.+historyDiscardFuture :: History a b -> Int -> History a b+historyDiscardFuture history n =+ case getInputHistory history of+ Nothing -> history+ Just (a0, ps) ->+ if length ps + 1 > n+ then if n > 0+ then history { getInputHistory = Just (a0, take n ps)+ , getSFHistory = (\(s0, ss) -> (s0, take n ss)) (getSFHistory history)+ , getPos = min n (getPos history)+ }+ else History { getInputHistory = Just (a0, [])+ , getSFHistory = (\(s0, ss) -> (s0, [])) (getSFHistory history)+ , getPos = 0+ }+ else history++-- ** Command Queue++-- | Obtain a command from the command queue, polling the communication+-- bridge if the queue is empty.+getCommand :: (Read a, Show a) => ExternalBridge -> [a] -> IO (Maybe a, [a])+-- getCommand bridge (c:cs) = return (Just c, cs)+getCommand bridge cmds = do+ mLines <- filter (not . null) <$> getAllMessages bridge+ let cmLines = map maybeRead mLines+ cLines = catMaybes cmLines+ unless (null mLines) $ do+ ebPrint bridge (show mLines)+ ebPrint bridge (show cmLines)+ case cmds ++ cLines of+ [] -> return (Nothing, [])+ (c:cs) -> return (Just c, cs)++-- | Place one command on the top of the queue.+pushCommand :: [a] -> a -> [a]+pushCommand cs c = c:cs++-- | Place one command on the top of the queue.+appendCommand :: [a] -> a -> [a]+appendCommand cs c = cs ++ [c]
+ src/FRP/Titan/Debug/Predicates.hs view
@@ -0,0 +1,18 @@+{-# LANGUAGE FunctionalDependencies #-}+{-# LANGUAGE MultiParamTypeClasses #-}++-- | Debugging predicates+module FRP.Titan.Debug.Predicates where+++-- | A notion of temporal point-wise (time-wise) predicate to be tested+-- during a simulation point. It needs to be something we can read+-- from the GUI bridge so that we can interactively read commands+-- from the user and test them.++-- TODO: Possibly use this:+-- https://hackage.haskell.org/package/hint++class Read p => Pred p i o | p -> i, p -> o where+ -- | Evaluate a predicate for a given input sample and a given output.+ evalPred :: p -> Maybe Double -> i -> o -> Bool
+ src/FRP/Titan/Debug/Preferences.hs view
@@ -0,0 +1,13 @@+-- | Simulation preferences+module FRP.Titan.Debug.Preferences where++-- | Debugging preferences.+data Preferences = Preferences+ { dumpInput :: Bool -- ^ Dump inputs to local log at every cycle (on simulation machine)+ }++-- | Default simulation preferences that do not dump the input to the log+-- every cycle.+defaultPreferences :: Preferences+defaultPreferences = Preferences+ { dumpInput = False }
+ src/FRP/Titan/Debug/SimMonad.hs view
@@ -0,0 +1,103 @@+-- | Simulation State+module FRP.Titan.Debug.SimMonad where++import Control.Monad.Trans.Class+import Control.Monad.Trans.State+import FRP.Yampa (DTime, SF)++import FRP.Titan.Debug.Comm+import FRP.Titan.Debug.Command+import FRP.Titan.Debug.Preferences+import FRP.Titan.Debug.Predicates+import FRP.Titan.Debug.History++type SimMonad p a b = StateT (SimState p a b) IO++data SimState p a b = SimState+ { simBridge :: ExternalBridge+ , simPrefs :: Preferences+ , simHistory :: History a b+ , simCommands :: [Command p]+ , simOps :: SimOps a b+ , simFinished :: Bool+ }++getSimHistory :: SimMonad p a b (History a b)+getSimHistory = simHistory <$> get++getSimCommands :: SimMonad p a b [Command p]+getSimCommands = simCommands <$> get++simPrint :: String -> SimMonad p a b ()+simPrint msg = get >>= \simState -> lift $ ebPrint (simBridge simState) msg++simSendMsg :: String -> SimMonad p a b ()+simSendMsg msg = get >>= \simState -> lift $ ebSendMsg (simBridge simState) msg++simSendEvent :: String -> SimMonad p a b ()+simSendEvent msg = get >>= \simState -> lift $ ebSendEvent (simBridge simState) msg++-- | SimOps represents the sensing and consumption actions used to animate/reactimate+-- a Yampa program:+--+-- * Initial sensing action+--+-- * Continued sensing action+--+-- * Rendering/consumption action++type SimOps a b = (IO a, Bool -> IO (DTime, Maybe a), Bool -> b -> IO Bool)++simSense :: SimMonad p a b a+simSense = get >>= \s -> let (op, _, _) = simOps s in lift op++simSense1 :: Bool -> SimMonad p a b (DTime, Maybe a)+simSense1 b = get >>= \s -> let (_, op, _) = simOps s in lift (op b)++simActuate :: Bool -> b -> SimMonad p a b Bool+simActuate c b = get >>= \s -> let (_, _, op) = simOps s in lift (op c b)++simFinish :: SimState p a b -> SimState p a b+simFinish simState = simState { simFinished = True }++-- | Obtain a command from the command queue, polling the communication+-- bridge if the queue is empty.+simGetCommand :: (Read p, Show p, Show a, Read a, Show b, Read b, Pred p a b)+ => SimMonad p a b (Maybe (Command p))+simGetCommand = do+ simState <- get+ (c, cms) <- lift $ getCommand (simBridge simState) (simCommands simState)+ put (simState { simCommands = cms })+ return c++simEmptyHistory :: SimMonad p a b ()+simEmptyHistory = do+ sf0 <- historyGetSF0+ modify $ \simState -> simState { simHistory = mkEmptyHistory sf0 }++simReplaceHistory :: (a, [(DTime, a)]) -> SimMonad p a b ()+simReplaceHistory (a0, as) = do+ sf0 <- historyGetSF0+ let history = History (Just (a0, as))+ (sf0, [])+ (-1) (Left sf0) Nothing+ modify $ \simState -> simState { simHistory = history }++simGetTrace :: SimMonad p a b (Maybe (a, [(DTime, a)]))+simGetTrace = getInputHistory <$> getSimHistory++historyGetSF0 :: SimMonad p a b (SF a b)+historyGetSF0 = (fst . getSFHistory) <$> getSimHistory++simModifyHistory :: (History a b -> History a b) -> SimMonad p a b ()+simModifyHistory f = do+ history <- f <$> getSimHistory+ modify $ \simState -> simState { simHistory = history }++hPushCommand :: Command p -> SimMonad p a b ()+hPushCommand cmd = modify+ (\simState -> simState { simCommands = pushCommand (simCommands simState) cmd })++hAppendCommand :: Command p -> SimMonad p a b ()+hAppendCommand cmd = modify+ (\simState -> simState { simCommands = appendCommand (simCommands simState) cmd })
+ src/FRP/Titan/Debug/Yampa.hs view
@@ -0,0 +1,342 @@+{-# LANGUAGE MultiWayIf #-}+{-# LANGUAGE ScopedTypeVariables #-}++-- | Replacement of Yampa's @reactimate@ function with more fine-tuned+-- control and debugging capabilities.+--+-- See "FRP.Titan.Debug.CommTCP" for a communication bridge using TCP+-- sockets.+module FRP.Titan.Debug.Yampa+ (+ -- * Debugging+ reactimateControl+ -- ** Communication bridge+ , ExternalBridge(..)+ -- ** Debugging preferences+ , Preferences(..)+ , defaultPreferences+ -- ** Debugging commands+ , Command+ -- ** Debugging predicates+ , Pred(..)+ )+ where++import Control.Monad+import Control.Monad.IfElse+import Control.Monad.Trans.State+import Data.Maybe+import FRP.Yampa (SF, DTime, evalAtZero, evalAt)++import Data.Extra+import FRP.Titan.Debug.Comm+import FRP.Titan.Debug.Command+import FRP.Titan.Debug.Preferences+import FRP.Titan.Debug.Predicates+import FRP.Titan.Debug.History+import FRP.Titan.Debug.SimMonad++-- Yampa is based on SFs and FutureSFs. The former is an SF that can be turned on by+-- providing an input signal, the latter is one that is already on, so it also+-- needs to know the time deltas between samples.+--+-- The following two functions implement reactimation (Yampa simulation)+-- based on debug preferences and program configuration.++-- | Start a Yampa program with interactive debugging enabled.+reactimateControl :: forall p a b+ . (Read p, Show p, Show a, Read a, Show b, Read b, Pred p a b)+ => ExternalBridge -- ^ Debug: Communication bridge for the interactive GUI+ -> Preferences -- ^ Debug: Debugging preferences+ -> [Command p] -- ^ Debug: List of commands (exposed only to facilitate fixing the type of predicates p)+ -> IO a -- ^ FRP: Initial sensing action+ -> (Bool -> IO (DTime, Maybe a)) -- ^ FRP: Continued sensing action+ -> (Bool -> b -> IO Bool) -- ^ FRP: Rendering/consumption action+ -> SF a b -- ^ FRP: Signal Function that defines the program+ -> IO ()+reactimateControl bridge prefs cmds init sense actuate sf =+ evalStateT run simulationState+ where+ simulationState = SimState bridge prefs history cmds yampaIO False+ history = mkEmptyHistory sf+ yampaIO = (init, sense, actuate)++-- | Run the debugger continuously until it finishes+run :: (Read p, Show p, Show a, Read a, Show b, Read b, Pred p a b)+ => SimMonad p a b ()+run = get >>= \s -> unless (simFinished s) (reactimateDebugStep >> run)++-- | Process one input command of a Yampa program with interactive debugging enabled.+reactimateDebugStep :: (Read p, Show p, Show a, Read a, Show b, Read b, Pred p a b)+ => SimMonad p a b ()+reactimateDebugStep = do+ simState <- get+ command <- simGetCommand+ awhen command $ \command' -> simPrint ("CORE: Executing command " ++ showCommand command')+ case command of++ Nothing -> return ()++ Just Exit -> modify simFinish++ -- TODO: Print summary information about the history+ Just SummarizeHistory -> do num <- historyGetNumFrames <$> getSimHistory+ simSendMsg ("CurrentHistory " ++ show num)++ -- Jump to a specific frame+ Just (JumpTo n) -> do running <- (historyIsRunning . simHistory) <$> get+ when running $ do+ simSendEvent "CurrentFrameChanged"+ simModifyHistory (`historyJumpTo` n)+ hPushCommand Redo++ -- Discard all future after a specific frame+ Just (DiscardFuture n) -> do simSendEvent "CurrentFrameChanged"+ simSendEvent "HistoryChanged"+ nframe <- (historyGetCurrentFrame . simHistory) <$> get+ simModifyHistory (`historyDiscardFuture` n)+ when (n >= nframe) $ hPushCommand Redo++ -- Jump one step back in the simulation+ Just (TravelToFrame n) -> do running <- (historyIsRunning . simHistory) <$> get+ when running $ do+ p0 <- getPos <$> getSimHistory+ simPrint ("TravelTo: Traveling to " ++ show n ++ ", current frame is " ++ show p0)+ if | p0 == n -> hPushCommand Pause+ | p0 < n -> hPushCommand (TravelToFrame n) >> hPushCommand Step+ | p0 > n -> hPushCommand (TravelToFrame n) >> hPushCommand SkipBack++ Just SkipBack -> do running <- (historyIsRunning . simHistory) <$> get+ when running $ do+ p0 <- getPos <$> getSimHistory+ simPrint ("SB: The current frame position before modifying history is " ++ show p0)+ simModifyHistory historyBack+ simSendEvent "CurrentFrameChanged"+ p1 <- getPos <$> getSimHistory+ simPrint ("SB: The current frame position after modifying history is " ++ show p1)+ l <- (length.snd.fromJust.getInputHistory) <$> getSimHistory+ simPrint ("SB: The number of recorded inputs after modifying history is " ++ show l)+ hPushCommand Redo++ -- Re-execute the last step+ Just Redo -> do (a0, mdt, sfc) <- historyGetCurFrame <$> getSimHistory+ let (b0, sf') = case (mdt, sfc) of+ (_, Just (Left sf0)) -> evalAtZero sf0 a0+ (Just dt, Just (Right sf1)) -> evalAt sf1 dt a0++ showInput <- (dumpInput . simPrefs) <$> get+ when showInput $ simPrint ("CORE: Redo from input " ++ show a0)++ last <- simActuate True b0+ when last (modify simFinish)+++ -- TODO: Skip cycle while sensing the input+ -- Should the input be used as new last input?+ Just SkipSense -> do running <- (historyIsRunning . simHistory) <$> get+ a <- if running then snd <$> simSense1 False else Just <$> simSense++ showInput <- (dumpInput . simPrefs) <$> get+ when showInput $ simPrint ("CORE: Skip with input " ++ show a)++ simSendEvent "CurrentFrameChanged"++ -- Simulate one step forward+ Just Step -> do void stepG++ -- Simulate until a predicate on the input and output holds+ Just (StepUntil p) -> do (a', dt, b') <- stepG++ cond <- checkCond p dt a' b'+ unless cond $ hPushCommand (StepUntil p)++ -- Skip steps until a predicate on the input and output holds+ Just (SkipUntil p) -> do (a', dt, b') <- skipG++ cond <- checkCond p dt a' b'+ unless cond $ hPushCommand (SkipUntil p)++ -- TODO Potential bug here: it could simulate too much!+ -- If the condition is not met, it will not "actuate",+ -- and so it will not check whether it should have stopped.+ last <- if cond then simActuate True b' else return False++ -- TODO: Potential bug: should stop, but not exit+ when last (modify simFinish)++ -- Simulate indefinitely+ Just Play -> do void stepG+ commandQ <- getSimCommands+ unless (any stopPlayingCommand commandQ) $ hAppendCommand Play++ Just Pause -> return ()++ Just DeleteTrace -> do simEmptyHistory+ simSendEvent "CurrentFrameChanged"+ simSendEvent "HistoryChanged"++ Just (LoadTraceFromString s) -> do simPrint "CORE: Loading Trace from String"+ case maybeRead s of+ Nothing -> simPrint "CORE: Could not read a trace"+ Just s -> do simPrint "CORE: Replacing history"+ simReplaceHistory s++ Just (IOSense f) -> do running <- (historyIsRunning . simHistory) <$> get+ if running+ then do+ (dt, ma') <- simSense1 False+ history <- getSimHistory+ -- Unsafe fromJust use+ let a' = fromMaybe (fromJust $ getLastInput history) ma'++ showInput <- (dumpInput . simPrefs) <$> get+ when showInput $ simPrint $ "CORE: IOSense " ++ show a'++ simModifyHistory (\h -> historyReplaceInputDTimeAt h f dt a')+ else do+ a <- simSense++ showInput <- (dumpInput . simPrefs) <$> get+ when showInput $ simPrint $ "CORE: IOSense " ++ show a++ simModifyHistory (\h -> historyReplaceInputAt h f a)++ Just (GetTrace) -> do simTrace <- simGetTrace+ simPrint (show simTrace)+ simSendMsg (show (show <$> simTrace))++ Just (GetInput f) -> do running <- (historyIsRunning . simHistory) <$> get+ if running+ then do e <- (`historyGetInput` f) <$> getSimHistory+ simSendMsg (show (show <$> e))+ else simSendMsg "Nothing"++ Just (SetInput f i) -> do case maybeRead i of+ Nothing -> return ()+ Just a -> simModifyHistory (\h -> historyReplaceInputAt h f a)++ Just (GetGTime f) -> do e <- (`historyGetGTime` f) <$> getSimHistory+ simPrint $ "CORE: Want to send GTime for frame " ++ show f ++ ", which is " ++ show e+ simSendMsg (show e)++ Just (GetDTime f) -> do e <- (`historyGetDTime` f) <$> getSimHistory+ simSendMsg (show e)++ Just (GetMaxTime) -> do e <- historyGetMaxTime <$> getSimHistory+ simPrint $ "CORE: Want to send Max time, which is " ++ show e+ simSendMsg $ "MaxTime " ++ show e++ Just (SetDTime f dtS) -> do case maybeRead dtS of+ Nothing -> return ()+ Just dt -> simModifyHistory (\h -> historyReplaceDTimeAt h f dt)++ Just GetCurrentTime -> do num <- historyGetCurrentTime <$> getSimHistory+ simSendMsg ("CurrentTime " ++ show num)+ simPrint ("CORE: Sending current time " ++ show num)++ Just GetCurrentFrame -> do num <- ((\x -> x - 1) . historyGetCurrentFrame) <$> getSimHistory+ simSendMsg ("CurrentFrame " ++ show num)+ simPrint ("CORE: Sending current frame " ++ show num)++ Just (SetPrefDumpInput b) -> do modify (\s -> s { simPrefs = (simPrefs s) { dumpInput = b } })++ Just GetPrefDumpInput -> do dump <- (dumpInput . simPrefs) <$> get+ simSendMsg ("DumpInput " ++ show dump)++ Just Ping -> do simSendMsg "Pong"+ simSendEvent "PingSent"++ Just c -> do simSendEvent ("Got " ++ show c ++ ", dunno what to do with it")+ where++ -- step0 :: IO (a, FutureSF a b, b)+ step0 = do+ -- Step+ simState <- get+ history <- getSimHistory+ a0 <- simSense+ when (dumpInput (simPrefs simState)) $ simPrint $ "CORE: Input: " ++ show a0++ let sf = fromLeft (getCurSF' history)+ tf0 = evalAtZero sf+ (b0, sf') = tf0 a0+ _ <- simActuate True b0+ -- TODO Potential bug here: it could simulate too much!+ simSendEvent "CurrentFrameChanged"+ simSendEvent "HistoryChanged"+ simModifyHistory (const (mkHistory (a0, sf) sf'))++ return (a0, b0)++ -- skip0 :: IO (a, FutureSF a b, b)+ skip0 = do+ simState <- get+ history <- getSimHistory+ a0 <- simSense+ when (dumpInput (simPrefs simState)) $ simPrint $ "CORE: Input: " ++ show a0++ let sf = fromLeft (getCurSF' history)+ tf0 = evalAtZero sf+ (b0, sf') = tf0 a0+ -- TODO Potential bug here: it could simulate too much!+ simSendEvent "CurrentFrameChanged"+ simSendEvent "HistoryChanged"+ simModifyHistory (const (mkHistory (a0, sf) sf'))+ return (a0, b0)++ stepRR stF = do+ simState <- get+ (a', dt, sf', b') <- stF+ p0 <- getPos <$> getSimHistory+ simPrint ("The current frame position before modifying history is " ++ show p0)+ simModifyHistory (`historyRecordFrame1` (a', dt, sf'))+ p1 <- getPos <$> getSimHistory+ simPrint ("The current frame position after modifying history is " ++ show p1)+ l <- (length.snd.fromJust.getInputHistory) <$> getSimHistory+ simPrint ("The number of recorded inputs after modifying history is " ++ show l)++ when (dumpInput (simPrefs simState)) $ simPrint $ "CORE: Input " ++ show a'+ simSendEvent "CurrentFrameChanged"+ simSendEvent "HistoryChanged"+ return (a', Just dt, b')++ step1 = do+ (dt, ma') <- simSense1 False++ history <- getSimHistory+ let a' = fromMaybe (fromJust $ getLastInput history) ma' -- unsafe fromJust+ sf = fromRight $ getCurSF' history+ (b', sf') = (evalAt sf) dt a'+ last <- simActuate True b'++ when last (modify simFinish)+ return (a', dt, sf', b')++ skip1 = do+ (dt, ma') <- simSense1 False++ history <- getSimHistory+ let a' = fromMaybe (fromJust $ getLastInput history) ma' -- unsafe fromJust+ sf = fromRight $ getCurSF' history+ (b',sf') = (evalAt sf) dt a'++ return (a', dt, sf', b')++ stepG = do running <- (historyIsRunning . simHistory) <$> get+ r <- if running then stepRR step1 else (\(a,b) -> (a, Nothing, b)) <$> step0+ -- simSendMsg "StepDone"+ return r++ skipG = do running <- (historyIsRunning . simHistory) <$> get+ r <- if running then stepRR skip1 else (\(a,b) -> (a, Nothing, b)) <$> skip0+ -- simSendMsg "SkipDone"+ return r++ checkCond p dt a0 b0 = do+ simState <- get+ -- Check condition+ let cond = evalPred p dt a0 b0+ when cond $ do+ simPrint ("CORE: Condition became true, with " ++ show (dt, a0) ++ " (" ++ show b0 ++ ")")+ simSendEvent "ConditionMet"+ return cond
+ titan-debug-yampa.cabal view
@@ -0,0 +1,100 @@+cabal-version: >= 1.10+build-type: Simple++name: titan-debug-yampa+version: 1.0.0+author: Ivan Perez+maintainer: ivan.perez@keera.co.uk+homepage: http://github.com/keera-studios/haskell-titan+copyright:+ All Rights Reserved (c) 2018 - 2020 Keera Studios Ltd+ .+ All Rights Reserved (c) 2015 - 2017 Ivan Perez Dominguez+license: GPL-3+license-file: LICENSE+category: Testing+synopsis: Testing Infrastructure for Temporal AbstractioNs - Interactive Yampa debugging layer.+description:+ Yampa debugger that allows you to run an FRP program and control its+ execution.+ .+ TITAN (Testing Infrastructure for Temporal AbstractioNs) is a framework to+ test and debug FRP programs. It allows you to write temporal unit tests, check+ them, QuickCheck them, run FRP programs with a fine-tuned debugger, obtain+ information to replicate tests, and follow and control the execution of a+ Yampa program from an interactive GUI.+ .+ This library provides a replacement function for Yampa's standard simulation+ function (@reactimate@), enabling debugging.+ .+ It also provides a definition of the standard communication interface with+ the debugging GUI, and a default implementation of a communication bridge+ suitable for standalone desktop applications using TCP sockets.++extra-source-files:+ ChangeLog.md++source-repository head+ type: git+ location: git://github.com/keera-studios/haskell-titan.git++flag examples+ default: False+ manual: True++library+ exposed-modules:+ FRP.Titan.Debug.CommTCP+ FRP.Titan.Debug.Yampa++ other-modules:+ Data.Extra+ FRP.Titan.Debug.Comm+ FRP.Titan.Debug.Command+ FRP.Titan.Debug.History+ FRP.Titan.Debug.Predicates+ FRP.Titan.Debug.Preferences+ FRP.Titan.Debug.SimMonad++ build-depends:+ base >=4.7 && < 4.13+ , IfElse+ , network+ , network-bsd+ , stm+ , transformers+ , Yampa++ default-language:+ Haskell2010++ hs-source-dirs:+ src++ ghc-options:+ -Wall -O2++executable titan-debug-yampa-example-bouncing-ball++ main-is:+ BouncingBall.hs++ build-depends:+ base < 5+ , SDL+ , SDL-gfx+ , Yampa+ , titan-debug-yampa++ hs-source-dirs:+ examples/++ default-language:+ Haskell2010++ ghc-options:+ -O3 -Wall -fno-warn-name-shadowing -rtsopts -threaded++ if !flag(examples)+ buildable:+ False