diff --git a/ArrayUtils.hs b/ArrayUtils.hs new file mode 100644 --- /dev/null +++ b/ArrayUtils.hs @@ -0,0 +1,12 @@ +-- License: GPL v2 or later + +module ArrayUtils (amapWithIxs, arraySize) where + +import Data.Array.IArray + +amapWithIxs :: (IArray a e, IArray a e', Ix i) => (i -> e -> e') -> a i e -> a i e' +amapWithIxs f arr = array (bounds arr) (map (\i -> (i, f i (arr ! i))) (indices arr)) + +arraySize :: (IArray a e) => a (Int,Int) e -> (Int,Int) +arraySize arr = case bounds arr of ((x1,y1),(x2,y2)) -> (x2 - x1 + 1, y2 - y1 + 1) + diff --git a/COPYING b/COPYING new file mode 100644 --- /dev/null +++ b/COPYING @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/Clock.hs b/Clock.hs new file mode 100644 --- /dev/null +++ b/Clock.hs @@ -0,0 +1,15 @@ +-- License: GPL v2 or later + +module Clock (millisecondsNow) where +import Data.Word (Word32) +import System.Clock + +millisecondsNow :: IO Word32 +millisecondsNow = fmap timeSpecToMilliseconds (getTime Monotonic) + +timeSpecToMilliseconds :: (Integral i) => TimeSpec -> i +-- We place these fromIntegrals being cautious about not overflowing where possible, +-- for any i (timespec contains Ints, however oddly) +timeSpecToMilliseconds t = (fromIntegral (sec t) * 1000) + + fromIntegral (nsec t `div` 1000000) + diff --git a/Display.hs b/Display.hs new file mode 100644 --- /dev/null +++ b/Display.hs @@ -0,0 +1,276 @@ +-- License: GPL v2 or later +{-# LANGUAGE ForeignFunctionInterface #-} + +module Display(doDisplay, initDisplay) where + +import Graphics.UI.GLUT +import qualified Sim +import Data.Array.Unboxed +import Data.Word(Word32) +import Control.Monad(when, unless, liftM2, forM_) +import System.Random +import ArrayUtils (arraySize) +import Foreign.Marshal.Array (withArray) +import Foreign.Ptr (Ptr) +import Foreign.C.Types (CFloat(CFloat)) + +-- This C code is for speed. I first wrote this code before vertex buffers +-- even existed in the OpenGL standard (and before I knew about them); +-- it's quite likely that modern GHC and OpenGL (ES) 2.0 could be plenty fast +-- without using C code. +foreign import ccall unsafe "foreignPollution" foreignPollution :: Word32 -> Ptr Double -> Word32 -> Word32 -> IO () + +-- We don't use the Random instance of GLfloat (CFloat) directly +-- because it uses realToFrac which might be slow. +randomRIOGLF :: (Float, Float) -> IO GLfloat +randomRIOGLF range_ = do + result <- randomRIO range_ + return (CFloat result) + +initDisplay :: IO () +initDisplay = do + ortho2D 0 1 0 1 + blend $= Enabled ; blendFunc $= (SrcAlpha, OneMinusSrcAlpha) + +-- Possibly the three int-like arguments should be better distinguished +-- or combined ("data TimeSituation"?) somehow. Or even made into one +-- value, simStepsSinceLastUpdate(Float), which could be used fine as a random +-- seed (which ms is currently used for), most likely (just transform it appropriately). +-- TODO. +doDisplay :: Sim.World -> Int{-milliseconds per step-} + -> Word32{-current time-} -> Word32{-last update time-} -> IO () +doDisplay (Sim.World worldMap worldParticles worldCreatures worldPollution worldHour) + msPerStep ms lastUpdateTime = do + let simStepsSinceLastUpdate = fromIntegral (ms - lastUpdateTime) / fromIntegral msPerStep :: GLfloat + let ((minX,minY),(maxX,maxY)) = bounds worldMap + let (numX,numY) = (fromIntegral $ maxX + 1 - minX, fromIntegral $ maxY + 1 - minY) + let rotationReference = Vector3 0 0 1 :: Vector3 GLfloat + let distFromCenter = 0.5 :: GLfloat + let translatingTo :: Integral coord => (coord,coord) -> IO a -> IO a + translatingTo (x,y) io = preservingMatrix $ do + translate (Vector3 (fromIntegral x + distFromCenter) (fromIntegral y + distFromCenter) 0 :: Vector3 GLfloat) + io + preservingMatrix $ do + scale (recip numX) (recip numY :: GLfloat) 1 + -- draw the floors + --timeL "flor" $ + renderPrimitive Quads $ forM_ (assocs worldMap) $ \ ((x,y), _maybeMachine) -> do + let (x',y') = (fromIntegral x :: GLfloat, fromIntegral y :: GLfloat) + color (Color3 0.50 0.50 0.60 :: Color3 GLfloat); vertex (Vertex2 x' y' ) + color (Color3 0.45 0.55 0.45 :: Color3 GLfloat); vertex (Vertex2 (x'+1) y' ) + color (Color3 0.60 0.60 0.50 :: Color3 GLfloat); vertex (Vertex2 (x'+1) (y'+1) ) + color (Color3 0.40 0.35 0.40 :: Color3 GLfloat); vertex (Vertex2 x' (y'+1) ) + -- draw the creatures (what about multiple creatures in the same place? + -- I guess one just gets drawn first, then the next...) + --timeL "cret" $ + forM_ worldCreatures $ \ (loc, creature) -> translatingTo loc $ do + case creature of + Sim.Water _rng -> do + color (Color4 0.4 0.5 0.9 0.6 :: Color4 GLfloat) + renderPrimitive Quads $ do + let shortDist = 0.5 :: GLfloat + let longDist = 0.5 :: GLfloat + vertex $ Vertex2 (-longDist) (-shortDist) + vertex $ Vertex2 ( longDist) (-shortDist) + vertex $ Vertex2 ( longDist) ( shortDist) + vertex $ Vertex2 (-longDist) ( shortDist) + Sim.Creature { Sim.creatureEnergy = energy } -> do + renderPrimitive Quads $ do + let legSpread = 0.35 :: GLfloat + let legHeight = -0.4 :: GLfloat + let waistSpread = 0.2 :: GLfloat + let waistHeight = 0 :: GLfloat + let armSpread = 0.3 :: GLfloat + let shoulderSpread = 0.2 :: GLfloat + let neckSpread = 0.1 :: GLfloat + let neckHeight = 0.2 :: GLfloat + let headHeight = 0.45 :: GLfloat + let headSpread = 0.2 :: GLfloat + color (Color3 0.5 0.5 (0.7 + realToFrac energy / 20) :: Color3 GLfloat) + vertex $ Vertex2 (-legSpread) (legHeight) + vertex $ Vertex2 ( legSpread) (legHeight) + vertex $ Vertex2 ( waistSpread) (waistHeight) + vertex $ Vertex2 (-waistSpread) (waistHeight) + color (Color3 0.4 0.9 0.6 :: Color3 GLfloat) + vertex $ Vertex2 (-armSpread) (waistHeight) + vertex $ Vertex2 ( armSpread) (waistHeight) + vertex $ Vertex2 ( shoulderSpread) (neckHeight) + vertex $ Vertex2 (-shoulderSpread) (neckHeight) + color (Color3 0.9 0.7 0.5 :: Color3 GLfloat) + vertex $ Vertex2 (-neckSpread) (neckHeight) + vertex $ Vertex2 ( neckSpread) (neckHeight) + vertex $ Vertex2 ( headSpread) (headHeight) + vertex $ Vertex2 (-headSpread) (headHeight) + -- draw the particles (what relation to machines? what about the dangerous particles?) + --timeL "part" $ + forM_ worldParticles $ \ (loc, Sim.Particle dir pType) -> translatingTo loc $ do + rotate (Sim.dirAngle dir) rotationReference + translate (Vector3 (simStepsSinceLastUpdate) 0 0) + --hmm, could separate list by particle-type and + --encompass more with each renderPrimitive... + case pType of + Sim.Energy strength -> do + color (Color4 0.9 0.9 0.2 (log $ fromIntegral strength) :: Color4 GLfloat) + renderPrimitive Quads $ do + let shortDist = 0.15 :: GLfloat + let longDist = 0.25 :: GLfloat + vertex $ Vertex2 (-longDist) (-shortDist) + vertex $ Vertex2 ( longDist) (-shortDist) + vertex $ Vertex2 ( longDist) ( shortDist) + vertex $ Vertex2 (-longDist) ( shortDist) + -- could draw this after the machines... + Sim.Chaos _rng -> do + let + io :: IO () + io = do + alpha1 <- randomRIOGLF (0.7,1.0) + color (Color4 0.7 0.2 0.7 alpha1 :: Color4 GLfloat) + let randPos = randomRIOGLF (-0.5, 0.5) + let randVertex = vertex =<< liftM2 Vertex2 randPos randPos + randVertex ; randVertex ; randVertex + randVal <- randomRIO (1, 10 :: Int) + unless (randVal == 1) io + renderPrimitive Triangles $ io + + -- draw the machines + --timeL "mach" $ + forM_ [(l,m) | (l,Just m) <- assocs worldMap] $ \ (loc,machine) -> translatingTo loc $ do + case machine of + Sim.Generator dir energy -> do + rotate (Sim.dirAngle dir) (Vector3 0 0 1 :: Vector3 GLfloat) + renderPrimitive Quads $ do + let dist = 0.3 :: GLfloat + color (Color3 0.6 0.6 0.6 :: Color3 GLfloat) + vertex $ Vertex2 (-dist) (-dist) + vertex $ Vertex2 ( dist) (-dist) + vertex $ Vertex2 ( dist) ( dist) + vertex $ Vertex2 (-dist) ( dist) + let shortDist = 0.1 :: GLfloat + let yellow = fromIntegral energy / 10 + color (Color3 yellow yellow 0.0 :: Color3 GLfloat) + vertex $ Vertex2 (-shortDist) (-shortDist) + vertex $ Vertex2 ( dist) (-shortDist) + vertex $ Vertex2 ( dist) ( shortDist) + vertex $ Vertex2 (-shortDist) ( shortDist) + Sim.Mirror mdir lSilvered rSilvered -> do + rotate (case mdir of { Sim.NW_SE -> 0; Sim.SW_NE -> -90 } :: GLfloat) rotationReference + let + dist = 0.25 :: GLfloat + silverDepth = 0.07 -- orthogonal, in both directions + renderPrimitive Quads $ do + color (Color3 0.9 0.9 0.9 :: Color3 GLfloat) + vertex $ Vertex2 (-dist) (distFromCenter) + vertex $ Vertex2 (distFromCenter) (-dist) + vertex $ Vertex2 (dist) (-distFromCenter) + vertex $ Vertex2 (-distFromCenter) (dist) + + color (Color3 0.7 0.7 0.8 :: Color3 GLfloat) + when lSilvered $ do + vertex $ Vertex2 (-(distFromCenter-silverDepth)) (dist+silverDepth) + vertex $ Vertex2 (dist+silverDepth) (-(distFromCenter-silverDepth)) + vertex $ Vertex2 (dist) (-distFromCenter) + vertex $ Vertex2 (-distFromCenter) (dist) + + when rSilvered $ do + vertex $ Vertex2 (-dist) (distFromCenter) + vertex $ Vertex2 (distFromCenter) (-dist) + vertex $ Vertex2 (distFromCenter-silverDepth) (-(dist+silverDepth)) + vertex $ Vertex2 (-(dist+silverDepth)) (distFromCenter-silverDepth) + Sim.Greenery -> do + renderPrimitive Polygon $ do + color (Color3 0.2 0.9 0.3 :: Color3 GLfloat) + vertex $ Vertex2 (-0.3) (0.2 :: GLfloat) + vertex $ Vertex2 (0) (distFromCenter) + vertex $ Vertex2 (0.3) (0.2 :: GLfloat) + vertex $ Vertex2 (0.5) (-0.3 :: GLfloat) + vertex $ Vertex2 (0.3) (-0.4 :: GLfloat) + vertex $ Vertex2 (0.1) (-0.35 :: GLfloat) + vertex $ Vertex2 (-0.1) (-0.35 :: GLfloat) + vertex $ Vertex2 (-0.3) (-0.4 :: GLfloat) + vertex $ Vertex2 (-0.5) (-0.3 :: GLfloat) + renderPrimitive Triangles $ do + color (Color3 0.6 0.4 0.3 :: Color3 GLfloat) + let trunkWidth = 0.1 :: GLfloat + let trunkY = 0.25 :: GLfloat + vertex $ Vertex2 (0) (trunkY) + vertex $ Vertex2 (trunkWidth) (-distFromCenter) + vertex $ Vertex2 (-trunkWidth) (-distFromCenter) + let branchTipY = -0.1 :: GLfloat + let branchTipX = 0.25 :: GLfloat + let branchStartHigh = -0.3 :: GLfloat + let branchStartLow = -0.4 :: GLfloat + vertex $ Vertex2 (0) (branchStartHigh) + vertex $ Vertex2 (branchTipX) (branchTipY) + vertex $ Vertex2 (0) (branchStartLow) + + vertex $ Vertex2 (0) (branchStartHigh) + vertex $ Vertex2 (-branchTipX) (branchTipY) + vertex $ Vertex2 (0) (branchStartLow) + Sim.Storm energy _rng -> do + let + io :: Double -> Int -> IO () + io amount side = do + alpha1 <- randomRIOGLF (0.7,1.0) + color (Color4 0.4 0.3 0.7 alpha1 :: Color4 GLfloat) + let randPos a b = randomRIOGLF (a, b) + let randVertex = [ + vertex =<< liftM2 Vertex2 (randPos 0 0.5) (randPos (-0.5) 0.5), + vertex =<< liftM2 Vertex2 (randPos (-0.5) 0) (randPos (-0.5) 0.5), + vertex =<< liftM2 Vertex2 (randPos (-0.5) 0.5) (randPos 0 0.5), + vertex =<< liftM2 Vertex2 (randPos (-0.5) 0.5) (randPos (-0.5) 0)] + !! side + randVertex ; randVertex ; randVertex + unless (amount < 0) ( io (amount - 1) ( (side + 1) `mod` 4 ) ) + renderPrimitive Triangles $ io ((energy+2) * 4) 0 + Sim.Mountain -> do + -- How about shadows i.e. "The sun rises in the east"? + renderPrimitive Triangles $ do + let width = 0.3 :: GLfloat + let height = 0.4 :: GLfloat + let offsetX = 0.15 :: GLfloat + let offsetY = 0.35 :: GLfloat + color (Color3 0.45 0.4 0.35 :: Color3 GLfloat) + vertex $ Vertex2 ((-width)-offsetX) (offsetY-0.1) + vertex $ Vertex2 (-offsetX) (height+offsetY-0.1) + vertex $ Vertex2 (width-offsetX) (offsetY-0.1) + color (Color3 0.25 0.2 0.15 :: Color3 GLfloat) + vertex $ Vertex2 ((-width)+offsetX) (offsetY) + vertex $ Vertex2 (offsetX) (height+offsetY) + vertex $ Vertex2 (width+offsetX) (offsetY) + color (Color3 0.35 0.4 0.45 :: Color3 GLfloat) + vertex $ Vertex2 (-width) (0) + vertex $ Vertex2 (0) (height) + vertex $ Vertex2 (width) (0) + color (Color3 0.2 0.2 0.2 :: Color3 GLfloat) + vertex $ Vertex2 ((-width)-offsetX) (-offsetY) + vertex $ Vertex2 (-offsetX) (height-offsetY) + vertex $ Vertex2 (width-offsetX) (-offsetY) + color (Color3 0.3 0.4 0.3 :: Color3 GLfloat) + vertex $ Vertex2 ((-width)+offsetX) ((-offsetY)+0.05) + vertex $ Vertex2 (offsetX) ((height-offsetY)+0.05) + vertex $ Vertex2 (width+offsetX) ((-offsetY)+0.05) + Sim.Riverbed{} -> error "Unimplemented yet" + + -- draw the pollution! + -- (the 'resolution' should depend on windowsize / (i.e.?) number of places displayed) + -- currently just 5x5 per place though + -- should it be invisible where really low? + do + let (width, height) = arraySize worldPollution + -- marshalling takes about 1 ms by last measurement + withArray (elems worldPollution) (\cArr -> foreignPollution ms cArr (fromIntegral width) (fromIntegral height)) + -- draw the night-time! (er.) (HACK!!!) + do + let dayFraction = case worldHour of Sim.WorldHour h -> (realToFrac h + simStepsSinceLastUpdate) / realToFrac Sim.dayLength + let dayLight = if dayFraction >= 0.5 then 0 else sin (dayFraction * pi * 2) + let nightMasking = (1 - dayLight) / 2 /10--since it doesn't do anything + color (Color4 0.1 0.1 0.3 nightMasking :: Color4 GLfloat) + renderPrimitive Quads $ do + vertex $ Vertex2 0 (0::GLfloat) + vertex $ Vertex2 numX (0::GLfloat) + vertex $ Vertex2 numX numY + vertex $ Vertex2 0 numY + + swapBuffers + reportErrors + diff --git a/Main.hs b/Main.hs new file mode 100644 --- /dev/null +++ b/Main.hs @@ -0,0 +1,117 @@ +-- License: GPL v2 or later + +module Main(main) where + +import Graphics.UI.GLUT +import Data.IORef +import qualified Sim +import System.Random +import Control.Monad +import Data.Array.IArray +import Data.Word(Word32) +import Control.Arrow( (***) ) +import System.Console.GetOpt + +import qualified Display(doDisplay, initDisplay) +import ArrayUtils (arraySize) +import Clock (millisecondsNow) + +data Flag = MillisecondsPerStep Int + +defaultMillisecondsPerStep :: Int +defaultMillisecondsPerStep = 500 + +options :: [OptDescr Flag] +options = [ + Option "s" ["milliseconds-per-step","ms/st"] + (ReqArg (MillisecondsPerStep . read) "TIME") + ("Amount of TIME between simulation steps (default " + ++ show defaultMillisecondsPerStep ++ ")") + ] + +doTimedStuff :: IORef (Sim.World,Word32) -> IO () +doTimedStuff worldRef = do + ms <- millisecondsNow + modifyIORef worldRef (Sim.simulate *** const ms) + +doIdleStuff :: Int -> IORef (Sim.World,Word32) -> IO () +doIdleStuff msPerStep worldRef = doDisplayCallback msPerStep worldRef + +randomRNGs :: RandomGen g => g -> [g] +randomRNGs rng = rng1 : randomRNGs rng2 + where (rng1,rng2) = split rng + + +initialWorld :: StdGen -> Sim.World +initialWorld g = + let + bound = ((0,0),(15,15)) + in Sim.World ( + listArray bound $ map (\rng -> let (r,rng') = randomR (0,99) rng in + if r < 4 then Just $ Sim.Generator (toEnum r) 5 + else if r < 16 then Just $ Sim.Mirror (toEnum (r `mod` 2)) (r<12) (r>=8) + else if r < 25 then Just Sim.Greenery + else if r < 27 then Just $ Sim.Storm 2 rng' + else if r < 40 then Just Sim.Mountain + else Nothing + ) $ randomRNGs g + ) ( + [] + ) ( + [((6,6), Sim.Creature 4 g)] + ) ( + listArray bound (repeat 0) + ) ( + Sim.WorldHour 0 + ) + +main :: IO () +main = do + firstWorld <- liftM initialWorld newStdGen + worldRef <- newIORef (firstWorld,0) + initialDisplayMode $= [DoubleBuffered] + initialWindowSize $= Size 600 600 + (_programName, args) <- getArgsAndInitialize + let (opts, _nonopts, optErrors) = getOpt Permute options args + when (not (null optErrors)) (putStrLn "do something smarter than printing these errors?" >> mapM_ putStrLn optErrors) + let msPerStep = case reverse [m | MillisecondsPerStep m <- opts] of + (m:_) -> m + [] -> defaultMillisecondsPerStep + (let triggerTimer = addTimerCallback msPerStep (doTimedStuff worldRef >> triggerTimer) + in triggerTimer) +--noooo! don't redisplay at 600framespersecond just because you can! +-- idleCallback $= Just (doIdleStuff msPerStep worldRef) +-- let's say we want 30 fps, way faster than anything changes anyway +-- 1000ms / 30 approx= 30 + (let redisplayTimer = addTimerCallback 30 (doIdleStuff msPerStep worldRef >> redisplayTimer) + in redisplayTimer) + actionOnWindowClose $= MainLoopReturns + -- ^ it seems to help GHC emit profiling information + _window <- createWindow "simulation"; do + Display.initDisplay + displayCallback $= doDisplayCallback msPerStep worldRef + keyboardMouseCallback $= Just (clickCallback (readIORef worldRef)) + mainLoop + +clickCallback :: IO (Sim.World,Word32) -> Key -> KeyState -> Modifiers -> Position -> IO () +clickCallback getWorld (MouseButton MiddleButton) Down _mods pos = do + --never mind being a useful gui-interface at the moment + (x,y) <- positionToZeroOneRange pos -- annoying. the window could theoretically have been resized by now. + (Sim.World machines _particles _creatures pollutions _hour, _) <- getWorld + let (width,height) = arraySize machines + let loc = (truncate (x * fromIntegral width), truncate (y * fromIntegral height)) + putStrLn $ show loc ++ ":\n\t" ++ show (machines!loc) ++ "\n\tPollution: " ++ show (pollutions!loc) +clickCallback _ _ _ _ _ = return () + +positionToZeroOneRange :: Position -> IO (Double,Double) +positionToZeroOneRange (Position x y) = get viewport >>= + \(Position minX minY, Size sizeX sizeY) -> return + (fromIntegral (x - minX) / fromIntegral sizeX, + fromIntegral (fromIntegral sizeY - (y - minY) {-stupid GLUT difference of *origin* to OpenGL-}) / fromIntegral sizeY) + +doDisplayCallback :: Int -> IORef (Sim.World,Word32) -> IO () +doDisplayCallback msPerStep worldRef = do + ms <- millisecondsNow + (world, lastUpdateTime) <- readIORef worldRef + Display.doDisplay world msPerStep ms lastUpdateTime + diff --git a/Pollutocracy.cabal b/Pollutocracy.cabal new file mode 100644 --- /dev/null +++ b/Pollutocracy.cabal @@ -0,0 +1,33 @@ +name: Pollutocracy +version: 1.0 +synopsis: An imaginary world +description: This is a simulated world I invented. + It has pollution and energy and trees and mountains + and chaos storms. It is randomly generated and + non-interactive at present. +author: Isaac Dupree +maintainer: Isaac Dupree +category: Game +license: GPL +license-file: COPYING +build-type: Simple +cabal-version: >= 1.6 + +-- Without this extra-source-files, `cabal sdist` doesn't include this header +-- that the .c includes; see e.g. this message for suggesting this workaround: +-- "cabal sdist doesn't include c headers", +-- http://osdir.com/ml/libraries@haskell.org/2010-01/msg00007.html +extra-source-files: foreignPollution.h + +source-repository head + type: git + location: https://github.com/idupree/Pollutocracy.git + +executable Pollutocracy + main-is: Main.hs + build-depends: base < 6, array, random, GLUT, clock + includes: foreignPollution.h + c-sources: foreignPollution.c + cc-options: -Wall + ghc-options: -Wall + other-modules: ArrayUtils, Clock, Display, Sim diff --git a/Setup.hs b/Setup.hs new file mode 100644 --- /dev/null +++ b/Setup.hs @@ -0,0 +1,2 @@ +import Distribution.Simple +main = defaultMain diff --git a/Sim.hs b/Sim.hs new file mode 100644 --- /dev/null +++ b/Sim.hs @@ -0,0 +1,315 @@ +-- License: GPL v2 or later + +module Sim (simulate, World(..), Machine(..), Particle(..), ParticleType(..), Creature(..), Dir(..), MirrorDir(..), dirAngle, WorldHour(..){-hmm-}, hourFraction, dayLength) where + +-- Generators emit pollution, as well as bolts of energy that +-- bounce off mirrors and can energize other generators. +-- +-- Mountains get in the way. +-- +-- Trees absorb pollution. +-- +-- Chaos-storms emit chaos, which changes these "machines" randomly +-- into other types of "machines", and water, which for some odd +-- reason is attracted to pollution yet destroyed by bolts of energy. +-- +-- (The reason is obviously that I wanted to see what it would be like +-- if I had something be affected by pollution in some nontrivial way. +-- Or that I wanted flowing rivers that go in a direction!) + +-- The guy wanders around mostly randomly and usually dies pretty soon. +-- Pay him/her no mind. (constructor "Creature") + +import Data.Array.Unboxed +import Data.List (genericLength, unzip4, maximumBy) +import Data.Ord (comparing) +import Data.Maybe (isJust) +import System.Random + +-- (TODO: Maybe use DiffArray or some modern data structure?) +type WholeMap = Array Loc +type SparseMultiMap a = [(Loc,a)] + +type Loc = (Int,Int) +type Offset = (Int,Int) -- (not) aka dir +type WorldMap = WholeMap (Maybe Machine) +type WorldMovers = SparseMultiMap Particle +type WorldCreatures = SparseMultiMap Creature +type Pollution = Double +type WorldPollution = UArray Loc Pollution +newtype WorldHour = WorldHour Int +data World = World + { worldMap :: WorldMap + , worldParticles :: WorldMovers + , worldCreatures :: WorldCreatures + , worldPollution :: WorldPollution + , worldHour :: WorldHour + } +data Dir = North | East | South | West + deriving (Enum,Bounded,Show) +data MirrorDir = NW_SE | SW_NE + deriving (Enum,Show) +-- member names: +-- `m'nName where n is the initial of the constructor, +-- or `_' if it may be applicable to multiple constructors +data Machine + = Generator { m_Dir :: Dir, m_Energy :: Int } + | Mirror { mMDir :: MirrorDir, mMLeftSilvered, mMRightSilvered :: Bool } + | Greenery { } + | Storm { mSEnergy :: Double, m_RNG :: StdGen } + | Mountain { } + | Riverbed { mRDepth :: Int } + deriving (Show) +{-instance Show Machine where + show (Generator{}) = "G" + show (Mirror{}) = "M"-} +data Particle = Particle Dir ParticleType +data ParticleType + = Energy Int -- where Int strength > 0 + | Chaos StdGen +data Creature + -- Energy system like Angband; only normally move every 10 energy, + -- but may communicate quicker. + = Creature { creatureEnergy :: Double, creatureRNG :: StdGen } + | Water { creatureRNG :: StdGen } + +-- OpenGL uses degrees, and that's what this is used for, so use degrees. +dirAngle :: Num{-Floating-} a => Dir -> a +dirAngle East = 0 --0 +dirAngle North = 90 --pi * 0.5 +dirAngle West = 180 --pi +dirAngle South = 270 --pi * 1.5 + +dirOffset :: Dir -> Offset +dirOffset North = (0,1) +dirOffset South = (0,-1) +dirOffset East = (1,0) +dirOffset West = (-1,0) + +shiftByOffset :: Offset -> Loc -> Loc +shiftByOffset (dx,dy) (x,y) = (x+dx,y+dy) + +shift :: Dir -> Loc -> Loc +shift = shiftByOffset . dirOffset + +particleMove :: (Loc,Particle) -> (Loc,Particle) +particleMove (loc,p@(Particle dir _)) = (shift dir loc,p) + +mirrorSilveredWhenGoingDirection :: Machine{-Mirror-} -> Dir -> Bool +mirrorSilveredWhenGoingDirection mir@(Mirror {}) dir = + (case mMDir mir of + NW_SE -> case dir of + North -> mMLeftSilvered + East -> mMLeftSilvered + South -> mMRightSilvered + West -> mMRightSilvered + SW_NE -> case dir of + South -> mMLeftSilvered + East -> mMLeftSilvered + North -> mMRightSilvered + West -> mMRightSilvered + ) mir +mirrorSilveredWhenGoingDirection machine dir = + error ( "BUG! mirrorSilveredWhenGoingDirection should not be" ++ + " called with a non-mirror, namely " ++ show machine ++ + " (with dir = " ++ show dir ++ ")" ) + +mirror :: MirrorDir -> Dir -> Dir +mirror NW_SE North = West +mirror NW_SE West = North +mirror NW_SE South = East +mirror NW_SE East = South +mirror SW_NE North = East +mirror SW_NE East = North +mirror SW_NE South = West +mirror SW_NE West = South + +orthogonalNeighborLocsWithin :: (Loc,Loc) -> Loc -> [Loc] +orthogonalNeighborLocsWithin bound center = + filter (inRange bound) $ map (flip shift center) [North,East,South,West] + +-- don't yet use a monad; see how this goes +-- hmm, randomness can wait too +simMachine :: + WorldMap -> Array Loc [Particle] -> Array Loc [Creature] -> WorldPollution + -> Loc -> Maybe Machine + -> (Maybe Machine, [Particle], [Creature], Pollution) +simMachine terrainMap particleMap creatureMap pollutionMap loc maybeMachine = + case maybeMachine of + Nothing -> (Nothing, pHere, cHere, defaultNewPollution) + (Just m) -> + -- If a chaos particle hits a machine, that mutates the machine + -- rather than the machine here doing anything this turn. + let + chaosRNGs = [rng | Particle _ (Chaos rng) <- pHere] + chaoslyRandomMachine :: StdGen -> Machine + -- could also return next g + chaoslyRandomMachine rng = let (r,rng') = randomR (0,28) rng in + if r < 4 then Generator (toEnum r) 5 + else if r < 16 then Mirror (toEnum (r `mod` 2)) (r<12) (r>=8) + else if r < 20 then Storm (fromIntegral r - 16) rng' + else if r < 25 then Greenery + else Mountain -- should chaos create/destroy MOUNTAINS??? + in if not (null chaosRNGs) then + (Just $ chaoslyRandomMachine $ head chaosRNGs, + [], cHere, defaultNewPollution + 3) + else + case m of + -- Generators generate energy over time (and when an energy particle + -- hits them), and every time they have enough energy stored, + -- they emit an energy particle using that energy. + -- It's a pretty efficient generator: 80% efficiency. + Generator dir energy -> if energy >= 5 + then (Just $ m {m_Energy = energy - 5 + particleEnergyHere}, + [Particle dir (Energy 4)], cHere, defaultNewPollution + 1) + else (Just $ m {m_Energy = energy + 1 + particleEnergyHere }, + [], cHere, defaultNewPollution) + Mirror mdir _ _ -> (Just m, + map (\p@(Particle pdir ptype) -> + if mirrorSilveredWhenGoingDirection m pdir + then Particle (mirror mdir pdir) (ptype) + else p) + pHere, + cHere, + defaultNewPollution) + -- Greenery absorbs pollution by letting pollution diffuse into it + -- and then remaining unpolluted. + -- It's a bit powerful pollution remover at the moment, + -- but non-invasive; seems nice in practice. + Greenery -> (Just m, pHere, cHere, 0) + -- Storms are strange. + -- They randomly absorb or emit pollution. + -- Absorbing pollution decreases their energy, + -- and emitting increases their energy. + -- Storms emit "chaos", which travels in a direction + -- until it hits something and mutates it, and "water", + -- which is a Creature that follows pollution. These + -- emissions depend on the storm's energy and on chance. + Storm energy rng -> + if newEnergy > today'sChaosParticleThreshold + then (Just $ Storm 0 rng_storm, + [newChaos], newWater:cHere, newPollution) + else if newEnergy < 16 + then (Just $ Storm newEnergy rng_storm, + [], newWater:cHere, newPollution) + else (Nothing, + [newChaos], cHere, newPollution + 3) + where + (rng_storm, rng2) = split rng + (today'sChaosParticleThreshold, rng3) = randomR (5,17) rng2 + (rawPollutionEffect, rng4) = randomR (-0.4,0.4) rng3 + (newChaos'sDirection,rng5) = randomDir rng4 + newChaos'sRNG = rng5 + randomDir :: (RandomGen g) => g -> (Dir, g) + randomDir rng_1 = let (dirN, rng_2) = randomR (0,3) rng_1 in (toEnum dirN, rng_2) + newEnergy = energy + fromIntegral particleEnergyHere + pollutionEffect + pollutionEffect = max (-defaultNewPollution) rawPollutionEffect + newPollution = pollutionEffect + defaultNewPollution + newChaos = Particle newChaos'sDirection (Chaos newChaos'sRNG) + newWater = (Water newChaos'sRNG)--hack: sharing RNG? + -- Mountains just sit there and get in the way of everything. + -- (Perhaps they could occasionally produce rain?) + Mountain -> (Just m, [], cHere, 0) + -- (Riverbeds are an unused constructor currently.) + Riverbed {} -> (Just m, [], cHere, 0) + where + pHere = particleMap ! loc + cHere = creatureMap ! loc + particleEnergyHere = sum [e | Particle _ (Energy e) <- pHere] + -- Pollution diffusion: + -- should edges of the map be dissipated off of? + -- should there be any decrease in total? + -- wind?! diagonals? + pollutionHere = pollutionMap ! loc + defaultNewPollution = let + neighborLocs = orthogonalNeighborLocsWithin (bounds pollutionMap) loc + significantNeighborLocs = filter (\l -> case terrainMap!l of + Just Mountain -> False; _ -> True) neighborLocs + neighborPollutions = map (pollutionMap !) significantNeighborLocs + pollutionKept = pollutionHere * + (1 - transferFraction*genericLength significantNeighborLocs) + pollutionTaken = sum $ map (* transferFraction) neighborPollutions + transferFraction = 1/16 + in pollutionKept + pollutionTaken + +simMachine' :: + WorldMap -> Array Loc [Particle] -> Array Loc [Creature] -> WorldPollution + -> Loc -> Maybe Machine + -> (Maybe Machine, [(Loc,Particle)], [(Loc,Creature)], Pollution) +simMachine' wm pm cm polluMap loc mm = + let (res1,res2,res3,res4) = simMachine wm pm cm polluMap loc mm + in (res1, map ((,) loc) res2, map ((,) loc) res3, res4) + +creatureMove :: WorldMap -> Array Loc [Particle] -> Array Loc [Creature] -> WorldPollution -> Loc -> Creature -> (Loc,Creature) +creatureMove machineMap particleMap _creatureMap pollutionMap loc creature = + let + (rng_pollutionEntropy, rng_creature) = split (creatureRNG creature) + movetoAble l = inRange (bounds machineMap) l && + case machineMap ! l of + Nothing -> True + Just (Generator{}) -> True + _ -> False + choices = filter movetoAble $ + orthogonalNeighborLocsWithin (bounds machineMap) loc + rawDraws = map (\l -> (pollutionMap ! l, l)) choices + pollutionTweaks = randomRs (0, 0.1) rng_pollutionEntropy + perceivedDraws = zipWith (\ (p,l) t -> (p+t, l)) rawDraws pollutionTweaks + --tie? arbitrary winner! more pollution is better for water! + best = maximumBy (comparing fst) perceivedDraws + loc' = snd best + newCreature = (loc', creature {creatureRNG = rng_creature}) + --water is killed by all particles!!!!(so is GUY.) + die = null choices || + not (null (particleMap ! loc)) || + not (null (particleMap ! loc')) || + isJust (machineMap ! loc') + -- HACK method to delete the creature: + nobody = ((-100000,-100000), + creature {creatureRNG = rng_creature}) + in if die then nobody else newCreature + + +simulate :: World -> World +simulate (World oldMap oldParticles oldCreatures oldPollution oldHour) = let + worldBounds = bounds oldMap + particleArray = accumArray (flip (:)) [] worldBounds + $ filter (inRange worldBounds . fst) + $ map (particleMove) oldParticles + oldCreatureArray = accumArray (flip (:)) [] worldBounds oldCreatures + newCreatureArray = accumArray (flip (:)) [] worldBounds + $ filter (inRange worldBounds . fst) + $ map (uncurry (creatureMove oldMap particleArray + oldCreatureArray oldPollution)) oldCreatures + results = map (uncurry (simMachine' oldMap particleArray + newCreatureArray oldPollution)) (assocs oldMap) + --mapArrayWithIndices (simMachine w particleArray) w + (machines,newParticle'ss,newCreature'ss,pollutions) = unzip4 results + newParticles = concat newParticle'ss + newCreatures = concat newCreature'ss + newMap = listArray worldBounds machines + newPollutions = listArray worldBounds pollutions -- this assumes pollution and map have same bounds + newHour = hourMove oldHour + in World newMap newParticles newCreatures newPollutions newHour + + +-- | in range [0,1) +hourFraction :: WorldHour -> Rational +hourFraction (WorldHour n) = realToFrac n / realToFrac dayLength + +hourMove :: WorldHour -> WorldHour +hourMove (WorldHour oldN) = + let newN = oldN + 1 in + if newN < dayLength + then WorldHour newN + else WorldHour (newN - dayLength) + +dayLength :: Int +dayLength = 50 + +-- not as generic (in Array) as it could be +--zipArray :: Ix i => Array i e1 -> Array i e2 -> Array i (e1,e2) +--zipArray a1 a2 + +--mapArrayWithIndices :: (Loc -> a -> b) -> MapType Loc a -> MapType Loc b +--mapArrayWithIndices f a = array (bounds a) (map (uncurry f) (assocs a)) + diff --git a/foreignPollution.c b/foreignPollution.c new file mode 100644 --- /dev/null +++ b/foreignPollution.c @@ -0,0 +1,86 @@ +/* License: GPL v2 or later */ + +// I wrote this in C because the Haskell version I had wasn't being fast +// enough for me. Now this is simple and works great! + +#include +#include +#include +#include +#include +#include "foreignPollution.h" + +void foreignPollution(uint32_t randSeed, const double * pollution, uint32_t pollutionWidth, uint32_t pollutionHeight) { + uint32_t x, y; + const uint32_t negative1AsXYtype = -1; + #define AT(array,x,y) ( (array)[((x)*(array##Height))+((y))] ) + //Glibc's parameters, seems to work fine. See wikipedia + //http://en.wikipedia.org/wiki/Linear_congruential_generator + #define RAND() ( randSeed = (((randSeed * 1103515245u) + 12345u) & 0x7fffffffu) ) + #define RAND_FLOAT_UP_TO(hi) ( (double)RAND() * (hi) / 0x7fffffffu ) + #define RAND_FLOAT_BETWEEN(lo,hi) ( (lo) + (double)RAND() * ((hi)-(lo)) / 0x7fffffffu ) + glPushMatrix(); + // To log pollution amounts to stderr (enable by changing the 'if'). + if(0) { + for(y = pollutionHeight-1; y != negative1AsXYtype; --y) { + for(x = 0; x != pollutionWidth; ++x) { + const int roundedPollution = AT(pollution,x,y); + const char indicator = + ( (roundedPollution < 10) + ? ( '0' + roundedPollution ) + : ( 'a' + (roundedPollution-10) )); + fputc(indicator, stderr); + } + printf("\n"); + } + printf("\n"); + } + glScaled(1.0/3.0, 1.0/3.0, 1); + glTranslated(-0.5, -0.5, 0.0); + glBegin(GL_QUADS); + const uint32_t deterministicHeavinessWidth = pollutionWidth + 2; + const uint32_t deterministicHeavinessHeight = pollutionHeight + 2; + double * deterministicHeaviness = (double*)alloca(deterministicHeavinessWidth*deterministicHeavinessHeight*sizeof(double)); + const uint32_t minX = 0; + const uint32_t minY = 0; + const uint32_t maxX = deterministicHeavinessWidth - 1; + const uint32_t maxY = deterministicHeavinessHeight - 1; + for(x = 0; x != deterministicHeavinessWidth; ++x) for(y = 0; y != deterministicHeavinessHeight; ++y) { + //should probably move in 1 to find border pollution amounts + //...but NOT segfault :-) + const int is_border = (x == minX || y == minY || x == maxX || y == maxY); + const double pollution_here = (is_border ? 0.0 : AT(pollution,x-1,y-1)); + //Maybe logarithm-of-pollution? (log ( 1 + pollution_here)) + AT(deterministicHeaviness,x,y) = pollution_here; + } + const uint32_t drawnWidth = pollutionWidth * 3 + 1; + const uint32_t drawnHeight = pollutionHeight * 3 + 1; + for(x = 0; x != drawnWidth; ++x) for(y = 0; y != drawnHeight; ++y) { + const double heaviness1 = AT(deterministicHeaviness,(x+2)/3,(y+2)/3); + const double heaviness2 = AT(deterministicHeaviness,(x+3)/3,(y+2)/3); + const double heaviness3 = AT(deterministicHeaviness,(x+3)/3,(y+3)/3); + const double heaviness4 = AT(deterministicHeaviness,(x+2)/3,(y+3)/3); + // if(heaviness1 > 1 || heaviness2 > 1 || heaviness3 > 1 || heaviness4 > 1) { + glColor4d(0.5, 0.5, 0.5, RAND_FLOAT_UP_TO(heaviness1)); + glVertex2i(x , y ); + glColor4d(0.5, 0.5, 0.5, RAND_FLOAT_UP_TO(heaviness2)); + glVertex2i(x+1, y ); + glColor4d(0.5, 0.5, 0.5, RAND_FLOAT_UP_TO(heaviness3)); + glVertex2i(x+1, y+1); + glColor4d(0.5, 0.5, 0.5, RAND_FLOAT_UP_TO(heaviness4)); + glVertex2i(x , y+1); + // } + /*glColor4d(0.5, 0.5, 0.5, RAND_FLOAT_UP_TO(AT(deterministicHeaviness,(x+2)/3,(y+2)/3))); + glVertex2i(x , y ); + glColor4d(0.5, 0.5, 0.5, RAND_FLOAT_UP_TO(AT(deterministicHeaviness,(x+3)/3,(y+2)/3))); + glVertex2i(x+1, y ); + glColor4d(0.5, 0.5, 0.5, RAND_FLOAT_UP_TO(AT(deterministicHeaviness,(x+3)/3,(y+3)/3))); + glVertex2i(x+1, y+1); + glColor4d(0.5, 0.5, 0.5, RAND_FLOAT_UP_TO(AT(deterministicHeaviness,(x+2)/3,(y+3)/3))); + glVertex2i(x , y+1);*/ + } + glEnd(); + glPopMatrix(); +} + + diff --git a/foreignPollution.h b/foreignPollution.h new file mode 100644 --- /dev/null +++ b/foreignPollution.h @@ -0,0 +1,6 @@ +/* License: GPL v2 or later */ + +#include + +void foreignPollution(uint32_t ms, const double * pollutions, uint32_t width, uint32_t height); +