Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Browse files

Initial commit

  • Loading branch information...
commit 1b5aa30cb1caec22bb04cc2c5e3f8c55ee1b6b38 0 parents
@fmarcia authored
674 LICENSE
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ <program> Copyright (C) <year> <name of author>
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
39 README
@@ -0,0 +1,39 @@
+Zen Coding for Gedit
+====================
+
+This plugin fully integrates [Zen Coding](http://code.google.com/p/zen-coding/) into [Gedit](http://projects.gnome.org/gedit/). With Zen Coding for Gedit, you can:
+
+- Expand abbreviation
+- Expand incrementally with abbreviation
+- Wrap incrementally with abbreviation
+- Balance tag inward or outward
+- Merge lines
+- Go to previous or next edit point
+- Update tag image size (needs `python-imaging`, see installation)
+- Remove tag
+- Split or join tags
+- Toggle comment
+- Create your own abbreviations and snippets
+
+These actions are available using keyboard shortcuts and menu items.
+
+Installation
+------------
+
+1. Download [zip](http://github.com/fmarcia/zen-coding-gedit/zipball/master) or [tar](http://github.com/fmarcia/zen-coding-gedit/tarball/master) source
+2. Unpack it
+3. Run `./zencoding-install.sh`
+4. In order to use "Update tag image size", install `python-imaging`, if not already done
+5. In Gedit, go to Edit > Preferences > Plugins and enable the plugin
+
+Credits
+-------
+
+- Zen Coding is written by [Sergey Chikuyonok](http://chikuyonok.ru/)
+- Zen Coding for Gedit is written by [Franck Marcia](http://github.com/fmarcia)
+
+License
+-------
+
+Zen Coding for Gedit 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.
+
11 install.sh
@@ -0,0 +1,11 @@
+#!/bin/bash
+#
+# Zen Coding installation
+#
+
+sudo cp zencoding.png /usr/share/icons/hicolor/16x16/apps
+sudo gtk-update-icon-cache /usr/share/icons/hicolor > /dev/null 2>&1
+mkdir -p ~/.gnome2/gedit/plugins
+cp zencoding.gedit-plugin ~/.gnome2/gedit/plugins
+cp -r zencoding ~/.gnome2/gedit/plugins
+
11 zencoding.gedit-plugin
@@ -0,0 +1,11 @@
+[Gedit Plugin]
+Loader=python
+Module=zencoding
+IAge=2
+Name=Zen Coding
+Description=Expand expressions similar to CSS selectors into HTML, CSS or XSLT code
+Description[fr]=Développe des expressions similaires à des sélecteurs CSS en code HTML, CSS ou XSLT
+Authors=Zen Coding: Sergey Chikuyonok <serge.che@gmail.com>\nGedit Plugin: Franck Marcia <franck.marcia@gmail.com>
+Copyright=Zen Coding: Sergey Chikuyonok <serge.che@gmail.com>\nGedit Plugin: Franck Marcia <franck.marcia@gmail.com>
+Website=http://code.google.com/p/zen-coding/
+
BIN  zencoding.png
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
9 zencoding/__init__.py
@@ -0,0 +1,9 @@
+'''
+Bootstrap for Zen Coding for Gedit
+
+@author Franck Marcia (franck.marcia@gmail.com)
+@link http://github.com/fmarcia/zen-coding-gedit
+'''
+
+from plugin import ZenCodingPlugin
+
23 zencoding/filters/__init__.py
@@ -0,0 +1,23 @@
+import os.path
+import sys
+
+# import all filters
+__sub_modules = []
+__prefix = 'zencoding.filters'
+__filter_dir = os.path.dirname(__file__)
+sys.path.append(__filter_dir)
+
+filter_map = {}
+for file in os.listdir(__filter_dir):
+ name, ext = os.path.splitext(file)
+ if ext.lower() == '.py':
+ __sub_modules.append(name)
+
+__filters = __import__(__prefix, globals(), locals(), __sub_modules)
+for key in dir(__filters):
+ __module = getattr(__filters, key)
+ if hasattr(__module, '__name__') and __module.__name__.startswith(__prefix + '.') and hasattr(__module, 'process'):
+ if hasattr(__module, 'alias'):
+ filter_map[__module.alias] = __module.process
+ else:
+ filter_map[__module.__name__[len(__prefix) + 1:]] = __module.process
47 zencoding/filters/comment.py
@@ -0,0 +1,47 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+'''
+Comment important tags (with 'id' and 'class' attributes)
+@author Sergey Chikuyonok (serge.che@gmail.com)
+@link http://chikuyonok.ru
+'''
+from zencoding import zen_core as zen_coding
+
+alias = 'c'
+"Filter name alias (if not defined, ZC will use module name)"
+
+def add_comments(node, i):
+
+ """
+ Add comments to tag
+ @type node: ZenNode
+ @type i: int
+ """
+ id_attr = node.get_attribute('id')
+ class_attr = node.get_attribute('class')
+ nl = zen_coding.get_newline()
+
+ if id_attr or class_attr:
+ comment_str = ''
+ padding = node.parent and node.parent.padding or ''
+ if id_attr: comment_str += '#' + id_attr
+ if class_attr: comment_str += '.' + class_attr
+
+ node.start = node.start.replace('<', '<!-- ' + comment_str + ' -->' + nl + padding + '<', 1)
+ node.end = node.end.replace('>', '>' + nl + padding + '<!-- /' + comment_str + ' -->', 1)
+
+ # replace counters
+ node.start = zen_coding.replace_counter(node.start, i + 1)
+ node.end = zen_coding.replace_counter(node.end, i + 1)
+
+def process(tree, profile):
+ if profile['tag_nl'] is False:
+ return tree
+
+ for i, item in enumerate(tree.children):
+ if item.is_block():
+ add_comments(item, i)
+ process(item, profile)
+
+ return tree
32 zencoding/filters/escape.py
@@ -0,0 +1,32 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+'''
+Filter for escaping unsafe XML characters: <, >, &
+@author Sergey Chikuyonok (serge.che@gmail.com)
+@link http://chikuyonok.ru
+'''
+import re
+
+alias = 'e'
+"Filter name alias (if not defined, ZC will use module name)"
+
+char_map = {
+ '<': '&lt;',
+ '>': '&gt;',
+ '&': '&amp;'
+}
+
+re_chars = re.compile(r'[<>&]')
+
+def escape_chars(text):
+ return re_chars.sub(lambda m: char_map[m.group(0)], text)
+
+def process(tree, profile=None):
+ for item in tree.children:
+ item.start = escape_chars(item.start)
+ item.end = escape_chars(item.end)
+
+ process(item)
+
+ return tree
25 zencoding/filters/format-css.py
@@ -0,0 +1,25 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+'''
+Format CSS properties: add space after property name:
+padding:0; -> padding: 0;
+@author Sergey Chikuyonok (serge.che@gmail.com)
+@link http://chikuyonok.ru
+'''
+import re
+
+alias = 'fc'
+"Filter name alias (if not defined, ZC will use module name)"
+
+re_css_prop = re.compile(r'([\w\-]+\s*:)\s*')
+
+def process(tree, profile):
+ for item in tree.children:
+ # CSS properties are always snippets
+ if item.type == 'snippet':
+ item.start = re_css_prop.sub(r'\1 ', item.start)
+
+ process(item, profile)
+
+ return tree
182 zencoding/filters/format.py
@@ -0,0 +1,182 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+"""
+Generic formatting filter: creates proper indentation for each tree node,
+placing "%s" placeholder where the actual output should be. You can use
+this filter to preformat tree and then replace %s placeholder to whatever you
+need. This filter should't be called directly from editor as a part
+of abbreviation.
+@author Sergey Chikuyonok (serge.che@gmail.com)
+@link http://chikuyonok.ru
+"""
+import re
+from zencoding import zen_core as zen_coding
+
+alias = '_format'
+"Filter name alias (if not defined, ZC will use module name)"
+
+child_token = '${child}'
+placeholder = '%s'
+
+def get_newline():
+ return zen_coding.get_newline()
+
+
+def get_indentation():
+ return zen_coding.get_indentation()
+
+def has_block_sibling(item):
+ """
+ Test if passed node has block-level sibling element
+ @type item: ZenNode
+ @return: bool
+ """
+ return item.parent and item.parent.has_block_children()
+
+def is_very_first_child(item):
+ """
+ Test if passed itrem is very first child of the whole tree
+ @type tree: ZenNode
+ """
+ return item.parent and not item.parent.parent and not item.previous_sibling
+
+def should_break_line(node, profile):
+ """
+ Need to add line break before element
+ @type node: ZenNode
+ @type profile: dict
+ @return: bool
+ """
+ if not profile['inline_break']:
+ return False
+
+ # find toppest non-inline sibling
+ while node.previous_sibling and node.previous_sibling.is_inline():
+ node = node.previous_sibling
+
+ if not node.is_inline():
+ return False
+
+ # calculate how many inline siblings we have
+ node_count = 1
+ node = node.next_sibling
+ while node:
+ if node.is_inline():
+ node_count += 1
+ else:
+ break
+ node = node.next_sibling
+
+ return node_count >= profile['inline_break']
+
+def should_break_child(node, profile):
+ """
+ Need to add newline because <code>item</code> has too many inline children
+ @type node: ZenNode
+ @type profile: dict
+ @return: bool
+ """
+ # we need to test only one child element, because
+ # has_block_children() method will do the rest
+ return node.children and should_break_line(node.children[0], profile)
+
+def process_snippet(item, profile, level=0):
+ """
+ Processes element with <code>snippet</code> type
+ @type item: ZenNode
+ @type profile: dict
+ @param level: Depth level
+ @type level: int
+ """
+ data = item.source.value;
+
+ if not data:
+ # snippet wasn't found, process it as tag
+ return process_tag(item, profile, level)
+
+ item.start = placeholder
+ item.end = placeholder
+
+ padding = item.parent.padding if item.parent else get_indentation() * level
+
+ if not is_very_first_child(item):
+ item.start = get_newline() + padding + item.start
+
+ # adjust item formatting according to last line of <code>start</code> property
+ parts = data.split(child_token)
+ lines = zen_coding.split_by_lines(parts[0] or '')
+ padding_delta = get_indentation()
+
+ if len(lines) > 1:
+ m = re.match(r'^(\s+)', lines[-1])
+ if m:
+ padding_delta = m.group(1)
+
+ item.padding = padding + padding_delta
+
+ return item
+
+def process_tag(item, profile, level=0):
+ """
+ Processes element with <code>tag</code> type
+ @type item: ZenNode
+ @type profile: dict
+ @param level: Depth level
+ @type level: int
+ """
+ if not item.name:
+ # looks like it's a root element
+ return item
+
+ item.start = placeholder
+ item.end = placeholder
+
+ is_unary = item.is_unary() and not item.children
+
+ # formatting output
+ if profile['tag_nl'] is not False:
+ padding = item.parent.padding if item.parent else get_indentation() * level
+ force_nl = profile['tag_nl'] is True
+ should_break = should_break_line(item, profile)
+
+ # formatting block-level elements
+ if ((item.is_block() or should_break) and item.parent) or force_nl:
+ # snippet children should take different formatting
+ if not item.parent or (item.parent.type != 'snippet' and not is_very_first_child(item)):
+ item.start = get_newline() + padding + item.start
+
+ if item.has_block_children() or should_break_child(item, profile) or (force_nl and not is_unary):
+ item.end = get_newline() + padding + item.end
+
+ if item.has_tags_in_content() or (force_nl and not item.has_children() and not is_unary):
+ item.start += get_newline() + padding + get_indentation()
+
+ elif item.is_inline() and has_block_sibling(item) and not is_very_first_child(item):
+ item.start = get_newline() + padding + item.start
+
+ item.padding = padding + get_indentation()
+
+ return item
+
+def process(tree, profile, level=0):
+ """
+ Processes simplified tree, making it suitable for output as HTML structure
+ @type item: ZenNode
+ @type profile: dict
+ @param level: Depth level
+ @type level: int
+ """
+
+ for item in tree.children:
+ if item.type == 'tag':
+ item = process_tag(item, profile, level)
+ else:
+ item = process_snippet(item, profile, level)
+
+ if item.content:
+ item.content = zen_coding.pad_string(item.content, item.padding)
+
+ process(item, profile, level + 1)
+
+ return tree
143 zencoding/filters/haml.py
@@ -0,0 +1,143 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+'''
+Filter that produces HAML tree
+@author Sergey Chikuyonok (serge.che@gmail.com)
+@link http://chikuyonok.ru
+'''
+from zencoding import zen_core as zen_coding
+
+child_token = '${child}'
+
+def make_attributes_string(tag, profile):
+ """
+ Creates HTML attributes string from tag according to profile settings
+ @type tag: ZenNode
+ @type profile: dict
+ """
+ # make attribute string
+ attrs = ''
+ attr_quote = profile['attr_quotes'] == 'single' and "'" or '"'
+ cursor = profile['place_cursor'] and zen_coding.get_caret_placeholder() or ''
+
+ # use short notation for ID and CLASS attributes
+ for a in tag.attributes:
+ name_lower = a['name'].lower()
+ if name_lower == 'id':
+ attrs += '#' + (a['value'] or cursor)
+ elif name_lower == 'class':
+ attrs += '.' + (a['value'] or cursor)
+
+ other_attrs = []
+
+ # process other attributes
+ for a in tag.attributes:
+ name_lower = a['name'].lower()
+ if name_lower != 'id' and name_lower != 'class':
+ attr_name = profile['attr_case'] == 'upper' and a['name'].upper() or name_lower
+ other_attrs.append(':' + attr_name + ' => ' + attr_quote + (a['value'] or cursor) + attr_quote)
+
+ if other_attrs:
+ attrs += '{' + ', '.join(other_attrs) + '}'
+
+ return attrs
+
+def _replace(placeholder, value):
+ if placeholder:
+ return placeholder % value
+ else:
+ return value
+
+def process_snippet(item, profile, level=0):
+ """
+ Processes element with <code>snippet</code> type
+ @type item: ZenNode
+ @type profile: dict
+ @type level: int
+ """
+ data = item.source.value
+
+ if not data:
+ # snippet wasn't found, process it as tag
+ return process_tag(item, profile, level)
+
+ tokens = data.split(child_token)
+ if len(tokens) < 2:
+ start = tokens[0]
+ end = ''
+ else:
+ start, end = tokens
+
+ padding = item.parent and item.parent.padding or ''
+
+ item.start = _replace(item.start, zen_coding.pad_string(start, padding))
+ item.end = _replace(item.end, zen_coding.pad_string(end, padding))
+
+ return item
+
+def has_block_sibling(item):
+ """
+ Test if passed node has block-level sibling element
+ @type item: ZenNode
+ @return: bool
+ """
+ return item.parent and item.parent.has_block_children()
+
+def process_tag(item, profile, level=0):
+ """
+ Processes element with <code>tag</code> type
+ @type item: ZenNode
+ @type profile: dict
+ @type level: int
+ """
+ if not item.name:
+ # looks like it's root element
+ return item
+
+ attrs = make_attributes_string(item, profile)
+ cursor = profile['place_cursor'] and zen_coding.get_caret_placeholder() or ''
+ self_closing = ''
+ is_unary = item.is_unary() and not item.children
+
+ if profile['self_closing_tag'] and is_unary:
+ self_closing = '/'
+
+ # define tag name
+ tag_name = '%' + (profile['tag_case'] == 'upper' and item.name.upper() or item.name.lower())
+
+ if tag_name.lower() == '%div' and '{' not in attrs:
+ # omit div tag
+ tag_name = ''
+
+ item.end = ''
+ item.start = _replace(item.start, tag_name + attrs + self_closing)
+
+ if not item.children and not is_unary:
+ item.start += cursor
+
+ return item
+
+def process(tree, profile, level=0):
+ """
+ Processes simplified tree, making it suitable for output as HTML structure
+ @type tree: ZenNode
+ @type profile: dict
+ @type level: int
+ """
+ if level == 0:
+ # preformat tree
+ tree = zen_coding.run_filters(tree, profile, '_format')
+
+ for i, item in enumerate(tree.children):
+ if item.type == 'tag':
+ process_tag(item, profile, level)
+ else:
+ process_snippet(item, profile, level)
+
+ # replace counters
+ item.start = zen_coding.unescape_text(zen_coding.replace_counter(item.start, item.counter))
+ item.end = zen_coding.unescape_text(zen_coding.replace_counter(item.end, item.counter))
+ process(item, profile, level + 1)
+
+ return tree
138 zencoding/filters/html.py
@@ -0,0 +1,138 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+'''
+Filter that produces HTML tree
+@author Sergey Chikuyonok (serge.che@gmail.com)
+@link http://chikuyonok.ru
+'''
+from zencoding import zen_core as zen_coding
+
+child_token = '${child}'
+
+def make_attributes_string(tag, profile):
+ """
+ Creates HTML attributes string from tag according to profile settings
+ @type tag: ZenNode
+ @type profile: dict
+ """
+ # make attribute string
+ attrs = ''
+ attr_quote = profile['attr_quotes'] == 'single' and "'" or '"'
+ cursor = profile['place_cursor'] and zen_coding.get_caret_placeholder() or ''
+
+ # process other attributes
+ for a in tag.attributes:
+ attr_name = profile['attr_case'] == 'upper' and a['name'].upper() or a['name'].lower()
+ attrs += ' ' + attr_name + '=' + attr_quote + (a['value'] or cursor) + attr_quote
+
+ return attrs
+
+def _replace(placeholder, value):
+ if placeholder:
+ return placeholder % value
+ else:
+ return value
+
+def process_snippet(item, profile, level):
+ """
+ Processes element with <code>snippet</code> type
+ @type item: ZenNode
+ @type profile: dict
+ @type level: int
+ """
+ data = item.source.value;
+
+ if not data:
+ # snippet wasn't found, process it as tag
+ return process_tag(item, profile, level)
+
+ tokens = data.split(child_token)
+ if len(tokens) < 2:
+ start = tokens[0]
+ end = ''
+ else:
+ start, end = tokens
+
+ padding = item.parent and item.parent.padding or ''
+
+ item.start = _replace(item.start, zen_coding.pad_string(start, padding))
+ item.end = _replace(item.end, zen_coding.pad_string(end, padding))
+
+ return item
+
+
+def has_block_sibling(item):
+ """
+ Test if passed node has block-level sibling element
+ @type item: ZenNode
+ @return: bool
+ """
+ return item.parent and item.parent.has_block_children()
+
+def process_tag(item, profile, level):
+ """
+ Processes element with <code>tag</code> type
+ @type item: ZenNode
+ @type profile: dict
+ @type level: int
+ """
+ if not item.name:
+ # looks like it's root element
+ return item
+
+ attrs = make_attributes_string(item, profile)
+ cursor = profile['place_cursor'] and zen_coding.get_caret_placeholder() or ''
+ self_closing = ''
+ is_unary = item.is_unary() and not item.children
+ start= ''
+ end = ''
+
+ if profile['self_closing_tag'] == 'xhtml':
+ self_closing = ' /'
+ elif profile['self_closing_tag'] is True:
+ self_closing = '/'
+
+ # define opening and closing tags
+ tag_name = profile['tag_case'] == 'upper' and item.name.upper() or item.name.lower()
+ if is_unary:
+ start = '<' + tag_name + attrs + self_closing + '>'
+ item.end = ''
+ else:
+ start = '<' + tag_name + attrs + '>'
+ end = '</' + tag_name + '>'
+
+ item.start = _replace(item.start, start)
+ item.end = _replace(item.end, end)
+
+ if not item.children and not is_unary:
+ item.start += cursor
+
+ return item
+
+def process(tree, profile, level=0):
+ """
+ Processes simplified tree, making it suitable for output as HTML structure
+ @type tree: ZenNode
+ @type profile: dict
+ @type level: int
+ """
+ if level == 0:
+ # preformat tree
+ tree = zen_coding.run_filters(tree, profile, '_format')
+ zen_coding.max_tabstop = 0
+
+ for item in tree.children:
+ if item.type == 'tag':
+ process_tag(item, profile, level)
+ else:
+ process_snippet(item, profile, level)
+
+ # replace counters
+ item.start = zen_coding.unescape_text(zen_coding.replace_counter(item.start, item.counter))
+ item.end = zen_coding.unescape_text(zen_coding.replace_counter(item.end, item.counter))
+ zen_coding.upgrade_tabstops(item)
+
+ process(item, profile, level + 1)
+
+ return tree
31 zencoding/filters/xsl.py
@@ -0,0 +1,31 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+'''
+Filter for trimming "select" attributes from some tags that contains
+child elements
+@author Sergey Chikuyonok (serge.che@gmail.com)
+@link http://chikuyonok.ru
+'''
+import re
+
+tags = {
+ 'xsl:variable': 1,
+ 'xsl:with-param': 1
+}
+
+re_attr = re.compile(r'\s+select\s*=\s*([\'"]).*?\1')
+
+def trim_attribute(node):
+ """
+ Removes "select" attribute from node
+ @type node: ZenNode
+ """
+ node.start = re_attr.sub('', node.start)
+
+def process(tree, profile):
+ for item in tree.children:
+ if item.type == 'tag' and item.name.lower() in tags and item.children:
+ trim_attribute(item)
+
+ process(item, profile)
273 zencoding/html_matcher.py
@@ -0,0 +1,273 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+'''
+Context-independent xHTML pair matcher
+Use method <code>match(html, start_ix)</code> to find matching pair.
+If pair was found, this function returns a list of indexes where tag pair
+starts and ends. If pair wasn't found, <code>None</code> will be returned.
+
+The last matched (or unmatched) result is saved in <code>last_match</code>
+dictionary for later use.
+
+@author: Sergey Chikuyonok (serge.che@gmail.com)
+'''
+import re
+
+start_tag = r'<([\w\:\-]+)((?:\s+[\w\-:]+(?:\s*=\s*(?:(?:"[^"]*")|(?:\'[^\']*\')|[^>\s]+))?)*)\s*(\/?)>'
+end_tag = r'<\/([\w\:\-]+)[^>]*>'
+attr = r'([\w\-:]+)(?:\s*=\s*(?:(?:"((?:\\.|[^"])*)")|(?:\'((?:\\.|[^\'])*)\')|([^>\s]+)))?'
+
+"Last matched HTML pair"
+last_match = {
+ 'opening_tag': None, # Tag() or Comment() object
+ 'closing_tag': None, # Tag() or Comment() object
+ 'start_ix': -1,
+ 'end_ix': -1
+}
+
+cur_mode = 'xhtml'
+"Current matching mode"
+
+def set_mode(new_mode):
+ global cur_mode
+ if new_mode != 'html': new_mode = 'xhtml'
+ cur_mode = new_mode
+
+def make_map(elems):
+ """
+ Create dictionary of elements for faster searching
+ @param elems: Elements, separated by comma
+ @type elems: str
+ """
+ obj = {}
+ for elem in elems.split(','):
+ obj[elem] = True
+
+ return obj
+
+# Empty Elements - HTML 4.01
+empty = make_map("area,base,basefont,br,col,frame,hr,img,input,isindex,link,meta,param,embed");
+
+# Block Elements - HTML 4.01
+block = make_map("address,applet,blockquote,button,center,dd,dir,div,dl,dt,fieldset,form,frameset,hr,iframe,isindex,li,map,menu,noframes,noscript,object,ol,p,pre,script,table,tbody,td,tfoot,th,thead,tr,ul");
+
+# Inline Elements - HTML 4.01
+inline = make_map("a,abbr,acronym,applet,b,basefont,bdo,big,br,button,cite,code,del,dfn,em,font,i,iframe,img,input,ins,kbd,label,map,object,q,s,samp,select,small,span,strike,strong,sub,sup,textarea,tt,u,var");
+
+# Elements that you can, intentionally, leave open
+# (and which close themselves)
+close_self = make_map("colgroup,dd,dt,li,options,p,td,tfoot,th,thead,tr");
+
+# Attributes that have their values filled in disabled="disabled"
+fill_attrs = make_map("checked,compact,declare,defer,disabled,ismap,multiple,nohref,noresize,noshade,nowrap,readonly,selected");
+
+#Special Elements (can contain anything)
+# serge.che: parsing data inside <scipt> elements is a "feature"
+special = make_map("style");
+
+class Tag():
+ """Matched tag"""
+ def __init__(self, match, ix):
+ """
+ @type match: MatchObject
+ @param match: Matched HTML tag
+ @type ix: int
+ @param ix: Tag's position
+ """
+ global cur_mode
+
+ name = match.group(1).lower()
+ self.name = name
+ self.full_tag = match.group(0)
+ self.start = ix
+ self.end = ix + len(self.full_tag)
+ self.unary = ( len(match.groups()) > 2 and bool(match.group(3)) ) or (name in empty and cur_mode == 'html')
+ self.type = 'tag'
+ self.close_self = (name in close_self and cur_mode == 'html')
+
+class Comment():
+ "Matched comment"
+ def __init__(self, start, end):
+ self.start = start
+ self.end = end
+ self.type = 'comment'
+
+def make_range(opening_tag=None, closing_tag=None, ix=0):
+ """
+ Makes selection ranges for matched tag pair
+ @type opening_tag: Tag
+ @type closing_tag: Tag
+ @type ix: int
+ @return list
+ """
+ start_ix, end_ix = -1, -1
+
+ if opening_tag and not closing_tag: # unary element
+ start_ix = opening_tag.start
+ end_ix = opening_tag.end
+ elif opening_tag and closing_tag: # complete element
+ if (opening_tag.start < ix and opening_tag.end > ix) or (closing_tag.start <= ix and closing_tag.end > ix):
+ start_ix = opening_tag.start
+ end_ix = closing_tag.end;
+ else:
+ start_ix = opening_tag.end
+ end_ix = closing_tag.start
+
+ return start_ix, end_ix
+
+def save_match(opening_tag=None, closing_tag=None, ix=0):
+ """
+ Save matched tag for later use and return found indexes
+ @type opening_tag: Tag
+ @type closing_tag: Tag
+ @type ix: int
+ @return list
+ """
+ last_match['opening_tag'] = opening_tag;
+ last_match['closing_tag'] = closing_tag;
+
+ last_match['start_ix'], last_match['end_ix'] = make_range(opening_tag, closing_tag, ix)
+
+ return last_match['start_ix'] != -1 and (last_match['start_ix'], last_match['end_ix']) or (None, None)
+
+def match(html, start_ix, mode='xhtml'):
+ """
+ Search for matching tags in <code>html</code>, starting from
+ <code>start_ix</code> position. The result is automatically saved
+ in <code>last_match</code> property
+ """
+ return _find_pair(html, start_ix, mode, save_match)
+
+def find(html, start_ix, mode='xhtml'):
+ """
+ Search for matching tags in <code>html</code>, starting from
+ <code>start_ix</code> position.
+ """
+ return _find_pair(html, start_ix, mode)
+
+def get_tags(html, start_ix, mode='xhtml'):
+ """
+ Search for matching tags in <code>html</code>, starting from
+ <code>start_ix</code> position. The difference between
+ <code>match</code> function itself is that <code>get_tags</code>
+ method doesn't save matched result in <code>last_match</code> property
+ and returns array of opening and closing tags
+ This method is generally used for lookups
+ """
+ return _find_pair(html, start_ix, mode, lambda op, cl=None, ix=0: (op, cl) if op and op.type == 'tag' else None)
+
+
+def _find_pair(html, start_ix, mode='xhtml', action=make_range):
+ """
+ Search for matching tags in <code>html</code>, starting from
+ <code>start_ix</code> position
+
+ @param html: Code to search
+ @type html: str
+
+ @param start_ix: Character index where to start searching pair
+ (commonly, current caret position)
+ @type start_ix: int
+
+ @param action: Function that creates selection range
+ @type action: function
+
+ @return: list
+ """
+
+ forward_stack = []
+ backward_stack = []
+ opening_tag = None
+ closing_tag = None
+ html_len = len(html)
+
+ set_mode(mode)
+
+ def has_match(substr, start=None):
+ if start is None:
+ start = ix
+
+ return html.find(substr, start) == start
+
+
+ def find_comment_start(start_pos):
+ while start_pos:
+ if html[start_pos] == '<' and has_match('<!--', start_pos):
+ break
+
+ start_pos -= 1
+
+ return start_pos
+
+# find opening tag
+ ix = start_ix - 1
+ while ix >= 0:
+ ch = html[ix]
+ if ch == '<':
+ check_str = html[ix:]
+ m = re.match(end_tag, check_str)
+ if m: # found closing tag
+ tmp_tag = Tag(m, ix)
+ if tmp_tag.start < start_ix and tmp_tag.end > start_ix: # direct hit on searched closing tag
+ closing_tag = tmp_tag
+ else:
+ backward_stack.append(tmp_tag)
+ else:
+ m = re.match(start_tag, check_str)
+ if m: # found opening tag
+ tmp_tag = Tag(m, ix);
+ if tmp_tag.unary:
+ if tmp_tag.start < start_ix and tmp_tag.end > start_ix: # exact match
+ return action(tmp_tag, None, start_ix)
+ elif backward_stack and backward_stack[-1].name == tmp_tag.name:
+ backward_stack.pop()
+ else: # found nearest unclosed tag
+ opening_tag = tmp_tag
+ break
+ elif check_str.startswith('<!--'): # found comment start
+ end_ix = check_str.find('-->') + ix + 3;
+ if ix < start_ix and end_ix >= start_ix:
+ return action(Comment(ix, end_ix))
+ elif ch == '-' and has_match('-->'): # found comment end
+ # search left until comment start is reached
+ ix = find_comment_start(ix)
+
+ ix -= 1
+
+ if not opening_tag:
+ return action(None)
+
+ # find closing tag
+ if not closing_tag:
+ ix = start_ix
+ while ix < html_len:
+ ch = html[ix]
+ if ch == '<':
+ check_str = html[ix:]
+ m = re.match(start_tag, check_str)
+ if m: # found opening tag
+ tmp_tag = Tag(m, ix);
+ if not tmp_tag.unary:
+ forward_stack.append(tmp_tag)
+ else:
+ m = re.match(end_tag, check_str)
+ if m: #found closing tag
+ tmp_tag = Tag(m, ix);
+ if forward_stack and forward_stack[-1].name == tmp_tag.name:
+ forward_stack.pop()
+ else: # found matched closing tag
+ closing_tag = tmp_tag;
+ break
+ elif has_match('<!--'): # found comment
+ ix += check_str.find('-->') + 3
+ continue
+ elif ch == '-' and has_match('-->'):
+ # looks like cursor was inside comment with invalid HTML
+ if not forward_stack or forward_stack[-1].type != 'comment':
+ end_ix = ix + 3
+ return action(Comment( find_comment_start(ix), end_ix ))
+
+ ix += 1
+
+ return action(opening_tag, closing_tag, start_ix)
124 zencoding/image_size.py
@@ -0,0 +1,124 @@
+'''
+Retrieve dimensions of an image from file
+@author Sergey Chikuyonok (serge.che@gmail.com)
+@link http://chikuyonok.ru
+
+Changes for Gedit Plugin
+@author Franck Marcia (franck.marcia@gmail.com)
+@link http://github.com/fmarcia/zen-coding-gedit
+'''
+
+from subprocess import Popen, PIPE
+import urllib
+import os
+import re
+
+def replace_or_append(img_tag, attr_name, attr_value):
+ """
+ Replaces or adds attribute to the tag
+ @type img_tag: str
+ @type attr_name: str
+ @type attr_value: str
+ """
+ if attr_name in img_tag.lower():
+ # attribute exists
+ re_attr = re.compile(attr_name + r'=([\'"])(.*?)\1', re.I)
+ return re.sub(re_attr, lambda m: '%s=%s%s%s' % (attr_name, m.group(1), attr_value, m.group(1)), img_tag)
+ else:
+ return re.sub(r'\s*(\/?>)$', ' ' + attr_name + '="' + attr_value + r'" \1', img_tag)
+
+def find_image(editor):
+ """
+ Find image tag under caret
+ @return Image tag and its indexes inside editor source
+ """
+ _caret = editor.get_caret_pos()
+ text = editor.get_content()
+ start_ix = -1
+ end_ix = -1
+
+ # find the beginning of the tag
+ caret_pos = _caret
+ while caret_pos >= 0:
+ if text[caret_pos] == '<':
+ if text[caret_pos:caret_pos + 4].lower() == '<img':
+ # found the beginning of the image tag
+ start_ix = caret_pos
+ break
+ else:
+ # found some other tag
+ return None
+ caret_pos -= 1
+
+ # find the end of the tag
+ caret_pos = _caret
+ ln = len(text)
+ while caret_pos <= ln:
+ if text[caret_pos] == '>':
+ end_ix = caret_pos + 1
+ break
+ caret_pos += 1
+
+
+ if start_ix != -1 and end_ix != -1:
+ return {
+ 'start': start_ix,
+ 'end': end_ix,
+ 'tag': text[start_ix:end_ix]
+ }
+
+ return None
+
+def get_image_size(editor, img):
+ """
+ Returns size of image in <img>; tag
+ @param img: Image tag
+ @return Dictionary with <code>width</code> and <code>height</code> attributes
+ """
+ m = re.search(r'src=(["\'])(.+?)\1', img, re.IGNORECASE)
+ if m:
+ src = get_absolute_uri(editor, m.group(2))
+ if not src:
+ return None
+ try:
+ #raw_output = Popen('sips -g pixelWidth -g pixelHeight "%s"' % src, stdout=PIPE, shell=True).communicate()[0]
+ raw_output = Popen('identify "%s"' % src, stdout=PIPE, shell=True).communicate()[0]
+ return {
+ 'width': re.search(r'([\d]+)x[\d]+', raw_output).group(1),
+ 'height': re.search(r'[\d]+x([\d]+)', raw_output).group(1)
+ }
+ except:
+ pass
+
+ return None
+
+def get_absolute_uri(editor, img_path):
+ file_uri = editor.document.get_uri()
+ if not file_uri: return None
+ file_uri = re.sub(r'^file://', '', file_uri)
+
+ if img_path[0] == '/':
+ img_path = img_path[1:]
+
+ while True:
+ head, tail = os.path.split(file_uri)
+ if not head or head == '/': break # reached the top
+
+ abs_image_path = os.path.join(head, img_path)
+ abs_image_path = os.path.normpath(abs_image_path)
+ if os.path.exists(abs_image_path):
+ return os.path.join(abs_image_path)
+
+ if head == file_uri: break # infinite loop protection
+ file_uri = head
+
+ return None
+
+def update_image_size(editor):
+ image = find_image(editor)
+ if image:
+ size = get_image_size(editor, image['tag'])
+ if size:
+ new_tag = replace_or_append(image['tag'], 'width', size['width'])
+ new_tag = replace_or_append(new_tag, 'height', size['height'])
+ editor.replace_content(new_tag, image['start'], image['end'])
8 zencoding/my_zen_settings.py
@@ -0,0 +1,8 @@
+my_zen_settings = {
+ 'html': {
+ 'abbreviations': {
+ 'jq': '<script type="text/javascript" src="http://ajax.googleapis.com/ajax/libs/jquery/1.3.2/jquery.min.js"></script>',
+ 'demo': '<div id="demo"></div>'
+ }
+ }
+}
149 zencoding/plugin.py
@@ -0,0 +1,149 @@
+# Zen Coding for Gedit
+#
+# Copyright (C) 2010 Franck Marcia
+#
+# 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/>.
+
+'''
+Connexion of Zen Coding to Gedit
+
+@author Franck Marcia (franck.marcia@gmail.com)
+@link http://github.com/fmarcia/zen-coding-gedit
+'''
+
+import gedit, gobject, gtk, os
+
+from zen_editor import ZenEditor
+
+zencoding_ui_str = """
+<ui>
+ <menubar name="MenuBar">
+ <menu name="EditMenu" action="Edit">
+ <placeholder name="EditOps_5">
+ <menu action="ZenCodingMenuAction">
+ <menuitem name="ZenCodingExpand" action="ZenCodingExpandAction"/>
+ <menuitem name="ZenCodingExpandW" action="ZenCodingExpandWAction"/>
+ <menuitem name="ZenCodingWrap" action="ZenCodingWrapAction"/>
+ <separator/>
+ <menuitem name="ZenCodingInward" action="ZenCodingInwardAction"/>
+ <menuitem name="ZenCodingOutward" action="ZenCodingOutwardAction"/>
+ <menuitem name="ZenCodingMerge" action="ZenCodingMergeAction"/>
+ <separator/>
+ <menuitem name="ZenCodingPrev" action="ZenCodingPrevAction"/>
+ <menuitem name="ZenCodingNext" action="ZenCodingNextAction"/>
+ <separator/>
+ <menuitem name="ZenCodingSize" action="ZenCodingSizeAction"/>
+ <separator/>
+ <menuitem name="ZenCodingRemove" action="ZenCodingRemoveAction"/>
+ <menuitem name="ZenCodingSplit" action="ZenCodingSplitAction"/>
+ <menuitem name="ZenCodingComment" action="ZenCodingCommentAction"/>
+ <separator/>
+ <menuitem name="ZenCodingSettings" action="ZenCodingSettingsAction"/>
+ </menu>
+ </placeholder>
+ </menu>
+ </menubar>
+</ui>
+"""
+
+class ZenCodingPlugin(gedit.Plugin):
+ """A Gedit plugin to implement Zen Coding's HTML and CSS shorthand expander."""
+
+ def activate(self, window):
+ actions = [
+ ('ZenCodingMenuAction', None, '_Zen Coding', None, "Zen Coding tools", None),
+ ('ZenCodingExpandAction', None, '_Expand abbreviation', '<Ctrl>E', "Expand abbreviation to raw HTML/CSS", self.expand_abbreviation),
+ ('ZenCodingExpandWAction', None, 'E_xpand with abbreviation...', '<Ctrl><Alt>E', "Type in an abbreviation to expand", self.expand_with_abbreviation),
+ ('ZenCodingWrapAction', None, '_Wrap with abbreviation...', '<Ctrl><Shift>E', "Wrap with code expanded from abbreviation", self.wrap_with_abbreviation),
+ ('ZenCodingInwardAction', None, 'Balance tag _inward', '<Ctrl><Alt>I', "Select inner tag's content", self.match_pair_inward),
+ ('ZenCodingOutwardAction', None, 'Balance tag _outward', '<Ctrl><Alt>O', "Select outer tag's content", self.match_pair_outward),
+ ('ZenCodingMergeAction', None, '_Merge lines', '<Ctrl><Alt>M', "Merge all lines of the current selection", self.merge_lines),
+ ('ZenCodingPrevAction', None, '_Previous edit point', '<Alt>Left', "Place the cursor at the previous edit point", self.prev_edit_point),
+ ('ZenCodingNextAction', None, '_Next edit point', '<Alt>Right', "Place the cursor at the next edit point", self.next_edit_point),
+ ('ZenCodingSizeAction', None, 'Update image _size', '<Ctrl><Alt>S', "Update image size tag from file", self.update_image_size),
+ ('ZenCodingRemoveAction', None, '_Remove tag', '<Ctrl><Alt>R', "Remove a tag", self.remove_tag),
+ ('ZenCodingSplitAction', None, 'Split or _join tag', '<Ctrl><Alt>J', "Toggle between single and double tag", self.split_join_tag),
+ ('ZenCodingCommentAction', None, 'Toggle _comment', '<Ctrl><Alt>C', "Toggle an XML or HTML comment", self.toggle_comment),
+ ('ZenCodingSettingsAction', None, 'E_dit settings...', None, "Customize snippets and abbreviations", self.edit_settings)
+ ]
+ windowdata = dict()
+ window.set_data("ZenCodingPluginDataKey", windowdata)
+ windowdata["action_group"] = gtk.ActionGroup("GeditZenCodingPluginActions")
+ windowdata["action_group"].add_actions(actions, window)
+ manager = window.get_ui_manager()
+ manager.insert_action_group(windowdata["action_group"], -1)
+ windowdata["ui_id"] = manager.add_ui_from_string(zencoding_ui_str)
+ window.set_data("ZenCodingPluginInfo", windowdata)
+ self.editor = ZenEditor()
+ error = self.editor.get_user_settings_error()
+ if error:
+ md = gtk.MessageDialog(window, gtk.DIALOG_MODAL, gtk.MESSAGE_ERROR,
+ gtk.BUTTONS_CLOSE, "There is an error in user settings:")
+ message = "{0} on line {1} at character {2}\n\nUser settings will not be available."
+ md.set_title("Zen Coding error")
+ md.format_secondary_text(message.format(error['msg'], error['lineno'], error['offset']))
+ md.run()
+ md.destroy()
+
+
+ def deactivate(self, window):
+ windowdata = window.get_data("ZenCodingPluginDataKey")
+ manager = window.get_ui_manager()
+ manager.remove_ui(windowdata["ui_id"])
+ manager.remove_action_group(windowdata["action_group"])
+
+ def update_ui(self, window):
+ view = window.get_active_view()
+ windowdata = window.get_data("ZenCodingPluginDataKey")
+ windowdata["action_group"].set_sensitive(bool(view and view.get_editable()))
+
+ def expand_abbreviation(self, action, window):
+ self.editor.expand_abbreviation(window)
+
+ def expand_with_abbreviation(self, action, window):
+ self.editor.expand_with_abbreviation(window)
+
+ def wrap_with_abbreviation(self, action, window):
+ self.editor.wrap_with_abbreviation(window)
+
+ def match_pair_inward(self, action, window):
+ self.editor.match_pair_inward(window)
+
+ def match_pair_outward(self, action, window):
+ self.editor.match_pair_outward(window)
+
+ def merge_lines(self, action, window):
+ self.editor.merge_lines(window)
+
+ def prev_edit_point(self, action, window):
+ self.editor.prev_edit_point(window)
+
+ def next_edit_point(self, action, window):
+ self.editor.next_edit_point(window)
+
+ def update_image_size(self, action, window):
+ self.editor.update_image_size(window)
+
+ def remove_tag(self, action, window):
+ self.editor.remove_tag(window)
+
+ def split_join_tag(self, action, window):
+ self.editor.split_join_tag(window)
+
+ def toggle_comment(self, action, window):
+ self.editor.toggle_comment(window)
+
+ def edit_settings(self, action, window):
+ window.create_tab_from_uri("file:///" + os.path.expanduser("~/.gnome2/gedit/plugins/zencoding/my_zen_settings.py"), None, 0, True, True)
+
161 zencoding/stparser.py
@@ -0,0 +1,161 @@
+'''
+Zen Coding's settings parser
+Created on Jun 14, 2009
+
+@author: sergey
+'''
+from copy import deepcopy
+
+import re
+import types
+from zen_settings import zen_settings
+
+_original_settings = deepcopy(zen_settings)
+
+TYPE_ABBREVIATION = 'zen-tag',
+TYPE_EXPANDO = 'zen-expando',
+TYPE_REFERENCE = 'zen-reference';
+""" Reference to another abbreviation or tag """
+
+re_tag = r'^<([\w\-]+(?:\:[\w\-]+)?)((?:\s+[\w\-]+(?:\s*=\s*(?:(?:"[^"]*")|(?:\'[^\']*\')|[^>\s]+))?)*)\s*(\/?)>'
+"Regular expression for XML tag matching"
+
+re_attrs = r'([\w\-]+)\s*=\s*([\'"])(.*?)\2'
+"Regular expression for matching XML attributes"
+
+class Entry:
+ """
+ Unified object for parsed data
+ """
+ def __init__(self, entry_type, key, value):
+ """
+ @type entry_type: str
+ @type key: str
+ @type value: dict
+ """
+ self.type = entry_type
+ self.key = key
+ self.value = value
+
+def _make_expando(key, value):
+ """
+ Make expando from string
+ @type key: str
+ @type value: str
+ @return: Entry
+ """
+ return Entry(TYPE_EXPANDO, key, value)
+
+def _make_abbreviation(key, tag_name, attrs, is_empty=False):
+ """
+ Make abbreviation from string
+ @param key: Abbreviation key
+ @type key: str
+ @param tag_name: Expanded element's tag name
+ @type tag_name: str
+ @param attrs: Expanded element's attributes
+ @type attrs: str
+ @param is_empty: Is expanded element empty or not
+ @type is_empty: bool
+ @return: dict
+ """
+ result = {
+ 'name': tag_name,
+ 'is_empty': is_empty
+ };
+
+ if attrs:
+ result['attributes'] = [];
+ for m in re.findall(re_attrs, attrs):
+ result['attributes'].append({
+ 'name': m[0],
+ 'value': m[2]
+ })
+
+ return Entry(TYPE_ABBREVIATION, key, result)
+
+def _parse_abbreviations(obj):
+ """
+ Parses all abbreviations inside dictionary
+ @param obj: dict
+ """
+ for key, value in obj.items():
+ key = key.strip()
+ if key[-1] == '+':
+# this is expando, leave 'value' as is
+ obj[key] = _make_expando(key, value)
+ else:
+ m = re.search(re_tag, value)
+ if m:
+ obj[key] = _make_abbreviation(key, m.group(1), m.group(2), (m.group(3) == '/'))
+ else:
+# assume it's reference to another abbreviation
+ obj[key] = Entry(TYPE_REFERENCE, key, value)
+
+def parse(settings):
+ """
+ Parse user's settings. This function must be called *before* any activity
+ in zen coding (for example, expanding abbreviation)
+ @type settings: dict
+ """
+ for p, value in settings.items():
+ if p == 'abbreviations':
+ _parse_abbreviations(value)
+ elif p == 'extends':
+ settings[p] = [v.strip() for v in value.split(',')]
+ elif type(value) == types.DictType:
+ parse(value)
+
+
+def extend(parent, child):
+ """
+ Recursevly extends parent dictionary with children's keys. Used for merging
+ default settings with user's
+ @type parent: dict
+ @type child: dict
+ """
+ for p, value in child.items():
+ if type(value) == types.DictType:
+ if p not in parent:
+ parent[p] = {}
+ extend(parent[p], value)
+ else:
+ parent[p] = value
+
+
+
+def create_maps(obj):
+ """
+ Create hash maps on certain string properties of zen settings
+ @type obj: dict
+ """
+ for p, value in obj.items():
+ if p == 'element_types':
+ for k, v in value.items():
+ if isinstance(v, str):
+ value[k] = [el.strip() for el in v.split(',')]
+ elif type(value) == types.DictType:
+ create_maps(value)
+
+
+if __name__ == '__main__':
+ pass
+
+def get_settings(user_settings=None):
+ """
+ Main function that gather all settings and returns parsed dictionary
+ @param user_settings: A dictionary of user-defined settings
+ """
+ settings = deepcopy(_original_settings)
+ create_maps(settings)
+
+ if user_settings:
+ user_settings = deepcopy(user_settings)
+ create_maps(user_settings)
+ extend(settings, user_settings)
+
+ # now we need to parse final set of settings
+ parse(settings)
+
+ return settings
+
646 zencoding/zen_actions.py
@@ -0,0 +1,646 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+"""
+Middleware layer that communicates between editor and Zen Coding.
+This layer describes all available Zen Coding actions, like
+"Expand Abbreviation".
+@author Sergey Chikuyonok (serge.che@gmail.com)
+@link http://chikuyonok.ru
+"""
+from zencoding import zen_core as zen_coding
+from zencoding import html_matcher
+import re
+from zen_core import char_at
+
+def find_abbreviation(editor):
+ """
+ Search for abbreviation in editor from current caret position
+ @param editor: Editor instance
+ @type editor: ZenEditor
+ @return: str
+ """
+ start, end = editor.get_selection_range()
+ if start != end:
+ # abbreviation is selected by user
+ return editor.get_content()[start:end]
+
+ # search for new abbreviation from current caret position
+ cur_line_start, cur_line_end = editor.get_current_line_range()
+ return zen_coding.extract_abbreviation(editor.get_content()[cur_line_start:start])
+
+def expand_abbreviation(editor, syntax=None, profile_name=None):
+ """
+ Find from current caret position and expand abbreviation in editor
+ @param editor: Editor instance
+ @type editor: ZenEditor
+ @param syntax: Syntax type (html, css, etc.)
+ @type syntax: str
+ @param profile_name: Output profile name (html, xml, xhtml)
+ @type profile_name: str
+ @return: True if abbreviation was expanded successfully
+ """
+ if syntax is None: syntax = editor.get_syntax()
+ if profile_name is None: profile_name = editor.get_profile_name()
+
+ range_start, caret_pos = editor.get_selection_range()
+ abbr = find_abbreviation(editor)
+ content = ''
+
+ if abbr:
+ content = zen_coding.expand_abbreviation(abbr, syntax, profile_name)
+ if content:
+ editor.replace_content(content, caret_pos - len(abbr), caret_pos)
+ return True
+
+ return False
+
+def expand_abbreviation_with_tab(editor, syntax, profile_name='xhtml'):
+ """
+ A special version of <code>expandAbbreviation</code> function: if it can't
+ find abbreviation, it will place Tab character at caret position
+ @param editor: Editor instance
+ @type editor: ZenEditor
+ @param syntax: Syntax type (html, css, etc.)
+ @type syntax: str
+ @param profile_name: Output profile name (html, xml, xhtml)
+ @type profile_name: str
+ """
+ if not expand_abbreviation(editor, syntax, profile_name):
+ editor.replace_content(zen_coding.get_variable('indentation'), editor.get_caret_pos())
+
+ return True
+
+def match_pair(editor, direction='out', syntax=None):
+ """
+ Find and select HTML tag pair
+ @param editor: Editor instance
+ @type editor: ZenEditor
+ @param direction: Direction of pair matching: 'in' or 'out'.
+ @type direction: str
+ """
+ direction = direction.lower()
+ if syntax is None: syntax = editor.get_profile_name()
+
+ range_start, range_end = editor.get_selection_range()
+ cursor = range_end
+ content = editor.get_content()
+ rng = None
+
+ old_open_tag = html_matcher.last_match['opening_tag']
+ old_close_tag = html_matcher.last_match['closing_tag']
+
+ if direction == 'in' and old_open_tag and range_start != range_end:
+# user has previously selected tag and wants to move inward
+ if not old_close_tag:
+# unary tag was selected, can't move inward
+ return False
+ elif old_open_tag.start == range_start:
+ if content[old_open_tag.end] == '<':
+# test if the first inward tag matches the entire parent tag's content
+ _r = html_matcher.find(content, old_open_tag.end + 1, syntax)
+ if _r[0] == old_open_tag.end and _r[1] == old_close_tag.start:
+ rng = html_matcher.match(content, old_open_tag.end + 1, syntax)
+ else:
+ rng = (old_open_tag.end, old_close_tag.start)
+ else:
+ rng = (old_open_tag.end, old_close_tag.start)
+ else:
+ new_cursor = content[0:old_close_tag.start].find('<', old_open_tag.end)
+ search_pos = new_cursor + 1 if new_cursor != -1 else old_open_tag.end
+ rng = html_matcher.match(content, search_pos, syntax)
+ else:
+ rng = html_matcher.match(content, cursor, syntax)
+
+ if rng and rng[0] is not None:
+ editor.create_selection(rng[0], rng[1])
+ return True
+ else:
+ return False
+
+def match_pair_inward(editor):
+ return match_pair(editor, 'in')
+
+def match_pair_outward(editor):
+ return match_pair(editor, 'out')
+
+def narrow_to_non_space(text, start, end):
+ """
+ Narrow down text indexes, adjusting selection to non-space characters
+ @type text: str
+ @type start: int
+ @type end: int
+ @return: list
+ """
+ # narrow down selection until first non-space character
+ while start < end:
+ if not text[start].isspace():
+ break
+
+ start += 1
+
+ while end > start:
+ end -= 1
+ if not text[end].isspace():
+ end += 1
+ break
+
+ return start, end
+
+def wrap_with_abbreviation(editor, abbr, syntax=None, profile_name=None):
+ """
+ Wraps content with abbreviation
+ @param editor: Editor instance
+ @type editor: ZenEditor
+ @param syntax: Syntax type (html, css, etc.)
+ @type syntax: str
+ @param profile_name: Output profile name (html, xml, xhtml)
+ @type profile_name: str
+ """
+ if not abbr: return None
+
+ if syntax is None: syntax = editor.get_syntax()
+ if profile_name is None: profile_name = editor.get_profile_name()
+
+ start_offset, end_offset = editor.get_selection_range()
+ content = editor.get_content()
+
+ if start_offset == end_offset:
+ # no selection, find tag pair
+ rng = html_matcher.match(content, start_offset, profile_name)
+
+ if rng[0] is None: # nothing to wrap
+ return None
+ else:
+ start_offset, end_offset = rng
+
+ start_offset, end_offset = narrow_to_non_space(content, start_offset, end_offset)
+ line_bounds = get_line_bounds(content, start_offset)
+ padding = get_line_padding(content[line_bounds[0]:line_bounds[1]])
+
+ new_content = content[start_offset:end_offset]
+ result = zen_coding.wrap_with_abbreviation(abbr, unindent_text(new_content, padding), syntax, profile_name)
+
+ if result:
+ editor.replace_content(result, start_offset, end_offset)
+ return True
+
+ return False
+
+def unindent(editor, text):
+ """
+ Unindent content, thus preparing text for tag wrapping
+ @param editor: Editor instance
+ @type editor: ZenEditor
+ @param text: str
+ @return str
+ """
+ return unindent_text(text, get_current_line_padding(editor))
+
+def unindent_text(text, pad):
+ """
+ Removes padding at the beginning of each text's line
+ @type text: str
+ @type pad: str
+ """
+ lines = zen_coding.split_by_lines(text)
+
+ for i,line in enumerate(lines):
+ if line.startswith(pad):
+ lines[i] = line[len(pad):]
+
+ return zen_coding.get_newline().join(lines)
+
+def get_current_line_padding(editor):
+ """
+ Returns padding of current editor's line
+ @return str
+ """
+ return get_line_padding(editor.get_current_line())
+
+def get_line_padding(line):
+ """
+ Returns padding of current editor's line
+ @return str
+ """
+ m = re.match(r'^(\s+)', line)
+ return m and m.group(0) or ''
+
+def find_new_edit_point(editor, inc=1, offset=0):
+ """
+ Search for new caret insertion point
+ @param editor: Editor instance
+ @type editor: ZenEditor
+ @param inc: Search increment: -1 — search left, 1 — search right
+ @param offset: Initial offset relative to current caret position
+ @return: -1 if insertion point wasn't found
+ """
+ cur_point = editor.get_caret_pos() + offset
+ content = editor.get_content()
+ max_len = len(content)
+ next_point = -1
+ re_empty_line = r'^\s+$'
+
+ def get_line(ix):
+ start = ix
+ while start >= 0:
+ c = content[start]
+ if c == '\n' or c == '\r': break
+ start -= 1
+
+ return content[start:ix]
+
+ while cur_point < max_len and cur_point > 0:
+ cur_point += inc
+ cur_char = char_at(content, cur_point)
+ next_char = char_at(content, cur_point + 1)
+ prev_char = char_at(content, cur_point - 1)
+
+ if cur_char in '"\'':
+ if next_char == cur_char and prev_char == '=':
+ # empty attribute
+ next_point = cur_point + 1
+ elif cur_char == '>' and next_char == '<':
+ # between tags
+ next_point = cur_point + 1
+ elif cur_char in '\r\n':
+ # empty line
+ if re.search(re_empty_line, get_line(cur_point - 1)):
+ next_point = cur_point
+
+ if next_point != -1: break
+
+ return next_point
+
+def prev_edit_point(editor):
+ """
+ Move caret to previous edit point
+ @param editor: Editor instance
+ @type editor: ZenEditor
+ """
+ cur_pos = editor.get_caret_pos()
+ new_point = find_new_edit_point(editor, -1)
+
+ if new_point == cur_pos:
+ # we're still in the same point, try searching from the other place
+ new_point = find_new_edit_point(editor, -1, -2)
+
+ if new_point != -1:
+ editor.set_caret_pos(new_point)
+ return True
+
+ return False
+
+def next_edit_point(editor):
+ """
+ Move caret to next edit point
+ @param editor: Editor instance
+ @type editor: ZenEditor
+ """
+ new_point = find_new_edit_point(editor, 1)
+ if new_point != -1:
+ editor.set_caret_pos(new_point)
+ return True
+
+ return False
+
+def insert_formatted_newline(editor, mode='html'):
+ """
+ Inserts newline character with proper indentation
+ @param editor: Editor instance