reupload

LICENSE

@@ -0,0 +1,675 @@
+                    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:
+
+    {project}  Copyright (C) {year}  {fullname}
+    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>.
+

Makefile

@@ -0,0 +1,41 @@
+CC = g++
+PROJECT = ld39
+OBJDIR = obj
+SRCDIR = src
+IDIR = include
+OPTS = -std=c++14 -g -Wall -I$(IDIR)
+LIBS = -ltmxlite -lsfml-audio -lsfml-graphics -lsfml-window -lsfml-system
+SRCS    = $(shell find $(SRCDIR) -name '*.cpp')
+SRCDIRS = $(shell find . -name '*.cpp' | dirname {} | sort | uniq | sed 's/\/$(SRCDIR)//g' )
+OBJS    = $(patsubst $(SRCDIR)/%.cpp,$(OBJDIR)/%.o,$(SRCS))
+
+.PHONY: default all clean
+.PRECIOUS: $(TARGET)
+
+default: $(PROJECT)
+
+all: default
+
+$(PROJECT): buildrepo $(OBJS)
+	$(CC) $(OBJS) $(LIBS) -o $@
+
+$(OBJDIR)/%.o: $(SRCDIR)/%.cpp
+	$(CC) $(OPTS) -c $< -o $@
+
+clean:
+	-rm -f obj/*.o
+	-rm -f $(TARGET)
+
+run:
+	-./$(PROJECT)
+	
+buildrepo:
+	@$(call make-repo)
+
+define make-repo
+	mkdir -p $(OBJDIR)
+	for dir in $(SRCDIRS); \
+	do \
+		mkdir -p $(OBJDIR)/$$dir; \
+	done
+endef

README.md

@@ -0,0 +1,13 @@
+# Zombies 'n Kebabs
+![Screenshot](https://static.jam.vg/raw/f90/1/z/6951.png)
+
+A Ghosts 'n Goblins clone for LD39. This is a reupload since I lost the original GitHub repo.
+More info on the game's page at ldjam.com.
+
+## License
+
+The code is licensed in GPLv3.
+
+The non-code files are CC-By-SA 4.0.
+
+See LICENSE files for licensing information.

data/LICENSE

@@ -0,0 +1,429 @@
+Attribution-ShareAlike 4.0 International
+
+=======================================================================
+
+Creative Commons Corporation ("Creative Commons") is not a law firm and
+does not provide legal services or legal advice. Distribution of
+Creative Commons public licenses does not create a lawyer-client or
+other relationship. Creative Commons makes its licenses and related
+information available on an "as-is" basis. Creative Commons gives no
+warranties regarding its licenses, any material licensed under their
+terms and conditions, or any related information. Creative Commons
+disclaims all liability for damages resulting from their use to the
+fullest extent possible.
+
+Using Creative Commons Public Licenses
+
+Creative Commons public licenses provide a standard set of terms and
+conditions that creators and other rights holders may use to share
+original works of authorship and other material subject to copyright
+and certain other rights specified in the public license below. The
+following considerations are for informational purposes only, are not
+exhaustive, and do not form part of our licenses.
+
+     Considerations for licensors: Our public licenses are
+     intended for use by those authorized to give the public
+     permission to use material in ways otherwise restricted by
+     copyright and certain other rights. Our licenses are
+     irrevocable. Licensors should read and understand the terms
+     and conditions of the license they choose before applying it.
+     Licensors should also secure all rights necessary before
+     applying our licenses so that the public can reuse the
+     material as expected. Licensors should clearly mark any
+     material not subject to the license. This includes other CC-
+     licensed material, or material used under an exception or
+     limitation to copyright. More considerations for licensors:
+	wiki.creativecommons.org/Considerations_for_licensors
+
+     Considerations for the public: By using one of our public
+     licenses, a licensor grants the public permission to use the
+     licensed material under specified terms and conditions. If
+     the licensor's permission is not necessary for any reason--for
+     example, because of any applicable exception or limitation to
+     copyright--then that use is not regulated by the license. Our
+     licenses grant only permissions under copyright and certain
+     other rights that a licensor has authority to grant. Use of
+     the licensed material may still be restricted for other
+     reasons, including because others have copyright or other
+     rights in the material. A licensor may make special requests,
+     such as asking that all changes be marked or described.
+     Although not required by our licenses, you are encouraged to
+     respect those requests where reasonable. More_considerations
+     for the public: 
+	wiki.creativecommons.org/Considerations_for_licensees
+
+=======================================================================
+
+Creative Commons Attribution-ShareAlike 4.0 International Public
+License
+
+By exercising the Licensed Rights (defined below), You accept and agree
+to be bound by the terms and conditions of this Creative Commons
+Attribution-ShareAlike 4.0 International Public License ("Public
+License"). To the extent this Public License may be interpreted as a
+contract, You are granted the Licensed Rights in consideration of Your
+acceptance of these terms and conditions, and the Licensor grants You
+such rights in consideration of benefits the Licensor receives from
+making the Licensed Material available under these terms and
+conditions.
+
+
+Section 1 -- Definitions.
+
+  a. Adapted Material means material subject to Copyright and Similar
+     Rights that is derived from or based upon the Licensed Material
+     and in which the Licensed Material is translated, altered,
+     arranged, transformed, or otherwise modified in a manner requiring
+     permission under the Copyright and Similar Rights held by the
+     Licensor. For purposes of this Public License, where the Licensed
+     Material is a musical work, performance, or sound recording,
+     Adapted Material is always produced where the Licensed Material is
+     synched in timed relation with a moving image.
+
+  b. Adapter's License means the license You apply to Your Copyright
+     and Similar Rights in Your contributions to Adapted Material in
+     accordance with the terms and conditions of this Public License.
+
+  c. BY-SA Compatible License means a license listed at
+     creativecommons.org/compatiblelicenses, approved by Creative
+     Commons as essentially the equivalent of this Public License.
+
+  d. Copyright and Similar Rights means copyright and/or similar rights
+     closely related to copyright including, without limitation,
+     performance, broadcast, sound recording, and Sui Generis Database
+     Rights, without regard to how the rights are labeled or
+     categorized. For purposes of this Public License, the rights
+     specified in Section 2(b)(1)-(2) are not Copyright and Similar
+     Rights.
+
+  e. Effective Technological Measures means those measures that, in the
+     absence of proper authority, may not be circumvented under laws
+     fulfilling obligations under Article 11 of the WIPO Copyright
+     Treaty adopted on December 20, 1996, and/or similar international
+     agreements.
+
+  f. Exceptions and Limitations means fair use, fair dealing, and/or
+     any other exception or limitation to Copyright and Similar Rights
+     that applies to Your use of the Licensed Material.
+
+  g. License Elements means the license attributes listed in the name
+     of a Creative Commons Public License. The License Elements of this
+     Public License are Attribution and ShareAlike.
+
+  h. Licensed Material means the artistic or literary work, database,
+     or other material to which the Licensor applied this Public
+     License.
+
+  i. Licensed Rights means the rights granted to You subject to the
+     terms and conditions of this Public License, which are limited to
+     all Copyright and Similar Rights that apply to Your use of the
+     Licensed Material and that the Licensor has authority to license.
+
+  j. Licensor means the individual(s) or entity(ies) granting rights
+     under this Public License.
+
+  k. Share means to provide material to the public by any means or
+     process that requires permission under the Licensed Rights, such
+     as reproduction, public display, public performance, distribution,
+     dissemination, communication, or importation, and to make material
+     available to the public including in ways that members of the
+     public may access the material from a place and at a time
+     individually chosen by them.
+
+  l. Sui Generis Database Rights means rights other than copyright
+     resulting from Directive 96/9/EC of the European Parliament and of
+     the Council of 11 March 1996 on the legal protection of databases,
+     as amended and/or succeeded, as well as other essentially
+     equivalent rights anywhere in the world.
+
+  m. You means the individual or entity exercising the Licensed Rights
+     under this Public License. Your has a corresponding meaning.
+
+
+Section 2 -- Scope.
+
+  a. License grant.
+
+       1. Subject to the terms and conditions of this Public License,
+          the Licensor hereby grants You a worldwide, royalty-free,
+          non-sublicensable, non-exclusive, irrevocable license to
+          exercise the Licensed Rights in the Licensed Material to:
+
+            a. reproduce and Share the Licensed Material, in whole or
+               in part; and
+
+            b. produce, reproduce, and Share Adapted Material.
+
+       2. Exceptions and Limitations. For the avoidance of doubt, where
+          Exceptions and Limitations apply to Your use, this Public
+          License does not apply, and You do not need to comply with
+          its terms and conditions.
+
+       3. Term. The term of this Public License is specified in Section
+          6(a).
+
+       4. Media and formats; technical modifications allowed. The
+          Licensor authorizes You to exercise the Licensed Rights in
+          all media and formats whether now known or hereafter created,
+          and to make technical modifications necessary to do so. The
+          Licensor waives and/or agrees not to assert any right or
+          authority to forbid You from making technical modifications
+          necessary to exercise the Licensed Rights, including
+          technical modifications necessary to circumvent Effective
+          Technological Measures. For purposes of this Public License,
+          simply making modifications authorized by this Section 2(a)
+          (4) never produces Adapted Material.
+
+       5. Downstream recipients.
+
+            a. Offer from the Licensor -- Licensed Material. Every
+               recipient of the Licensed Material automatically
+               receives an offer from the Licensor to exercise the
+               Licensed Rights under the terms and conditions of this
+               Public License.
+
+            b. Additional offer from the Licensor -- Adapted Material.
+               Every recipient of Adapted Material from You
+               automatically receives an offer from the Licensor to
+               exercise the Licensed Rights in the Adapted Material
+               under the conditions of the Adapter's License You apply.
+
+            c. No downstream restrictions. You may not offer or impose
+               any additional or different terms or conditions on, or
+               apply any Effective Technological Measures to, the
+               Licensed Material if doing so restricts exercise of the
+               Licensed Rights by any recipient of the Licensed
+               Material.
+
+       6. No endorsement. Nothing in this Public License constitutes or
+          may be construed as permission to assert or imply that You
+          are, or that Your use of the Licensed Material is, connected
+          with, or sponsored, endorsed, or granted official status by,
+          the Licensor or others designated to receive attribution as
+          provided in Section 3(a)(1)(A)(i).
+
+  b. Other rights.
+
+       1. Moral rights, such as the right of integrity, are not
+          licensed under this Public License, nor are publicity,
+          privacy, and/or other similar personality rights; however, to
+          the extent possible, the Licensor waives and/or agrees not to
+          assert any such rights held by the Licensor to the limited
+          extent necessary to allow You to exercise the Licensed
+          Rights, but not otherwise.
+
+       2. Patent and trademark rights are not licensed under this
+          Public License.
+
+       3. To the extent possible, the Licensor waives any right to
+          collect royalties from You for the exercise of the Licensed
+          Rights, whether directly or through a collecting society
+          under any voluntary or waivable statutory or compulsory
+          licensing scheme. In all other cases the Licensor expressly
+          reserves any right to collect such royalties.
+
+
+Section 3 -- License Conditions.
+
+Your exercise of the Licensed Rights is expressly made subject to the
+following conditions.
+
+  a. Attribution.
+
+       1. If You Share the Licensed Material (including in modified
+          form), You must:
+
+            a. retain the following if it is supplied by the Licensor
+               with the Licensed Material:
+
+                 i. identification of the creator(s) of the Licensed
+                    Material and any others designated to receive
+                    attribution, in any reasonable manner requested by
+                    the Licensor (including by pseudonym if
+                    designated);
+
+                ii. a copyright notice;
+
+               iii. a notice that refers to this Public License;
+
+                iv. a notice that refers to the disclaimer of
+                    warranties;
+
+                 v. a URI or hyperlink to the Licensed Material to the
+                    extent reasonably practicable;
+
+            b. indicate if You modified the Licensed Material and
+               retain an indication of any previous modifications; and
+
+            c. indicate the Licensed Material is licensed under this
+               Public License, and include the text of, or the URI or
+               hyperlink to, this Public License.
+
+       2. You may satisfy the conditions in Section 3(a)(1) in any
+          reasonable manner based on the medium, means, and context in
+          which You Share the Licensed Material. For example, it may be
+          reasonable to satisfy the conditions by providing a URI or
+          hyperlink to a resource that includes the required
+          information.
+
+       3. If requested by the Licensor, You must remove any of the
+          information required by Section 3(a)(1)(A) to the extent
+          reasonably practicable.
+
+  b. ShareAlike.
+
+     In addition to the conditions in Section 3(a), if You Share
+     Adapted Material You produce, the following conditions also apply.
+
+       1. The Adapter's License You apply must be a Creative Commons
+          license with the same License Elements, this version or
+          later, or a BY-SA Compatible License.
+
+       2. You must include the text of, or the URI or hyperlink to, the
+          Adapter's License You apply. You may satisfy this condition
+          in any reasonable manner based on the medium, means, and
+          context in which You Share Adapted Material.
+
+       3. You may not offer or impose any additional or different terms
+          or conditions on, or apply any Effective Technological
+          Measures to, Adapted Material that restrict exercise of the
+          rights granted under the Adapter's License You apply.
+
+
+Section 4 -- Sui Generis Database Rights.
+
+Where the Licensed Rights include Sui Generis Database Rights that
+apply to Your use of the Licensed Material:
+
+  a. for the avoidance of doubt, Section 2(a)(1) grants You the right
+     to extract, reuse, reproduce, and Share all or a substantial
+     portion of the contents of the database;
+
+  b. if You include all or a substantial portion of the database
+     contents in a database in which You have Sui Generis Database
+     Rights, then the database in which You have Sui Generis Database
+     Rights (but not its individual contents) is Adapted Material,
+
+     including for purposes of Section 3(b); and
+  c. You must comply with the conditions in Section 3(a) if You Share
+     all or a substantial portion of the contents of the database.
+
+For the avoidance of doubt, this Section 4 supplements and does not
+replace Your obligations under this Public License where the Licensed
+Rights include other Copyright and Similar Rights.
+
+
+Section 5 -- Disclaimer of Warranties and Limitation of Liability.
+
+  a. UNLESS OTHERWISE SEPARATELY UNDERTAKEN BY THE LICENSOR, TO THE
+     EXTENT POSSIBLE, THE LICENSOR OFFERS THE LICENSED MATERIAL AS-IS
+     AND AS-AVAILABLE, AND MAKES NO REPRESENTATIONS OR WARRANTIES OF
+     ANY KIND CONCERNING THE LICENSED MATERIAL, WHETHER EXPRESS,
+     IMPLIED, STATUTORY, OR OTHER. THIS INCLUDES, WITHOUT LIMITATION,
+     WARRANTIES OF TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR
+     PURPOSE, NON-INFRINGEMENT, ABSENCE OF LATENT OR OTHER DEFECTS,
+     ACCURACY, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT
+     KNOWN OR DISCOVERABLE. WHERE DISCLAIMERS OF WARRANTIES ARE NOT
+     ALLOWED IN FULL OR IN PART, THIS DISCLAIMER MAY NOT APPLY TO YOU.
+
+  b. TO THE EXTENT POSSIBLE, IN NO EVENT WILL THE LICENSOR BE LIABLE
+     TO YOU ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION,
+     NEGLIGENCE) OR OTHERWISE FOR ANY DIRECT, SPECIAL, INDIRECT,
+     INCIDENTAL, CONSEQUENTIAL, PUNITIVE, EXEMPLARY, OR OTHER LOSSES,
+     COSTS, EXPENSES, OR DAMAGES ARISING OUT OF THIS PUBLIC LICENSE OR
+     USE OF THE LICENSED MATERIAL, EVEN IF THE LICENSOR HAS BEEN
+     ADVISED OF THE POSSIBILITY OF SUCH LOSSES, COSTS, EXPENSES, OR
+     DAMAGES. WHERE A LIMITATION OF LIABILITY IS NOT ALLOWED IN FULL OR
+     IN PART, THIS LIMITATION MAY NOT APPLY TO YOU.
+
+  c. The disclaimer of warranties and limitation of liability provided
+     above shall be interpreted in a manner that, to the extent
+     possible, most closely approximates an absolute disclaimer and
+     waiver of all liability.
+
+
+Section 6 -- Term and Termination.
+
+  a. This Public License applies for the term of the Copyright and
+     Similar Rights licensed here. However, if You fail to comply with
+     this Public License, then Your rights under this Public License
+     terminate automatically.
+
+  b. Where Your right to use the Licensed Material has terminated under
+     Section 6(a), it reinstates:
+
+       1. automatically as of the date the violation is cured, provided
+          it is cured within 30 days of Your discovery of the
+          violation; or
+
+       2. upon express reinstatement by the Licensor.
+
+     For the avoidance of doubt, this Section 6(b) does not affect any
+     right the Licensor may have to seek remedies for Your violations
+     of this Public License.
+
+  c. For the avoidance of doubt, the Licensor may also offer the
+     Licensed Material under separate terms or conditions or stop
+     distributing the Licensed Material at any time; however, doing so
+     will not terminate this Public License.
+
+  d. Sections 1, 5, 6, 7, and 8 survive termination of this Public
+     License.
+
+
+Section 7 -- Other Terms and Conditions.
+
+  a. The Licensor shall not be bound by any additional or different
+     terms or conditions communicated by You unless expressly agreed.
+
+  b. Any arrangements, understandings, or agreements regarding the
+     Licensed Material not stated herein are separate from and
+     independent of the terms and conditions of this Public License.
+
+
+Section 8 -- Interpretation.
+
+  a. For the avoidance of doubt, this Public License does not, and
+     shall not be interpreted to, reduce, limit, restrict, or impose
+     conditions on any use of the Licensed Material that could lawfully
+     be made without permission under this Public License.
+
+  b. To the extent possible, if any provision of this Public License is
+     deemed unenforceable, it shall be automatically reformed to the
+     minimum extent necessary to make it enforceable. If the provision
+     cannot be reformed, it shall be severed from this Public License
+     without affecting the enforceability of the remaining terms and
+     conditions.
+
+  c. No term or condition of this Public License will be waived and no
+     failure to comply consented to unless expressly agreed to by the
+     Licensor.
+
+  d. Nothing in this Public License constitutes or may be interpreted
+     as a limitation upon, or waiver of, any privileges and immunities
+     that apply to the Licensor or You, including from the legal
+     processes of any jurisdiction or authority.
+
+
+=======================================================================
+
+Creative Commons is not a party to its public
+licenses. Notwithstanding, Creative Commons may elect to apply one of
+its public licenses to material it publishes and in those instances
+will be considered the “Licensor.” The text of the Creative Commons
+public licenses is dedicated to the public domain under the CC0 Public
+Domain Dedication. Except for the limited purpose of indicating that
+material is shared under a Creative Commons public license or as
+otherwise permitted by the Creative Commons policies published at
+creativecommons.org/policies, Creative Commons does not authorize the
+use of the trademark "Creative Commons" or any other trademark or logo
+of Creative Commons without its prior written consent including,
+without limitation, in connection with any unauthorized modifications
+to any of its public licenses or any other arrangements,
+understandings, or agreements concerning use of licensed material. For
+the avoidance of doubt, this paragraph does not form part of the
+public licenses.
+
+Creative Commons may be contacted at creativecommons.org.
+
+

data/font-readme.txt

@@ -0,0 +1,31 @@
+
+     http://xero.nu       +       http://xero.owns.us
+
+
+         00XXXX                        XXXX00        
+         00XXxx                        xxXX00        
+         ee0000eeeeRR            RReeee0000ee        
+               xxXX00            00XXxx              
+               XXXX00            00XXXX              
+         eexxXXXXXXXXXXXXXXXXXXXXXXXXXXXXxxee        
+         00XXXXeeee00XXXXXXXXXXXX00eeeeXXXX00        
+     xxXXXXXXXX    00XXXXXXXXXXXX00    XXXXXXXXxx    
+     XXXXXXXXXX    00XXXXXXXXXXXX00    XXXXXXXXXX    
+ eeeeXXXXXXXXXXeeeeRRXXXXXXXXXXXXRReeeeXXXXXXXXXXeeee
+ XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
+ XXXX""""RRXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXRR""""XXXX
+ XXXX    00XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX00    XXXX
+ XXXX    00XXXX""""""""""""""""""""""""XXXX00    XXXX
+ XXRR    00XXXX                        XXXX00    RRXX
+ eeXX    00xxxxRR000000ee    ee000000RRxxxx00    XXee
+               xxXXXXXXxx    xxXXXXXXxx                            
+               XXXXXXXXXX    XXXXXXXXXX              
+  _____             __        .__
+_/ ____\___   _____/  |____  _|__|______  __ __ ______
+\   __Y  _ \ /    \   __\  \/ /  \_  __ \|  |  Y  ___/
+ |  |(  <_> )   |  \  |  \   /|  ||  | \/|  |  |___ \
+ |__| \____/|___|  /__|   \_/ |__||__|  /\____/____  >
+                 \/                     \/         \/
+      font designed, created, and downloaded from
+   
+        h t t p : / / f o n t v i r . u s /

data/map1.tsx

@@ -0,0 +1,4 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<tileset name="tiles" tilewidth="16" tileheight="16" tilecount="6" columns="3">
+ <image source="tiles.png" width="48" height="32"/>
+</tileset>

include/AnimatedSprite.hpp

@@ -0,0 +1,26 @@
+#pragma once
+
+#include <SFML/Graphics.hpp>
+
+using namespace sf;
+struct Animation;
+
+class AnimatedSprite: public Sprite {
+public:
+	AnimatedSprite();
+	virtual ~AnimatedSprite();
+	void addAnimation(std::string armored, std::string filename, unsigned duration, std::string name, bool loop);
+	void setAnimation(std::string name, bool armored);
+	virtual void animate();
+	bool isJumping() const
+	{
+		return _jumping;
+	}
+	bool armored;
+protected:
+	Animation* _current;
+	bool _jumping;
+	Clock _anclock;
+private:
+	std::map<std::string, Animation> _anim;
+};

include/Animation.hpp

@@ -0,0 +1,19 @@
+#pragma once
+
+#include <SFML/Graphics.hpp>
+
+using namespace sf;
+
+struct Animation {
+	Animation() {
+		// Turns out to be constant.
+		count = 166;
+	}
+	Texture tex;
+	Texture tex1;
+	Texture tex2;
+	unsigned count;
+	unsigned duration;
+	std::string name;
+	bool loop;
+};

include/Core.hpp

@@ -0,0 +1,102 @@
+#pragma once
+
+#include <SFML/Graphics.hpp>
+#include <SFML/Audio.hpp>
+#include <tmxlite/Map.hpp>
+#include "Shared.hpp"
+#include "Player.hpp"
+#include "NumText.hpp"
+#include "Portal.hpp"
+#include "Kebab.hpp"
+#include "SFMLOrthogonalLayer.hpp"
+
+#define LAYERCOUNT 5
+
+using namespace sf;
+
+struct Global {
+ 	int lives;
+	unsigned score;
+	unsigned high;
+	bool restart;
+	RenderWindow window;
+	Music music;
+	bool reachedEast;
+};
+
+class Core {
+public:
+	Core() = delete;
+	Core(Global* lg);
+	virtual ~Core();
+	void run();
+private:
+	void think(float delta);
+	void loop(float delta);
+	void render();
+
+	Global* g;
+	View _view;
+	Shared _settings;
+ 	Player _player;
+	tmx::Map map;
+
+	MapLayer _layer[LAYERCOUNT];
+
+	Texture _background_tx;
+	Sprite _background;
+	Texture _evm_tx;
+	Sprite _evm;
+	Texture _fog_tx;
+	Sprite _fog;
+
+	Sprite _head;
+	Texture _head_tx;
+
+	Sprite _frame;
+	Texture _frame_tx;
+
+	Sprite _hud_score;
+	Sprite _hud_highscore;
+	Sprite _hud_time;
+	Sprite _hud_energy;
+	Texture _hud_tx;
+
+	Texture _font;
+	NumText _score_text;
+	NumText _highscore_text;
+	NumText _time_text;
+	NumText _energy_text;
+
+	RectangleShape debug;
+	RectangleShape debug2;
+
+	std::vector<Corrupted> _corrupted;
+	std::vector<Kebab> keb;
+	Clock _corr_clock;
+
+	Portal _p1;
+	Portal _p2;
+	Portal _p3;
+
+	Texture splashtx;
+	Sprite splash;
+
+	int _lives;
+
+	Clock _s1c;
+
+	Sprite _trixie;
+	Texture _trix;
+
+	bool timegranted;
+
+	Texture ggtex;
+	std::vector<Sprite> gg;
+
+	SoundBuffer boom;
+	Sound sht;
+
+	std::vector<IntRect> jedi;
+	Clock jediClock;
+};

include/Echo.hpp

@@ -0,0 +1,91 @@
+#pragma once
+
+#include <iostream>
+#include <initializer_list>
+#include <SFML/Graphics.hpp>
+
+enum EchoType {
+	DEBUG, INFO, LOAD, WARNING, ERROR
+};
+
+class Echo { 
+public:
+	Echo() = delete;
+	template<typename T, typename... Args>
+	Echo(EchoType a, T t, Args... args);
+	static void setLogLevel(int lv);
+private:;
+	template <typename T>
+	void print(bool cerr, T t);
+	template<typename T, typename... Args>
+	void print(bool cerr, T t, Args... args);
+	static int level;
+};
+
+template<typename T, typename... Args>
+Echo::Echo(EchoType a, T t, Args... args)
+{
+	switch(a) {
+		case EchoType::DEBUG:
+			if(level < 3)
+				return;
+			std::cout << "[DEBUG]   ";
+			break;
+		case EchoType::INFO:
+			if(level < 2)
+				return;
+			std::cout << "[INFO]    ";
+			break;
+		case EchoType::LOAD:
+			if(level < 2)
+				return;
+			std::cout << "[LOAD]    ";
+			break;
+		case EchoType::WARNING:
+			if(level < 3)
+				return;
+			std::cout << "[WARNING] ";
+			break;
+		case EchoType::ERROR:
+			if(level < 1)
+				return;
+			std::cerr << "[ERROR]   ";
+			break;
+		default:
+			std::cout << "          ";
+			break;
+	}
+	print(a == ERROR, t, args...);
+	if(a == ERROR) {
+		std::cerr << std::endl;
+	}
+	else {
+		std::cout << std::endl;
+	}
+}
+
+template <typename T>
+void Echo::print(bool cerr, T t)
+{
+	if(cerr) {
+		std::cerr << t;
+	}
+	else {
+		std::cout << t;
+	}
+}
+
+template<typename T, typename... Args>
+void Echo::print(bool cerr, T t, Args... args)
+{
+	if(cerr) {
+		std::cerr << t;
+	}
+	else {
+		std::cout << t;
+	}
+
+    print(cerr, args...);
+}
+
+void loadTexture(sf::Texture& texture, std::string filename);

include/Kebab.hpp

@@ -0,0 +1,28 @@
+#pragma once
+
+#include <SFML/Graphics.hpp>
+
+using namespace sf;
+
+#include "Shared.hpp"
+
+class Kebab:public Drawable, public Transformable {
+public:
+	Kebab() = delete;
+	Kebab(Shared* context);
+	virtual ~Kebab();
+	bool dead;
+	void loop(float delta);
+	Sprite keb;
+	Sprite spr;
+private:
+	virtual void draw(RenderTarget& target, RenderStates states) const override;
+Shared* _context;
+	static Texture _tex;
+	static Texture _tex2;
+	Clock clk;
+	bool released;
+	bool phasing;
+	Clock phasecd;
+	Clock rotcd;
+};

include/NumText.hpp

@@ -0,0 +1,21 @@
+#pragma once
+
+#include <SFML/Graphics.hpp>
+
+using namespace sf;
+
+class NumText: public Drawable, public Transformable {
+public:
+	NumText();
+	virtual ~NumText();
+	void setTexture(Texture* texture);
+	void setNumber(unsigned number);
+	void semicolon();
+	void percent();
+private:
+	Texture* _font;
+	std::vector<Sprite> _nums;
+	bool _semicolon;
+	bool _percent;
+	virtual void draw(RenderTarget& target, RenderStates states) const override;
+};

include/Player.hpp

@@ -0,0 +1,49 @@
+#pragma once
+
+#include <SFML/Graphics.hpp>
+#include "AnimatedSprite.hpp"
+
+using namespace sf;
+
+struct Shared;
+
+class Player: public AnimatedSprite {
+public:
+	Player() = delete;
+	Player(Shared* context);
+	virtual ~Player();
+	void loop(float delta);
+	void move(float x, float y);
+	void move(float x);
+	void animate() override;
+	bool dead;
+public:
+	Shared* _context;
+	int _jumpDirection;
+	float _velocity;
+	Clock iframeclock;
+	bool iframed;
+};
+
+class Corrupted: public Sprite {
+public:
+	Corrupted() = delete;
+	Corrupted(Shared* context);
+	virtual ~Corrupted();
+	void loop(float delta);
+	bool dead;
+	float speed;
+	int hp;
+	float xd;
+	int lifespan;
+	float out;
+	float in;
+	bool ready;
+private:
+	Shared* _context;
+	bool _direction;
+	static Texture _tex;
+	Clock _anclock;
+
+	float height;
+};

include/Portal.hpp

@@ -0,0 +1,20 @@
+#pragma once
+
+#include <SFML/Graphics.hpp>
+
+using namespace sf;
+
+class Shared;
+
+class Portal: public Drawable {
+public:
+	void create(Shared* context, Vector2i src, Vector2i dest);
+	void animate();
+private:
+	virtual void draw(RenderTarget& target, RenderStates states) const override;
+	static Texture _blue_tex;
+	static Texture _orange_tex;
+	Sprite _blue;
+	Sprite _orange;
+	Clock _clock;
+};

include/SFMLOrthogonalLayer.hpp

@@ -0,0 +1,313 @@
+/*********************************************************************
+Matt Marchant 2016
+http://trederia.blogspot.com
+
+tmxlite - Zlib license.
+
+This software is provided 'as-is', without any express or
+implied warranty. In no event will the authors be held
+liable for any damages arising from the use of this software.
+
+Permission is granted to anyone to use this software for any purpose,
+including commercial applications, and to alter it and redistribute
+it freely, subject to the following restrictions:
+
+1. The origin of this software must not be misrepresented;
+you must not claim that you wrote the original software.
+If you use this software in a product, an acknowledgment
+in the product documentation would be appreciated but
+is not required.
+
+2. Altered source versions must be plainly marked as such,
+and must not be misrepresented as being the original software.
+
+3. This notice may not be removed or altered from any
+source distribution.
+*********************************************************************/
+
+/*
+Creates an SFML drawable from an Orthogonal tmx map layer.
+This is an example of drawing with SFML - not all features,
+such as tile flipping, are implemented. For a more detailed
+implementation, including artifact prevention, see:
+https://github.com/fallahn/xygine/blob/master/xygine/src/components/ComponentTileMapLayer.cpp
+*/
+
+#ifndef SFML_ORTHO_HPP_
+#define SFML_ORTHO_HPP_
+
+#include <tmxlite/Map.hpp>
+#include <tmxlite/TileLayer.hpp>
+
+#include <SFML/Graphics.hpp>
+
+#include <memory>
+#include <vector>
+#include <array>
+#include <map>
+#include <string>
+#include <limits>
+#include <iostream>
+#include <sstream>
+#include <cmath>
+#include "Echo.hpp"
+
+class MapLayer final : public sf::Drawable
+{
+public:
+	MapLayer() = default;
+    MapLayer(const tmx::Map& map, std::size_t idx)
+    {
+        create(map, idx);
+    }
+	void create(const tmx::Map& map, std::size_t idx)
+	{
+		const auto& layers = map.getLayers();
+        if (map.getOrientation() == tmx::Orientation::Orthogonal &&
+            idx < layers.size() && layers[idx]->getType() == tmx::Layer::Type::Tile)
+        {
+            //round the chunk size to the nearest tile
+            const auto tileSize = map.getTileSize();
+            m_chunkSize.x = std::floor(m_chunkSize.x / tileSize.x) * tileSize.x;
+            m_chunkSize.y = std::floor(m_chunkSize.y / tileSize.y) * tileSize.y;
+
+            const auto& layer = *dynamic_cast<const tmx::TileLayer*>(layers[idx].get());
+            createChunks(map, layer);
+
+            auto mapSize = map.getBounds();
+            m_globalBounds.width = mapSize.width;
+            m_globalBounds.height = mapSize.height;
+        }
+        else
+        {
+            std::cout << "Not a valid othogonal layer, nothing will be drawn." << std::endl;
+        }
+	}
+    ~MapLayer() = default;
+    MapLayer(const MapLayer&) = delete;
+    MapLayer& operator = (const MapLayer&) = delete;
+
+    const sf::FloatRect& getGlobalBounds() const { return m_globalBounds; }
+
+private:
+
+    sf::Vector2f m_chunkSize = sf::Vector2f(1024.f, 256.f);
+    sf::Vector2u m_chunkCount;
+    sf::FloatRect m_globalBounds;
+
+    using TextureResource = std::map<std::string, std::unique_ptr<sf::Texture>>;
+    TextureResource m_textureResource;
+
+    class Chunk final : public sf::Transformable, public sf::Drawable
+    {
+    public:
+        using Ptr = std::unique_ptr<Chunk>;
+        using Tile = std::array<sf::Vertex, 4u>;
+        Chunk(const tmx::TileLayer& layer, std::vector<const tmx::Tileset*> tilesets,
+            const sf::Vector2f& position, const sf::Vector2f& tileCount, std::size_t rowSize,  TextureResource& tr)
+        {
+            auto opacity = static_cast<sf::Uint8>(layer.getOpacity() /  1.f * 255.f);
+            sf::Color vertColour = sf::Color::White;
+            vertColour.a = opacity;
+
+            auto offset = layer.getOffset();
+            sf::Vector2f layerOffset(offset.x, offset.y);
+
+            const auto& tileIDs = layer.getTiles();
+
+            //go through the tiles and create the appropriate arrays
+            for (const auto ts : tilesets)
+            {
+                bool chunkArrayCreated = false;
+                auto tileSize = ts->getTileSize();
+
+                sf::Vector2u tsTileCount;
+
+                std::size_t xPos = static_cast<std::size_t>(position.x / tileSize.x);
+                std::size_t yPos = static_cast<std::size_t>(position.y / tileSize.y);
+
+                for (auto y = yPos; y < yPos + tileCount.y; ++y)
+                {
+                    for (auto x = xPos; x < xPos + tileCount.x; ++x)
+                    {
+                        auto idx = (y * rowSize + x);
+                        if (idx < tileIDs.size() && tileIDs[idx].ID >= ts->getFirstGID()
+                            && tileIDs[idx].ID < (ts->getFirstGID() + ts->getTileCount()))
+                        {
+                            //ID must belong to this set - so add a tile
+                            if (!chunkArrayCreated)
+                            {
+                                m_chunkArrays.emplace_back(std::make_unique<ChunkArray>(*tr.find(ts->getImagePath())->second));
+                                auto texSize = m_chunkArrays.back()->getTextureSize();
+                                tsTileCount.x = texSize.x / tileSize.x;
+                                tsTileCount.y = texSize.y / tileSize.y;
+                                chunkArrayCreated = true;
+                            }
+                            auto& ca = m_chunkArrays.back();
+                            sf::Vector2f tileOffset(x * tileSize.x, y * tileSize.y);
+
+                            auto idIndex = tileIDs[idx].ID - ts->getFirstGID();
+                            sf::Vector2f tileIndex(idIndex % tsTileCount.x, idIndex / tsTileCount.x);
+                            tileIndex.x *= tileSize.x;
+                            tileIndex.y *= tileSize.y;
+                            Tile tile =
+                            {
+                                sf::Vertex(tileOffset, vertColour, tileIndex),
+                                sf::Vertex(tileOffset + sf::Vector2f(tileSize.x, 0.f), vertColour, tileIndex + sf::Vector2f(tileSize.x, 0.f)),
+                                sf::Vertex(tileOffset + sf::Vector2f(tileSize.x, tileSize.y), vertColour, tileIndex + sf::Vector2f(tileSize.x, tileSize.y)),
+                                sf::Vertex(tileOffset + sf::Vector2f(0.f, tileSize.y), vertColour, tileIndex + sf::Vector2f(0.f, tileSize.y))
+                            };
+                            ca->addTile(tile);
+                        }
+                    }
+                }
+            }
+
+            setPosition(0, 0);
+        }
+        ~Chunk() = default;
+        Chunk(const Chunk&) = delete;
+        Chunk& operator = (const Chunk&) = delete;
+
+        bool empty() const { return m_chunkArrays.empty(); }
+    private:
+        class ChunkArray final : public sf::Drawable
+        {
+        public:
+            using Ptr = std::unique_ptr<ChunkArray>;
+            explicit ChunkArray(const sf::Texture& t)
+                : m_texture(t) {}
+            ~ChunkArray() = default;
+            ChunkArray(const ChunkArray&) = delete;
+            ChunkArray& operator = (const ChunkArray&) = delete;
+
+            void addTile(const Chunk::Tile& tile)
+            {
+                for (const auto& v : tile)
+                {
+                    m_vertices.push_back(v);
+                }
+            }
+            sf::Vector2u getTextureSize() const { return m_texture.getSize(); }
+
+        private:
+            const sf::Texture& m_texture;
+            std::vector<sf::Vertex> m_vertices;
+            void draw(sf::RenderTarget& rt, sf::RenderStates states) const override
+            {
+                states.texture = &m_texture;
+                rt.draw(m_vertices.data(), m_vertices.size(), sf::Quads, states);
+            }
+        };
+
+        std::vector<ChunkArray::Ptr> m_chunkArrays;
+        void draw(sf::RenderTarget& rt, sf::RenderStates states) const override
+        {
+            states.transform *= getTransform();
+            for (const auto& a : m_chunkArrays)
+            {
+                rt.draw(*a, states);
+            }
+        }
+    };
+
+    std::vector<Chunk::Ptr> m_chunks;
+    mutable std::vector<const Chunk*> m_visibleChunks;
+    void createChunks(const tmx::Map& map, const tmx::TileLayer& layer)
+    {
+        //look up all the tile sets and load the textures
+        const auto& tileSets = map.getTilesets();
+        const auto& layerIDs = layer.getTiles();
+        std::uint32_t maxID = std::numeric_limits<std::uint32_t>::max();
+        std::vector<const tmx::Tileset*> usedTileSets;
+
+        for (auto i = tileSets.rbegin(); i != tileSets.rend(); ++i)
+        {
+            for (const auto& tile : layerIDs)
+            {
+                if (tile.ID >= i->getFirstGID() && tile.ID < maxID)
+                {
+                    usedTileSets.push_back(&(*i));
+                    break;
+                }
+            }
+            maxID = i->getFirstGID();
+        }
+
+        sf::Image fallback;
+        fallback.create(2, 2, sf::Color::Magenta);
+        for (const auto ts : usedTileSets)
+        {
+            const auto& path = ts->getImagePath();
+            std::unique_ptr<sf::Texture> newTexture = std::make_unique<sf::Texture>();
+            sf::Image img;
+            if (!img.loadFromFile(path))
+            {
+                newTexture->loadFromImage(fallback);
+            }
+            else
+            {
+                if (ts->hasTransparency())
+                {
+                    auto transparency = ts->getTransparencyColour();
+                    img.createMaskFromColor({ transparency.r, transparency.g, transparency.b, transparency.a });
+                }
+                newTexture->loadFromImage(img);
+            }
+            m_textureResource.insert(std::make_pair(path, std::move(newTexture)));
+        }
+
+        //calculate the number of chunks in the layer
+        //and create each one
+        const auto bounds = map.getBounds();
+        m_chunkCount.x = static_cast<sf::Uint32>(std::ceil(bounds.width / m_chunkSize.x));
+        m_chunkCount.y = static_cast<sf::Uint32>(std::ceil(bounds.height / m_chunkSize.y));
+
+        sf::Vector2f tileCount(m_chunkSize.x / map.getTileSize().x, m_chunkSize.y / map.getTileSize().y);
+
+        for (auto y = 0u; y < m_chunkCount.y; ++y)
+        {
+            for (auto x = 0u; x < m_chunkCount.x; ++x)
+            {
+                m_chunks.emplace_back(std::make_unique<Chunk>(layer, usedTileSets,
+                    sf::Vector2f(x * m_chunkSize.x, y * m_chunkSize.y), tileCount, map.getTileCount().x, m_textureResource));
+            }
+        }
+    }
+
+    void updateVisibility(const sf::View& view) const
+    {
+        sf::Vector2f viewCorner = view.getCenter();
+        viewCorner -= view.getSize() / 2.f;
+
+        int posX = static_cast<int>(std::floor(viewCorner.x / m_chunkSize.x));
+        int posY = static_cast<int>(std::floor(viewCorner.y / m_chunkSize.y));
+
+        std::vector<const Chunk*> visible;
+        for (auto y = posY; y < posY + 2; ++y)
+        {
+            for (auto x = posX; x < posX + 2; ++x)
+            {
+                auto idx = y * int(m_chunkCount.x) + x;
+                if (idx >= 0 && idx < (int)m_chunks.size() && !m_chunks[idx]->empty())
+                {
+                    visible.push_back(m_chunks[idx].get());
+                }
+            }
+        }
+
+        std::swap(m_visibleChunks, visible);
+    }
+
+    void draw(sf::RenderTarget& rt, sf::RenderStates states) const override
+    {
+        //calc view coverage and draw nearest chunks
+        updateVisibility(rt.getView());
+        for (const auto& c : m_visibleChunks)
+        {
+            rt.draw(*c, states);
+        }
+    }
+};
+
+#endif //SFML_ORTHO_HPP_

