X (empty) → 0.1.0.0
raw patch · 12 files changed
+2051/−0 lines, 12 filesdep +basedep +bytestringdep +deepseqsetup-changed
Dependencies added: base, bytestring, deepseq, text, text-short
Files
- LICENSE +51/−0
- LICENSE.GPLv3 +674/−0
- Setup.hs +2/−0
- X.cabal +56/−0
- src/Common.hs +22/−0
- src/Text/XML.hs +90/−0
- src/Text/XML/Cursor.hs +342/−0
- src/Text/XML/Input.hs +147/−0
- src/Text/XML/Lexer.hs +267/−0
- src/Text/XML/Output.hs +170/−0
- src/Text/XML/Proc.hs +108/−0
- src/Text/XML/Types.hs +122/−0
+ LICENSE view
@@ -0,0 +1,51 @@+SPDX-License-Identifier: GPL-3.0-or-later AND BSD-3-Clause++Copyright (c) 2019 Herbert Valerio Riedel <hvr@gnu.org>++ This library is free software: you may copy, redistribute 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 library 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 (see `LICENSE.GPLv3`). If not, see+ <https://www.gnu.org/licenses/gpl-3.0.html>.++This library incorporates work covered by the following copyright and+permission notice:++ (c) 2007 Galois Inc.++ All rights reserved.++ Redistribution and use in source and binary forms, with or without+ modification, are permitted provided that the following conditions+ are met:++ 1. Redistributions of source code must retain the above copyright+ notice, this list of conditions and the following disclaimer.++ 2. Redistributions in binary form must reproduce the above copyright+ notice, this list of conditions and the following disclaimer in the+ documentation and/or other materials provided with the distribution.++ 3. Neither the name of the author nor the names of his contributors+ may be used to endorse or promote products derived from this software+ without specific prior written permission.++ THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS+ OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE+ DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR+ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,+ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN+ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE+ POSSIBILITY OF SUCH DAMAGE.
+ LICENSE.GPLv3 view
@@ -0,0 +1,674 @@+ GNU GENERAL PUBLIC LICENSE+ Version 3, 29 June 2007++ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>+ Everyone is permitted to copy and distribute verbatim copies+ of this license document, but changing it is not allowed.++ Preamble++ The GNU General Public License is a free, copyleft license for+software and other kinds of works.++ The licenses for most software and other practical works are designed+to take away your freedom to share and change the works. By contrast,+the GNU General Public License is intended to guarantee your freedom to+share and change all versions of a program--to make sure it remains free+software for all its users. We, the Free Software Foundation, use the+GNU General Public License for most of our software; it applies also to+any other work released this way by its authors. You can apply it to+your programs, too.++ When we speak of free software, we are referring to freedom, not+price. Our General Public Licenses are designed to make sure that you+have the freedom to distribute copies of free software (and charge for+them if you wish), that you receive source code or can get it if you+want it, that you can change the software or use pieces of it in new+free programs, and that you know you can do these things.++ To protect your rights, we need to prevent others from denying you+these rights or asking you to surrender the rights. Therefore, you have+certain responsibilities if you distribute copies of the software, or if+you modify it: responsibilities to respect the freedom of others.++ For example, if you distribute copies of such a program, whether+gratis or for a fee, you must pass on to the recipients the same+freedoms that you received. You must make sure that they, too, receive+or can get the source code. And you must show them these terms so they+know their rights.++ Developers that use the GNU GPL protect your rights with two steps:+(1) assert copyright on the software, and (2) offer you this License+giving you legal permission to copy, distribute and/or modify it.++ For the developers' and authors' protection, the GPL clearly explains+that there is no warranty for this free software. For both users' and+authors' sake, the GPL requires that modified versions be marked as+changed, so that their problems will not be attributed erroneously to+authors of previous versions.++ Some devices are designed to deny users access to install or run+modified versions of the software inside them, although the manufacturer+can do so. This is fundamentally incompatible with the aim of+protecting users' freedom to change the software. The systematic+pattern of such abuse occurs in the area of products for individuals to+use, which is precisely where it is most unacceptable. Therefore, we+have designed this version of the GPL to prohibit the practice for those+products. If such problems arise substantially in other domains, we+stand ready to extend this provision to those domains in future versions+of the GPL, as needed to protect the freedom of users.++ Finally, every program is threatened constantly by software patents.+States should not allow patents to restrict development and use of+software on general-purpose computers, but in those that do, we wish to+avoid the special danger that patents applied to a free program could+make it effectively proprietary. To prevent this, the GPL assures that+patents cannot be used to render the program non-free.++ The precise terms and conditions for copying, distribution and+modification follow.++ TERMS AND CONDITIONS++ 0. Definitions.++ "This License" refers to version 3 of the GNU General Public License.++ "Copyright" also means copyright-like laws that apply to other kinds of+works, such as semiconductor masks.++ "The Program" refers to any copyrightable work licensed under this+License. Each licensee is addressed as "you". "Licensees" and+"recipients" may be individuals or organizations.++ To "modify" a work means to copy from or adapt all or part of the work+in a fashion requiring copyright permission, other than the making of an+exact copy. The resulting work is called a "modified version" of the+earlier work or a work "based on" the earlier work.++ A "covered work" means either the unmodified Program or a work based+on the Program.++ To "propagate" a work means to do anything with it that, without+permission, would make you directly or secondarily liable for+infringement under applicable copyright law, except executing it on a+computer or modifying a private copy. Propagation includes copying,+distribution (with or without modification), making available to the+public, and in some countries other activities as well.++ To "convey" a work means any kind of propagation that enables other+parties to make or receive copies. Mere interaction with a user through+a computer network, with no transfer of a copy, is not conveying.++ An interactive user interface displays "Appropriate Legal Notices"+to the extent that it includes a convenient and prominently visible+feature that (1) displays an appropriate copyright notice, and (2)+tells the user that there is no warranty for the work (except to the+extent that warranties are provided), that licensees may convey the+work under this License, and how to view a copy of this License. If+the interface presents a list of user commands or options, such as a+menu, a prominent item in the list meets this criterion.++ 1. Source Code.++ The "source code" for a work means the preferred form of the work+for making modifications to it. "Object code" means any non-source+form of a work.++ A "Standard Interface" means an interface that either is an official+standard defined by a recognized standards body, or, in the case of+interfaces specified for a particular programming language, one that+is widely used among developers working in that language.++ The "System Libraries" of an executable work include anything, other+than the work as a whole, that (a) is included in the normal form of+packaging a Major Component, but which is not part of that Major+Component, and (b) serves only to enable use of the work with that+Major Component, or to implement a Standard Interface for which an+implementation is available to the public in source code form. A+"Major Component", in this context, means a major essential component+(kernel, window system, and so on) of the specific operating system+(if any) on which the executable work runs, or a compiler used to+produce the work, or an object code interpreter used to run it.++ The "Corresponding Source" for a work in object code form means all+the source code needed to generate, install, and (for an executable+work) run the object code and to modify the work, including scripts to+control those activities. However, it does not include the work's+System Libraries, or general-purpose tools or generally available free+programs which are used unmodified in performing those activities but+which are not part of the work. For example, Corresponding Source+includes interface definition files associated with source files for+the work, and the source code for shared libraries and dynamically+linked subprograms that the work is specifically designed to require,+such as by intimate data communication or control flow between those+subprograms and other parts of the work.++ The Corresponding Source need not include anything that users+can regenerate automatically from other parts of the Corresponding+Source.++ The Corresponding Source for a work in source code form is that+same work.++ 2. Basic Permissions.++ All rights granted under this License are granted for the term of+copyright on the Program, and are irrevocable provided the stated+conditions are met. This License explicitly affirms your unlimited+permission to run the unmodified Program. The output from running a+covered work is covered by this License only if the output, given its+content, constitutes a covered work. This License acknowledges your+rights of fair use or other equivalent, as provided by copyright law.++ You may make, run and propagate covered works that you do not+convey, without conditions so long as your license otherwise remains+in force. You may convey covered works to others for the sole purpose+of having them make modifications exclusively for you, or provide you+with facilities for running those works, provided that you comply with+the terms of this License in conveying all material for which you do+not control copyright. Those thus making or running the covered works+for you must do so exclusively on your behalf, under your direction+and control, on terms that prohibit them from making any copies of+your copyrighted material outside their relationship with you.++ Conveying under any other circumstances is permitted solely under+the conditions stated below. Sublicensing is not allowed; section 10+makes it unnecessary.++ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.++ No covered work shall be deemed part of an effective technological+measure under any applicable law fulfilling obligations under article+11 of the WIPO copyright treaty adopted on 20 December 1996, or+similar laws prohibiting or restricting circumvention of such+measures.++ When you convey a covered work, you waive any legal power to forbid+circumvention of technological measures to the extent such circumvention+is effected by exercising rights under this License with respect to+the covered work, and you disclaim any intention to limit operation or+modification of the work as a means of enforcing, against the work's+users, your or third parties' legal rights to forbid circumvention of+technological measures.++ 4. Conveying Verbatim Copies.++ You may convey verbatim copies of the Program's source code as you+receive it, in any medium, provided that you conspicuously and+appropriately publish on each copy an appropriate copyright notice;+keep intact all notices stating that this License and any+non-permissive terms added in accord with section 7 apply to the code;+keep intact all notices of the absence of any warranty; and give all+recipients a copy of this License along with the Program.++ You may charge any price or no price for each copy that you convey,+and you may offer support or warranty protection for a fee.++ 5. Conveying Modified Source Versions.++ You may convey a work based on the Program, or the modifications to+produce it from the Program, in the form of source code under the+terms of section 4, provided that you also meet all of these conditions:++ a) The work must carry prominent notices stating that you modified+ it, and giving a relevant date.++ b) The work must carry prominent notices stating that it is+ released under this License and any conditions added under section+ 7. This requirement modifies the requirement in section 4 to+ "keep intact all notices".++ c) You must license the entire work, as a whole, under this+ License to anyone who comes into possession of a copy. This+ License will therefore apply, along with any applicable section 7+ additional terms, to the whole of the work, and all its parts,+ regardless of how they are packaged. This License gives no+ permission to license the work in any other way, but it does not+ invalidate such permission if you have separately received it.++ d) If the work has interactive user interfaces, each must display+ Appropriate Legal Notices; however, if the Program has interactive+ interfaces that do not display Appropriate Legal Notices, your+ work need not make them do so.++ A compilation of a covered work with other separate and independent+works, which are not by their nature extensions of the covered work,+and which are not combined with it such as to form a larger program,+in or on a volume of a storage or distribution medium, is called an+"aggregate" if the compilation and its resulting copyright are not+used to limit the access or legal rights of the compilation's users+beyond what the individual works permit. Inclusion of a covered work+in an aggregate does not cause this License to apply to the other+parts of the aggregate.++ 6. Conveying Non-Source Forms.++ You may convey a covered work in object code form under the terms+of sections 4 and 5, provided that you also convey the+machine-readable Corresponding Source under the terms of this License,+in one of these ways:++ a) Convey the object code in, or embodied in, a physical product+ (including a physical distribution medium), accompanied by the+ Corresponding Source fixed on a durable physical medium+ customarily used for software interchange.++ b) Convey the object code in, or embodied in, a physical product+ (including a physical distribution medium), accompanied by a+ written offer, valid for at least three years and valid for as+ long as you offer spare parts or customer support for that product+ model, to give anyone who possesses the object code either (1) a+ copy of the Corresponding Source for all the software in the+ product that is covered by this License, on a durable physical+ medium customarily used for software interchange, for a price no+ more than your reasonable cost of physically performing this+ conveying of source, or (2) access to copy the+ Corresponding Source from a network server at no charge.++ c) Convey individual copies of the object code with a copy of the+ written offer to provide the Corresponding Source. This+ alternative is allowed only occasionally and noncommercially, and+ only if you received the object code with such an offer, in accord+ with subsection 6b.++ d) Convey the object code by offering access from a designated+ place (gratis or for a charge), and offer equivalent access to the+ Corresponding Source in the same way through the same place at no+ further charge. You need not require recipients to copy the+ Corresponding Source along with the object code. If the place to+ copy the object code is a network server, the Corresponding Source+ may be on a different server (operated by you or a third party)+ that supports equivalent copying facilities, provided you maintain+ clear directions next to the object code saying where to find the+ Corresponding Source. Regardless of what server hosts the+ Corresponding Source, you remain obligated to ensure that it is+ available for as long as needed to satisfy these requirements.++ e) Convey the object code using peer-to-peer transmission, provided+ you inform other peers where the object code and Corresponding+ Source of the work are being offered to the general public at no+ charge under subsection 6d.++ A separable portion of the object code, whose source code is excluded+from the Corresponding Source as a System Library, need not be+included in conveying the object code work.++ A "User Product" is either (1) a "consumer product", which means any+tangible personal property which is normally used for personal, family,+or household purposes, or (2) anything designed or sold for incorporation+into a dwelling. In determining whether a product is a consumer product,+doubtful cases shall be resolved in favor of coverage. For a particular+product received by a particular user, "normally used" refers to a+typical or common use of that class of product, regardless of the status+of the particular user or of the way in which the particular user+actually uses, or expects or is expected to use, the product. A product+is a consumer product regardless of whether the product has substantial+commercial, industrial or non-consumer uses, unless such uses represent+the only significant mode of use of the product.++ "Installation Information" for a User Product means any methods,+procedures, authorization keys, or other information required to install+and execute modified versions of a covered work in that User Product from+a modified version of its Corresponding Source. The information must+suffice to ensure that the continued functioning of the modified object+code is in no case prevented or interfered with solely because+modification has been made.++ If you convey an object code work under this section in, or with, or+specifically for use in, a User Product, and the conveying occurs as+part of a transaction in which the right of possession and use of the+User Product is transferred to the recipient in perpetuity or for a+fixed term (regardless of how the transaction is characterized), the+Corresponding Source conveyed under this section must be accompanied+by the Installation Information. But this requirement does not apply+if neither you nor any third party retains the ability to install+modified object code on the User Product (for example, the work has+been installed in ROM).++ The requirement to provide Installation Information does not include a+requirement to continue to provide support service, warranty, or updates+for a work that has been modified or installed by the recipient, or for+the User Product in which it has been modified or installed. Access to a+network may be denied when the modification itself materially and+adversely affects the operation of the network or violates the rules and+protocols for communication across the network.++ Corresponding Source conveyed, and Installation Information provided,+in accord with this section must be in a format that is publicly+documented (and with an implementation available to the public in+source code form), and must require no special password or key for+unpacking, reading or copying.++ 7. Additional Terms.++ "Additional permissions" are terms that supplement the terms of this+License by making exceptions from one or more of its conditions.+Additional permissions that are applicable to the entire Program shall+be treated as though they were included in this License, to the extent+that they are valid under applicable law. If additional permissions+apply only to part of the Program, that part may be used separately+under those permissions, but the entire Program remains governed by+this License without regard to the additional permissions.++ When you convey a copy of a covered work, you may at your option+remove any additional permissions from that copy, or from any part of+it. (Additional permissions may be written to require their own+removal in certain cases when you modify the work.) You may place+additional permissions on material, added by you to a covered work,+for which you have or can give appropriate copyright permission.++ Notwithstanding any other provision of this License, for material you+add to a covered work, you may (if authorized by the copyright holders of+that material) supplement the terms of this License with terms:++ a) Disclaiming warranty or limiting liability differently from the+ terms of sections 15 and 16 of this License; or++ b) Requiring preservation of specified reasonable legal notices or+ author attributions in that material or in the Appropriate Legal+ Notices displayed by works containing it; or++ c) Prohibiting misrepresentation of the origin of that material, or+ requiring that modified versions of such material be marked in+ reasonable ways as different from the original version; or++ d) Limiting the use for publicity purposes of names of licensors or+ authors of the material; or++ e) Declining to grant rights under trademark law for use of some+ trade names, trademarks, or service marks; or++ f) Requiring indemnification of licensors and authors of that+ material by anyone who conveys the material (or modified versions of+ it) with contractual assumptions of liability to the recipient, for+ any liability that these contractual assumptions directly impose on+ those licensors and authors.++ All other non-permissive additional terms are considered "further+restrictions" within the meaning of section 10. If the Program as you+received it, or any part of it, contains a notice stating that it is+governed by this License along with a term that is a further+restriction, you may remove that term. If a license document contains+a further restriction but permits relicensing or conveying under this+License, you may add to a covered work material governed by the terms+of that license document, provided that the further restriction does+not survive such relicensing or conveying.++ If you add terms to a covered work in accord with this section, you+must place, in the relevant source files, a statement of the+additional terms that apply to those files, or a notice indicating+where to find the applicable terms.++ Additional terms, permissive or non-permissive, may be stated in the+form of a separately written license, or stated as exceptions;+the above requirements apply either way.++ 8. Termination.++ You may not propagate or modify a covered work except as expressly+provided under this License. Any attempt otherwise to propagate or+modify it is void, and will automatically terminate your rights under+this License (including any patent licenses granted under the third+paragraph of section 11).++ However, if you cease all violation of this License, then your+license from a particular copyright holder is reinstated (a)+provisionally, unless and until the copyright holder explicitly and+finally terminates your license, and (b) permanently, if the copyright+holder fails to notify you of the violation by some reasonable means+prior to 60 days after the cessation.++ Moreover, your license from a particular copyright holder is+reinstated permanently if the copyright holder notifies you of the+violation by some reasonable means, this is the first time you have+received notice of violation of this License (for any work) from that+copyright holder, and you cure the violation prior to 30 days after+your receipt of the notice.++ Termination of your rights under this section does not terminate the+licenses of parties who have received copies or rights from you under+this License. If your rights have been terminated and not permanently+reinstated, you do not qualify to receive new licenses for the same+material under section 10.++ 9. Acceptance Not Required for Having Copies.++ You are not required to accept this License in order to receive or+run a copy of the Program. Ancillary propagation of a covered work+occurring solely as a consequence of using peer-to-peer transmission+to receive a copy likewise does not require acceptance. However,+nothing other than this License grants you permission to propagate or+modify any covered work. These actions infringe copyright if you do+not accept this License. Therefore, by modifying or propagating a+covered work, you indicate your acceptance of this License to do so.++ 10. Automatic Licensing of Downstream Recipients.++ Each time you convey a covered work, the recipient automatically+receives a license from the original licensors, to run, modify and+propagate that work, subject to this License. You are not responsible+for enforcing compliance by third parties with this License.++ An "entity transaction" is a transaction transferring control of an+organization, or substantially all assets of one, or subdividing an+organization, or merging organizations. If propagation of a covered+work results from an entity transaction, each party to that+transaction who receives a copy of the work also receives whatever+licenses to the work the party's predecessor in interest had or could+give under the previous paragraph, plus a right to possession of the+Corresponding Source of the work from the predecessor in interest, if+the predecessor has it or can get it with reasonable efforts.++ You may not impose any further restrictions on the exercise of the+rights granted or affirmed under this License. For example, you may+not impose a license fee, royalty, or other charge for exercise of+rights granted under this License, and you may not initiate litigation+(including a cross-claim or counterclaim in a lawsuit) alleging that+any patent claim is infringed by making, using, selling, offering for+sale, or importing the Program or any portion of it.++ 11. Patents.++ A "contributor" is a copyright holder who authorizes use under this+License of the Program or a work on which the Program is based. The+work thus licensed is called the contributor's "contributor version".++ A contributor's "essential patent claims" are all patent claims+owned or controlled by the contributor, whether already acquired or+hereafter acquired, that would be infringed by some manner, permitted+by this License, of making, using, or selling its contributor version,+but do not include claims that would be infringed only as a+consequence of further modification of the contributor version. For+purposes of this definition, "control" includes the right to grant+patent sublicenses in a manner consistent with the requirements of+this License.++ Each contributor grants you a non-exclusive, worldwide, royalty-free+patent license under the contributor's essential patent claims, to+make, use, sell, offer for sale, import and otherwise run, modify and+propagate the contents of its contributor version.++ In the following three paragraphs, a "patent license" is any express+agreement or commitment, however denominated, not to enforce a patent+(such as an express permission to practice a patent or covenant not to+sue for patent infringement). To "grant" such a patent license to a+party means to make such an agreement or commitment not to enforce a+patent against the party.++ If you convey a covered work, knowingly relying on a patent license,+and the Corresponding Source of the work is not available for anyone+to copy, free of charge and under the terms of this License, through a+publicly available network server or other readily accessible means,+then you must either (1) cause the Corresponding Source to be so+available, or (2) arrange to deprive yourself of the benefit of the+patent license for this particular work, or (3) arrange, in a manner+consistent with the requirements of this License, to extend the patent+license to downstream recipients. "Knowingly relying" means you have+actual knowledge that, but for the patent license, your conveying the+covered work in a country, or your recipient's use of the covered work+in a country, would infringe one or more identifiable patents in that+country that you have reason to believe are valid.++ If, pursuant to or in connection with a single transaction or+arrangement, you convey, or propagate by procuring conveyance of, a+covered work, and grant a patent license to some of the parties+receiving the covered work authorizing them to use, propagate, modify+or convey a specific copy of the covered work, then the patent license+you grant is automatically extended to all recipients of the covered+work and works based on it.++ A patent license is "discriminatory" if it does not include within+the scope of its coverage, prohibits the exercise of, or is+conditioned on the non-exercise of one or more of the rights that are+specifically granted under this License. You may not convey a covered+work if you are a party to an arrangement with a third party that is+in the business of distributing software, under which you make payment+to the third party based on the extent of your activity of conveying+the work, and under which the third party grants, to any of the+parties who would receive the covered work from you, a discriminatory+patent license (a) in connection with copies of the covered work+conveyed by you (or copies made from those copies), or (b) primarily+for and in connection with specific products or compilations that+contain the covered work, unless you entered into that arrangement,+or that patent license was granted, prior to 28 March 2007.++ Nothing in this License shall be construed as excluding or limiting+any implied license or other defenses to infringement that may+otherwise be available to you under applicable patent law.++ 12. No Surrender of Others' Freedom.++ If conditions are imposed on you (whether by court order, agreement or+otherwise) that contradict the conditions of this License, they do not+excuse you from the conditions of this License. If you cannot convey a+covered work so as to satisfy simultaneously your obligations under this+License and any other pertinent obligations, then as a consequence you may+not convey it at all. For example, if you agree to terms that obligate you+to collect a royalty for further conveying from those to whom you convey+the Program, the only way you could satisfy both those terms and this+License would be to refrain entirely from conveying the Program.++ 13. Use with the GNU Affero General Public License.++ Notwithstanding any other provision of this License, you have+permission to link or combine any covered work with a work licensed+under version 3 of the GNU Affero General Public License into a single+combined work, and to convey the resulting work. The terms of this+License will continue to apply to the part which is the covered work,+but the special requirements of the GNU Affero General Public License,+section 13, concerning interaction through a network will apply to the+combination as such.++ 14. Revised Versions of this License.++ The Free Software Foundation may publish revised and/or new versions of+the GNU General Public License from time to time. Such new versions will+be similar in spirit to the present version, but may differ in detail to+address new problems or concerns.++ Each version is given a distinguishing version number. If the+Program specifies that a certain numbered version of the GNU General+Public License "or any later version" applies to it, you have the+option of following the terms and conditions either of that numbered+version or of any later version published by the Free Software+Foundation. If the Program does not specify a version number of the+GNU General Public License, you may choose any version ever published+by the Free Software Foundation.++ If the Program specifies that a proxy can decide which future+versions of the GNU General Public License can be used, that proxy's+public statement of acceptance of a version permanently authorizes you+to choose that version for the Program.++ Later license versions may give you additional or different+permissions. However, no additional obligations are imposed on any+author or copyright holder as a result of your choosing to follow a+later version.++ 15. Disclaimer of Warranty.++ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.++ 16. Limitation of Liability.++ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF+SUCH DAMAGES.++ 17. Interpretation of Sections 15 and 16.++ If the disclaimer of warranty and limitation of liability provided+above cannot be given local legal effect according to their terms,+reviewing courts shall apply local law that most closely approximates+an absolute waiver of all civil liability in connection with the+Program, unless a warranty or assumption of liability accompanies a+copy of the Program in return for a fee.++ END OF TERMS AND CONDITIONS++ How to Apply These Terms to Your New Programs++ If you develop a new program, and you want it to be of the greatest+possible use to the public, the best way to achieve this is to make it+free software which everyone can redistribute and change under these terms.++ To do so, attach the following notices to the program. It is safest+to attach them to the start of each source file to most effectively+state the exclusion of warranty; and each file should have at least+the "copyright" line and a pointer to where the full notice is found.++ <one line to give the program's name and a brief idea of what it does.>+ Copyright (C) <year> <name of author>++ This program is free software: you can redistribute it and/or modify+ it under the terms of the GNU General Public License as published by+ the Free Software Foundation, either version 3 of the License, or+ (at your option) any later version.++ This program is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+ GNU General Public License for more details.++ You should have received a copy of the GNU General Public License+ along with this program. If not, see <http://www.gnu.org/licenses/>.++Also add information on how to contact you by electronic and paper mail.++ If the program does terminal interaction, make it output a short+notice like this when it starts in an interactive mode:++ <program> Copyright (C) <year> <name of author>+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.+ This is free software, and you are welcome to redistribute it+ under certain conditions; type `show c' for details.++The hypothetical commands `show w' and `show c' should show the appropriate+parts of the General Public License. Of course, your program's commands+might be different; for a GUI interface, you would use an "about box".++ You should also get your employer (if you work as a programmer) or school,+if any, to sign a "copyright disclaimer" for the program, if necessary.+For more information on this, and how to apply and follow the GNU GPL, see+<http://www.gnu.org/licenses/>.++ The GNU General Public License does not permit incorporating your program+into proprietary programs. If your program is a subroutine library, you+may consider it more useful to permit linking proprietary applications with+the library. If this is what you want to do, use the GNU Lesser General+Public License instead of this License. But first, please read+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+ Setup.hs view
@@ -0,0 +1,2 @@+import Distribution.Simple+main = defaultMain
+ X.cabal view
@@ -0,0 +1,56 @@+cabal-version: 2.2+name: X+version: 0.1.0.0++license: BSD-3-Clause AND GPL-3.0-or-later+license-files: LICENSE LICENSE.GPLv3+author: Galois Inc., Herbert Valerio Riedel+maintainer: hvr@gnu.org+copyright: (c) 2007-2008 Galois Inc.,+ (c) 2019 Herbert Valerio Riedel++synopsis: A light-weight XML library+category: Text, XML+bug-reports: https://github.com/hvr/issues+description:+ Light-weight XML library derived from the [`xml` package](http://hackage.haskell.org/package/xml)+ for simple parsing and creation of XML documents.+ It only depends on @base@, @deepseq@, @bytestring@, @text@, and @text-short@.++library+ hs-source-dirs: src+ exposed-modules:+ Text.XML+ Text.XML.Types+ Text.XML.Output+ Text.XML.Input+ Text.XML.Proc+ Text.XML.Cursor++ other-modules:+ Common+ Text.XML.Lexer++ build-depends:+ , base ^>= 4.7.0+ || ^>= 4.8.0+ || ^>= 4.9.0+ || ^>= 4.10.0+ || ^>= 4.11.0+ || ^>= 4.12.0+ , bytestring ^>= 0.10.4+ , deepseq ^>= 1.3.0+ || ^>= 1.4.0+ , text ^>= 1.2.3+ , text-short ^>= 0.1.3++ ghc-options: -Wall+ default-language: Haskell2010+ other-extensions:+ DeriveDataTypeable+ FlexibleInstances+ TypeSynonymInstances++source-repository head+ type: git+ location: https://github.com/hvr/X.git
+ src/Common.hs view
@@ -0,0 +1,22 @@+-- |+-- Module : Common+-- Copyright : (c) Herbert Valerio Riedel 2019+-- SPDX-License-Identifier: GPL-3.0-or-later+--+-- Internal vocabulary providing common vocabulary+--++module Common (module X) where++import Control.Applicative as X+import Control.DeepSeq as X (NFData (rnf), deepseq)+import Data.Data as X (Data)+import Data.Foldable as X (Foldable)+import Data.Maybe as X+import Data.Monoid as X (Monoid (mappend, mempty))+import Data.String as X (IsString (fromString))+import Data.Text as X (Text)+import Data.Text.Short as X (ShortText)+import Data.Traversable as X (Traversable, traverse)+import Data.Typeable as X (Typeable)+import GHC.Generics as X (Generic)
+ src/Text/XML.hs view
@@ -0,0 +1,90 @@+{-# LANGUAGE FlexibleInstances #-}+--------------------------------------------------------------------+-- |+-- Module : Text.XML+-- Copyright : (c) Galois, Inc. 2007+-- (c) Herbert Valerio Riedel 2019+-- SPDX-License-Identifier: BSD-3-Clause AND GPL-3.0-or-later+--+-- A lightweight XML parsing, filtering and generating library.+--+-- This module reexports functions from:+--+-- * "Text.XML.Types"+--+-- * "Text.XML.Proc"+--+-- * "Text.XML.Input"+--+-- * "Text.XML.Output"+--++module Text.XML (++ module Text.XML,+ module Text.XML.Types,+ module Text.XML.Proc,+ module Text.XML.Input,+ module Text.XML.Output++ ) where++import Common++import Text.XML.Input+import Text.XML.Output+import Text.XML.Proc+import Text.XML.Types++import qualified Data.Text.Short as TS++-- | Add an attribute to an element.+add_attr :: Attr -> Element -> Element+add_attr a e = add_attrs [a] e++-- | Add some attributes to an element.+add_attrs :: [Attr] -> Element -> Element+add_attrs as e = e { elAttribs = as ++ elAttribs e }++-- | Create an unqualified name.+unqual :: LName -> QName+unqual x = blank_name { qLName = x }++-- | A smart element constructor which uses the type of its argument+-- to determine what sort of element to make.+class Node t where+ node :: QName -> t -> Element++instance Node [Attr] where node n as = node n (as,[]::[Content])+instance Node Attr where node n a = node n [a]+instance Node () where node n () = node n ([]::[Attr])++instance Node ([Attr],[Content]) where node n (as,cs) = Element n as cs+instance Node ([Attr],Content) where node n (as,c) = node n (as,[c])+instance Node (Attr,Content) where node n (a,c) = node n ([a],[c])+instance Node [Content] where node n cs = node n ([]::[Attr],cs)+instance Node Content where node n c = node n [c]++instance Node ([Attr],[Element]) where node n (as,cs) = node n (as,map Elem cs)+instance Node ([Attr],Element) where node n (as,c) = node n (as,[c])+instance Node (Attr,Element) where node n (a,c) = node n ([a],c)+instance Node ([Element]) where node n es = node n ([]::[Attr],es)+instance Node (Element) where node n e = node n [e]++instance Node ([Attr],[CData]) where node n (as,cs) = node n (as,map Text cs)+instance Node ([Attr],CData) where node n (as,c) = node n (as,[c])+instance Node (Attr,CData) where node n (a,c) = node n ([a],c)+instance Node [CData] where node n es = node n ([]::[Attr],es)+instance Node CData where node n e = node n [e]++instance Node ([Attr],Text) where node n (as,t) = node n (as,blank_cdata { cdData = t })+instance Node (Attr,Text) where node n (a,t) = node n ([a],t)+instance Node Text where node n t = node n ([]::[Attr],t)++instance Node ([Attr],ShortText) where node n (as,t) = node n (as,blank_cdata { cdData = TS.toText t })+instance Node (Attr,ShortText) where node n (a,t) = node n ([a],t)+instance Node ShortText where node n t = node n ([]::[Attr],t)++-- | Create node with unqualified name+unode :: Node t => LName -> t -> Element+unode = node . unqual
+ src/Text/XML/Cursor.hs view
@@ -0,0 +1,342 @@+{-# LANGUAGE DeriveDataTypeable #-}+{-# LANGUAGE DeriveGeneric #-}++--------------------------------------------------------------------+-- |+-- Module : Text.XML.Cursor+-- Copyright : (c) Galois, Inc. 2008+-- (c) Herbert Valerio Riedel 2019+-- SPDX-License-Identifier: BSD-3-Clause AND GPL-3.0-or-later+--+-- XML cursors for working XML content withing the context of+-- an XML document. This implementation is based on the general+-- tree zipper written by Krasimir Angelov and Iavor S. Diatchki.+--+module Text.XML.Cursor+ ( Tag(..), getTag, setTag, fromTag+ , Cursor(..), Path++ -- * Conversions+ , fromContent+ , fromElement+ , fromForest+ , toForest+ , toTree++ -- * Moving around+ , parent+ , root+ , getChild+ , firstChild+ , lastChild+ , left+ , right+ , nextDF++ -- ** Searching+ , findChild+ , findLeft+ , findRight+ , findRec++ -- * Node classification+ , isRoot+ , isFirst+ , isLast+ , isLeaf+ , isChild+ , hasChildren+ , getNodeIndex++ -- * Updates+ , setContent+ , modifyContent+ , modifyContentM++ -- ** Inserting content+ , insertLeft+ , insertRight+ , insertGoLeft+ , insertGoRight++ -- ** Removing content+ , removeLeft+ , removeRight+ , removeGoLeft+ , removeGoRight+ , removeGoUp++ ) where++import Common+import Text.XML.Types++data Tag = Tag+ { tagName :: QName+ , tagAttribs :: [Attr]+ } deriving (Show,Generic,Typeable,Data)++instance NFData Tag++getTag :: Element -> Tag+getTag e = Tag { tagName = elName e+ , tagAttribs = elAttribs e+ }++setTag :: Tag -> Element -> Element+setTag t e = fromTag t (elContent e)++fromTag :: Tag -> [Content] -> Element+fromTag t cs = Element { elName = tagName t+ , elAttribs = tagAttribs t+ , elContent = cs+ }++type Path = [([Content],Tag,[Content])]++-- | The position of a piece of content in an XML document.+data Cursor = Cur+ { current :: Content -- ^ The currently selected content.+ , lefts :: [Content] -- ^ Siblings on the left, closest first.+ , rights :: [Content] -- ^ Siblings on the right, closest first.+ , parents :: Path -- ^ The contexts of the parent elements of this location.+ } deriving (Show,Generic,Typeable,Data)++instance NFData Cursor++-- Moving around ---------------------------------------------------------------++-- | The parent of the given location.+parent :: Cursor -> Maybe Cursor+parent loc =+ case parents loc of+ (pls,v,prs) : ps -> Just+ Cur { current = Elem+ (fromTag v+ (combChildren (lefts loc) (current loc) (rights loc)))+ , lefts = pls, rights = prs, parents = ps+ }+ [] -> Nothing+++-- | The top-most parent of the given location.+root :: Cursor -> Cursor+root loc = maybe loc root (parent loc)++-- | The left sibling of the given location.+left :: Cursor -> Maybe Cursor+left loc =+ case lefts loc of+ t : ts -> Just loc { current = t, lefts = ts+ , rights = current loc : rights loc }+ [] -> Nothing++-- | The right sibling of the given location.+right :: Cursor -> Maybe Cursor+right loc =+ case rights loc of+ t : ts -> Just loc { current = t, lefts = current loc : lefts loc+ , rights = ts }+ [] -> Nothing++-- | The first child of the given location.+firstChild :: Cursor -> Maybe Cursor+firstChild loc =+ do (t : ts, ps) <- downParents loc+ return Cur { current = t, lefts = [], rights = ts , parents = ps }++-- | The last child of the given location.+lastChild :: Cursor -> Maybe Cursor+lastChild loc =+ do (ts, ps) <- downParents loc+ case reverse ts of+ l : ls -> return Cur { current = l, lefts = ls, rights = []+ , parents = ps }+ [] -> Nothing++-- | Find the next left sibling that satisfies a predicate.+findLeft :: (Cursor -> Bool) -> Cursor -> Maybe Cursor+findLeft p loc = do loc1 <- left loc+ if p loc1 then return loc1 else findLeft p loc1++-- | Find the next right sibling that satisfies a predicate.+findRight :: (Cursor -> Bool) -> Cursor -> Maybe Cursor+findRight p loc = do loc1 <- right loc+ if p loc1 then return loc1 else findRight p loc1++-- | The first child that satisfies a predicate.+findChild :: (Cursor -> Bool) -> Cursor -> Maybe Cursor+findChild p loc =+ do loc1 <- firstChild loc+ if p loc1 then return loc1 else findRight p loc1++-- | The next position in a left-to-right depth-first traversal of a document:+-- either the first child, right sibling, or the right sibling of a parent that+-- has one.+nextDF :: Cursor -> Maybe Cursor+nextDF c = firstChild c <|> up c+ where up x = right x <|> (up =<< parent x)++-- | Perform a depth first search for a descendant that satisfies the+-- given predicate.+findRec :: (Cursor -> Bool) -> Cursor -> Maybe Cursor+findRec p c = if p c then Just c else findRec p =<< nextDF c++-- | The child with the given index (starting from 0).+getChild :: Int -> Cursor -> Maybe Cursor+getChild n loc =+ do (ts,ps) <- downParents loc+ (ls,t,rs) <- splitChildren ts n+ return Cur { current = t, lefts = ls, rights = rs, parents = ps }+++-- | private: computes the parent for "down" operations.+downParents :: Cursor -> Maybe ([Content], Path)+downParents loc =+ case current loc of+ Elem e -> Just ( elContent e+ , (lefts loc, getTag e, rights loc) : parents loc+ )+ _ -> Nothing++-- Conversions -----------------------------------------------------------------++-- | A cursor for the given content.+fromContent :: Content -> Cursor+fromContent t = Cur { current = t, lefts = [], rights = [], parents = [] }++-- | A cursor for the given element.+fromElement :: Element -> Cursor+fromElement e = fromContent (Elem e)++-- | The location of the first tree in a forest.+fromForest :: [Content] -> Maybe Cursor+fromForest (t:ts) = Just Cur { current = t, lefts = [], rights = ts+ , parents = [] }+fromForest [] = Nothing++-- | Computes the tree containing this location.+toTree :: Cursor -> Content+toTree loc = current (root loc)++-- | Computes the forest containing this location.+toForest :: Cursor -> [Content]+toForest loc = let r = root loc in combChildren (lefts r) (current r) (rights r)+++-- Queries ---------------------------------------------------------------------++-- | Are we at the top of the document?+isRoot :: Cursor -> Bool+isRoot loc = null (parents loc)++-- | Are we at the left end of the the document?+isFirst :: Cursor -> Bool+isFirst loc = null (lefts loc)++-- | Are we at the right end of the document?+isLast :: Cursor -> Bool+isLast loc = null (rights loc)++-- | Are we at the bottom of the document?+isLeaf :: Cursor -> Bool+isLeaf loc = isNothing (downParents loc)++-- | Do we have a parent?+isChild :: Cursor -> Bool+isChild loc = not (isRoot loc)++-- | Get the node index inside the sequence of children+getNodeIndex :: Cursor -> Int+getNodeIndex loc = length (lefts loc)++-- | Do we have children?+hasChildren :: Cursor -> Bool+hasChildren loc = not (isLeaf loc)++++-- Updates ---------------------------------------------------------------------++-- | Change the current content.+setContent :: Content -> Cursor -> Cursor+setContent t loc = loc { current = t }++-- | Modify the current content.+modifyContent :: (Content -> Content) -> Cursor -> Cursor+modifyContent f loc = setContent (f (current loc)) loc++-- | Modify the current content, allowing for an effect.+modifyContentM :: Monad m => (Content -> m Content) -> Cursor -> m Cursor+modifyContentM f loc = do x <- f (current loc)+ return (setContent x loc)++-- | Insert content to the left of the current position.+insertLeft :: Content -> Cursor -> Cursor+insertLeft t loc = loc { lefts = t : lefts loc }++-- | Insert content to the right of the current position.+insertRight :: Content -> Cursor -> Cursor+insertRight t loc = loc { rights = t : rights loc }++-- | Remove the content on the left of the current position, if any.+removeLeft :: Cursor -> Maybe (Content,Cursor)+removeLeft loc = case lefts loc of+ l : ls -> return (l,loc { lefts = ls })+ [] -> Nothing++-- | Remove the content on the right of the current position, if any.+removeRight :: Cursor -> Maybe (Content,Cursor)+removeRight loc = case rights loc of+ l : ls -> return (l,loc { rights = ls })+ [] -> Nothing+++-- | Insert content to the left of the current position.+-- The new content becomes the current position.+insertGoLeft :: Content -> Cursor -> Cursor+insertGoLeft t loc = loc { current = t, rights = current loc : rights loc }++-- | Insert content to the right of the current position.+-- The new content becomes the current position.+insertGoRight :: Content -> Cursor -> Cursor+insertGoRight t loc = loc { current = t, lefts = current loc : lefts loc }++-- | Remove the current element.+-- The new position is the one on the left.+removeGoLeft :: Cursor -> Maybe Cursor+removeGoLeft loc = case lefts loc of+ l : ls -> Just loc { current = l, lefts = ls }+ [] -> Nothing++-- | Remove the current element.+-- The new position is the one on the right.+removeGoRight :: Cursor -> Maybe Cursor+removeGoRight loc = case rights loc of+ l : ls -> Just loc { current = l, rights = ls }+ [] -> Nothing++-- | Remove the current element.+-- The new position is the parent of the old position.+removeGoUp :: Cursor -> Maybe Cursor+removeGoUp loc =+ case parents loc of+ (pls,v,prs) : ps -> Just+ Cur { current = Elem (fromTag v (reverse (lefts loc) ++ rights loc))+ , lefts = pls, rights = prs, parents = ps+ }+ [] -> Nothing+++-- | private: Gets the given element of a list.+-- Also returns the preceding elements (reversed) and the following elements.+splitChildren :: [a] -> Int -> Maybe ([a],a,[a])+splitChildren _ n | n < 0 = Nothing+splitChildren cs pos = loop [] cs pos+ where loop acc (x:xs) 0 = Just (acc,x,xs)+ loop acc (x:xs) n = loop (x:acc) xs $! n-1+ loop _ _ _ = Nothing++-- | private: combChildren ls x ys = reverse ls ++ [x] ++ ys+combChildren :: [a] -> a -> [a] -> [a]+combChildren ls t rs = foldl (flip (:)) (t:rs) ls
+ src/Text/XML/Input.hs view
@@ -0,0 +1,147 @@+{-# LANGUAGE DeriveDataTypeable #-}+{-# LANGUAGE DeriveGeneric #-}+{-# LANGUAGE GeneralizedNewtypeDeriving #-}+{-# LANGUAGE OverloadedStrings #-}++-- |+-- Module : Text.XML.Input+-- Copyright : (c) Galois, Inc. 2007+-- (c) Herbert Valerio Riedel 2019+-- SPDX-License-Identifier: BSD-3-Clause AND GPL-3.0-or-later+--+-- Lightweight XML parsing+--++module Text.XML.Input+ ( -- * High-level DOM Parser+ parseXML+ , parseXMLDoc++ -- * Token Scanner+ , XmlSource(uncons)+ , Scanner, customScanner++ , Token(..), scanXML+ ) where++import Common++import Text.XML.Lexer+import Text.XML.Proc+import Text.XML.Types++import qualified Data.Text as T+import qualified Data.Text.Short as TS++-- | parseXMLDoc, parse a XML document to an 'Element'+parseXMLDoc :: XmlSource s => s -> Either (Pos,String) Element+parseXMLDoc xs0 = parseXML xs0 >>= strip+ where+ strip cs = case onlyElems cs of+ e : es+ | "?xml" `TS.isPrefixOf` unLName (qLName (elName e))+ -> strip (map Elem es)+ | otherwise -> Right e+ [] -> Left (-1,"empty document")++-- | parseXML to a list of 'Content' chunks+parseXML :: XmlSource s => s -> Either (Pos,String) [Content]+parseXML = traverse fromContentF . parse . scanXML++------------------------------------------------------------------------++-- | Variant of 'Content' that can encode parser 'Failure's+data ContentF+ = ElemF (Element' ContentF)+ | TextF CData+ | CRefF !ShortText+ | Failure !Int String+ deriving (Show, Typeable, Data, Generic)++instance NFData ContentF++fromContentF :: ContentF -> Either (Pos,String) Content+fromContentF (CRefF ref) = Right (CRef ref)+fromContentF (TextF cd) = Right (Text cd)+fromContentF (ElemF el) = Elem <$> traverse fromContentF el+fromContentF (Failure pos err) = Left (pos,err)++------------------------------------------------------------------------++parse :: [Token] -> [ContentF]+parse [] = []+parse ts = let (es,_,ts1) = nodes ([],Nothing) [] ts+ in es ++ parse ts1++-- Information about namespaces.+-- The first component is a map that associates prefixes to URIs,+-- the second is the URI for the default namespace, if one was provided.+type NSInfo = ([(ShortText,URI)],Maybe URI)+++nodes :: NSInfo -> [QName] -> [Token] -> ([ContentF], [QName], [Token])++nodes ns ps (TokError pos msg : _) =+ let (es,qs,ts1) = nodes ns ps []+ in (Failure pos msg : es, qs, ts1)++nodes ns ps (TokCRef ref : ts) =+ let (es,qs,ts1) = nodes ns ps ts+ in (CRefF ref : es, qs, ts1)++nodes ns ps (TokText txt : ts) =+ let (es,qs,ts1) = nodes ns ps ts+ (more,es1) = case es of+ TextF cd : es1'+ | cdVerbatim cd == cdVerbatim txt -> (cdData cd,es1')+ _ -> (mempty,es)++ in (TextF txt { cdData = cdData txt `T.append` more } : es1, qs, ts1)++nodes cur_info ps (TokStart _ t as empty' : ts) = (node : siblings, open, toks)+ where+ new_name = annotName new_info t+ new_info = foldr addNS cur_info as+ node = ElemF Element { elName = new_name+ , elAttribs = map (annotAttr new_info) as+ , elContent = children+ }++ (children,(siblings,open,toks))+ | empty' = ([], nodes cur_info ps ts)+ | otherwise = let (es1,qs1,ts1) = nodes new_info (new_name:ps) ts+ in (es1,+ case qs1 of+ [] -> nodes cur_info ps ts1+ _ : qs3 -> ([],qs3,ts1))++nodes ns ps (TokEnd pos t : ts)+ = case ps of+ p1:_ | t1 == p1 -> ([],[],ts)+ _ -> let (es,qs,ts1) = nodes ns ps ts+ in (Failure pos "start/end-tag mismatch" : es, qs, ts1)+ where+ t1 = annotName ns t++nodes _ ps [] = ([],ps,[])+++annotName :: NSInfo -> QName -> QName+annotName (namespaces,def_ns) n = n { qURI = maybe def_ns (`lookup` namespaces) (qPrefix n) }+++annotAttr :: NSInfo -> Attr -> Attr+annotAttr ns a@(Attr { attrKey = k}) =+ case (qPrefix k, qLName k) of+ -- Do not apply the default name-space to unqualified+ -- attributes. See Section 6.2 of <http://www.w3.org/TR/REC-xml-names>.+ (Nothing, _) -> a+ _ -> a { attrKey = annotName ns k }+++addNS :: Attr -> NSInfo -> NSInfo+addNS (Attr { attrKey = key, attrVal = val }) (ns,def) =+ case (qPrefix key, qLName key) of+ (Nothing,"xmlns") -> (ns, if T.null val then Nothing else Just (URI (TS.fromText val)))+ (Just "xmlns", k) -> ((unLName k, URI (TS.fromText val)) : ns, def)+ _ -> (ns,def)
+ src/Text/XML/Lexer.hs view
@@ -0,0 +1,267 @@+{-# LANGUAGE BangPatterns #-}+{-# LANGUAGE DeriveDataTypeable #-}+{-# LANGUAGE DeriveGeneric #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE TypeSynonymInstances #-}++-- |+-- Module : Text.XML.Lexer+-- Copyright : (c) Galois, Inc. 2007+-- (c) Herbert Valerio Riedel 2019+-- SPDX-License-Identifier: BSD-3-Clause AND GPL-3.0-or-later+--+module Text.XML.Lexer where++import Common+import Text.XML.Types++import qualified Data.Text as TS+import qualified Data.Text as T+import qualified Data.Text.Lazy as TL+import Numeric (readHex)++class XmlSource s where+ uncons :: s -> Maybe (Char,s)++instance XmlSource String where+ uncons (c:s) = Just (c,s)+ uncons "" = Nothing++instance XmlSource TS.Text where+ uncons = TS.uncons++instance XmlSource TL.Text where+ uncons = TL.uncons++-- | This type may be used to provide a custom scanning function+-- for extracting characters.+data Scanner s = Scanner (Maybe (Char,s)) (s -> Maybe (Char,s))++-- | This type may be used to provide a custom scanning function+-- for extracting characters.+customScanner :: (s -> Maybe (Char,s)) -> s -> Scanner s+customScanner next s = Scanner (next s) next++instance XmlSource (Scanner s) where+ uncons (Scanner this next) = do+ (c,s1) <- this+ return (c, Scanner (next s1) next)++-- Lexer -----------------------------------------------------------------------++type LChar = (Pos,Char)+type LString = [LChar]++-- | XML Lexer token.+data Token = TokStart !Pos QName [Attr] Bool+ -- ^ opening start-tag (the 'Bool' field denotes whether this is an empty tag)+ | TokEnd !Pos QName -- ^ closing end-tag+ | TokCRef ShortText -- ^ character entity reference+ | TokText CData -- ^ character data+ | TokError !Pos String -- ^ Lexer error+ deriving (Show,Data,Typeable,Generic)++instance NFData Token++eofErr :: [Token]+eofErr = [TokError (-1) "Premature EOF"]++-- | Run XML lexer over 'XmlSource'+scanXML :: XmlSource source => source -> [Token]+scanXML = tokens' . go 0+ where+ go !n src = case uncons src of+ Just (c,src') -> (n,c) : go (n+1) src'+ Nothing -> []+++tokens' :: LString -> [Token]+tokens' ((_,'<') : c@(_,'!') : cs) = special c cs+tokens' ((_,'<') : cs) = tag cs+tokens' [] = []+tokens' cs@((_,_):_) = let (as,bs) = breakn ('<' ==) cs+ in map cvt (decode_text as) ++ tokens' bs++ -- XXX: Note, some of the lines might be a bit inacuarate+ where cvt (TxtBit x) = TokText CData { cdVerbatim = CDataText+ , cdData = fromString x+ }+ cvt (CRefBit x) = case cref_to_char x of+ Just c -> TokText CData { cdVerbatim = CDataText+ , cdData = T.singleton c+ }+ Nothing -> TokCRef (fromString x)+++special :: LChar -> LString -> [Token]+special (_,_) ((_,'-') : (_,'-') : cs) = skip cs+ where+ skip ((pos,'-') : (_,'-') : (_,x) : ds)+ | x == '>' = tokens' ds+ | otherwise = [TokError pos "double hyphen within comment"]+ skip (_ : ds) = skip ds+ skip [] = eofErr++special _ ((_,'[') : (_,'C') : (_,'D') : (_,'A') : (_,'T') : (_,'A') : (_,'[') : cs) =+ let (xs,ts) = cdata cs+ in TokText CData { cdVerbatim = CDataVerbatim+ , cdData = fromString xs+ } : tokens' ts+ where cdata ((_,']') : (_,']') : (_,'>') : ds) = ([],ds)+ cdata ((_,d) : ds) = let (xs,ys) = cdata ds in (d:xs,ys)+ cdata [] = ([],[])++special _ cs =+ let (xs,ts) = munch "" 0 cs+ in TokText CData { cdVerbatim = CDataRaw+ , cdData = fromString ('<':'!':reverse xs)+ } : tokens' ts+ where munch acc nesting ((_,'>') : ds)+ | nesting == (0::Int) = ('>':acc,ds)+ | otherwise = munch ('>':acc) (nesting-1) ds+ munch acc nesting ((_,'<') : ds)+ = munch ('<':acc) (nesting+1) ds+ munch acc n ((_,x) : ds) = munch (x:acc) n ds+ munch acc _ [] = (acc,[]) -- unterminated DTD markup+--special c cs = tag (c : cs) -- invalid specials are processed as tags++qualName :: LString -> (QName,LString)+qualName xs = (QName { qURI = Nothing+ , qPrefix = fmap fromString q+ , qLName = LName (fromString n)+ }, bs)+ where+ (as,bs) = breakn endName xs+ (q,n) = case break (':'==) as of+ (q1,_:n1) -> (Just q1, n1)+ _ -> (Nothing, as)++ endName x = isSpace x || x == '=' || x == '>' || x == '/'++{-++EmptyElemTag ::= '<' Name (S Attribute)* S? '/>'+STag ::= '<' Name (S Attribute)* S? '>'+ETag ::= '</' Name S? '>'++Attribute ::= Name Eq AttValue++-}+tag :: LString -> [Token]+tag ((p,'/') : cs)+ = TokEnd p n : case dropSpace ds of+ (_,'>') : es -> tokens' es+ -- tag was not properly closed...+ (p',_) : _ -> [TokError p' "expected '>'"]+ [] -> eofErr+ where+ (n,ds) = qualName (dropSpace cs)+tag [] = eofErr+tag cs+ = TokStart (fst (head cs)) n as b : ts+ where+ (n,ds) = qualName cs+ (as,b,ts) = attribs (dropSpace ds)+++attribs :: LString -> ([Attr], Bool, [Token])+attribs cs = case cs of+ (_,'>') : ds -> ([], False, tokens' ds)+ (_,'/') : ds -> ([], True, case ds of+ (_,'>') : es -> tokens' es+ (pos,_) : _ -> [TokError pos "expected '>'"]+ [] -> eofErr)+ (_,'?') : (_,'>') : ds -> ([], True, tokens' ds)++ -- doc ended within a tag..+ [] -> ([],False,eofErr)++ _ -> let (a,cs1) = attrib cs+ (as,b,ts) = attribs cs1+ in (a:as,b,ts)++attrib :: LString -> (Attr,LString)+attrib cs = let (ks,cs1) = qualName cs+ (vs,cs2) = attr_val (dropSpace cs1)+ in ((Attr ks (fromString $ decode_attr vs)),dropSpace cs2)++{-+AttValue ::= '"' ([^<&"] | Reference)* '"'+ | "'" ([^<&'] | Reference)* "'"+-}+attr_val :: LString -> (String,LString)+attr_val ((_,'=') : cs0) = string (dropSpace cs0)+ where+ -- | Match the value for an attribute. For malformed XML we do+ -- our best to guess the programmer's intention.+ string :: LString -> (String,LString)+ string ((_,'"') : cs) = break' ('"' ==) cs+ string ((_,'\'') : cs) = break' ('\'' ==) cs+ -- Allow attributes that are not enclosed by anything.+ string cs = breakn eos cs+ where eos x = isSpace x || x == '>' || x == '/'+attr_val cs = ("",cs)+++{-++S ::= (#x20 | #x9 | #xD | #xA)+++-}+dropSpace :: LString -> LString+dropSpace = dropWhile (isSpace . snd)++isSpace :: Char -> Bool+isSpace = (`elem` "\x20\x09\x0D\x0A")+++break' :: (a -> Bool) -> [(b,a)] -> ([a],[(b,a)])+break' p xs = let (as,bs) = breakn p xs+ in (as, case bs of+ [] -> []+ _ : cs -> cs)++breakn :: (a -> Bool) -> [(b,a)] -> ([a],[(b,a)])+breakn p l = (map snd as,bs) where (as,bs) = break (p . snd) l+++decode_attr :: String -> String+decode_attr cs = concatMap cvt (decode_text cs)+ where cvt (TxtBit x) = x+ cvt (CRefBit x) = case cref_to_char x of+ Just c -> [c]+ Nothing -> '&' : x ++ ";"++data Txt = TxtBit String | CRefBit String deriving Show++decode_text :: [Char] -> [Txt]+decode_text xs@('&' : cs) = case break (';' ==) cs of+ (as,_:bs) -> CRefBit as : decode_text bs+ _ -> [TxtBit xs]+decode_text [] = []+decode_text cs = let (as,bs) = break ('&' ==) cs+ in TxtBit as : decode_text bs++cref_to_char :: [Char] -> Maybe Char+cref_to_char cs = case cs of+ '#' : ds -> num_esc ds+ "lt" -> Just '<'+ "gt" -> Just '>'+ "amp" -> Just '&'+ "apos" -> Just '\''+ "quot" -> Just '"'+ _ -> Nothing++num_esc :: String -> Maybe Char+num_esc cs = case cs of+ 'x' : ds -> check (readHex ds)+ _ -> check (reads cs)++ where check [(n,"")] = cvt_char n+ check _ = Nothing++cvt_char :: Int -> Maybe Char+cvt_char x+ | fromEnum (minBound :: Char) <= x && x <= fromEnum (maxBound::Char)+ = Just (toEnum x)+ | otherwise = Nothing
+ src/Text/XML/Output.hs view
@@ -0,0 +1,170 @@+{-# LANGUAGE OverloadedStrings #-}++--------------------------------------------------------------------+-- |+-- Module : Text.XML.Output+-- Copyright : (c) Galois, Inc. 2007+-- (c) Herbert Valerio Riedel 2019+-- SPDX-License-Identifier: BSD-3-Clause AND GPL-3.0-or-later+--+-- Output handling for the lightweight XML lib.+--++module Text.XML.Output+ ( serializeXML+ , serializeXMLDoc+ ) where++import Common+import Data.Char+import qualified Data.Text as T+import qualified Data.Text.Lazy as TL+import qualified Data.Text.Short as TS+import Text.XML.Types++-- | Serialize XML 1.0 document prefixed by the XML prologue+-- \"@\<?xml version='1.0' ?\>@\"+--+serializeXMLDoc :: Element -> TL.Text+serializeXMLDoc = TL.pack . showTopElement++-- | Serialize a sequence of XML 'Content' nodes+serializeXML :: [Content] -> TL.Text+serializeXML = TL.pack . foldr (ppContentS defaultConfigPP "") ""++-- | The XML 1.0 header+xml_header :: String+xml_header = "<?xml version='1.0' ?>"++--------------------------------------------------------------------------------+data ConfigPP = ConfigPP+ { prettify :: !Bool+ }++-- | Default pretty printing configuration.+-- * Always use abbreviate empty tags.+defaultConfigPP :: ConfigPP+defaultConfigPP = ConfigPP { prettify = False }++{-+-- | A configuration that tries to make things pretty+-- (possibly at the cost of changing the semantics a bit+-- through adding white space.)+prettyConfigPP :: ConfigPP+prettyConfigPP = defaultConfigPP { prettify = True }++-- | Pretty printing renders XML documents faithfully,+-- with the exception that whitespace may be added\/removed+-- in non-verbatim character data.+ppTopElement :: Element -> String+ppTopElement = ppcTopElement prettyConfigPP++-- | Pretty printing renders XML documents faithfully,+-- with the exception that whitespace may be added\/removed+-- in non-verbatim character data.+ppcTopElement :: ConfigPP -> Element -> String+ppcTopElement c e = unlines [xml_header,ppcElement c e]++-- | Pretty printing elements+ppcElement :: ConfigPP -> Element -> String+ppcElement c e = ppElementS c "" e ""+-}++-- | Pretty printing content using ShowS+ppContentS :: ConfigPP -> String -> Content -> ShowS+ppContentS c i x xs = case x of+ Elem e -> ppElementS c i e xs+ Text t -> ppCDataS c i t xs+ CRef r -> showCRefS r xs++ppElementS :: ConfigPP -> String -> Element -> ShowS+ppElementS c i e xs = i ++ (tagStart (elName e) (elAttribs e) $+ case elContent e of+ [] | "?" `TS.isPrefixOf` unLName (qLName name) -> " ?>" ++ xs+ | otherwise -> " />" ++ xs+ [Text t] -> ">" ++ ppCDataS c "" t (tagEnd name xs)+ cs -> '>' : nl ++ foldr ppSub (i ++ tagEnd name xs) cs+ where ppSub e1 = ppContentS c (sp ++ i) e1 . showString nl+ (nl,sp) = if prettify c then ("\n"," ") else ("","")+ )+ where+ name = elName e++ppCDataS :: ConfigPP -> String -> CData -> ShowS+ppCDataS c i t xs = i ++ if cdVerbatim t /= CDataText || not (prettify c)+ then showCDataS t xs+ else foldr cons xs (showCData t)++ where cons :: Char -> String -> String+ cons '\n' ys = "\n" ++ i ++ ys+ cons y ys = y : ys++--------------------------------------------------------------------------------++-- | Adds the <?xml?> header.+showTopElement :: Element -> String+showTopElement c = xml_header ++ showElement c++showElement :: Element -> String+showElement c = ppElementS defaultConfigPP "" c ""++showCData :: CData -> String+showCData c = ppCDataS defaultConfigPP "" c ""++-- Note: crefs should not contain '&', ';', etc.+showCRefS :: ShortText -> ShowS+showCRefS r xs = '&' : TS.unpack r ++ ';' : xs++-- | Convert a text element to characters.+showCDataS :: CData -> ShowS+showCDataS cd =+ case cdVerbatim cd of+ CDataText -> escStr (T.unpack $ cdData cd)+ CDataVerbatim -> showString "<![CDATA[" . escCData (T.unpack $ cdData cd)+ . showString "]]>"+ CDataRaw -> \ xs -> T.unpack (cdData cd) ++ xs++--------------------------------------------------------------------------------+escCData :: String -> ShowS+escCData (']' : ']' : '>' : cs) = showString "]]]]><![CDATA[>" . escCData cs+escCData (c : cs) = showChar c . escCData cs+escCData [] = id++escChar :: Char -> ShowS+escChar c = case c of+ '<' -> showString "<"+ '>' -> showString ">"+ '&' -> showString "&"+ '"' -> showString """+ -- we use ' instead of ' because IE apparently has difficulties+ -- rendering ' in xhtml.+ -- Reported by Rohan Drape <rohan.drape@gmail.com>.+ '\'' -> showString "'"++ -- NOTE: We escape '\r' explicitly because otherwise they get lost+ -- when parsed back in because of then end-of-line normalization rules.+ _ | isPrint c || c == '\n' -> showChar c+ | otherwise -> showString "&#" . shows oc . showChar ';'+ where oc = ord c++escStr :: String -> ShowS+escStr cs rs = foldr escChar rs cs++tagEnd :: QName -> ShowS+tagEnd qn rs = '<':'/':showQName qn ++ '>':rs++tagStart :: QName -> [Attr] -> ShowS+tagStart qn as rs = '<':showQName qn ++ as_str ++ rs+ where as_str = if null as then "" else ' ' : unwords (map showAttr as)++showAttr :: Attr -> String+showAttr (Attr qn v) = showQName qn ++ '=' : '"' : escStr (T.unpack v) "\""++showQName :: QName -> String+showQName q = pre ++ showLName (qLName q)+ where pre = case qPrefix q of+ Nothing -> ""+ Just p -> TS.unpack p ++ ":"++showLName :: LName -> String+showLName = TS.unpack . unLName
+ src/Text/XML/Proc.hs view
@@ -0,0 +1,108 @@+--------------------------------------------------------------------+-- |+-- Module : Text.XML.Proc+-- Copyright : (c) Galois, Inc. 2007+-- (c) Herbert Valerio Riedel 2019+-- SPDX-License-Identifier: BSD-3-Clause AND GPL-3.0-or-later+--+--------------------------------------------------------------------++module Text.XML.Proc where++import Common+import Text.XML.Types++import Data.List (find)+import qualified Data.Text as T++-- | Get the text value of an XML element. This function+-- ignores non-text elements, and concatenates all text elements.+strContent :: Element -> Text+strContent e = T.concat $ map cdData $ onlyText $ elContent e++-- | Select only the elements from a list of XML content.+onlyElems :: [Content] -> [Element]+onlyElems xs = [ x | Elem x <- xs ]++-- | Select only the elements from a parent.+elChildren :: Element -> [Element]+elChildren e = [ x | Elem x <- elContent e ]++-- | Select only the text from a list of XML content.+onlyText :: [Content] -> [CData]+onlyText xs = [ x | Text x <- xs ]++-- | Find all immediate children with the given name.+findChildren :: QName -> Element -> [Element]+findChildren q e = filterChildren ((q ==) . elName) e++-- | Filter all immediate children wrt a given predicate.+filterChildren :: (Element -> Bool) -> Element -> [Element]+filterChildren p e = filter p (onlyElems (elContent e))+++-- | Filter all immediate children wrt a given predicate over their names.+filterChildrenName :: (QName -> Bool) -> Element -> [Element]+filterChildrenName p e = filter (p.elName) (onlyElems (elContent e))+++-- | Find an immediate child with the given name.+findChild :: QName -> Element -> Maybe Element+findChild q e = listToMaybe (findChildren q e)++-- | Find an immediate child with the given name.+filterChild :: (Element -> Bool) -> Element -> Maybe Element+filterChild p e = listToMaybe (filterChildren p e)++-- | Find an immediate child with name matching a predicate.+filterChildName :: (QName -> Bool) -> Element -> Maybe Element+filterChildName p e = listToMaybe (filterChildrenName p e)++-- | Find the left-most occurrence of an element matching given name.+findElement :: QName -> Element -> Maybe Element+findElement q e = listToMaybe (findElements q e)++-- | Filter the left-most occurrence of an element wrt. given predicate.+filterElement :: (Element -> Bool) -> Element -> Maybe Element+filterElement p e = listToMaybe (filterElements p e)++-- | Filter the left-most occurrence of an element wrt. given predicate.+filterElementName :: (QName -> Bool) -> Element -> Maybe Element+filterElementName p e = listToMaybe (filterElementsName p e)++-- | Find all non-nested occurances of an element.+-- (i.e., once we have found an element, we do not search+-- for more occurances among the element's children).+findElements :: QName -> Element -> [Element]+findElements qn e = filterElementsName (qn==) e++-- | Find all non-nested occurrences of an element wrt. given predicate.+-- (i.e., once we have found an element, we do not search+-- for more occurances among the element's children).+filterElements :: (Element -> Bool) -> Element -> [Element]+filterElements p e+ | p e = [e]+ | otherwise = concatMap (filterElements p) $ onlyElems $ elContent e++-- | Find all non-nested occurences of an element wrt a predicate over element names.+-- (i.e., once we have found an element, we do not search+-- for more occurances among the element's children).+filterElementsName :: (QName -> Bool) -> Element -> [Element]+filterElementsName p e = filterElements (p.elName) e++-- | Lookup the value of an attribute.+findAttr :: QName -> Element -> Maybe Text+findAttr x e = lookupAttr x (elAttribs e)++-- | Lookup attribute name from list.+lookupAttr :: QName -> [Attr] -> Maybe Text+lookupAttr x = lookupAttrBy (x ==)++-- | Lookup the first attribute whose name satisfies the given predicate.+lookupAttrBy :: (QName -> Bool) -> [Attr] -> Maybe Text+lookupAttrBy p as = attrVal `fmap` find (p . attrKey) as++-- | Lookup the value of the first attribute whose name+-- satisfies the given predicate.+findAttrBy :: (QName -> Bool) -> Element -> Maybe Text+findAttrBy p e = lookupAttrBy p (elAttribs e)
+ src/Text/XML/Types.hs view
@@ -0,0 +1,122 @@+{-# LANGUAGE DeriveDataTypeable #-}+{-# LANGUAGE DeriveFoldable #-}+{-# LANGUAGE DeriveFunctor #-}+{-# LANGUAGE DeriveGeneric #-}+{-# LANGUAGE DeriveTraversable #-}+{-# LANGUAGE GeneralizedNewtypeDeriving #-}+++-- |+-- Module : Text.XML.Types+-- Copyright : (c) Galois, Inc. 2007+-- (c) Herbert Valerio Riedel 2019+-- SPDX-License-Identifier: BSD-3-Clause AND GPL-3.0-or-later+--+-- Basic XML types.+--+module Text.XML.Types where++import Common++-- | XML content+data Content+ = Elem Element+ | Text CData+ | CRef !ShortText+ deriving (Show, Typeable, Data, Generic)++instance NFData Content++type Element = Element' Content++-- | XML elements+data Element' cnode = Element+ { elName :: !QName+ , elAttribs :: [Attr]+ , elContent :: [cnode]+ } deriving (Show, Typeable, Data, Generic, Functor, Foldable, Traversable)++instance NFData cnode => NFData (Element' cnode)++-- | XML attributes+data Attr = Attr+ { attrKey :: !QName+ , attrVal :: !Text+ } deriving (Eq, Ord, Show, Typeable, Data, Generic)++instance NFData Attr++-- | XML CData+data CData = CData+ { cdVerbatim :: !CDataKind+ , cdData :: !Text+ } deriving (Show, Typeable, Data, Generic)++instance NFData CData++data CDataKind+ = CDataText -- ^ Ordinary character data; pretty printer escapes &, < etc.+ | CDataVerbatim -- ^ Unescaped character data; pretty printer embeds it in <![CDATA[..+ | CDataRaw -- ^ As-is character data; pretty printer passes it along without any escaping or CDATA wrap-up.+ deriving (Eq, Show, Typeable, Data, Generic)++instance NFData CDataKind++-- | XML qualified names+data QName = QName+ { qLName :: !LName+ , qURI :: Maybe URI+ , qPrefix :: Maybe ShortText+ } deriving (Show, Typeable, Data, Generic)++instance NFData QName++instance Eq QName where+ q1 == q2 = compare q1 q2 == EQ++instance Ord QName where+ compare q1 q2 =+ case compare (qLName q1) (qLName q2) of+ EQ -> case (qURI q1, qURI q2) of+ (Nothing,Nothing) -> compare (qPrefix q1) (qPrefix q2)+ (u1,u2) -> compare u1 u2+ x -> x++-- | XML local names+newtype LName = LName { unLName :: ShortText }+ deriving (Show, Ord, Eq, Typeable, Data, IsString, NFData, Generic)++-- | URIs resembling @anyURI@+newtype URI = URI { unURI :: ShortText }+ deriving (Show, Ord, Eq, Typeable, Data, IsString, NFData, Generic)++-- | Position expressed in number of code-points+--+-- A negative value denotes EOF+type Pos = Int+++-- blank elements --------------------------------------------------------------++-- | Blank names+blank_name :: QName+blank_name = QName+ { qLName = LName mempty+ , qURI = Nothing+ , qPrefix = Nothing+ }++-- | Blank cdata+blank_cdata :: CData+blank_cdata = CData+ { cdVerbatim = CDataText+ , cdData = mempty+ }++-- | Blank elements+blank_element :: Element+blank_element = Element+ { elName = blank_name+ , elAttribs = mempty+ , elContent = mempty+ }