Skip to content
Browse files

jCoverflip 1.1.0

  • Loading branch information...
0 parents commit ae92b1ac193140e336e180fa0bec80652b3369c2 Seamus Leahy committed
622 LICENSE.txt
@@ -0,0 +1,622 @@
+ 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
+
28 README.markdown
@@ -0,0 +1,28 @@
+# jCoverflip
+
+Present your featured content elegantly.
+
+http://www.jcoverflip.com/
+
+## Documentation
+
+http://www.jcoverflip.com/documentation
+
+
+## License
+
+Copyright New Signature 2010 - 2011
+
+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/>.
+
+You can contact New Signature by electronic mail at labs@newsignature.com
+or- by U.S. Postal Service at 1100 H St. NW, Suite 940, Washington, DC 20005.
62 include/.svn/entries
@@ -0,0 +1,62 @@
+10
+
+dir
+17317
+svn://svn.newsig.com/newsig/labs/jCoverflip/tags/1.1.0/include
+svn://svn.newsig.com/newsig
+
+
+
+2011-01-05T14:13:26.034203Z
+16923
+sleahy
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+1cbaf7ca-7d55-409f-9623-c90ebb489a2d
+
+jquery-1.3.2.js
+file
+
+
+
+
+2011-01-26T20:39:29.501145Z
+7b7ece4224616a0eb48bf16057e15e77
+2010-03-29T21:20:36.334987Z
+11804
+sleahy
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+120763
+
4,376 include/.svn/text-base/jquery-1.3.2.js.svn-base
4,376 additions, 0 deletions not shown because the diff is too large. Please use a local Git client to view these changes.
4,376 include/jquery-1.3.2.js
4,376 additions, 0 deletions not shown because the diff is too large. Please use a local Git client to view these changes.
1,464 jquery.jcoverflip.js
@@ -0,0 +1,1464 @@
+/*
+ * jCoverflip - Present your featured content elegantly.
+ * Version: 1.1.0
+ * Copyright 2010 New Signature
+ *
+ * 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/>.
+ *
+ * You can contact New Signature by electronic mail at labs@newsignature.com
+ * or- by U.S. Postal Service at 1100 H St. NW, Suite 940, Washington, DC 20005.
+ */
+( function( $ ){
+//
+// Helpers
+//
+var undefined; // safeguards against anyone who wants to change the value of undefined in the global space
+
+var nofn = function(){};
+
+var proxy = function( context, fn ){
+ return function( ){
+ if( $.isFunction( fn ) ){
+ return fn.apply( context, arguments );
+ } else {
+ return context[ fn ].apply( context, arguments );
+ }
+ };
+ };
+
+
+
+/**
+ * Get an array of keys for an object
+ */
+var objectKeys = function( obj ){
+ var r = [];
+
+ for( var k in obj ){
+ r.push(k);
+ }
+
+ return r;
+};
+
+
+
+
+/**
+ * jQuery Plugin Factory
+ *
+ * A simple framework for creating jQuery plugins that have several 'methods'.
+ * The result will be a plugin that you can initialize like this:
+ * $('#foo').myplugin(param1, param2).show();
+ *
+ * Then you can call methods 'toggle' and 'bar' with you plugin like this:
+ * $('#foo').myplugin('toggle', param1).myplugin('bar', param1, parma2).fadeIn();
+ *
+ * The methods can alos act as getters and return values:
+ * var v = $('#foo').myplugin('current');
+ *
+ * 1) Most of the work is in creating the methods which is just an object of functions.
+ * 2) Any function name that starts with an underscore will not be exposed to the public.
+ * 3) When the plugin initializes, it will call the method named '_init'.
+ * 4) The 'this' object is for the each instance of the plugin.
+ * 5) To get the element that the plugin is for, use this.element to get it.
+ *
+ * @param $ - the jQuery instance to add the plugin to
+ * @param name - the name to call the plugin with
+ * @param methods - an object of functions to add as methods
+ * Any method name that starts with an underscore will be private, it will not be exposed.
+ * The method named '_init' will be called when initializing.
+ * @param getters - an array of methods that return values
+ */
+function jQueryPluginFactory( $, name, methods, getters ){
+ getters = getters instanceof Array ? getters : [];
+ var getters_obj = {};
+ for(var i=0; i<getters.length; i++){
+ getters_obj[getters[i]] = true;
+ }
+
+
+ // Create the object
+ var Plugin = function(element){
+ this.element = element;
+ };
+ Plugin.prototype = methods;
+
+ // Assign the plugin
+ $.fn[name] = function(){
+ var args = arguments;
+ var returnValue = this;
+
+ this.each(function() {
+ var $this = $(this);
+ var plugin = $this.data('plugin-'+name);
+ // Init the plugin if first time
+ if( !plugin ){
+ plugin = new Plugin($this);
+ $this.data('plugin-'+name, plugin);
+ if(plugin._init){
+ plugin._init.apply(plugin, args);
+ }
+
+ // call a method
+ } else if(typeof args[0] == 'string' && args[0].charAt(0) != '_' && typeof plugin[args[0]] == 'function'){
+ var methodArgs = Array.prototype.slice.call(args, 1);
+ var r = plugin[args[0]].apply(plugin, methodArgs);
+ // set the return value if method is a getter
+ if( args[0] in getters_obj ){
+ returnValue = r;
+ }
+ }
+
+ });
+
+ return returnValue; // returning the jQuery object
+ };
+};
+
+
+
+
+
+//
+// Animation queue
+//
+animationqueue = { };
+
+/**
+ * Animation Queue
+ *
+ * The AnimationQueue holds list of AnimationSets that each perform a set of animations. The sets
+ * run in ordering when the AnimationQueue is animating. As well, the running time is distributed
+ * across all the sets when the AnimationQueue is animating.
+ *
+ * As well, the AnimationQueue can be stopped and started again at any time. AnimationSets can be
+ * removed when stopped when they are not needed anymore.
+ *
+ */
+animationqueue.AnimationQueue = function(){
+ this.sets = [];
+
+ this.isRunning = false;
+ this.current = 0;
+
+ this.totalTime = 0;
+ this.elapsedTime = 0;
+ this.startTime = 1;
+ this.poll = null;
+};
+
+animationqueue.AnimationQueue.prototype = {
+ /**
+ * Add an AnimationSet to the end of the queue.
+ *
+ * @param animationSet
+ * The AnimationSet object to add to the end of the queue.
+ */
+ queue: function( animationSet ){
+ this.sets.push( animationSet );
+ },
+
+ /**
+ * Start the animation.
+ *
+ * @param time
+ * The total running time of the animation in milliseconds.
+ */
+ start: function( time, callback ){
+ this.totalTime = time;
+ this.elapsedTime = 0;
+ this.isRunning = true;
+
+ callback = $.isFunction( callback )? callback : nofn;
+
+ // calculate the how to divide the time between the sets
+ // Each set gets 1 part of the time except for the first which can get less if "paused."
+ var timeShare = 1; // total number of parts to divide the time by
+ var firstTimeShare = 1; // the part for the first item
+ if( this.sets.length > 0 ){
+ timeShare = this.sets.length;
+ firstTimeShare = this.sets[ 0 ].totalTime > 0? Math.max( 0, Math.min( 1, 1-(this.sets[ 0 ].elapsedTime / this.sets[ 0 ].totalTime) ) ): 1;
+ //timeShare += firstTimeShare;
+ }
+ var startTime = (new Date( )).getTime( );
+
+ if( this.sets.length > 0 ){
+ this.sets[ 0 ].start( firstTimeShare/timeShare*this.totalTime );
+ }
+
+
+ (function( self, totalTime, timeShare ){
+ function poll( ){
+ self.elapsedTime = (new Date( )).getTime( ) - startTime;
+
+ if( self.sets.length && !self.sets[ 0 ].isRunning ){
+ self.sets.shift( );
+ if( self.sets.length ){
+ self.sets[ 0 ].start( totalTime/timeShare );
+ }
+ }
+
+ if( self.elapsedTime >= self.totalTime && self.sets.length == 0 ){
+ callback( self.elapsedTime );
+ self.stop( );
+ }
+ }
+ self.poll = setInterval( poll, 16 );
+ } )( this, this.totalTime, timeShare );
+ },
+
+ /**
+ * Stop the animation.
+ */
+ stop: function( ){
+ if( this.isRunning ){
+ this.isRunning = false;
+
+ var i = this.sets.length;
+ while( i-- ){
+ this.sets[ i ].stop( );
+ }
+
+ clearInterval( this.poll );
+ }
+ },
+
+ /**
+ * Remove an AnimationSet from the queue.
+ *
+ * @param animationSet
+ * The AnimationSet to remove from the queue.
+ */
+ remove: function( animationSet ){
+ var i = this.sets.length;
+ while( i-- ){
+ if( this.sets[ i ] == animationSet ){
+ var newSets = this.sets.slice( 0, i );
+ this.animationSet = newSets.push( this.sets.slice( i + 1 ) );
+ }
+ }
+ },
+
+ /**
+ * Get an array of all the AnimationSets in order. The array is not live, but the AnimationSets are.
+ *
+ * @return array of AnimationSets
+ */
+ get: function( ){
+ return this.sets.slice( 0 ); // .slice is to clone the array but not the objects
+ }
+};
+
+
+
+/**
+ *
+ *
+ *
+ */
+animationqueue.AnimationSet = function(){
+ this.steps = [ ];
+ this.isStepsSorted = true;
+ this.currentStep = -1;
+ this.animations = [ ];
+
+ this.isRunning = false;
+ this.totalTime = 0;
+ this.elapsedTime = 0;
+
+ this.poll = null;
+
+ this.data = { };
+};
+
+animationqueue.AnimationSet.prototype = {
+ /**
+ * Add an AnimationStep or Animation for this set.
+ *
+ * @param anim
+ * The AnimationStep or Animation to add.
+ */
+ add: function( anim ){
+ if( anim instanceof animationqueue.AnimationStep ){
+ this.steps.push( anim );
+ this.isStepsSorted = false;
+ ++this.currentStep;
+
+ } else if( anim instanceof animationqueue.Animation ){
+ this.animations.push( anim );
+ }
+ },
+
+ /**
+ * Start the set's animation.
+ *
+ * @param time
+ * The total running time of the animation.
+ */
+ start: function( time ){
+
+ // Scale the previous elapsedTime to the new time
+ this.elapsedTime = this.totalTime == 0? 0: this.elapsedTime/this.totalTime*time;
+ this.totalTime = time;
+
+ // prepare this to run
+ if( !this.isStepsSorted ){
+ // Reverse sort
+ this.steps.sort( function( a, b ){
+ return b.moment - a.moment;
+ } );
+ this.isStepsSorted = true;
+ }
+
+ this.isRunning = true;
+
+ // Start the time up here right before any of the animation starts
+ this.startTime = (new Date()).getTime() - this.elapsedTime;
+ // Start up the animations
+ var i = this.animations.length;
+ while( i-- ){
+ this.animations[ i ].start( this.totalTime );
+ }
+
+ // The polling function: this will run the steps at the right time and
+ // check for when the animations are finished.
+ var self = this;
+ var animationsIndex = this.animations.length-1;
+ function poll( timeSince ){
+ self.elapsedTime = (new Date()).getTime() - self.startTime;
+ // Run any steps that should be run
+ while( self.currentStep >= 0 && self.steps[ self.currentStep ].getTime( self.totalTime ) <= self.elapsedTime ){
+ self.steps[ self.currentStep ].doIt( );
+ --self.currentStep;
+ }
+
+ // Check if all the animations are finished
+ if( self.elapsedTime >= self.totalTime && self.currentStep < 0){
+ while( animationsIndex >= 0 && !self.animations[ animationsIndex ].isRunning ){
+ --animationsIndex;
+ }
+
+ if( animationsIndex < 0 ){
+ // finished
+ self.reset( self.elapsedTime );
+
+ }
+ }
+ }
+
+ this.poll = setInterval( poll, 16 );
+
+ },
+
+ /**
+ * Stop the animation.
+ */
+ stop: function( ){
+ if( this.isRunning ){
+ this.isRunning = false;
+ if( this.poll ){
+ clearInterval( this.poll );
+ }
+ var i = this.animations.length;
+ while( i-- ){
+ this.animations[ i ].stop( );
+ }
+ }
+ },
+ /**
+ * Set meta data for the set.
+ *
+ * @param key
+ * The key for the meta data.
+ *
+ * @param data
+ * The data.
+ */
+ setData: function( key, data ){
+ this.data[ key ] = data;
+ },
+
+ /**
+ * Get meta data for the set.
+ *
+ * @param key
+ * The key used to save the meta data.
+ *
+ * @return The value of the meta data
+ */
+ getData: function( key ){
+ return this.data[ key ];
+ },
+
+ /**
+ * Resets the set to beginning.
+ */
+ reset: function( ){
+ this.stop( );
+ this.elapsedTime = 0;
+ this.currentStep = this.steps.length-1;
+ }
+};
+
+
+
+
+
+
+
+/**
+ * A single step to occur during a set's animation.
+ *
+ * This is useful for handling one off things during a set's animation such
+ * as switch the z-index.
+ *
+ * @param $element
+ * The jQuery object for the element(s) to update their CSS
+ *
+ * @param cssParams
+ * A key/value object of style properties. @see http://docs.jquery.com/CSS/css#properties
+ *
+ * @param moment
+ * A number from 0 to 1 for when as a percentage of the set's running time the
+ * step should happen.
+ */
+animationqueue.AnimationStep = function( $element, cssParams, moment ){
+ this.$element = $element;
+ this.cssParams = cssParams;
+ this.moment = Math.min( 1, Math.max( 0, moment ) );
+};
+
+animationqueue.AnimationStep.prototype = {
+
+ /**
+ * Get the time of execution
+ *
+ * @param totalTime
+ * The total of time for the set this belongs to in milliseconds.
+ *
+ * @return The time in milliseconds this step needs to execute.
+ */
+ getTime: function( totalTime ){
+ return this.moment * totalTime;
+ },
+
+ /**
+ * Does the step action.
+ */
+ doIt: function( ){
+ this.$element.css( this.cssParams );
+ }
+};
+
+
+
+
+/**
+ * A single animation object for a jQuery object.
+ *
+ * @param $element
+ * The jQuery object for the element(s) to animate
+ *
+ * @param animateParams
+ * The object of CSS values to animate. @see http://docs.jquery.com/Effects/animate
+ */
+animationqueue.Animation = function( $element, animateParams ){
+ this.$element = $element;
+ this.animateParams = $.isArray(animateParams) ? animateParams : [ animateParams ];
+ this.isRunning = false;
+};
+
+animationqueue.Animation.prototype = {
+ /**
+ * Start the animation.
+ *
+ * @param time
+ * The running time of the animation (and the step) in milliseconds.
+ */
+ start: function( time ){
+ this.$element.stop( );
+
+ if( time === 0 ){
+ for( var i=0; i<this.animateParams.length; ++i ){
+ this.$element.css( this.animateParams[i] );
+ }
+ self.isRunning = false;
+ } else {
+
+ // calculate the duration of each animation param
+ if( this.animateParams.length > 1 ){
+ var totalDur = 0; // total duration calculated
+ var withoutDur = 0; // the number without a duration set
+ var i=this.animateParams.length;
+ while( i-- != 0 ){
+ var dur = this.animateParams[i].animationDuration;
+ if( !isNaN( dur ) && dur >= 0 ){
+ totalDur += dur;
+ } else {
+ ++withoutDur;
+ delete this.animateParams[i].animationDuration;
+ }
+ }
+ var emptyDurVal = 0;
+ // case for when the total duration is less than 1, and there are animations that can fill in the gap
+ if( withoutDur && totalDur < 1 ){
+ emptyDurVal = (1-totalDur) / withoutDur; // the duration for those without value set
+ totalDur = 1;
+ }
+
+ i=this.animateParams.length;
+ // set the duration for each
+ while( i-- != 0 ){
+ if( !isNaN(this.animateParams[i].animationDuration) ){
+ this.animateParams[i].animationDuration = this.animateParams[i].animationDuration / totalDur;
+ } else {
+ this.animateParams[i].animationDuration = emptyDurVal;
+ }
+ }
+
+ // This is for the likely case that there is only one, to save time
+ } else {
+ this.animateParams[0].animationDuration = 1;
+ }
+
+
+ this.isRunning = true;
+ for( var i=0; i<this.animateParams.length-1; ++i ){
+ this.$element.animate( this.animateParams[i], time*this.animateParams[i].animationDuration );
+ }
+ this.$element.animate( this.animateParams[i], time*this.animateParams[i].animationDuration, proxy( this, function( ){
+ this.isRunning = false;
+ } ) );
+ }
+ },
+
+ /**
+ * Stop the animation.
+ */
+ stop: function( ){
+ this.$element.stop( );
+ this.isRunning = false;
+ }
+};
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+//
+// The widget
+//
+//
+
+
+
+
+
+
+
+
+
+
+
+
+// Static methods
+$.jcoverflip = {
+ /**
+ * Used for wrapping the animation for an element for returned by beforeCss, afterCss and
+ * currentCss options.
+ *
+ * @param element
+ * The jQuery element to run the animation on.
+ *
+ * @param animate
+ * An object with CSS keys and values to animate to.
+ *
+ * @param steps
+ * An object with keys from 0 to 1 (0 to 100%) for how far along in the animation (0: start,
+ * 0.5: half way through, 1: end) with the value being an object of CSS keys and values to change.
+ * This is for discrete values that need to change such as z-index.
+ *
+ */
+ animationElement: function( element, animate, steps ){
+ return { element: element, animate: animate, steps: steps };
+ },
+
+ /**
+ * Find the item element and index number that the element is associated.
+ *
+ * @param element
+ * The element that either is the item element or descendant element of the item element.
+ *
+ * @return
+ * null - if no item element is found
+ * { element: <the item element>, index: <the item index> }
+ *
+ */
+ getItemFromElement: function( element ){
+ element = $( element );
+ var item = element.hasClass( 'ui-jcoverflip--item' )? element : element.parents( '.ui-jcoverflip--item' );
+
+ if( item.size( ) == 0 ){
+ return null;
+ } else {
+ return { element: item, index: item.data( 'jcoverflip__index' ) };
+ }
+ }
+};
+
+
+
+// The widget
+var methods = {
+ _init: function( args ){
+ this.options = $.extend( defaults, args || {} );
+
+ // init some internal values
+ this.animationQueue = new animationqueue.AnimationQueue( );
+ this.isInit = false; // used for setting up the CSS
+
+ // Used to queue up overlapping goTo() calls since they come in async
+ this.goToPoll = { id: null };
+ this.goToQueue = [ ];
+
+
+ // Setup the elements
+ var items = this.items( );
+
+ // add classes
+ this.element.addClass( 'ui-jcoverflip' );
+ items.addClass( 'ui-jcoverflip--item' );
+
+ // Get the title for each item
+ var i = items.size( );
+ while( i-- ){
+ var el = items.eq( i );
+
+ // Tell the item what its index is
+ el.data( 'jcoverflip__index', i );
+
+ // Create the titles for the coverflow items
+ var title = this.options.titles.create( el );
+ title.css( { display: 'none' } ).addClass( 'ui-jcoverflip--title' ).appendTo( this.element );
+
+ el.data( 'jcoverflip__titleElement', title );
+ }
+
+ // Bind the click action for when the user clicks on the item to change the current
+ this.element.click( proxy( this, this._clickItem ) );
+
+ // Setup wrap around
+ if( this.options.wrapItemsAround ){
+ this.options.wrapCenter = this.options.wrapCenter === undefined? this.options.current : this.options.wrapCenter;
+ }
+
+ // setup the positioning of the elements, pass 0 for time, pass true to flag to init
+ this._goTo( this.options.current, 0, true );
+
+ // Add any addition controls (such as a scroll bar)
+ this.options.controls.create( this.element, this.length() );
+ },
+
+
+
+ /**
+ * The click event for an item. If the item is not current,
+ * then it calls the current() and stops the event.
+ */
+ _clickItem: function( event ){
+ if( this.options.disabled == true ){
+ return;
+ }
+
+ var item = $.jcoverflip.getItemFromElement( event.target );
+
+ if( item !== null && item.index != this.current( ) ){
+ this.current( item.index, event );
+ event.preventDefault();
+ return false;
+ }
+ return true;
+ },
+
+
+ /**
+ * Parses the parameters for next and previous methods. Any of the parameters are optional.
+ */
+ _nextAndPrevParameters: function( by, wrapAround, callback, originalEvent ){
+
+
+ // originalEvent is an object
+ if( typeof by == 'object' ){
+ originalEvent = by;
+ } else if( typeof wrapAround == 'object' ){
+ originalEvent = wrapAround;
+ } else if( typeof callback == 'object' ){
+ originalEvent = callback;
+ } else if( typeof originalEvent == 'object' ){
+ originalEvent = originalEvent;
+ } else {
+ originalEvent = { };
+ }
+
+ // callback is a function
+ if( $.isFunction( by ) ){
+ callback = by;
+ } else if( $.isFunction( wrapAround ) ){
+ callback = wrapAround;
+ } else if( $.isFunction( callback ) ){
+ callback = callback;
+ } else {
+ callback = nofn;
+ }
+
+ // wrapAround is boolean
+ if( typeof( by ) == 'boolean' ) {
+ wrapAround = by;
+ } else if( typeof( wrapAround ) == 'boolean' ){
+ wrapAround = wrapAround;
+ } else {
+ wrapAround = true;
+ }
+
+ // by is a number
+ by = isNaN( parseInt( by ) )? 1 : parseInt( by );
+
+ return { by: by, wrapAround: wrapAround, callback: callback, originalEvent: originalEvent };
+ },
+
+
+ /**
+ * Step to the right from the current.
+ *
+ * @param by
+ * (optional) An integer to step to the right by. Defaults to 1.
+ *
+ * @param wrapAround
+ * (optional) A boolean flag to wrap around if moving past the end. Defaults to true.
+ *
+ * @return
+ * New current number
+ */
+ next: function( by, wrapAround, callback, originalEvent ){
+ if( this.options.disabled == true ){
+ return;
+ }
+
+ var params = this._nextAndPrevParameters( by, wrapAround, callback, originalEvent );
+
+ return this._nextAux( params.by, params.wrapAround, params.callback, params.originalEvent, 'next' );
+ },
+
+
+
+ _nextAux: function( by, wrapAround, callback, originalEvent, eventType ){
+ by = by === undefined && isNaN( by ) ? 1 : parseInt( by );
+ wrapAround = wrapAround !== false;
+
+ var current = this.current( );
+ var oldCurrent = current;
+ var length = this.length( );
+
+ if( wrapAround ){
+ current = (current + by) % length;
+ // If "current + by" is negative, then the result of "%" is between -(length-1) and -1.
+ // Add the length, if negative, to bring the index back to a valid number
+ current = current < 0 ? current + length : current;
+ } else {
+ current = Math.min( length-1, Math.max( 0, current + by ) );
+ }
+
+ if( current != this.current( ) ){
+ this.current( current, originalEvent );
+ }
+
+ if( eventType && oldCurrent != current ){
+ var event = $.Event( originalEvent );
+ event.type = this.widgetEventPrefix + eventType;
+ callback.call( this.element, event, { from: oldCurrent, to: current } );
+ this._trigger( eventType, originalEvent, { from: oldCurrent, to: current } );
+ }
+
+ return current;
+ },
+
+
+
+ /**
+ * Step to the left from the current.
+ *
+ * @param by
+ * (optional) An integer to step to the left by. Defaults to 1.
+ *
+ * @param wrapAround
+ * (optional) A boolean flag to wrap around if moving past the end. Defaults to true.
+ *
+ * @return
+ * New current number
+ *
+ */
+ previous: function( by, wrapAround, callback, originalEvent ){
+ if( this.options.disabled == true ){
+ return;
+ }
+
+ var params = this._nextAndPrevParameters( by, wrapAround, callback, originalEvent );
+
+ return this._nextAux( -1*params.by, params.wrapAround, params.callback, params.originalEvent, 'previous' );
+ },
+
+
+
+ /**
+ * Go all the way to the left.
+ */
+ first: function( callback, originalEvent ){
+ if( this.options.disabled == true ){
+ return;
+ }
+
+ if( typeof callback == 'object' ){
+ originalEvent = callback
+ } else if( typeof originalEvent == 'object' ){
+ originalEvent = originalEvent;
+ } else {
+ originalEvent = { };
+ }
+
+ callback = $.isFunction( callback ) ? callback : nofn;
+
+ var from = this.current( );
+ var to = this.current( 0, originalEvent );
+ if( from != to ){
+ var event = $.Event( originalEvent );
+ event.type = this.widgetEventPrefix + 'first';
+ callback.call( this.element, event, { from: from, to: to } );
+ this._trigger( 'first', originalEvent, { from: from, to: to } );
+ }
+ },
+
+
+
+ /**
+ * Go all the way to the right.
+ */
+ last: function( callback, originalEvent ){
+ if( this.options.disabled == true ){
+ return;
+ }
+
+ if( typeof callback == 'object' ){
+ originalEvent = callback
+ } else if( typeof originalEvent == 'object' ){
+ originalEvent = originalEvent;
+ } else {
+ originalEvent = { };
+ }
+
+ callback = $.isFunction( callback ) ? callback : nofn;
+
+ var from = this.current( );
+ var to = this.current( this.length( ) - 1, originalEvent );
+ if( from != to ){
+ var event = $.Event( originalEvent );
+ event.type = this.widgetEventPrefix + 'last';
+ callback.call( this.element, event, { from: from, to: to } );
+ this._trigger( 'last', originalEvent, { from: from, to: to } );
+ }
+ },
+
+
+
+ /**
+ * Gets or sets the current item.
+ *
+ * @param originalEvent (optional)
+ * Pass an event object along to be assigned to the originalEvent for the event object passed
+ * along with the triggered events of start, stop and change.
+ */
+ current: function( newCurrent, originalEvent ){
+
+ if( newCurrent !== undefined && !isNaN( newCurrent ) && !this.options.disabled && newCurrent != this.options.current ){
+ this._goTo( newCurrent, undefined, false, originalEvent );
+ }
+
+ return this.options.current;
+ },
+
+
+
+ destroy: function( ){
+ if( this.options.disabled == true ){
+ return;
+ }
+
+ // let others clean up first
+ this._trigger( 'destroy', {} );
+
+ // container element
+ this.element.removeClass( 'ui-jcoverflip' );
+
+
+ // titles
+ var items = this.items( );
+ var titleEl;
+ var i = items.length;
+ while( i-- ){
+ titleEl = items.eq( i ).data( 'jcoverflip__titleElement' );
+ this.options.titles.destroy( titleEl );
+ }
+
+
+ // items
+ // aggressively remove all inline styles
+ items
+ .removeClass( 'ui-jcoverflip--item' )
+ .find( '*' ).add( items.get( ) )
+ .each( function( ){
+ this.removeAttribute( 'style' );
+
+ } );
+
+
+ // controls
+ this.options.controls.destroy( this.element );
+
+
+ // default action
+ $.widget.prototype.destroy.apply( this, arguments );
+ },
+
+
+ enable: function( ){
+ this.options.disabled = false;
+ this._trigger( 'enable', {} );
+ },
+
+
+ disable: function( ){
+ this.options.disabled = true;
+ this._trigger( 'disable', {} );
+ },
+
+
+ option: function( name, value ){
+
+ // getter
+ if( typeof value == 'undefined' ){
+ return $.widget.prototype.option.apply( this, arguments );
+ }
+
+ // setter
+
+ // current
+ if( name == 'current' ){
+ return this.current( value );
+ }
+
+ // TODO: dynamic changing of the options: items, titles, controls
+ // items, titles, controls
+ if( name in { 'items': '', 'titles': '', 'controls': '' } ){
+ return this.options.items;
+ }
+
+ // beforeCss, afterCss, currentCss
+ if( name in { 'beforeCss': '', 'afterCss': '', 'currentCss': '' } ){
+ this.options[ name ] = value;
+ // force update positioning
+ this._goTo( this.current( ), 0, true );
+ }
+
+ // time
+ if( name == 'time' && isNaN( parseInt( value ) ) && parseInt( value ) < 0 ){
+ return this.options.time;
+ }
+
+ // Default action
+ return $.widget.prototype.option.apply( this, arguments );
+ },
+
+
+
+ /**
+ * Go to a particular coverflow item.
+ *
+ * @param index
+ * The item index.
+ *
+ * @param time
+ * Optional. The time to do the animation to the new item in.
+ *
+ */
+ _goTo: function( index, time, force, originalEvent ){
+ if( this.options.disabled == true ){
+ return;
+ }
+
+ force = !!force;
+ originalEvent = originalEvent == undefined? { } : originalEvent;
+
+ // Get the time to run
+ time = time === undefined? this.options.time: parseInt( time );
+
+ // Setup current and oldCurrent
+ var oldCurrent = this.options.current;
+ var current = Math.floor( Math.max( 0, Math.min( index, this.length( )-1 ) ) );
+ this.options.current = current;
+
+
+ // Start working on the animation queue
+ // 1. Stop the current animation
+ // 2. Remove sets that are moving away from the current item
+ // 3. Add needed sets to move towards the current item
+ // 4. Start the animation queue
+ this.animationQueue.stop( );
+
+ // Clear out any sets that are moving away from the current item
+ var animationSets = this.animationQueue.get( );
+ var i = animationSets.length;
+ while( i-- ){
+ var to = animationSets[ i ].getData( 'to' );
+ var goingToTheRight = animationSets[ i ].getData( 'goingToTheRight' );
+ var rightOfCurrent = to > current;
+ if( rightOfCurrent != goingToTheRight ){
+ this.animationQueue.remove( animationSets[ i ] );
+ }
+ }
+
+ animationSets = this.animationQueue.get( ); // update it since we may have changed the it by removing sets above
+ // How many steps from the old current item to the new current item
+ var stepsToCurrent = animationSets.length > 0? animationSets.pop( ).getData( 'to' ) : oldCurrent;
+ var goingToTheRight = stepsToCurrent < current; // direction of movement
+ stepsToCurrent += goingToTheRight? 1: -1; // advance to the next since we don't need to animate to our current position
+
+
+ // Special case for the first run
+ if( force ){
+ stepsToCurrent = current;
+ }
+
+ var fromOffset = this.getOffset(oldCurrent),
+ lastToOffset = fromOffset,
+ goingRight = fromOffset[ current ] > 0,
+ numberOfSteps = Math.abs(fromOffset[ current ]),
+ items = this.items( ),
+ startFrom = goingRight? current - numberOfSteps : current + numberOfSteps,
+ minOffset = this.options.wrapItemsAround ? -1*this.options.wrapCenter : 1-items.length,
+ maxOffset = this.options.wrapItemsAround ? items.length-1-this.options.wrapCenter : items.length-1;
+
+ // Special case the first time this is created
+ if( force && numberOfSteps==0 ){
+ numberOfSteps = 1;
+ startFrom += goingRight? -1: 1;
+ }
+
+ // The main animation setup loop
+ // Loops for the number of places the items have to move
+ for( var step=1; step <= numberOfSteps; ++step ){
+ var stepIndex = startFrom + (goingRight? step: -1*step);
+ var toOffset = this.getOffset( stepIndex );
+
+ // Create a set
+ var animationSet = new animationqueue.AnimationSet( );
+ this.animationQueue.queue( animationSet );
+ animationSet.setData( 'goingToTheRight', goingRight );
+ animationSet.setData( 'to', stepIndex );
+
+
+ var ii=items.length;
+ while( ii--!=0 ) {
+ var el = items.eq(ii);
+
+ // current
+ if( toOffset[ii]==0 ){
+ var css = this.options.currentCss( el, this.element, step == numberOfSteps );
+
+ // from start to end
+ } else if( lastToOffset[ii]==minOffset && toOffset[ii]==maxOffset ){
+ if( this.options.startToEndCss ){
+ var css = this.options.startToEndCss( el, this.element, toOffset[ii]-1, -1*lastToOffset[ii]-1 );
+ } else {
+ var css = this.options.afterCss( el, this.element, toOffset[ii]-1 );
+ }
+ // from end to start
+ } else if( lastToOffset[ii]==maxOffset && toOffset[ii]==minOffset ){
+ if( this.options.endToStartCss ){
+ var css = this.options.endToStartCss( el, this.element, -1*toOffset[ii]-1, lastToOffset[ii]-1 );
+ } else {
+ var css = this.options.beforeCss( el, this.element, -1*toOffset[ii]-1 );
+ }
+ // after
+ } else if( toOffset[ii]>0 ){
+ var css = this.options.afterCss( el, this.element, toOffset[ii]-1 );
+
+ // before
+ } else if( toOffset[ii]<0 ){
+ var css = this.options.beforeCss( el, this.element, -1*toOffset[ii]-1 );
+ }
+
+ // Push all the animation info onto the animation queue
+ var j = css.length;
+ while( j-- ){
+ var cssI = css[ j ];
+ animationSet.add( new animationqueue.Animation( cssI.element, cssI.animate ) );
+ for( var step in cssI.steps ){
+ animationSet.add( new animationqueue.AnimationStep( cssI.element, cssI.steps[ step ], parseFloat( step ) ) );
+ }
+ }
+ }
+
+ // for determining if the item moved from start to end and vice-versa
+ lastToOffset = toOffset;
+
+ }
+
+ // hide/show the title
+ var titleElement = items.eq( current ).data( 'jcoverflip__titleElement' );
+ if( titleElement ){
+ this.options.titleAnimateIn( titleElement, time, goingToTheRight );
+ }
+
+ if( current != oldCurrent ){ // prevent the case where current and oldCurrent are the same
+
+ var titleElement = items.eq( oldCurrent ).data( 'jcoverflip__titleElement' );
+
+ if( titleElement ){
+ this.options.titleAnimateOut( titleElement, time, goingToTheRight );
+ }
+ }
+
+ if( !force ){
+ // Trigger the start event
+ this._trigger( 'start', originalEvent, { to: current, from: oldCurrent } );
+ // run the animation and set a callback to trigger the stop event
+ this.animationQueue.start( time, proxy( this, function( timeElapsed ){
+ this._trigger( 'stop', originalEvent, { to: current, from: oldCurrent, time: timeElapsed} );
+ } ) );
+
+ this._trigger( 'change', originalEvent, { to: current, from: oldCurrent } );
+ } else {
+ this.animationQueue.start( time, nofn );
+ }
+
+ // Used to create the functions for creating AnimationSteps
+ function stepFactory( el, css ){
+ return function( ){
+ el.css( css );
+ };
+ };
+
+
+ },
+
+
+ /**
+ * Get the item elements
+ *
+ * Returns the items based on the selector string found in options.items, if not defined, then
+ * the children of the jcoverflip element will be the items.
+ *
+ * @param reload - boolean flag to clear the cache of elements that are the items
+ *
+ * @return jQuery object of items
+ */
+ items: function( reload ){
+ if( this.itemsCache === undefined || !!reload ){
+ if( this.options.items ){
+ this.itemsCache = this.element.find( this.options.items );
+ } else {
+ this.itemsCache = this.element.children( );
+ }
+ }
+
+ return this.itemsCache;
+ },
+
+
+
+ /**
+ * Get length
+ *
+ * Returns the number of items.
+ */
+ length: function( ){
+ var items = this.items( );
+ return items.length;
+ },
+
+
+
+ /**
+ * Get offset object
+ *
+ * Returns an object that maps an item index to its position.
+ */
+ getOffset: function( current ){
+ var r = {},
+ length = this.length();
+
+ if( !this.options.wrapItemsAround ){
+ for( var i=0; i<length; ++i ){
+ r[i] = i-current;
+ }
+ } else {
+ var min = -1*this.options.wrapCenter,
+ minStart = ( current - this.options.wrapCenter + length ) % length,
+ max = length + min;
+
+ for( var i=minStart, j=min; j<max; ++j, i=(i+1)%length ){
+ r[i] = j;
+ }
+ }
+
+ return r;
+ },
+
+
+ /**
+ * Copied from jQuery UI
+ */
+ _trigger: function(type, event, data) {
+ var callback = this.options[type],
+ eventName = (type == 'jcoverflip'
+ ? type : 'jcoverflip' + type);
+
+ event = $.Event(event);
+ event.type = eventName;
+
+ // copy original event properties over to the new event
+ // this would happen if we could call $.event.fix instead of $.Event
+ // but we don't have a way to force an event to be fixed multiple times
+ if (event.originalEvent) {
+ for (var i = $.event.props.length, prop; i;) {
+ prop = $.event.props[--i];
+ event[prop] = event.originalEvent[prop];
+ }
+ }
+
+ this.element.trigger(event, data);
+
+ return !($.isFunction(callback) && callback.call(this.element[0], event, data) === false
+ || event.isDefaultPrevented());
+ },
+
+
+
+};
+
+
+
+
+
+
+
+
+
+var defaults = {
+ items: '',
+
+ /**
+ * Controls the CSS/Animation for items that go from the start to the end
+ *
+ *
+ * @param el jQuery element - the item element
+ * @param container jQuery element - the container element
+ * @param endOffset int - the offset of the item at the end (where the animation ends)
+ * @param startOffset int - the offset of the item at the start (where the animation starts)
+ */
+ startToEndCss: function( el, container, endOffset, startOffset ){
+ return [
+ $.jcoverflip.animationElement( el, { left: ( container.width( )/2 + 110 + 110*endOffset )+'px', bottom: '20px' }, { } ),
+ $.jcoverflip.animationElement( el.find( 'img' ), [
+ { opacity: 0.2, width: '50px' },
+ { opacity: 0.5, width: '100px' }
+ ], {} )
+ ];
+ },
+
+ /**
+ * Controls the CSS/Animation for items that go from the end to the start
+ *
+ * @param el jQuery element - the item element
+ * @param container jQuery element - the container element
+ * @param startOffset int - the offset of the item at the start (where the animation ends)
+ * @param endOffset int - the offset of the item at the end (where the animation starts)
+ */
+ endToStartCss: function( el, container, endOffset, startOffset ){
+ return [
+ $.jcoverflip.animationElement( el, { left: ( container.width( )/2 - 210 - 110*endOffset )+'px', bottom: '20px' }, { } ),
+ $.jcoverflip.animationElement( el.find( 'img' ), [
+ { opacity: 0.2, width: '50px' },
+ { opacity: 0.5, width: '100px' }
+ ], {} )
+ ];
+ },
+
+ /**
+ * Controls the CSS/Animation for items before the current
+ *
+ * @param el jQuery element - the item element
+ * @param container jQuery element - the container element
+ * @param offset int - the offset of the item from the current starting with zero
+ */
+ beforeCss: function( el, container, offset ){
+ return [
+ $.jcoverflip.animationElement( el, { left: ( container.width( )/2 - 210 - 110*offset )+'px', bottom: '20px' }, { } ),
+ $.jcoverflip.animationElement( el.find( 'img' ), { opacity: 0.5, width: '100px' }, {} )
+ ];
+ },
+
+ /**
+ * Controls the CSS/Animation for items after the current
+ *
+ * @param el jQuery element - the item element
+ * @param container jQuery element - the container element
+ * @param offset int - the offset of the item from the current starting with zero
+ */
+ afterCss: function( el, container, offset ){
+ return [
+ $.jcoverflip.animationElement( el, { left: ( container.width( )/2 + 110 + 110*offset )+'px', bottom: '20px' }, { } ),
+ $.jcoverflip.animationElement( el.find( 'img' ), { opacity: 0.5, width: '100px' }, {} )
+ ];
+ },
+
+ /**
+ * Controls the CSS/Animation for item that is the current
+ *
+ * @param el jQuery element - the item element
+ * @param container jQuery element - the container element
+ * @param isFinal boolean - a flag if the item is going to stop as the current or if it is passing through the current place to its final location
+ */
+ currentCss: function( el, container, isFinal ){
+ if( isFinal ){
+ return [
+ $.jcoverflip.animationElement( el, { left: ( container.width( )/2 - 100 )+'px', bottom: 0 }, { } ),
+ $.jcoverflip.animationElement( el.find( 'img' ), { opacity: 1, width: '200px' }, { } )
+ ];
+ } else {
+ return [
+ $.jcoverflip.animationElement( el, { left: ( container.width( )/2 - 50 )+'px', bottom: '20px' }, { } ),
+ $.jcoverflip.animationElement( el.find( 'img' ), { opacity: 0.5, width: '100px' }, { } )
+ ];
+ }
+ },
+ time: 500, // half a second
+
+ titles: {
+ /**
+ *
+ * @param el - item element
+ *
+ * @return jQuery element object of the title
+ *
+ * Order for finding the title
+ * 1) An element with a class of "title"
+ * 2) The title attribute of the item
+ * 3) The alt attribute of the item
+ * 4) The first title or alt attribute of a child element of the item
+ */
+ create: function( el ){
+ var titleText = '';
+ var title = $( [] );
+ var titleEl = el.find( '.title:first' );
+ if( titleEl.size( ) == 1 ){
+ title = titleEl.clone( true );
+ titleEl.css( 'display', 'none' );
+ title.data( 'jcoverflip__origin', 'cloned' );
+ title.data( 'jcoverflip__source', titleEl );
+ } else if( el.attr( 'title' ) ) {
+ titleText = el.attr( 'title' );
+ } else if( el.attr( 'alt' ) ) {
+ titleText = el.attr( 'alt' );
+ } else {
+ titleEl = el.find( '[title], [alt]' ).eq( 0 );
+ if( titleEl.size( ) == 1 ){
+ titleText = titleEl.attr( 'title' ) || titleEl.attr( 'alt' ) || '';
+ }
+ }
+
+ if( title.size( ) ){
+ title.css( { 'opacity': 0, 'display': 'block' } );
+ } else {
+ title = $( '<span class="title">' + titleText + '</span>' );
+ title.data( 'jcoverflip__origin', 'attribute' );
+ }
+ return title;
+ },
+ /**
+ *
+ * @param el - title element
+ */
+ destroy: function( el ){
+ if( el.data( 'jcoverflip__origin' ) == 'cloned' ){
+ el.data( 'jcoverflip__source' ).css( 'display', '' );
+ }
+ el.remove( );
+ }
+ },
+
+ titleAnimateIn: function( titleElement, time, offset ){
+ if( titleElement.css( 'display' ) == 'none' ){
+ titleElement.css({opacity: 0, display: 'block'});
+ }
+ titleElement.stop( ).animate({opacity: 1}, time );
+ },
+ titleAnimateOut: function( titleElement, time, offset ){
+ titleElement.stop( ).animate( {opacity: 0 }, time, function(){
+ $(this).css('display', 'none');
+ } );
+ },
+ controls: {
+ /**
+ * @param containerElement - the jQuery object for the jcoverflip
+ * @param length - the number of items
+ */
+ create: nofn,
+ /**
+ * @param containerElement - the jQuery object for the jcoverflip
+ */
+ destroy: nofn
+ },
+ current: 0
+};
+
+
+// specify the getters
+var getters = [ 'length', 'current' ];
+
+
+// Create the plugin
+jQueryPluginFactory(jQuery, 'jcoverflip', methods, getters);
+
+
+
+} )( jQuery );
266 tests/.svn/entries
@@ -0,0 +1,266 @@
+10
+
+dir
+17317
+svn://svn.newsig.com/newsig/labs/jCoverflip/tags/1.1.0/tests
+svn://svn.newsig.com/newsig
+
+
+
+2011-01-05T14:20:23.965910Z
+16926
+sleahy
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+1cbaf7ca-7d55-409f-9623-c90ebb489a2d
+
+1.jpg
+file
+
+
+
+
+2011-01-26T20:39:29.469180Z
+efcdfa0336d73beb3b540c1055559209
+2010-03-29T21:20:36.334987Z
+11804
+sleahy
+has-props
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+41806
+
+2.jpg
+file
+
+
+
+
+2011-01-26T20:39:29.473427Z
+d8c2394ff500c1fe29bf315d34f1ed86
+2010-03-29T21:20:36.334987Z
+11804
+sleahy
+has-props
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+45481
+
+3.jpg
+file
+
+
+
+
+2011-01-26T20:39:29.473427Z
+c7c8cfb3e98a1658a7c191ec8fc80217
+2010-03-29T21:20:36.334987Z
+11804
+sleahy
+has-props
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+41262
+
+4.jpg
+file
+
+
+
+
+2011-01-26T20:39:29.473427Z
+858b41e7f452a6220b4e38f88ca47476
+2010-03-29T21:20:36.334987Z
+11804
+sleahy
+has-props
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+41130
+
+5.jpg
+file
+
+
+
+
+2011-01-26T20:39:29.473427Z
+9823f5be0b013c55620a7dd6efa0d46e
+2010-03-29T21:20:36.334987Z
+11804
+sleahy
+has-props
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+31210
+
+test1.html
+file
+
+
+
+
+2011-01-26T20:39:29.473427Z
+088ad4b20344c38177782a9151fab1d9
+2011-01-05T14:20:23.965910Z
+16926
+sleahy
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+11874
+
+test2.html
+file
+
+
+
+
+2011-01-26T20:39:29.473427Z
+ce8539ce2e40bd8ea10b818f80123e07
+2011-01-05T14:20:23.965910Z
+16926
+sleahy
+has-props
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+12003
+
5 tests/.svn/prop-base/1.jpg.svn-base
@@ -0,0 +1,5 @@
+K 13
+svn:mime-type
+V 24
+application/octet-stream
+END
5 tests/.svn/prop-base/2.jpg.svn-base
@@ -0,0 +1,5 @@
+K 13
+svn:mime-type
+V 24
+application/octet-stream
+END
5 tests/.svn/prop-base/3.jpg.svn-base
@@ -0,0 +1,5 @@
+K 13
+svn:mime-type
+V 24
+application/octet-stream
+END
5 tests/.svn/prop-base/4.jpg.svn-base
@@ -0,0 +1,5 @@
+K 13
+svn:mime-type
+V 24
+application/octet-stream
+END
5 tests/.svn/prop-base/5.jpg.svn-base
@@ -0,0 +1,5 @@
+K 13
+svn:mime-type
+V 24
+application/octet-stream
+END
5 tests/.svn/prop-base/test2.html.svn-base
@@ -0,0 +1,5 @@
+K 14
+svn:executable
+V 1
+*
+END
BIN tests/.svn/text-base/1.jpg.svn-base
Binary file not shown.
BIN tests/.svn/text-base/2.jpg.svn-base
Binary file not shown.
BIN tests/.svn/text-base/3.jpg.svn-base
Binary file not shown.