include/Shared.hpp

@@ -0,0 +1,40 @@
+#pragma once
+
+#include <SFML/Graphics.hpp>
+
+using namespace sf;
+
+class Player;
+
+struct Shared {
+	~Shared()
+	{
+		window = nullptr;
+		view = nullptr;
+		bg = nullptr;
+		evm = nullptr;
+		fog = nullptr;
+	}
+	RenderWindow* window;
+	View* view;
+	Sprite* bg;
+	Sprite* evm;
+	Sprite* fog;
+	Vector2u size;
+	bool running;
+	bool jump;
+	bool paused;
+	std::vector<IntRect> cb;
+	std::vector<IntRect> cp;
+	std::vector<Vector2i> tpa;
+	std::vector<Vector2i> tpb;
+	std::vector<IntRect> hz;
+	std::vector<IntRect> gz;
+	Player* p;
+	int state;
+
+	Time _t;
+	unsigned _s;
+	unsigned _h;
+	float _e;
+};

src/AnimatedSprite.cpp

@@ -0,0 +1,62 @@
+#include "Animation.hpp"
+#include "AnimatedSprite.hpp"
+#include "Echo.hpp"
+
+AnimatedSprite::AnimatedSprite()
+{
+	_current = nullptr;
+	_jumping = false;
+	armored = true;
+}
+
+AnimatedSprite::~AnimatedSprite()
+{
+	_current = nullptr;
+	_anim.clear();
+}
+
+void AnimatedSprite::addAnimation(std::string armored, std::string filename, unsigned duration, std::string name, bool loop)
+{
+	_anim[name].tex1.loadFromFile(armored);
+	_anim[name].tex2.loadFromFile(filename);
+	_anim[name].duration = duration;
+	_anim[name].name = name;
+	_anim[name].loop = loop;
+	Echo(LOAD, "Registered animation ", name, " from ", filename, '.');
+}
+
+void AnimatedSprite::setAnimation(std::string name, bool armored)
+{
+	/// If it's already set, abort.
+	if(_current == &_anim[name]) {
+		return;
+	}
+	_current = &_anim[name];
+	if(_current == nullptr) {
+		Echo(ERROR, "Attempted to use an inexisting animation ", name, '.');
+	}
+	if(armored)
+	_current->tex = _current->tex1;
+	else
+	_current->tex = _current->tex2;
+	setTexture(_current->tex);
+	setTextureRect(IntRect(0, 0,
+						_current->tex.getSize().x / _current->count, _current->tex.getSize().y / _current->count));
+	_anclock.restart();
+}
+
+void AnimatedSprite::animate()
+{
+	if(_current == nullptr) {
+		return;
+	}
+	const unsigned duration = _current->duration;
+	if(duration == 0) {
+		setAnimation("idle", armored);
+	}
+
+ 	unsigned elapsed = _anclock.getElapsedTime().asMilliseconds() % duration;
+	unsigned frame = (elapsed * _current->count) / duration;
+	setTextureRect(IntRect(_current->tex.getSize().x * frame / _current->count, 0,
+						_current->tex.getSize().x / _current->count, _current->tex.getSize().y));
+}

