transient (empty) → 0.1.0.0
raw patch · 10 files changed
+2483/−0 lines, 10 filesdep +HTTPdep +basedep +containerssetup-changed
Dependencies added: HTTP, base, containers, directory, filepath, mtl, network, network-info, process, random, stm, transformers, transient
Files
- LICENSE +674/−0
- Main.hs +383/−0
- Setup.hs +2/−0
- move.hs +185/−0
- src/Transient/Backtrack.hs +81/−0
- src/Transient/Base.hs +683/−0
- src/Transient/Indeterminism.hs +101/−0
- src/Transient/Logged.hs +90/−0
- src/Transient/Move.hs +231/−0
- transient.cabal +53/−0
+ 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>.
+ Main.hs view
@@ -0,0 +1,383 @@+ + +{-# LANGUAGE ScopedTypeVariables #-} + +{-# LANGUAGE DeriveDataTypeable #-} +module Main where + +import Data.Typeable +import Transient.Base +import Transient.Backtrack +import Transient.Indeterminism +import Transient.Logged +import Transient.Move +import Transient.EVars +import Control.Applicative +import Control.Concurrent +import Control.Exception +import Control.Monad.State +import Data.Monoid +import System.IO.Unsafe +import System.Directory +import System.FilePath +import Network.HTTP +import Network +import System.IO +import Data.IORef + +import Data.List hiding (find,map, group) + + +main= keep $ do + oneThread $ option "main" "to kill previous spawned processes and return to the main menu" <|> return "" + liftIO $ putStrLn "MAIN MENU" + + nonDeterminsm <|> trans <|> + colors <|> app <|> + futures <|> server <|> + distributed <|> pubSub + +solveConstraint= do + x <- choose [1,2,3] + y <- choose [4,5,6] + + guard $ x * y == 8 + + return (x,y) + +pythags = freeThreads $ do + x <- choose [1..50] + y <- choose ([1..x] :: [Int]) + z <- choose [1..round $ sqrt(fromIntegral $ 2*x*x)] + + guard (x*x+y*y==z*z) + th <- liftIO $ myThreadId + return (x, y, z, th) + +example1= do + option "ex1" "example 1" + r <- threads 4 solveConstraint + liftIO $ print r + +example2= do + option "pyt" "pythagoras" + r<- threads 2 pythags + liftIO $ print r + +collectSample= threads 4 $ do + option "coll" "group sample: return results in a list" + r <- collect 0 $ do + x <- choose [1,2,3] + y <- choose [4,5,6] + th <- liftIO $ threadDelay 1000 >> myThreadId + + return (x,y,th) + + liftIO $ print r + +threadSample= do + option "th" "threads sample" + liftIO $ print "number of threads? (< 10)" + + n <- input ( < 10) + + threads n $ do + x <- choose [1,2,3] + y <- choose [4,5,6] + th <- liftIO $ myThreadId + liftIO $ print (x,y,th) + +nonDeterminsm= do + option "nondet" "Non determinism examples" + example1 <|> example2 + <|> collectSample + <|> threadSample + <|> fileSearch + + + +find' :: String -> FilePath -> TransientIO FilePath +find' s d = do + fs <- liftIO $ getDirectoryContents d + `catch` \(e:: SomeException) -> return [] -- 1 + let fs' = sort $ filter (`notElem` [".",".."]) fs -- 2 + if any (== s) fs' -- 3 + then do + liftIO $ print $ d </> s + return $ d</> s + else do + f <- choose fs' -- 4 + let d' = d </> f -- 6 + isdir <- liftIO $ doesDirectoryExist d' -- 7 + if isdir then find' s d' -- 8 + else stop + + +------------------ + +fileSearch= do + option "file" "example of file search" + r<- threads 3 $ collect 10 $ find' "Main.hs" "." + liftIO $ putStrLn $ "SOLUTION= "++ show r +-- exit + + + + + + + +trans= do + option "trans" "transaction examples with backtracking for undoing actions" + transaction <|> transaction2 + +transaction= do + option "back" "backtracking test" + productNavigation + reserve + payment + +transaction2= do + option "back2" "backtracking test 2" + productNavigation + reserveAndSendMsg + payment + + + liftIO $ print "done!" + + +productNavigation = liftIO $ putStrLn "product navigation" + +reserve= liftIO (putStrLn "product reserved,added to cart") + `onUndo` liftIO (putStrLn "product un-reserved") + +payment = do + liftIO $ putStrLn "Payment failed" + undo + +reserveAndSendMsg= do + reserve + liftIO (putStrLn "update other database necesary for the reservation") + `onUndo` liftIO (putStrLn "database update undone") + + + +colors :: TransientIO () +colors= do + option "colors" "choose between three colors" + r <- color 1 "red" <|> color 2 "green" <|> color 3 "blue" + liftIO $ print r + where + color :: Int -> String -> TransientIO String + color n str= do + option (show n) str + liftIO . print $ str ++ " color" + return str + +app :: TransientIO () +app= do + option "app" "applicative expression that return a counter in 2-tuples every second" + liftIO $ putStrLn "to stop the sequence, write main(enter)" + counter <- liftIO $ newMVar 0 + + r <- (,) <$> number counter 1 <*> number counter 1 + + + liftIO $ putStrLn $ "result=" ++ show r + where + number counter n= waitEvents $ do + threadDelay $ n * 1000000 + n <- takeMVar counter + putMVar counter (n+1) + return n + +futures= do + option "async" "for parallelization of IO actions with applicative and monoidal combinators" + sum1 <|> sum2 + +sum1 :: TransientIO () +sum1= do + option "sum1" "access to two web pages concurrently and sum the number of words using Applicative" + liftIO $ print " downloading data..." + (r,r') <- (,) <$> async (worker "http://www.haskell.org/") + <*> async (worker "http://www.google.com/") + + liftIO $ putStrLn $ "result=" ++ show (r + r') + +getURL= simpleHTTP . getRequest + +worker :: String -> IO Int +worker url=do + r <- getURL url + body <- getResponseBody r + putStrLn $ "number of words in " ++ url ++" is: " ++ show(length (words body)) + return . length . words $ body + +sum2 :: TransientIO () +sum2= do + option "sum2" "access to N web pages concurrenty and sum the number of words using map-fold" + liftIO $ print " downloading data..." + rs <- foldl (<>) (return 0) $ map (async . worker) + [ "http://www.haskell.org/" + , "http://www.google.com/"] + + liftIO $ putStrLn $ "result=" ++ show rs + +instance Monoid Int where + mappend= (+) + mempty= 0 + +server :: TransientIO () +server= do + option "server" "A web server in the port 8080" + liftIO $ print "Server Stated" + sock <- liftIO $ listenOn $ PortNumber 8080 + + (h,_,_) <- spawn $ accept sock `catch` (\(e::SomeException) -> sClose sock >> throw e) + liftIO $ do + hPutStr h msg + putStrLn "new request" + hFlush h + hClose h + `catch` (\(e::SomeException) -> sClose sock) + +msg = "HTTP/1.0 200 OK\r\nContent-Length: 5\r\n\r\nPong!\r\n" + + +-- distributed computing + +distributed= do + option "distr" "examples of distributed computing" + let port1 = PortNumber 2000 + + + addNodes [Node host port1 Nothing] + listen port1 <|> return ()-- conn port1 port1 <|> conn port2 port1 + + examples' host port1 + where + host= "localhost" + conn p p'= connect host p host p' + +examples' remoteHost remotePort= do + logged $ option "maind" "to see this menu" <|> return "" + r <-logged $ option "move" "move to another node" + <|> option "call" "call a function in another node" + <|> option "chat" "chat" + <|> option "netev" "events propagating trough the network" + case r of + "call" -> callExample remoteHost remotePort + "move" -> moveExample remoteHost remotePort + "chat" -> chat + "netev" -> networkEvents remoteHost remotePort + + +callExample host port= do + logged $ putStrLnhp port "asking for the remote data" + s <- callTo host port $ liftIO $ do + putStrLnhp port "remote callTo request" + readIORef environ + + + liftIO $ putStrLn $ "resp=" ++ show s + + +environ= unsafePerformIO $ newIORef "Not Changed" + +moveExample host port= do + putStrLnhp port "enter a string. It will be inserted in the other node by a migrating program" + name <- logged $ input (const True) + beamTo host port + putStrLnhp port "moved!" + putStrLnhp port $ "inserting "++ name ++" as new data in this node" + liftIO $ writeIORef environ name + return() + + +chat :: TransIO () +chat = do + name <- logged $ do liftIO $ putStrLn "Name?" ; input (const True) + text <- logged $ waitEvents $ putStr ">" >> hFlush stdout >> getLine' (const True) + let line= name ++": "++ text + clustered $ liftIO $ putStrLn line + + +networkEvents rh rp= do + logged $ do + putStrLnhp rp "callTo is not a simole remote call. it stablish a connection" + putStrLnhp rp "between transient processes in different nodes" + putStrLnhp rp "in this example, events are piped back from a remote node to the local node" + + r <- callTo rh rp $ do + option "fire" "fire event" + return "event fired" + putStrLnhp rp $ r ++ " in remote node" + +putStrLnhp p msg= liftIO $ putStr (show p) >> putStr " ->" >> putStrLn msg + + +pubSub= do + option "pubs" "an example of publish-subscribe using Event Vars (EVars)" + v <- newEVar :: TransIO (EVar String) + v' <- newEVar + suscribe v v' <|> publish v v' + where + + publish v v'= do + liftIO $ putStrLn "Enter a message to publish" + msg <- input(const True) + writeEVar v msg + liftIO $ putStrLn "after writing first EVar\n" + writeEVar v' $ "second " ++ msg + liftIO $ putStrLn "after writing second EVar\n" + publish v v' + + suscribe :: EVar String -> EVar String -> TransIO () + suscribe v v'= do + r <- (,) <$> proc1 v <*> proc2 v' + liftIO $ do + putStr $ "applicative result= " + print r + + suscribe2 :: EVar String -> EVar String -> TransIO () + suscribe2 v v'= do + x <- readEVar v + y <- readEVar v' + liftIO $ do + putStr "monadic result" + print (x,y) + + proc1 v= do + msg <- readEVar v + liftIO $ putStrLn $ "proc1 readed var: " ++ show msg + return msg + + proc2 v= do + msg <- readEVar v + liftIO $ putStrLn $ "proc2 readed var: " ++ show msg + return msg + + + + + + +--main=do +-- r <- getURL "https://www.w3.org/services/html2txt?url=http%3A%2F%2Fwww.searchquotes.com%2Fsearch%2Ftransient%2F" +-- body <- getResponseBody r +-- print $ parse quote' "" body +-- where +-- quote'= do +-- q <- between(brackets natural) (brackets natural) string +-- +-- if "http" `isPrefixOf` q +-- then quote' +-- else return q +-- + +--main = case (parse numbers "" "11, 2, 43") of +-- Left err -> print err +-- Right xs -> print (sum xs) +-- +--numbers = commaSep integer
+ Setup.hs view
@@ -0,0 +1,2 @@+import Distribution.Simple +main = defaultMain
+ move.hs view
@@ -0,0 +1,185 @@+{-# LANGUAGE ScopedTypeVariables, DeriveDataTypeable #-} +module Main where + +import Transient.Move +import Transient.Logged +import Transient.Base +import Network +import Control.Applicative + +import Control.Monad.IO.Class +import System.Environment +import System.IO.Unsafe +import Data.Monoid +import System.IO +import Control.Monad +import Data.Maybe +import Control.Exception +import Control.Concurrent (threadDelay) +import Data.Typeable +import Control.Concurrent.STM +import Data.IORef + + +main= do + let port1 = PortNumber 2000 + port2 = PortNumber 2001 + + + keep $ do + conn port1 port1 <|> conn port2 port1 + + examples' host port2 + where + host= "localhost" +-- delay = liftIO $ threadDelay 1000000 + conn p p'= connect host p host p' + + + + + +test = do + args <- getArgs + let ports= [("localhost",PortNumber 2000), ("localhost",PortNumber 2001)] + + let [(_,port1), (_,port2)]= if null args then ports else reverse ports + print [port1, port2] + let local= "localhost" + beamInit port1 $ do + logged $ option "call" "call" + callTo local port2 (liftIO $ print "HOLA") + <|> callTo local port2(liftIO $ print "HELLO") + + + +two = do + args <- getArgs + if length args < 2 + then do + putStrLn "The program need at least two parameters: localHost localPort remoteHost RemotePort" + putStrLn "Start one node alone. The rest, connected to this node." + return () + else keep $ do + let localHost= head args + localPort= PortNumber . fromInteger . read $ args !! 1 + (remoteHost,remotePort) = + if length args >=4 + then(args !! 2, PortNumber . fromInteger . read $ args !! 3) + else (localHost,localPort) + connect localHost localPort remoteHost remotePort + examples + + +examples = do + nodes <- logged getNodes + logged $ liftIO $ print $ "NODES=" ++ show nodes + let (remoteHost,remotePort)= head $ tail nodes + examples' remoteHost remotePort + +examples' remoteHost remotePort= do + logged $ option "main" "to see the menu" <|> return "" + r <-logged $ option "move" "move to another node" + <|> option "call" "call a function in another node" + <|> option "chat" "chat" + <|> option "netev" "events propagating trough the network" + case r of + "call" -> callExample remoteHost remotePort + "move" -> moveExample remoteHost remotePort + "chat" -> chat + "netev" -> networkEvents remoteHost remotePort + +data Environ= Environ (IORef String) deriving Typeable + +callExample host port= do + logged $ putStrLnhp port "asking for the remote data" + s <- callTo host port $ do + putStrLnhp port "remote callTo request" + Environ environ <- getSData <|> do + ref <- liftIO $ newIORef "Not Changed" + let env= Environ ref + setSData env + return env + liftIO $ readIORef environ + + + liftIO $ putStrLn $ "resp=" ++ show s + + +environ= unsafePerformIO $ newIORef "Not Changed" + +moveExample host port= do + putStrLnhp port "enter a string. It will be inserted in the other node by a migrating program" + name <- logged $ input (const True) + beamTo host port + putStrLnhp port "moved!" + putStrLnhp port $ "inserting "++ name ++" as new data in this node" + Environ environ <- getSData <|> do + ref <- liftIO $ newIORef "Not Changed" + let env= Environ ref + setSData env + return env + + liftIO $ writeIORef environ name + return() + + +chat :: TransIO () +chat = do + name <- logged $ do liftIO $ putStrLn "Name?" ; input (const True) + text <- logged $ waitEvents $ putStr ">" >> hFlush stdout >> getLine' (const True) + let line= name ++": "++ text + clustered $ liftIO $ putStrLn line + + +networkEvents rh rp= do + logged $ do + putStrLnhp rp "callTo is not a simole remote call. it stablish a connection" + putStrLnhp rp "between transient processes in different nodes" + putStrLnhp rp "in this example, events are piped back from a remote node to the local node" + + r <- callTo rh rp $ do + option "fire" "fire event" + return "event fired" + putStrLnhp rp $ r ++ " in remote node" + +putStrLnhp p msg= liftIO $ putStr (show p) >> putStr " ->" >> putStrLn msg + + + + + +--call host port proc params= do +-- port <- getPort +-- listen port <|> return +-- parms <- logged $ return params +-- callTo host port proc parms +-- close +-- +--distribute proc= do +-- case dataFor proc +-- Nothing -> proc +-- Just dataproc -> do +-- (h,p) <- bestNode dataproc +-- callTo h p proc +-- +--bestNode dataproc= +-- nodes <- getNodes +-- (h,p) <- bestMatch dataproc nodes <- user defined +-- +--bestMatch (DataProc nodesAccesed cpuLoad resourcesNeeded) nodes= do +-- nodesAccesed: node, response +-- +--bestMove= do +-- thisproc <- gets myProc +-- case dataFor thisproc +-- Nothing -> return () +-- Just dataproc -> do +-- (h,p) <- bestNode dataproc +-- moveTo h p +-- +-- +--inNetwork= do +-- p <- getPort +-- listen p <|> return () +
+ src/Transient/Backtrack.hs view
@@ -0,0 +1,81 @@+{-# LANGUAGE DeriveDataTypeable #-} +{-# LANGUAGE ExistentialQuantification #-} + +-- | <https://www.fpcomplete.com/user/agocorona/the-hardworking-programmer-ii-practical-backtracking-to-undo-actions> + +module Transient.Backtrack (registerUndo, onUndo, undo, retry, undoCut) where + +import Transient.Base +import Data.Typeable +import Control.Applicative +import Control.Monad.State +import Unsafe.Coerce +import System.Mem.StableName + +data Backtrack= forall a b.Backtrack{backtracking :: Bool + ,backStack :: [EventF]} + deriving Typeable + +-- | assures that backtracking will not go further back +undoCut :: TransientIO () +undoCut= Transient $ do + delSessionData $ Backtrack False [] + return $ Just () + +-- | the secod parameter will be executed when backtracking +{-# NOINLINE onUndo #-} +onUndo :: TransientIO a -> TransientIO a -> TransientIO a +onUndo ac bac= do + r<-registerUndo $ Transient $ do + Backtrack back _ <- getSessionData `onNothing` return (Backtrack False []) + runTrans $ if back then bac else ac + return r + +-- | register an action that will be executed when backtracking +{-# NOINLINE registerUndo #-} +registerUndo :: TransientIO a -> TransientIO a +registerUndo f = Transient $ do + cont@(EventF x _ _ _ _ _ _ _ _) <- get !> "backregister" + md <- getSessionData + ss <- case md of + Just (bss@(Backtrack b (bs@((EventF x' _ _ _ _ _ _ _ _):_)))) -> do + addrx <- addr x + addrx' <- addr x' -- to avoid duplicate backtracking points + return $ if addrx == addrx' then bss else Backtrack b $ cont:bs + Nothing -> return $ Backtrack False [cont] + setSessionData ss + runTrans f + where + addr x = liftIO $ return . hashStableName =<< (makeStableName $! x) + +-- | restart the flow forward from this point on +retry :: TransientIO () +retry= do + Backtrack _ stack <- getSessionData `onNothing` return (Backtrack False []) + setSData $ Backtrack False stack + +-- | execute backtracking. It execute the registered actions in reverse order. +-- +-- If the backtracking flag is changed the flow proceed forward from that point on. +-- +--If the backtrack stack is finished or undoCut executed, `undo` will stop. +undo :: TransientIO a +undo= Transient $ do + bs <- getSessionData `onNothing` return nullBack !>"GOBACK" + goBackt bs + + where + nullBack= Backtrack False [] + goBackt (Backtrack _ [])= return Nothing !> "END" + goBackt (Backtrack b (stack@(first@(EventF x fs _ _ _ _ _ _ _): bs)))= do +-- put first{replay=True} + setSData $ Backtrack True stack + mr <- runClosure first !> "RUNCLOSURE" + Backtrack back _ <- getSessionData `onNothing` return nullBack + !>"END RUNCLOSURE" + case back of + True -> goBackt $ Backtrack True bs !> "BACK AGAIN" + False -> case mr of + Nothing -> return empty !> "FORWARD END" + Just x -> runContinuation first x !> "FORWARD EXEC" +
+ src/Transient/Base.hs view
@@ -0,0 +1,683 @@+{-# LANGUAGE ScopedTypeVariables #-} +----------------------------------------------------------------------------- +-- +-- Module : Base +-- Copyright : +-- License : GPL (Just (Version {versionBranch = [3], versionTags = []})) +-- +-- Maintainer : agocorona@gmail.com +-- Stability : +-- Portability : +-- +-- | See http://github.com/agocorona/transient +-- everithing in this module is exported in order to allow extensibility. +----------------------------------------------------------------------------- +{-# LANGUAGE ExistentialQuantification #-} +{-# LANGUAGE FlexibleContexts #-} +{-# LANGUAGE FlexibleInstances #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE DeriveDataTypeable #-} +-- show +module Transient.Base where +-- /show + +import Control.Applicative +import Control.Monad.State +import Data.Dynamic +import qualified Data.Map as M +import Data.Monoid +import Debug.Trace +import System.IO.Unsafe +import Unsafe.Coerce +import Control.Exception +import Control.Concurrent +import Control.Concurrent.STM +import System.Mem.StableName +import Data.Maybe +import GHC.Conc +import Data.List +import Data.IORef + + +{-# INLINE (!>) #-} +(!>) = const . id -- flip trace +infixr 0 !> + +data TransIO x = Transient {runTrans :: StateT EventF IO (Maybe x)} +type SData= () + +type EventId= Int + +type TransientIO= TransIO + +data EventF = forall a b . EventF{xcomp :: TransientIO a + ,fcomp :: [b -> TransientIO b] + ,mfData :: M.Map TypeRep SData + ,mfSequence :: Int + ,threadId :: ThreadId + ,freeTh :: Bool + ,parent :: Maybe EventF + ,children :: TVar[EventF] + ,maxThread :: Maybe (P Int) + } + deriving Typeable + +type P= IORef +newp= newIORef + + +--(=:) :: P a -> (a -> a) -> IO() +(=:) n f= liftIO $ atomicModifyIORef' n $ \v -> ((f v),()) + +addr x= show $ unsafePerformIO $ do + st <- makeStableName $! x + return $ hashStableName st + + + + +instance MonadState EventF TransientIO where + get= Transient $ get >>= return . Just + put x= Transient $ put x >> return (Just ()) + +type StateIO= StateT EventF IO + +--type TransientIO= Transient StateIO + +--runTrans :: TransientIO x -> StateT EventF IO (Maybe x) +--runTrans (Transient mx) = mx + + +runTransient :: TransientIO x -> IO (Maybe x, EventF) +runTransient t= do + + th <- myThreadId + let eventf0= EventF empty [] M.empty 0 + th False Nothing (unsafePerformIO $ newTVarIO []) Nothing + + + runStateT (runTrans t) eventf0{threadId=th} !> "MAIN="++show th + + + + +-- | get the continuation context: closure, continuation, state, child threads etc +getCont ::(MonadState EventF m) => m EventF +getCont = get + +-- | run the continuation context +runCont :: EventF -> StateIO () +runCont (EventF x fs _ _ _ _ _ _ _)= runTrans ((unsafeCoerce x') >>= compose ( fs)) >> return () + where + x'= do +-- modify $ \s -> s{replay=True} + r<- x +-- modify $ \s -> s{replay=False} + return r + +{- +runCont cont= do + mr <- runClosure cont + case mr of + Nothing -> return Nothing + Just r -> runContinuation cont r +-} + +-- | compose a list of continuations +compose []= const empty +compose (f: fs)= \x -> f x >>= compose fs + + +-- | run the closure (the 'x' in 'x >>= f') of the current bind operation. +runClosure :: EventF -> StateIO (Maybe a) +runClosure (EventF x _ _ _ _ _ _ _ _) = unsafeCoerce $ runTrans x + +-- | run the continuation (the 'f' in 'x >> f') of the current bind operation +runContinuation :: EventF -> a -> StateIO (Maybe b) +runContinuation (EventF _ fs _ _ _ _ _ _ _) x= runTrans $ (unsafeCoerce $ compose $ fs) x + +instance Functor TransientIO where + fmap f mx= -- Transient $ fmap (fmap f) $ runTrans mx + do + x <- mx + return $ f x + +instance Applicative TransientIO where + pure a = Transient . return $ Just a + + + f <*> g = Transient $ do + + rf <- liftIO $ newIORef Nothing + rg <- liftIO $ newIORef Nothing -- !> "NEWIOREF" + + cont@(EventF _ fs a b c d peers children g1) <- get -- !> "APLICATIVE DOIT" + + let + appg x = Transient $ do + liftIO $ writeIORef rg $ Just x :: StateIO () + k <- liftIO $ readIORef rf + return $ k <*> Just x -- !> "RETURNED: " ++ show(isJust k)++ show(isJust x) + + + appf k = Transient $ do + liftIO $ writeIORef rf $ Just k :: StateIO () + x<- liftIO $ readIORef rg + return $ Just k <*> x -- !> "RETURNED: " ++ show(isJust k)++ show(isJust x) + + + + put $ EventF f (unsafeCoerce appf: fs) + a b c d peers children g1 + k <- runTrans f + was <- getSessionData `onNothing` return NoRemote + if was== WasRemote + then return Nothing + else do + liftIO $ writeIORef rf k -- :: StateIO () + + mfdata <- gets mfData + put $ EventF g (unsafeCoerce appg : fs) mfdata b c d peers children g1 + + + x <- runTrans g !> "RUN g" + liftIO $ writeIORef rg x + return $ k <*> x + +-- | dynamic serializable data for logging +data IDynamic= IDyns String | forall a.(Read a, Show a,Typeable a) => IDynamic a + +instance Show IDynamic where + show (IDynamic x)= show $ show x + show (IDyns s)= show s + +instance Read IDynamic where + readsPrec n str= map (\(x,s) -> (IDyns x,s)) $ readsPrec n str + + +type Recover= Bool +type CurrentPointer= [LogElem] +type LogEntries= [LogElem] +data LogElem= WaitRemote | Exec | Step IDynamic deriving (Read,Show) +data Log= Log Recover CurrentPointer LogEntries deriving Typeable + + +instance Alternative TransientIO where + empty = Transient $ return Nothing + (<|>) = mplus + +-- Transient f <|> Transient g= Transient $ do +-- k <- f +-- x <- g +-- return $ k <|> x + +data RemoteStatus= WasRemote | NoRemote deriving (Typeable, Eq) + +instance MonadPlus TransientIO where + mzero= empty + mplus x y= Transient $ do + mx <- runTrans x -- !> "RUNTRANS11111" + was <- getSessionData `onNothing` return NoRemote + if was== WasRemote + then return Nothing + else case mx of + Nothing -> runTrans y -- !> "RUNTRANS22222" + justx -> return justx + +-- | a sinonym of empty that can be used in a monadic expression. it stop the +-- computation +stop :: TransientIO a +stop= Control.Applicative.empty + +instance Monoid a => Monoid (TransientIO a) where + mappend x y = mappend <$> x <*> y + mempty= return mempty + +-- | set the current closure and continuation for the current statement +setEventCont :: TransientIO a -> (a -> TransientIO b) -> StateIO () +setEventCont x f = do + st@(EventF _ fs d n r applic ch rc bs) <- get + put $ EventF x ( unsafeCoerce f : fs) d n r applic ch rc bs + + +-- | reset the closure and continuation. remove inner binds than the prevous computations may have stacked +-- in the list of continuations. +resetEventCont :: Maybe a -> StateIO () +resetEventCont mx =do + st@(EventF _ fs d n r nr ch rc bs) <- get + + let f= \mx -> case mx of + Nothing -> empty + Just x -> (unsafeCoerce $ head fs) x + put $ EventF (f mx) ( tailsafe fs)d n r nr ch rc bs + where + tailsafe []=[] + tailsafe (x:xs)= xs + + +instance Monad TransientIO where + return x = Transient $ return $ Just x + x >>= f = Transient $ do + setEventCont x f + + mk <- runTrans x + resetEventCont mk + case mk of + Just k -> do + runTrans $ f k + + Nothing -> return Nothing + + + + +--instance MonadTrans (Transient ) where +-- lift mx = Transient $ mx >>= return . Just + +instance MonadIO TransientIO where + liftIO x = Transient $ liftIO x >>= return . Just -- let x= liftIO io in x `seq` lift x + + + + +-- * Threads + +waitQSemB sem= atomicModifyIORef' sem $ \n -> if n > 0 then(n-1,True) else (n,False) +signalQSemB sem= atomicModifyIORef' sem $ \n -> (n + 1,()) + +-- | set the maximun number of threads for a procedure. It is useful for the +threads :: Int -> TransientIO a -> TransientIO a +threads n proc= Transient $ do + msem <- gets maxThread + sem <- liftIO $ newIORef n + modify $ \s -> s{maxThread= Just sem} + r <- runTrans proc + modify $ \s -> s{maxThread = msem} -- restore it + return r +-- | delete all the previous childs generated by the expressions and continue execution +-- of the current thread. +oneThread :: TransientIO a -> TransientIO a +oneThread comp= do + chs <- liftIO $ newTVarIO [] + r <- comp + modify $ \ s -> s{children= chs} + killChilds + return r + + + +-- | The threads generated in the process passed as parameter will not be killed. +freeThreads :: TransientIO a -> TransientIO a +freeThreads proc= Transient $ do + st <- get + put st{freeTh= True} + r <- runTrans proc + modify $ \st -> st{freeTh= freeTh st} + return r + +-- | The threads will be killed when the parent thread dies. That is the default +-- This can be invoked to revert the effect of `freeThreads` +hookedThreads :: TransientIO a -> TransientIO a +hookedThreads proc= Transient $ do + st <- get + put st{freeTh= False} + r <- runTrans proc + modify $ \st -> st{freeTh= freeTh st} + return r + + +-- | kill all the child processes +killChilds :: TransientIO() +killChilds= Transient $ do + cont <- get + liftIO $ killChildren cont + return $ Just () + +-- * extensible state: session data management + +-- | Get the session data for the desired type if there is any. +getSessionData :: (MonadState EventF m,Typeable a) => m (Maybe a) +getSessionData = resp where + resp= gets mfData >>= \list -> + case M.lookup ( typeOf $ typeResp resp ) list of + Just x -> return . Just $ unsafeCoerce x + Nothing -> return $ Nothing + typeResp :: m (Maybe x) -> x + typeResp= undefined + +-- | getSessionData specialized for the Transient monad. if Nothing, the +-- monadic computation does not continue. +-- +-- If there is no such data, `getSData` silently stop the computation. +-- That may or may not be the desired behaviour. +-- To make sure that this does not get unnoticed, use this construction: +-- +-- > getSData <|> error "no data" +-- +getSData :: Typeable a => TransIO a +getSData= Transient getSessionData + + +-- | set session data for this type. retrieved with getSessionData orr getSData +setSessionData :: (MonadState EventF m, Typeable a) => a -> m () +setSessionData x= do + let t= typeOf x in modify $ \st -> st{mfData= M.insert t (unsafeCoerce x) (mfData st)} + +-- | a shorter name for setSessionData +setSData :: ( MonadState EventF m,Typeable a) => a -> m () +setSData= setSessionData + +delSessionData x= + modify $ \st -> st{mfData= M.delete (typeOf x ) (mfData st)} + +delSData :: ( MonadState EventF m,Typeable a) => a -> m () +delSData= delSessionData + +--withSData :: ( MonadState EventF m,Typeable a) => (Maybe a -> a) -> m () +--withSData f= modify $ \st -> st{mfData= +-- let dat = mfData st +-- mx= M.lookup typeofx dat +-- mx'= case mx of Nothing -> Nothing; Just x -> unsafeCoerce x +-- fx= f mx' +-- typeofx= typeOf $ typeoff f +-- in M.insert typeofx (unsafeCoerce fx) dat} +-- where +-- typeoff :: (Maybe a -> a) -> a +-- typeoff = undefined +---- + +-- | generator of identifiers +genNewId :: MonadIO m => MonadState EventF m => m Int +genNewId= do + st <- get + + let n= mfSequence st + put $ st{mfSequence= n+1} + return n + +refSequence :: IORef Int +refSequence= unsafePerformIO $ newp 0 + + + +data Loop= Once | Loop | Multithread deriving Eq + +-- | variant of `parallel` that repeatedly executes the IO computation and kill the previously created childs +waitEvents :: IO b -> TransientIO b +waitEvents io= do + r <- parallel (Right <$> io) + killChilds + return r + +-- | variant of + parallel` that execute the IO computation once, and kill the previous child threads +async :: IO b -> TransientIO b +async io= do + r <- parallel (Left <$>io) + killChilds + return r + +spawn :: IO b -> TransientIO b +spawn io= freeThreads $ do + r <- parallel (Right <$>io) + return r + +data EventValue= EventValue SData deriving Typeable + +-- | return empty to the current thread and launch the IO action in a new thread and attaches the continuation after it. +-- if the result of the action is `Right` the process is repeated. if not, it finish. +-- +-- If the maximum number of threads, set with `threads` has been reached `parallel` perform +-- the work sequentially, in the current thread. +-- +-- when finish, increase the counter of threads available, if there is a limitation of them. + +parallel :: IO (Either b b) -> TransientIO b +parallel ioaction= Transient$ do + cont <- getCont -- !> "PARALLEL" + mv <- getSessionData + case mv of + Just (EventValue v) -> do + delSessionData $ EventValue () -- !> "ISJUST " + return $ Just $ unsafeCoerce v + Nothing -> do + liftIO $ loop cont ioaction + return Nothing + + + + +loop (cont'@(EventF x fs a b c d peers childs g)) rec = do + chs <- liftIO $ newTVarIO [] + let cont = EventF x fs a b c d (Just cont') chs g + iocont dat= + runStateT ( do + setSessionData . EventValue $ unsafeCoerce dat + runCont cont + ) cont + >> return () + loop'= do + mdat <- rec + case mdat of + Left dat -> iocont dat + + Right dat -> do + forkMaybe cont $ iocont dat + loop' + + forkMaybe cont loop' + where + forkMaybe cont proc = do + dofork <- case maxThread cont of + Nothing -> return True + Just sem -> do + dofork <- waitQSemB sem + if dofork then return True else return False + + if dofork + then do + th <- forkFinally proc $ \me -> do + case me of -- !> "THREAD ENDED" of + Left e -> do + when (fromException e /= Just ThreadKilled)$ liftIO $ print e + killChildren cont !> "KILL RECEIVED" ++ (show $ unsafePerformIO myThreadId) + + Right _ -> do + -- if parent is alive + -- then remove himself from the list (with free) + -- and pass his active children to his parent + return () + th <- myThreadId + mparent <- free th cont + case mparent of + Nothing -> return() + Just parent -> atomically $ do + chs' <- readTVar $ children cont + chs <- (readTVar $ children parent) + writeTVar (children parent)$ chs ++ chs' + return () + + case maxThread cont of + Just sem -> signalQSemB sem + Nothing -> return () + + + addThread cont' cont{threadId=th} -- !> "thread created: "++ show th + + else proc -- !> "NO THREAD" + + + +free th env= do + if isNothing $ parent env + then return Nothing !> show th ++ " orphan" + else do + let msibling= fmap children $ parent env + + case msibling of + Nothing -> return Nothing + Just sibling -> do + found <- atomically $ do + sbs <- readTVar sibling + let (sbs', found) = drop [] th sbs -- !> "search "++show th ++ " in " ++ show (map threadId sbs) + when found $ writeTVar sibling sbs' + return found + if (not found && isJust (parent env)) + then free th $ fromJust $ parent env -- !> "toparent" + else return $ Just env + + where + drop processed th []= (processed,False) + drop processed th (ev:evts)| th == threadId ev= (processed ++ evts, True) + | otherwise= drop (ev:processed) th evts + + +addThread parent child = when(not $ freeTh parent) $ do + let headpths= children parent + atomically $ do + ths <- readTVar headpths + writeTVar headpths $ child:ths + +-- | kill all the threads associated with the continuation context +killChildren cont = do + forkIO $ do + let childs= children cont !> "killChildren list= "++ addr (children cont) + ths <- atomically $ do + ths <- readTVar childs + writeTVar childs [] + return ths + mapM_ (killThread . threadId) ths !> "KILLEVENT " ++ show (map threadId ths) + return () + + +type EventSetter eventdata response= (eventdata -> IO response) -> IO () +type ToReturn response= IO response + +-- | deinvert an event handler. The first parameter is the event handler to be deinverted +-- the second is the value to return to the event handler +-- it configures the event handler by calling the first parameter, that set the event +-- handler, with the current continuation +react + :: Typeable eventdata + => EventSetter eventdata response + -> ToReturn response + -> TransientIO eventdata +react setHandler iob= Transient $ do + cont <- getCont + mEvData <- getSessionData + case mEvData of + Nothing -> do + liftIO $ setHandler $ \dat ->do +-- let cont'= cont{mfData = M.insert (typeOf dat)(unsafeCoerce dat) (mfData cont)} + runStateT (setSData dat >> runCont cont) cont + iob + return Nothing + Just dat -> delSessionData dat >> return (Just dat) + + +-- * non-blocking keyboard input + +getLineRef= unsafePerformIO $ newTVarIO Nothing + + +roption= unsafePerformIO $ newMVar [] + +-- | install a event receiver that wait for a string and trigger the continuation when this string arrives. +option :: (Typeable b, Show b, Read b, Eq b) => + b -> [Char] -> TransientIO b +option ret message= do + let sret= show ret + + liftIO $ putStrLn $ "Enter "++sret++"\tto: " ++ message + liftIO $ modifyMVar_ roption $ \msgs-> return $ sret:msgs + waitEvents $ getLine' (==ret) + liftIO $ putStrLn $ show ret ++ " chosen" + return ret + + +-- | validates an input entered in the keyboard in non blocking mode. non blocking means that +-- the user can enter also anything else to activate other option +-- unlike `option`, input only wait for one valid response +input :: (Typeable a, Read a) => (a -> Bool) -> TransientIO a +input cond= Transient . liftIO . atomically $ do + mr <- readTVar getLineRef + case mr of + Nothing -> retry + Just r -> + case reads1 r of + (s,_):_ -> if cond s -- !> show (cond s) + then do + writeTVar getLineRef Nothing -- !>"match" + return $ Just s + + else return Nothing + _ -> return Nothing + +-- | non blocking `getLine` with a validator +getLine' cond= do + atomically $ do + mr <- readTVar getLineRef + case mr of + Nothing -> retry + Just r -> + case reads1 r of -- !> ("received " ++ show r ++ show (unsafePerformIO myThreadId)) of + (s,_):_ -> if cond s -- !> show (cond s) + then do + writeTVar getLineRef Nothing -- !>"match" + return s + + else retry + _ -> retry + +reads1 s=x where + x= if typeOf(typeOfr x) == typeOf "" then unsafeCoerce[(s,"")] else readsPrec 0 s + typeOfr :: [(a,String)] -> a + typeOfr = undefined + +inputLoop= do + putStrLn "Press end to exit" + inputLoop' -- !> "started inputLoop" + where + + inputLoop'= do + r<- getLine + if r=="end" then putMVar rexit () else do + let rs = breakSlash [] r + mapM_ (\ r -> do threadDelay 1000 + atomically . writeTVar getLineRef $ Just r) rs + inputLoop' + + breakSlash :: [String] -> String -> [String] + breakSlash s ""= s + breakSlash res s= + let (r,rest) = span(/= '/') s + in breakSlash (res++[r]) $ tail1 rest + where + tail1 []=[] + tail1 x= tail x + + +rexit= unsafePerformIO newEmptyMVar + +stay= takeMVar rexit + +-- | keep the main thread running, initiate the asynchronous keyboard input and execute +-- the transient computation. +keep mx = do + forkIO $ inputLoop + forkIO $ runTransient mx >> return () + stay + +-- | force the finalization of the main thread and thus, all the application +exit :: TransientIO a +exit= do + liftIO $ putStrLn "Tempus fugit: exit" + liftIO $ putMVar rexit True + return undefined + +-- | alternative operator for maybe values. Used in infix mode +onNothing :: Monad m => m (Maybe b) -> m b -> m b +onNothing iox iox'= do + mx <- iox + case mx of + Just x -> return x + Nothing -> iox'
+ src/Transient/Indeterminism.hs view
@@ -0,0 +1,101 @@+----------------------------------------------------------------------------- +-- +-- Module : Transient.Indeterminism +-- Copyright : +-- License : GPL (Just (Version {versionBranch = [3], versionTags = []})) +-- +-- Maintainer : agocorona@gmail.com +-- Stability : +-- Portability : +-- +-- | see <https://www.fpcomplete.com/user/agocorona/beautiful-parallel-non-determinism-transient-effects-iii> +-- +----------------------------------------------------------------------------- +{-# LANGUAGE BangPatterns #-} +module Transient.Indeterminism ( +choose, choose', collect, group --, found +) where + +import Transient.Base +import Control.Monad.IO.Class +import Data.IORef +import Control.Applicative +import Data.Monoid +import Control.Concurrent +import Data.Typeable +import Control.Monad.State +import Control.Concurrent.STM as STM +import GHC.Conc + + +-- | slurp a list of values and process them in parallel . To limit the number of processing +-- threads, use `threads` +choose :: [a] -> TransientIO a +choose []= empty +choose xs = do + evs <- liftIO $ newIORef xs + parallel $ do + es <- atomicModifyIORef' evs $ \es -> let !tes= tail es in (tes,es) + case es of + [x] -> return $ Left $ head es + x:_ -> return $ Right x + +-- | group the output of a possible multithreaded process in groups of n elements. +group :: Int -> TransientIO a -> TransientIO [a] +group num proc = do + v <- liftIO $ newIORef (0,[]) + x <- proc + n <- liftIO $ atomicModifyIORef' v $ \(n,xs) -> let !n'=n +1 in ((n', x:xs),n') + if n < num + then stop + else liftIO $ atomicModifyIORef v $ \(n,xs) -> ((0,[]),xs) + +-- | alternative definition with more parallelism +choose' :: [a] -> TransientIO a +choose' xs = foldl (<|>) empty $ map (parallel . return . Left) xs + + +--newtype Collect a= Collect (MVar (Int, [a])) deriving Typeable + +-- collect the results of a search done in parallel, usually initiated by +-- `choose` . The results are added to the collection with `found` +-- +-- + + +-- | execute a process and get the first n solutions. +-- if the process end without finding the number of solutions requested, it return the fond ones +-- if he find the number of solutions requested, it kill the threads of the process and return +-- It works monitoring the solutions found and the number of active threads. +-- If the first parameter is 0, collect will return all the results +collect :: Int -> TransientIO a -> TransientIO [a] +collect n search= do + rv <- liftIO $ atomically $ newTVar (0,[]) !> "NEWMVAR" + endflag <- liftIO $ newTVarIO False + st <- get + let any1 = do + r <- search !> "ANY" + liftIO $ atomically $ do + (n1,rs) <- readTVar rv + writeTVar rv (n1+1,r:rs) !> "MODIFY" + stop + + detect= freeThreads $ do + xs <- async $ do + threadDelay 1000 -- to allow some activity before monitoring it + atomically $ do + (n',xs) <- readTVar rv + ns <- readTVar $ children st + + if (n > 0 && n' >= n) || null ns !> show (n,n') !> (show $ length ns) + then return xs + else retry + + th <- liftIO $ myThreadId !> "KILL" + stnow <- get + liftIO $ killChildren st + liftIO $ addThread st stnow + return xs + + (any1 >> stop) <|> detect +
+ src/Transient/Logged.hs view
@@ -0,0 +1,90 @@+----------------------------------------------------------------------------- +-- +-- Module : Transient.Logged +-- Copyright : +-- License : GPL-3 +-- +-- Maintainer : agocorona@gmail.com +-- Stability : +-- Portability : +-- +-- | +-- +----------------------------------------------------------------------------- +{-# LANGUAGE ExistentialQuantification #-} +module Transient.Logged where + +import Data.Typeable +import Unsafe.Coerce +import Transient.Base +import Control.Applicative +import Control.Monad.IO.Class + +--data IDynamic= IDyns String | forall a.(Read a, Show a,Typeable a) => IDynamic a + +--instance Show IDynamic where +-- show (IDynamic x)= show $ show x +-- show (IDyns s)= show s +-- +--instance Read IDynamic where +-- readsPrec n str= map (\(x,s) -> (IDyns x,s)) $ readsPrec n str + + +fromIDyn :: (Read a, Show a, Typeable a) => IDynamic -> a +fromIDyn (IDynamic x)= unsafeCoerce x + +fromIDyn (IDyns s)=r where r= read s !> "read " ++ s ++ "to type "++ show (typeOf r) + +toIDyn x= IDynamic x + +-- | synonymous of `step` +logged :: (Show a, Read a, Typeable a) => TransientIO a -> TransientIO a +logged= step + + + +-- | write the result of the computation in the log and return it. +-- but if there is data in the internal log, it read the data from the log and +-- do not execute the computation. +-- +-- It accept nested step's. The effect is that if the outer step is executed completely +-- the log of the inner steps are erased. If it is not the case, the inner steps are logged +-- this reduce the log of large computations to the minimum. That is a feature not present +-- in the package Workflow. +-- +-- > r <- step $ do +-- > step this :: TransIO () +-- > step that :: TransIO () +-- > step thatOther +-- > liftIO $ print r +-- +-- when `print` is executed, the log is just the value of r. +-- +-- but when `thatOther` is executed the log is: [Exec,(), ()] +-- +step :: (Show a, Read a, Typeable a) => TransientIO a -> TransientIO a +step mx= do + Log recover rs full <- getSData <|> return ( Log False [][]) + + case (recover,rs) of + (True, Step x: rs') -> do + setSData $ Log recover rs' full + return $ fromIDyn x !> "read in step:" ++ show x + + (True,Exec:rs') -> do + setSData $ Log recover rs' full + mx + + (True, WaitRemote:rs') -> do + setSData (Log recover rs' full) !> "waitRemote2" + empty + + _ -> do + let add= Exec: full + setSData $ Log False add add + r <- mx + let add= Step (toIDyn r): full + setSData $ Log False add add + return r + +
+ src/Transient/Move.hs view
@@ -0,0 +1,231 @@+----------------------------------------------------------------------------- +-- +-- Module : Transient.Move +-- Copyright : +-- License : GPL-3 +-- +-- Maintainer : agocorona@gmail.com +-- Stability : +-- Portability : +-- +-- | see <https://www.fpcomplete.com/user/agocorona/moving-haskell-processes-between-nodes-transient-effects-iv> +----------------------------------------------------------------------------- +{-# LANGUAGE DeriveDataTypeable , ExistentialQuantification + ,ScopedTypeVariables, StandaloneDeriving #-} +module Transient.Move where +import Transient.Base +import Transient.Logged +import Data.Typeable +import Control.Applicative +import Network +import Network.HTTP +import Control.Monad.IO.Class +import System.IO +import Control.Exception +import Data.Maybe +import Unsafe.Coerce +import System.Process +import System.Directory +import Control.Monad +import Network.Info +import System.IO.Unsafe +import Control.Concurrent.STM as STM +import Data.Monoid +import qualified Data.Map as M +import Data.List (nub,(\\)) + + + +-- | install in a remote node a haskell package with an executable transient service initialized with `listen` +-- the package, the git repository and the main exectable must have the same name +installService node port servport package= do + beamTo node port + liftIO $ do + let packagename= name package + exist <- doesDirectoryExist packagename + when (not exist) $ do + runCommand $ "git clone "++ package + runCommand $ "cd "++ packagename + runCommand "cabal install" + createProcess $ shell $ "./dist/build/"++ packagename++"/"++packagename + ++ " " ++ show port + return() + where + name path= + let x= dropWhile (/= '/') path + in if x== "" then tail path else name $ tail x + +-- | continue the execution in a new node +-- all the previous actions from `listen` to this statement must have been logged +beamTo :: HostName -> PortID -> TransientIO () +beamTo host port= do + Log rec log _ <- getSData <|> return (Log False [][]) + if rec then return () else do + h <- liftIO $ connectTo host port + liftIO $ hSetBuffering h LineBuffering + liftIO $ hPutStrLn h (show $ reverse log) >> hFlush h + liftIO $ hClose h + delSData h + stop + +-- | execute in the remote node a process with the same execution state +-- all the previous actions from `listen` to this statement must have been logged +forkTo :: HostName -> PortID -> TransientIO () +forkTo host port= do + Log rec log _<- getSData <|> return (Log False [][]) + if rec then return () else do + h <- liftIO $ connectTo host port + liftIO $ hSetBuffering h LineBuffering + liftIO $ hPutStrLn h (show $ reverse log) >> hFlush h + liftIO $ hClose h + delSData h + +-- | executes an action in another node. +-- all the previous actions from `listen` to this statement must have been logged +callTo :: (Show a, Read a,Typeable a) => HostName -> PortID -> TransIO a -> TransIO a +callTo host port remoteProc= logged $ Transient $ do +-- liftIO $ print "callto" + Log rec log fulLog <- getSessionData `onNothing` return (Log False [][]) + if rec + then + runTrans $ do + + Connection port h sock <- getSData <|> error "callto: no hander" + r <- remoteProc !> "executing remoteProc" !> "CALLTO REMOTE" -- LOg="++ show fulLog + liftIO $ hPutStrLn h (show r) -- `catch` (\(e::SomeException) -> sClose sock) + -- !> "sent response, HANDLE="++ show h + setSData WasRemote + stop + + + else do + + h <- liftIO $ connectTo host port + liftIO $ hPutStrLn h (show $ reverse fulLog) >> hFlush h !> "CALLTO LOCAL" -- send "++ show log + let log'= WaitRemote:tail log + setSessionData $ Log rec log' log' + runTrans $ waitEvents $ do -- local side + liftIO $ hSetBuffering h LineBuffering + s <- hGetLine h +-- hClose h + + let r = read s + + return r !> "read: " ++ s ++" response type= "++show( typeOf r) + +-- | A connectionless version of callTo for long running remote calls +callTo' :: (Show a, Read a,Typeable a) => HostName -> PortID -> TransIO a -> TransIO a +callTo' rhost rport remoteProc= logged $ do + (host,port) <- getMyNode + logged $ beamTo rhost rport + r <- logged remoteProc + logged $ beamTo host port + return r + +data Connection= Connection PortID Handle Socket deriving Typeable + +-- | Wait for messages and replay the rest of the monadic sequence with the log received. +listen :: PortID -> TransIO () +listen port = do + setSData $ Log False [] [] + sock <- liftIO $ withSocketsDo $ listenOn port + + (h,host,port1) <- parallel $ Right <$> accept sock + `catch` (\(e::SomeException) -> sClose sock >> throw e) + + liftIO $ hSetBuffering h LineBuffering -- !> "LISTEN in "++ show (h,host,port1) + + slog <- Transient $ liftIO $ (Just <$> hGetLine h) + `catch` (\(e::SomeException) -> print "ERR" >> return Nothing) + + setSData $ Connection port h sock -- !> "setdata port=" ++ show port + + let log= read slog -- !> "read1 " ++ slog + setSData $ Log True log (reverse log) + + +-- | init a Transient process in a interactive as well as in a replay mode. +-- It is intended for twin processes that interact among them in different nodes. +beamInit :: PortID -> TransIO a -> IO b +beamInit port program= keep $ do + listen port <|> return () + program + + + + +instance Read PortNumber where + readsPrec n str= let [(n,s)]= readsPrec n str in [(fromIntegral n,s)] + + +deriving instance Read PortID +deriving instance Typeable PortID + +-- * Level 2: connections node lists and operations with the node list + +data Node= Node{host :: HostName, port :: PortID, connection :: Maybe(Handle,Socket,HostName,PortID)} deriving (Eq,Typeable) + +instance Show Node where show (Node h p _)= show (h,p) +instance Read Node where readsPrec _ s= let [((h,p),s')]= readsPrec 0 s in [((Node h p Nothing),s')] + +nodeList :: TVar [Node] +nodeList = unsafePerformIO $ newTVarIO [] + +deriving instance Ord PortID + +myNode= unsafePerformIO $ atomically $ newTVar Nothing + +setMyNode h p= liftIO $ atomically $ writeTVar myNode $ Just (h,p) +getMyNode= Transient $ liftIO $ atomically $ readTVar myNode + +getNodes :: TransIO [Node] +getNodes = Transient $ Just <$> (liftIO $ atomically $ readTVar nodeList) + +addNodes nodes= Transient . liftIO . atomically $ do + prevnodes <- readTVar nodeList + writeTVar nodeList $ nub $ prevnodes ++ nodes + return $ Just () + +--getInterfaces :: TransIO TransIO HostName +--getInterfaces= do +-- host <- logged $ do +-- ifs <- liftIO $ getNetworkInterfaces +-- liftIO $ mapM_ (\(i,n) ->putStrLn $ show i ++ "\t"++ show (ipv4 n) ++ "\t"++name n)$ zip [0..] ifs +-- liftIO $ putStrLn "Select one: " +-- ind <- input ( < length ifs) +-- return $ show . ipv4 $ ifs !! ind + + +-- | execute a Transient action in each of the nodes connected. The results are aggregated with `mappend` +clustered :: (Typeable a, Show a, Read a) => Monoid a => TransIO a -> TransIO a +clustered proc= logged $ do + nodes <- step getNodes + logged $ foldr (<>) mempty $ map (\(Node h p _) -> callTo h p proc) nodes !> "fold" + +-- | a connectionless version of clustered for long running remote computations. Not tested +clustered' proc= logged $ do + nodes <- step getNodes + logged $ mapM (\(Node h p _) -> callTo' h p proc) $ nodes + +-- | Connect to a new node to another. The other node will notify about this connection to +-- all the nodes connected to him. the new connected node will receive the list of connected nodes +-- the nodes will be updated with this list. it can be retrieved with `getNodes` +connect :: HostName -> PortID -> HostName -> PortID -> TransientIO () +connect host port remotehost remoteport= do + listen port <|> return () + logged $ do + let n= Node host port Nothing + logged $ do + setMyNode host port + addNodes [n] + liftIO $ putStrLn $ "connecting to: "++ show (remotehost,remoteport) + newnode <- logged $ return n -- must pass my node the remote node or else it will use his own + port <- logged $ return port + nodes <- callTo remotehost remoteport $ do + clustered $ addNodes [newnode] + getNodes + + logged $ addNodes nodes + logged $ liftIO $ putStrLn $ "Connected to modes: " ++ show nodes + +
+ transient.cabal view
@@ -0,0 +1,53 @@+name: transient +synopsis: A monad for extensible effects and primitives for unrestricted composability of applications +homepage: http://www.fpcomplete.com/user/agocorona +bug-reports: https://github.com/agocorona/transient/issues +version: 0.1.0.0 +cabal-version: >=1.10 +build-type: Simple +license: GPL-3 +license-file: LICENSE +maintainer: agocorona@gmail.com +category: Control +author: Alberto G. Corona +description: + see <http://github.com/agocorona/transient> + +data-dir: "" + +library + build-depends: base -any, mtl -any, random -any, containers -any, + directory -any, filepath -any, stm -any, HTTP -any, network -any, + transformers -any, process -any, network-info -any + + exposed-modules: Transient.Indeterminism Transient.Base + Transient.Backtrack Transient.Move Transient.Logged + exposed: True + buildable: True + default-language: Haskell2010 + hs-source-dirs: src . + other-modules: + +executable transient + build-depends: base >4 && <5, mtl -any, random -any, containers -any, + directory -any, filepath -any, stm -any, HTTP -any, network -any, + transformers -any, transient -any + main-is: Main.hs + buildable: True + default-language: Haskell2010 + hs-source-dirs: . + other-modules: + +executable move + build-depends: base -any, mtl -any, random -any, containers -any, + directory -any, filepath -any, stm -any, HTTP -any, network -any, + transformers -any, transient -any + main-is: move.hs + buildable: True + default-language: Haskell2010 + hs-source-dirs: . + other-modules: + +source-repository head + type: git + location: https://github.com/agocorona/transient