src/Core.cpp

@@ -0,0 +1,500 @@
+#include "Core.hpp"
+#include "Echo.hpp"
+#include "Animation.hpp"
+
+Core::Core(Global* lg):
+	_player(&_settings),
+	_lives(lg->lives),
+	g(lg)
+{
+	_settings.view = &_view;
+	_settings.window = &g->window;
+	_settings.evm = &_evm;
+	_settings.bg = &_background;
+	_settings.fog = &_fog;
+	_settings.size = Vector2u(256, 224);
+	_settings.running = true;
+	_settings.paused = false;
+	_settings.p = &_player;
+	_settings._s = g->score;
+	if(_settings._s == 0 && _lives == 2)
+	_settings.state = 0;
+	else
+	_settings.state = 2;
+
+	_view = g->window.getDefaultView();
+
+	loadTexture(_hud_tx, "data/hud.png");
+	_hud_score.setTexture(_hud_tx);
+	_hud_score.setTextureRect(IntRect(0, 0, 72, 7));
+	_hud_score.setPosition(8, 0);
+
+	_hud_highscore.setTexture(_hud_tx);
+	_hud_highscore.setTextureRect(IntRect(0, 7, 72, 7));
+	_hud_highscore.setPosition(88, 0);
+
+	_hud_time.setTexture(_hud_tx);
+	_hud_time.setTextureRect(IntRect(0, 14, 72, 7));
+	_hud_time.setPosition(15, 17);
+
+	_hud_energy.setTexture(_hud_tx);
+	_hud_energy.setTextureRect(IntRect(0, 21, 72, 7));
+	_hud_energy.setPosition(80, 17);
+
+	loadTexture(_font, "data/numbers.png");
+	_score_text.setTexture(&_font);
+	_score_text.setPosition(55, 8);
+	_highscore_text.setTexture(&_font);
+	_highscore_text.setPosition(138, 8);
+
+	_time_text.setTexture(&_font);
+	_time_text.semicolon();
+	_time_text.setPosition(18, 27);
+	_energy_text.setTexture(&_font);
+	_energy_text.percent();
+	_energy_text.setPosition(100, 27);
+
+	loadTexture(_head_tx, "data/glim-head.png");
+	_head_tx.setRepeated(true);
+	_head.setTexture(_head_tx);
+	_head.setPosition(0, 224);
+	_head.setOrigin(0, _head_tx.getSize().y);
+	_head.setTextureRect(IntRect(0, 0, _head_tx.getSize().x * _lives, _head_tx.getSize().y));
+
+	loadTexture(_frame_tx, "data/frame.png");
+	_frame.setTexture(_frame_tx);
+	_frame.setPosition(128, 224);
+	_frame.setOrigin(_frame_tx.getSize().x / 2.f, _frame_tx.getSize().y + 4.f);
+
+	if(g->reachedEast)
+		_player.setPosition(16 * 86, 224);
+	else
+		_player.setPosition(16 * 9, 224);
+	_player.addAnimation("data/snowfall-walk.png", "data/glim-walk.png", 500, "walk", true);
+	_player.addAnimation("data/snowfall-idle.png", "data/glim-idle.png", 10000, "idle", true);
+	_player.addAnimation("data/snowfall-longidle.png", "data/glim-longidle.png", 1000, "longidle", false);
+	_player.addAnimation("data/snowfall-forward.png", "data/glim-forward.png", 1000, "forward", false);
+	_player.addAnimation("data/snowfall-jump.png", "data/glim-jump.png", 200, "jump", false);
+	_player.setAnimation("longidle", true);
+
+	_view.setSize(256, 224);
+	_view.setCenter(_player.getPosition().x, _player.getPosition().y - 80.f);
+
+	loadTexture(_background_tx, "data/basic_background.png");
+	_background.setTexture(_background_tx);
+	_background.setOrigin((Vector2f)_background_tx.getSize() / 2.f);
+	_background.setPosition(_player.getPosition().x, _player.getPosition().y - 80.f);
+
+	loadTexture(_evm_tx, "data/evilmountain.png");
+	_evm.setTexture(_evm_tx);
+	_evm.setOrigin((Vector2f)_evm_tx.getSize() / 2.f);
+	_evm.setPosition(_player.getPosition().x + 32.f, _player.getPosition().y - 128.f);
+
+	loadTexture(_fog_tx, "data/basic_fog.png");
+	_fog.setTexture(_fog_tx);
+	_fog.setOrigin((Vector2f)_fog_tx.getSize() / 2.f);
+	_fog.setColor(Color(255, 255, 255, 10));
+	_fog.setPosition(_player.getPosition().x, _player.getPosition().y - 80.f);
+
+	map.load("data/map1.tmx");
+
+	for(unsigned i = 0; i < LAYERCOUNT; ++i) {
+    	_layer[i].create(map, i);
+	}
+
+	/// Left invisible wall
+	_settings.cb.emplace_back(-16, 0, 16, 16 * 32);
+	_settings.cb.emplace_back(192 * 16, 0, 16, 16 * 32);
+
+	/// Graves
+	_settings.cb.emplace_back(6 * 16, 13 * 16, 16, 16);
+	_settings.cb.emplace_back(19 * 16, 13 * 16, 16, 16);
+	_settings.cb.emplace_back(38 * 16, 13 * 16, 16, 16);
+	_settings.cb.emplace_back(53 * 16, 13 * 16, 16, 16);
+	_settings.cb.emplace_back(28 * 16, 9 * 16, 16, 16);
+
+	/// Ground
+	_settings.cp.emplace_back(0, 224, 64 * 16 + 16, 8);
+	_settings.cp.emplace_back(22 * 16, 10 * 16, 13 * 16 + 16, 8);
+	_settings.cp.emplace_back(73 * 16, 224, 130 * 16 + 16, 8);
+
+	jedi.emplace_back(2 * 16, 13 * 16, 48, 16);
+	jedi.emplace_back(11 * 16, 13 * 16, 48, 16);
+	jedi.emplace_back(48 * 16, 13 * 16, 48, 16);
+	jedi.emplace_back(86 * 16, 13 * 16, 48, 16);
+	jedi.emplace_back(101 * 16, 13 * 16, 48, 16);
+	jedi.emplace_back(112 * 16, 13 * 16, 48, 16);
+	jedi.emplace_back(124 * 16, 13 * 16, 48, 16);
+	jedi.emplace_back(139 * 16, 13 * 16, 48, 16);
+	jedi.emplace_back(171 * 16, 13 * 16, 48 * 3, 16);
+
+	jedi.emplace_back(31 * 16, 9 * 16, 48, 16);
+
+	_p1.create(&_settings, {23, 13}, {23, 9});
+	_p2.create(&_settings, {64, 13}, {74, 13});
+	_p3.create(&_settings, {75, 13}, {63, 13});
+
+	debug.setFillColor(Color(255, 0, 0, 100));
+	debug.setSize(Vector2f(4.f, 4.f));
+	debug.setOrigin(2.f, 2.f);
+	debug2.setFillColor(Color::Red);
+	debug2.setSize(Vector2f(4.f, 4.f));
+	debug2.setOrigin(2.f, 2.f);
+
+	splashtx.loadFromFile("data/splash.png");
+	splash.setTexture(splashtx);
+
+	_settings._t = sf::seconds(120);
+	_settings._s = g->score;
+	_settings._h = g->high;
+	_settings._e = 50;
+	timegranted = false;
+
+	boom.loadFromFile("data/shoot.wav");
+	sht.setBuffer(boom);
+	sht.setVolume(40.f);
+
+	ggtex.loadFromFile("data/shot.png");
+
+	_corrupted.emplace_back(&_settings);
+	_corrupted.back().setPosition(170 * 16, 224);
+	_corrupted.back().out = 0.f;
+	_corrupted.back().in = 0.f;
+	_corrupted.back().speed = 144.f;
+	_corrupted.back().lifespan = 2000000000;
+	_corrupted.back().hp = 6;
+	_corrupted.back().ready = true;
+
+	_trix.loadFromFile("data/trixie.png");
+	_trixie.setPosition(_player.getPosition().x + 32.f, _player.getPosition().y);
+	_trixie.setOrigin(0.f, 14.f);
+	_trixie.setTexture(_trix);
+}
+
+Core::~Core()
+{
+
+}
+
+void Core::run()
+{
+	Clock clock;
+	float delta;
+	float minimum = 1.f / 30.f;
+	Echo(INFO, "Starting.");
+	while(_settings.running) {
+		think(delta);
+		delta = clock.restart().asSeconds();
+		while(delta > minimum) {
+			delta -= minimum;
+			if(!_settings.paused)
+				loop(minimum);
+		}
+		if(!_settings.paused)
+			loop(delta);
+		render();
+	}
+}
+
+void Core::think(float delta)
+{
+    Event event;
+	_settings.jump = false;
+    while(g->window.pollEvent(event)) {
+        if(event.type == Event::Closed || (event.type == Event::KeyReleased && event.key.code == Keyboard::Escape)) {
+            g->window.close();
+			g->restart = false;
+			_settings.running = false;
+		}
+		else if(event.type == Event::GainedFocus) {
+			_settings.paused = false;
+		}
+		else if(event.type == Event::LostFocus) {
+			_settings.paused = true;
+		}
+		else if(event.type == Event::KeyReleased && event.key.code == Keyboard::P) {
+			_settings.paused = !_settings.paused;
+		}
+		else if(_settings.state == 2 && event.type == Event::KeyPressed && (event.key.code == Keyboard::Space || event.key.code == Keyboard::X)) {
+			if(_settings._e >= 10.f && !_player.dead)
+			{
+				_settings.jump = true;
+				_settings._e -= 10.f;
+			}
+		}
+		else if(_settings.state == 2 && event.type == Event::KeyPressed && (event.key.code == Keyboard::LControl || event.key.code == Keyboard::Z)) {
+			if(gg.size() < 3 && _settings._e >= 20.f) {
+				_settings._e -= 20.f;
+				sht.setPitch(int(80 + rand() % 40) / 100.f);
+				sht.play();
+				gg.emplace_back();
+				gg.back().setTexture(ggtex);
+				gg.back().setOrigin(4, 4 + 24);
+				gg.back().setScale(_player.getScale());
+				gg.back().setPosition(_player.getPosition().x, _player.getPosition().y);
+			}
+		}
+		else if(_settings.state < 2 && event.type == Event::KeyReleased && (
+			event.key.code == Keyboard::Return || event.key.code == Keyboard::Num1)) {
+			_settings.state = 2;
+			_s1c.restart();
+		}
+    }
+}
+#include <sstream>
+void Core::loop(float delta)
+{
+	if(_settings.state == 2)
+		_player.loop(delta);
+	else
+		_player.animate();
+	if(_settings.state != 1) {
+		_s1c.restart();
+	}
+	_settings.hz.clear();
+	_settings.gz.clear();
+	_p1.animate();
+	_p2.animate();
+	_p3.animate();
+
+	_score_text.setNumber(_settings._s);
+	_highscore_text.setNumber(_settings._h);
+	std::stringstream ss;
+	int asfioahsfuio;
+	if(int(_settings._t.asSeconds() / 60) < 10)
+		ss << 0;
+	ss << int(_settings._t.asSeconds() / 60.f);
+	if(int(_settings._t.asSeconds()) % 60 < 10)
+		ss << 0;
+	ss << int(_settings._t.asSeconds()) % 60;
+	ss >> asfioahsfuio;
+	_time_text.setNumber(asfioahsfuio);
+	_energy_text.setNumber((int)_settings._e);
+
+	if(_settings.state == 1) {
+
+	}
+
+	if(_settings.state == 2) {
+		if(_settings._e < 100.f) {
+			_settings._e += delta * 3.f;
+			bool jedifound = false;
+			for(unsigned i = 0; i < jedi.size(); ++i) {
+				if(jedi[i].intersects(IntRect(_player.getGlobalBounds()))) {
+					jedifound = true;
+					break;
+				}
+			}
+			if(jedifound) {
+				if(jediClock.getElapsedTime().asSeconds() > 1.f) {
+					_settings._e += delta * 17.f;
+				}
+			}
+			else {
+				jediClock.restart();
+			}
+
+		}
+		_settings._t -= seconds(delta);
+		if(!timegranted && _player.getPosition().x > 70.f * 16.f) {
+			timegranted = true;
+			_settings._t = sf::seconds(120);
+			g->reachedEast = true;
+		}
+
+		for(unsigned i = 0; i < gg.size(); ++i) {
+			gg[i].move(delta * 256.f * gg[i].getScale().x, 0.f);
+			_settings.gz.push_back(IntRect(gg[i].getPosition().x - gg[i].getOrigin().x,
+						 gg[i].getPosition().y - gg[i].getOrigin().x,
+							 gg[i].getTextureRect().width,
+							 gg[i].getTextureRect().height));
+		}
+
+		for(unsigned i = 0; i < _corrupted.size(); ++i) {
+			_corrupted[i].loop(delta);
+		}
+
+		if(_corrupted[0].dead) {
+			_settings._s += 900;
+			_settings._s += _settings._t.asSeconds() * 10;
+			_settings.state = 5;
+			splashtx.loadFromFile("data/gaemover.png");
+			splash.setTexture(splashtx);
+		}
+
+		for(unsigned i = 1; i < _corrupted.size(); ++i) {
+			if(_corrupted[i].dead) {
+				_corrupted.erase(_corrupted.begin() + i);
+				i--;
+			}
+		}
+
+		for(unsigned i = 0; i < _corrupted.size(); ++i) {
+			if(!_corrupted[i].ready) {
+				continue;
+			}
+				_settings.hz.push_back(IntRect(_corrupted[i].getPosition().x - _corrupted[i].getOrigin().x,
+								 _corrupted[i].getPosition().y - _corrupted[i].getOrigin().x,
+								 _corrupted[i].getTextureRect().width,
+								 _corrupted[i].getTextureRect().height));
+		}
+
+		for(unsigned i = 0; i < keb.size(); ++i) {
+			keb[i].loop(delta);
+		}
+
+		for(unsigned i = 0; i < keb.size(); ++i) {
+			if(keb[i].dead) {
+				keb.erase(keb.begin() + i);
+			}
+		}
+
+		for(unsigned i = 0; i < keb.size(); ++i) {
+				_settings.hz.push_back(IntRect(keb[i].getPosition().x + keb[i].keb.getGlobalBounds().left,
+								 keb[i].getPosition().y + keb[i].spr.getGlobalBounds().top + 8.f,
+								 keb[i].keb.getTextureRect().width,
+								 keb[i].keb.getTextureRect().height + 16.f));
+				_settings.hz.push_back(IntRect(keb[i].getPosition().x + keb[i].spr.getGlobalBounds().left,
+				 				keb[i].getPosition().y + keb[i].spr.getGlobalBounds().top + 8.f,
+				 				 keb[i].spr.getTextureRect().width,
+				 				 keb[i].spr.getTextureRect().height));
+
+		}
+		//debug2.setPosition(_player.getPosition().x - 8.f * _player.getScale().x, _player.getPosition().y);
+
+		if(_player.getPosition().x < 64 * 16) {
+			if(_corr_clock.getElapsedTime().asSeconds() > 2.f && !_player.isJumping() && _corrupted.size() < 6) {
+				_corr_clock.restart();
+				_corrupted.emplace_back(&_settings);
+				bool bad = true;
+				while(bad) {
+					bad = true;
+					_corrupted.back().setPosition(_player.getPosition().x - 32.f + rand() % 64, _player.getPosition().y + 24.f + 16.f * (rand() % 2));
+					for(unsigned i = 0; i < _settings.cp.size(); ++i) {
+						if(((_corrupted.back().getPosition().x >= _settings.cp[i].left + 4.f
+							&& _corrupted.back().getPosition().x <= _settings.cp[i].left - 4.f + _settings.cp[i].width)
+						||
+							(_corrupted.back().getPosition().x - 8.f >= _settings.cp[i].left + 4.f
+							&& _corrupted.back().getPosition().x - 8.f <= _settings.cp[i].left - 4.f + _settings.cp[i].width))
+
+						&& _corrupted.back().getPosition().y - 24.f >= _settings.cp[i].top
+						&& _corrupted.back().getPosition().y - 24.f <= _settings.cp[i].top + _settings.cp[i].height) {
+							bad = false;
+							break;
+						}
+					}
+					if(_corrupted.back().getPosition().x >= _player.getPosition().x - 16.f && _corrupted.back().getPosition().x <= _player.getPosition().x + 16.f)
+						bad = true;
+					for(unsigned i = 0; i < _settings.cb.size() && !bad; ++i) {
+						if(_corrupted.back().getPosition().x + 12.f > _settings.cb[i].left
+						&& _corrupted.back().getPosition().x + 12.f < _settings.cb[i].left + _settings.cb[i].width
+						&& _corrupted.back().getPosition().y - 24.f - 8.f > _settings.cb[i].top
+						&& _corrupted.back().getPosition().y - 24.f - 8.f < _settings.cb[i].top + _settings.cb[i].height) {
+							bad = true;
+							break;
+						}
+					}
+				}
+			}
+		}
+		if(_player.getPosition().x > 90 * 16 && !_player.isJumping()) {
+			if(_corr_clock.getElapsedTime().asSeconds() > 2.f && keb.size() < 6) {
+				_corr_clock.restart();
+				keb.emplace_back(&_settings);
+				keb.back().setPosition(_player.getPosition().x - 128.f + rand() % 256, _player.getPosition().y - 32.f - ((rand() % 2) * 16.f));
+				keb.back().keb.setColor(Color(255, 255, 255, 0));
+			}
+		}
+	}
+
+	for(unsigned i = 0; i < gg.size(); ++i) {
+		if(_settings.gz[i].width == 0 || _settings.gz[i].left > _view.getCenter().x + _view.getSize().x / 2.f || _settings.gz[i].left + _settings.gz[i].width < _view.getCenter().x - _view.getSize().x / 2.f) {
+			gg.erase(gg.begin() + i);
+			break;
+		}
+	}
+	static float waiting = 0.f;
+	if(_player.dead || _settings._t.asSeconds() < 0.5f) {
+		if(waiting < 1.f) {
+			if(_lives == 0) {
+				_settings.state = 4;
+				splashtx.loadFromFile("data/gaemover2.png");
+				splash.setTexture(splashtx);
+				waiting += 1.f;
+			}
+			else waiting += 3.f;
+		}
+		waiting += delta;
+		if(waiting > 4.f) {
+			waiting = 0.f;
+			--_lives;
+			g->lives--;
+			g->score = _settings._s;
+			_settings.running = false;
+			/*_player.setPosition(16 * 9, 224);
+			_head.setTextureRect(IntRect(0, 0, _head_tx.getSize().x * _lives, _head_tx.getSize().y));
+			if(_lives <= -1) {
+				_settings.state = 4;
+				splashtx.loadFromFile("data/gaemover2.png");
+				splash.setTexture(splashtx);
+			}
+			_view.setCenter(_player.getPosition().x, _player.getPosition().y - 80.f);
+			_background.setPosition(_player.getPosition().x, _player.getPosition().y - 80.f);
+			_evm.setPosition(_player.getPosition().x + 32.f, _player.getPosition().y - 128.f);
+			_fog.setPosition(_player.getPosition().x, _player.getPosition().y - 80.f);
+
+			_player.dead = false;
+			_player.armored = true;
+			_player.iframed = true;
+			_player.iframeclock.restart();*/
+		}
+	}
+}
+
+void Core::render()
+{
+	g->window.setView(_view);
+	g->window.draw(_background);
+	g->window.draw(_evm);
+	for(unsigned i = 1; i < LAYERCOUNT; ++i) {
+    	g->window.draw(_layer[i]);
+	}
+	g->window.draw(_p1);
+	g->window.draw(_p2);
+	g->window.draw(_p3);
+	for(unsigned i = 0; i < _corrupted.size(); ++i) {
+		g->window.draw(_corrupted[i]);
+	}
+	for(unsigned i = 0; i < keb.size(); ++i) {
+		g->window.draw(keb[i]);
+	}
+	g->window.draw(_layer[0]);
+	if(_settings.state == 2)
+		g->window.draw(_player);
+	if(_settings.state == 0 && _s1c.getElapsedTime().asSeconds() < 4.f)
+		g->window.draw(_trixie);
+	for(unsigned i = 0; i < gg.size(); ++i) {
+		g->window.draw(gg[i]);
+	}
+	g->window.draw(_fog);
+	g->window.draw(debug);
+	g->window.draw(debug2);
+	g->window.setView(g->window.getDefaultView());
+
+	g->window.draw(_hud_time);
+	g->window.draw(_hud_highscore);
+	g->window.draw(_hud_energy);
+	g->window.draw(_highscore_text);
+	g->window.draw(_time_text);
+	g->window.draw(_energy_text);
+	if(_settings.state == 2) {
+		g->window.draw(_head);
+		g->window.draw(_frame);
+	}
+	if(_settings.state == 0 || _settings.state > 2) {
+		g->window.draw(splash);
+	}
+	g->window.draw(_hud_score);
+	g->window.draw(_score_text);
+	g->window.display();
+}

src/Corrupted.cpp

@@ -0,0 +1,132 @@
+#include "Player.hpp"
+#include "Echo.hpp"
+#include "Shared.hpp"
+
+Texture Corrupted::_tex;
+
+Corrupted::Corrupted(Shared* context)
+{
+	_context = context;
+	setOrigin(16.f, 25.f);
+	if(_tex.getSize().x == 0)
+		_tex.loadFromFile("data/corrupted.png");
+	setTexture(_tex);
+	_direction = rand() % 2;
+	out = 24.f;
+	in = 0.f;
+	height = 0.f;
+	dead = false;
+	lifespan = rand() % 10000 + 5000;
+	setTextureRect(IntRect(0, 0,
+					_tex.getSize().x / 166, _tex.getSize().y));
+	speed = 72.f;
+	hp = 1;
+	ready = false;
+}
+
+Corrupted::~Corrupted()
+{
+
+}
+
+void Corrupted::loop(float delta)
+{
+	xd += delta;
+	if(xd >= 0.5f) {
+		xd = 0.f;
+		if(!(rand() % 4))
+			_direction = !_direction;
+	}
+
+	for(unsigned i = 0; i < _context->gz.size(); ++i) {
+		if(getPosition().x >= _context->gz[i].left && getPosition().x <= _context->gz[i].left + _context->gz[i].width &&
+		   getPosition().y >= _context->gz[i].top && getPosition().y <= _context->gz[i].top + _context->gz[i].height) {
+			   --hp;
+			   if(hp <= 0)
+			   		dead = true;
+			   _context->gz[i].width = 0;
+			   _context->_s += 100;
+			   return;
+		}
+		if(getPosition().x - 8.f * getScale().x >= _context->gz[i].left && getPosition().x - 8.f * getScale().x <= _context->gz[i].left + _context->gz[i].width &&
+		   getPosition().y >= _context->gz[i].top && getPosition().y <= _context->gz[i].top + _context->gz[i].height) {
+			   --hp;
+			   if(hp <= 0)
+			   		dead = true;
+			   _context->gz[i].width = 0;
+			   _context->_s += 100;
+			   return;
+		}
+	}
+
+
+
+	if(height == 0.f) {
+		height = getPosition().y - out;
+	}
+	if(out != 0.f) {
+		float tmp = delta * -24.f;
+		out += tmp;
+		if(out < 0.f) {
+			out = 0.f;
+			setPosition(getPosition().x, height);
+			ready = true;
+		}
+		else
+			move(0.f, tmp);
+	}
+	else if(in != 0.f) {
+		float tmp = delta * 24.f;
+		in -= tmp;
+		if(in < 0.f) {
+			in = 0.f;
+			dead = true;
+		}
+		else
+			move(0.f, tmp);
+	}
+	else {
+		if(_anclock.getElapsedTime().asMilliseconds() > lifespan) {
+			in = 24.f;
+		}
+		bool k = false;
+		for(unsigned i = 0; i < _context->cp.size(); ++i) {
+			if((((getPosition().x >= _context->cp[i].left + 4.f && getPosition().x <= _context->cp[i].left - 4.f + _context->cp[i].width) ||
+			   (getPosition().x - 8.f >= _context->cp[i].left && getPosition().x - 8.f <= _context->cp[i].left + _context->cp[i].width)) &&
+			   getPosition().y >= _context->cp[i].top && getPosition().y <= _context->cp[i].top + _context->cp[i].height)) {
+				   k = true;
+			}
+		}
+		if(!k) {
+			_direction = !_direction;
+		}
+
+		if(_direction) {
+			move(delta * speed, 0.f);
+			setScale(1.f, 1.f);
+			for(unsigned i = 0; i < _context->cb.size(); ++i) {
+				if(getPosition().x + 12.f > _context->cb[i].left && getPosition().x + 12.f < _context->cb[i].left + _context->cb[i].width &&
+				   getPosition().y - 8.f > _context->cb[i].top && getPosition().y - 8.f < _context->cb[i].top + _context->cb[i].height) {
+					_direction = !_direction;
+					break;
+				}
+			}
+		}
+		else {
+			move(delta * -speed, 0.f);
+			setScale(-1.f, 1.f);
+			for(unsigned i = 0; i < _context->cb.size(); ++i) {
+				if(getPosition().x - 12.f > _context->cb[i].left && getPosition().x - 12.f < _context->cb[i].left + _context->cb[i].width &&
+				   getPosition().y - 8.f > _context->cb[i].top && getPosition().y - 8.f < _context->cb[i].top + _context->cb[i].height) {
+					_direction = !_direction;
+					break;
+				}
+			}
+		}
+
+		unsigned elapsed = _anclock.getElapsedTime().asMilliseconds() % 500;
+		unsigned frame = (elapsed * 166) / 500;
+		setTextureRect(IntRect(_tex.getSize().x * frame / 166, 0,
+						_tex.getSize().x / 166, _tex.getSize().y));
+	}
+}

src/Echo.cpp

@@ -0,0 +1,18 @@
+#include "Echo.hpp"
+
+int Echo::level = 3;
+
+void Echo::setLogLevel(int lv)
+{
+	level = lv;
+}
+
+void loadTexture(sf::Texture& texture, std::string filename)
+{
+	if(texture.loadFromFile(filename)) {
+		Echo(LOAD, "Loaded ", filename);
+	}
+	else {
+		Echo(WARNING, "Unable to load ", filename);
+	}
+}

src/Kebab.cpp

@@ -0,0 +1,112 @@
+#include "Kebab.hpp"
+#include "Echo.hpp"
+#include "Player.hpp"
+
+Texture Kebab::_tex;
+Texture Kebab::_tex2;
+
+Kebab::Kebab(Shared* context)
+{
+	_context = context;
+	if(_tex.getSize().x == 0) {
+		_tex.loadFromFile("data/kebab.png");
+	}
+	if(_tex2.getSize().x == 0) {
+		_tex2.loadFromFile("data/kebab2.png");
+	}
+	keb.setTexture(_tex);
+	spr.setTexture(_tex2);
+	keb.setOrigin(16, 24);
+	spr.setOrigin(16, 24);
+	dead = 0;
+	released = 1;
+	phasing = 0;
+}
+
+Kebab::~Kebab()
+{
+
+}
+
+void Kebab::loop(float delta)
+{
+
+	IntRect b = IntRect(getPosition().x + keb.getGlobalBounds().left,
+					 getPosition().y + keb.getGlobalBounds().top + 24.f,
+					 keb.getTextureRect().width,
+					 keb.getTextureRect().height);
+
+	for(unsigned i = 0; i < _context->gz.size(); ++i)
+	{
+		if(_context->gz[i].intersects(b))
+		{
+			   dead = true;
+			   _context->gz[i].width = 0;
+			   _context->_s += 100;
+			   return;
+		}
+	}
+
+
+	int phaseSpeed = 300;
+	int a = keb.getColor().a;
+	if(!released) {
+		spr.move(delta * 160.f * spr.getScale().x, 0);
+	}
+	if(!phasing) {
+		if(clk.getElapsedTime().asSeconds() > 16.f) {
+			a -= delta * phaseSpeed;
+			if(a <= 0)
+				dead = true;
+			else {
+				keb.setColor(Color(255, 255, 255, a >= 0 ? a : 0));
+			if(released) spr.setColor(Color(255, 255, 255, a >= 0 ? a : 0));
+			}
+		}
+		else if(a < 255) {
+			a += delta * phaseSpeed;
+			keb.setColor(Color(255, 255, 255, a < 255 ? a : 255));
+			if(released) spr.setColor(Color(255, 255, 255, a < 255 ? a : 255));
+		}
+		if(_context->p->getPosition().x + 48.f < getPosition().x) {
+			if(spr.getScale().x == 1.f && rotcd.getElapsedTime().asSeconds() > 2.f) {
+				spr.setScale(-1.f, 1.f);
+				keb.setScale(-1.f, 1.f);
+				rotcd.restart();
+			}
+		}
+		else if(_context->p->getPosition().x - 48.f > getPosition().x) {
+			if(spr.getScale().x == -1.f && rotcd.getElapsedTime().asSeconds() > 2.f) {
+				spr.setScale(1.f, 1.f);
+				keb.setScale(1.f, 1.f);
+				rotcd.restart();
+			}
+		}
+		else if(_context->p->getPosition().y != getPosition().y) {
+			if(phasecd.getElapsedTime().asSeconds() > 4.f)
+				phasing = true;
+		}
+		else {
+			released = false;
+		}
+		move(delta * 120.f * keb.getScale().x, 0.f);
+	}
+	else {
+		phasecd.restart();
+		a -= delta * phaseSpeed;
+		keb.setColor(Color(255, 255, 255, a >= 0 ? a : 0));
+		if(released) spr.setColor(Color(255, 255, 255, a >= 0 ? a : 0));
+		if(a <= 20) {
+			phasing = false;
+			move(0, 16.f);
+		}
+	}
+}
+
+void Kebab::draw(RenderTarget& target, RenderStates states) const
+{
+	states.transform *= getTransform();
+
+	target.draw(spr, states);
+	target.draw(keb, states);
+}

src/NumText.cpp

@@ -0,0 +1,73 @@
+#include "NumText.hpp"
+#include "Echo.hpp"
+#include <cmath>
+
+NumText::NumText()
+{
+	_semicolon = false;
+	_percent = false;
+}
+
+NumText::~NumText()
+{
+
+}
+
+void NumText::setTexture(Texture* texture)
+{
+	_font = texture;
+}
+void NumText::setNumber(unsigned number)
+{
+	_nums.clear();
+	if(!number) {
+		_nums.resize(1);
+		_nums.back().setTexture(*_font);
+		_nums.back().setPosition(0 * 13, 0);
+		_nums.back().setTextureRect(IntRect(0, 0 * 14, 13, 14));
+	}
+	else {
+		int count = std::log10(number) + 1 + _percent + _semicolon;
+		_nums.resize(count);
+		for(int i = 0; i < count; ++i) {
+			_nums[i].setTexture(*_font);
+			_nums[i].setPosition((count - i - 1) * 8, 0);
+			unsigned offset = 0;
+			if(_semicolon && i == 2) {
+				offset = 10;
+			}
+			else if(_percent && i == 0) {
+				offset = 11;
+			}
+			else {
+				offset = number % 10;
+				number /= 10;
+			}
+			if(offset < 11) {
+				_nums[i].setTextureRect(IntRect(0, offset * 14, 8, 7));
+			}
+			else {
+				_nums[i].setTextureRect(IntRect(0, offset * 14, 13, 10));
+				_nums[i].move(0, -1.5f);
+			}
+		}
+	}
+}
+
+void NumText::semicolon()
+{
+	_semicolon = true;
+}
+void NumText::percent()
+{
+	_percent = true;
+}
+
+void NumText::draw(RenderTarget& target, RenderStates states) const
+{
+	states.transform *= getTransform();
+
+	for(unsigned i = 0; i < _nums.size(); ++i) {
+		target.draw(_nums[i], states);
+	}
+}

src/Player.cpp

@@ -0,0 +1,243 @@
+#include "Player.hpp"
+#include "Echo.hpp"
+#include "Animation.hpp"
+#include "Shared.hpp"
+
+Player::Player(Shared* context)
+{
+	armored = true;
+	_context = context;
+	dead = false;
+	iframed = false;
+}
+
+Player::~Player()
+{
+
+}
+
+void Player::move(float x, float y)
+{
+	setPosition(getPosition().x + x, getPosition().y + y);
+
+	if(dead) return;
+	// if(getPosition().x < getOrigin().x) {
+		// setPosition(getOrigin().x, getPosition()_settings.cb.emplace_back(53 * 16, 13 * 16, 16, 16);.y);
+	// }
+	if(getPosition().x < 128.f) {
+		x = 0.f;
+	}
+	if(getPosition().y > 0.f) {
+		y = 0.f;
+	}
+	_context->view->move(x, y);
+	_context->evm->move(x * 0.95f, y * 0.95f);
+	_context->bg->move(x, y);
+	_context->fog->move(x, y);
+}
+
+void Player::move(float x)
+{
+	Player::move(x, 0.f);
+}
+
+void Player::loop(float delta)
+{
+	bool right = (Keyboard::isKeyPressed(Keyboard::D) || Keyboard::isKeyPressed(Keyboard::Right)) && !dead;
+	bool left = (Keyboard::isKeyPressed(Keyboard::A) || Keyboard::isKeyPressed(Keyboard::Left)) && !dead;
+	bool jump =_context->jump;
+	static Clock jumpClock;
+
+	if(getPosition().y > 224.f + 32.f) {
+		dead = true;
+	}
+
+	if(armored) {
+		setOrigin(16.f, 29.f);
+	}
+	else {
+		setOrigin(16.f, 25.f);
+	}
+
+	bool bottomCol = false;
+	for(unsigned i = 0; i < _context->cp.size() && !bottomCol; ++i) {
+		if(((getPosition().x >= _context->cp[i].left && getPosition().x <= _context->cp[i].left + _context->cp[i].width) ||
+		   (getPosition().x - 8.f * getScale().x >= _context->cp[i].left && getPosition().x - 8.f * getScale().x <= _context->cp[i].left + _context->cp[i].width)) &&
+		   getPosition().y >= _context->cp[i].top && getPosition().y <= _context->cp[i].top + _context->cp[i].height) {
+			if(_velocity > 0.f && !dead) {
+				move(0, -getPosition().y + _context->cp[i].top);
+			}
+			bottomCol = true;
+		}
+	}
+	for(unsigned i = 0; i < _context->cb.size() && !bottomCol; ++i) {
+		//if(getPosition().x >= _context->cb[i].left + 4.f && getPosition().x <= _context->cb[i].left - 4.f + _context->cb[i].width &&
+		//   getPosition().y >= _context->cb[i].top && getPosition().y <= _context->cb[i].top + _context->cb[i].height) {
+		if(((getPosition().x >= _context->cb[i].left && getPosition().x <= _context->cb[i].left + _context->cb[i].width) ||
+		   (getPosition().x - 8.f * getScale().x >= _context->cb[i].left && getPosition().x - 8.f * getScale().x <= _context->cb[i].left + _context->cb[i].width)) &&
+		   getPosition().y >= _context->cb[i].top && getPosition().y <= _context->cb[i].top + _context->cb[i].height) {
+			if(_velocity > 0.f && !dead) {
+				move(0, -getPosition().y + _context->cb[i].top);
+			}
+			bottomCol = true;
+		}
+	}
+	if(dead) {
+		bottomCol = false;
+	}
+	if(iframeclock.getElapsedTime().asSeconds() > 4.f) {
+		setColor(Color::White);
+		iframed = false;
+	}
+	else {
+		setColor(Color(255, 255, 255, rand() % 155 + 100));
+	}
+	for(unsigned i = 0; i < _context->hz.size(); ++i) {
+		if(iframed) {
+			break;
+		}
+		if(getPosition().x >= _context->hz[i].left && getPosition().x <= _context->hz[i].left + _context->hz[i].width &&
+		   getPosition().y >= _context->hz[i].top && getPosition().y <= _context->hz[i].top + _context->hz[i].height) {
+			   ///front!
+			   if(armored) {
+				   _jumping = true;
+				   _velocity = -192.f;
+				   _jumpDirection = getScale().x * -1.f;
+				   armored = false;
+				   setAnimation("jump", armored);
+				   iframeclock.restart();
+				   iframed = true;
+		   	   }
+			   else {
+				   dead = true;
+				   _velocity = 192.f;
+			   }
+			   break;
+		}
+		if(getPosition().x - 8.f * getScale().x >= _context->hz[i].left && getPosition().x - 8.f * getScale().x <= _context->hz[i].left + _context->hz[i].width &&
+		   getPosition().y >= _context->hz[i].top && getPosition().y <= _context->hz[i].top + _context->hz[i].height) {
+			   ///back!
+			   if(armored) {
+				   armored = false;
+				   _jumping = true;
+				  _velocity = -192.f;
+				  _jumpDirection = getScale().x;
+				  setScale(getScale().x * -1.f, 1.f);
+				   setAnimation("jump", armored);
+				   iframeclock.restart();
+				   iframed = true;
+		   	   }
+			   else {
+				   dead = true;
+				   _velocity = 192.f;
+			   }
+		}
+	}
+
+	if(_jumping) {
+		if(jumpClock.getElapsedTime().asSeconds() > 0.1f) {
+			move(delta * 85.f * _jumpDirection, delta * _velocity);
+			if(_velocity < 0.f) {
+				_velocity -= delta * (_velocity - 900.f);
+			}
+			else {
+				_velocity += delta * (_velocity + 450.f);
+			}
+			if(_velocity > 0.f && bottomCol) {
+				_jumping = false;
+				setAnimation("idle", armored);
+			}
+		}
+		if(left && !right) {
+			setScale(-1.f, 1.f);
+		}
+		else if(!left && right) {
+			setScale(1.f, 1.f);
+		}
+	}
+	else {
+		if(left && !right) {
+			float speed = -85.f;
+			for(unsigned i = 0; i < _context->cb.size(); ++i) {
+				if(getPosition().x - getOrigin().x + 12.f > _context->cb[i].left && getPosition().x - getOrigin().x + 12.f < _context->cb[i].left + _context->cb[i].width &&
+				   getPosition().y - 8.f > _context->cb[i].top && getPosition().y - 8.f < _context->cb[i].top + _context->cb[i].height) {
+					move(-getPosition().x + _context->cb[i].left + _context->cb[i].width + getOrigin().x - 12.f, 0);
+					speed = 0.f;
+					break;
+				}
+			}
+			move(delta * speed, 0.f);
+			setScale(-1.f, 1.f);
+			setAnimation("walk", armored);
+		}
+		else if(right && !left) {
+			float speed = 85.f;
+			for(unsigned i = 0; i < _context->cb.size(); ++i) {
+				if(getPosition().x + getOrigin().x - 12.f > _context->cb[i].left && getPosition().x + getOrigin().x - 12.f < _context->cb[i].left + _context->cb[i].width &&
+				   getPosition().y - 8.f > _context->cb[i].top && getPosition().y - 8.f < _context->cb[i].top + _context->cb[i].height) {
+					move(-getPosition().x + _context->cb[i].left - getOrigin().x + 12.f, 0);
+					speed = 0.f;
+					break;
+				}
+			}
+			move(delta * speed, 0.f);
+			setScale(1.f, 1.f);
+			setAnimation("walk", armored);
+		}
+		else if(_current->name == "walk") {
+			setAnimation("idle", armored);
+		}
+		if(jump && bottomCol) {
+			bool rekt = false;
+			for(unsigned i = 0; i < _context->tpa.size(); ++i) {
+				if(_context->tpa[i].x * 16.f + 16.f >= getPosition().x && _context->tpa[i].x * 16.f <= getPosition().x
+			     && _context->tpa[i].y * 16.f + 16.f >= getPosition().y && _context->tpa[i].y * 16.f <= getPosition().y) {
+					rekt = true;
+					setAnimation("forward", armored);
+					move(16.f * (_context->tpb[i].x - _context->tpa[i].x), 16.f * (_context->tpb[i].y - _context->tpa[i].y));
+					break;
+				}
+			}
+			if(!rekt) {
+				_jumping = true;
+				_velocity = -256.f;
+				_jumpDirection = right - left;
+				jumpClock.restart();
+				setAnimation("jump", armored);
+			}
+		}
+		if(!bottomCol) {
+			_jumping = true;
+			_velocity = 384.f;
+			_jumpDirection = 0;
+			setAnimation("longidle", armored);
+		}
+	}
+
+	animate();
+}
+
+void Player::animate()
+{
+	if(_current == nullptr) {
+		return;
+	}
+	const unsigned duration = _current->duration;
+ 	unsigned elapsed = _anclock.getElapsedTime().asMilliseconds() % duration;
+	unsigned frame = (elapsed * _current->count) / duration;
+	setTextureRect(IntRect(_current->tex.getSize().x * frame / _current->count, 0,
+						_current->tex.getSize().x / _current->count, _current->tex.getSize().y));
+
+	if(!_current->loop) {
+		if(elapsed + _current->duration <= _anclock.getElapsedTime().asMilliseconds()) {
+			if(!_jumping) {
+				setAnimation("idle", armored);
+			}
+			else {
+				//setAnimation("jump");
+				setTextureRect(IntRect(_current->tex.getSize().x - _current->tex.getSize().x / _current->count, 0,
+									_current->tex.getSize().x / _current->count, _current->tex.getSize().y));
+			}
+		}
+	}
+}

src/Portal.cpp

@@ -0,0 +1,37 @@
+#include "Portal.hpp"
+#include "Echo.hpp"
+#include "Shared.hpp"
+
+Texture Portal::_blue_tex;
+Texture Portal::_orange_tex;
+
+void Portal::create(Shared* context, Vector2i src, Vector2i dest)
+{
+	if(_blue_tex.getSize().x == 0) {
+		 _blue_tex.loadFromFile("data/blueportal.png");
+	}
+	_blue.setTexture(_blue_tex);
+	_blue.setTextureRect(IntRect(0, 0, 16, 32));
+	_blue.setPosition(src.x * 16, src.y * 16 - 16);
+	context->tpa.push_back(src);
+
+	if(_orange_tex.getSize().x == 0) {
+		_orange_tex.loadFromFile("data/orangeportal.png");
+   }
+   _orange.setTexture(_orange_tex);
+   _orange.setTextureRect(IntRect(0, 0, 16, 32));
+   _orange.setPosition(dest.x * 16, dest.y * 16 - 16);
+   context->tpb.push_back(dest);
+}
+void Portal::animate()
+{
+	if(_clock.getElapsedTime().asSeconds() > 0.5f) {
+		_blue.setTextureRect(IntRect((_blue.getTextureRect().left + 16) % 64, 0, 16, 32));
+		_orange.setTextureRect(IntRect((_blue.getTextureRect().left + 16) % 64, 0, 16, 32));
+		_clock.restart();
+	}
+}
+void Portal::draw(RenderTarget& target, RenderStates states) const {
+	target.draw(_blue, states);
+	target.draw(_orange, states);
+}

src/main.cpp

@@ -0,0 +1,39 @@
+#include <SFML/Graphics.hpp>
+
+#include "Core.hpp"
+#include "Echo.hpp"
+
+using namespace sf;
+
+int main()
+{
+	srand(time(nullptr));
+	Global g;
+	g.music.openFromFile("data/music.ogg");
+	g.music.setLoop(true);
+	g.music.play();
+	g.window.create(VideoMode(256, 224),
+	"Zombies 'n Kebabs", Style::Default,
+	ContextSettings(0, 0, 0, 2, 0));
+	g.window.setFramerateLimit(240);
+	g.window.setSize({1024, 896});
+	g.window.setKeyRepeatEnabled(false);
+	g.restart = true;
+	g.lives = 2;
+	g.score = 0;
+	g.high = 0;
+	g.reachedEast = false;
+	while(g.restart) {
+		g.restart = true;
+		Core core(&g);
+		core.run();
+		if(g.lives < 0) {
+			if(g.score > g.high)
+				g.high = g.score;
+			g.score = 0;
+			g.lives = 2;
+			g.reachedEast = false;
+		}
+	}
+    return 0;
+}