microaeson (empty) → 0.1.0.0
raw patch · 7 files changed
+1549/−0 lines, 7 filesdep +QuickCheckdep +aesondep +arraysetup-changed
Dependencies added: QuickCheck, aeson, array, base, bytestring, containers, deepseq, microaeson, quickcheck-instances, tasty, tasty-quickcheck, text, unordered-containers, vector
Files
- LICENSE +674/−0
- Setup.hs +2/−0
- microaeson.cabal +88/−0
- src-tests/tests.hs +72/−0
- src/Data/Aeson/Micro.hs +540/−0
- src/Data/Aeson/Micro/Parser.hs +74/−0
- src/Data/Aeson/Micro/Scanner.x +99/−0
+ LICENSE 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
+ microaeson.cabal view
@@ -0,0 +1,88 @@+cabal-version: 2.0+name: microaeson+version: 0.1.0.0++synopsis: A tiny JSON library with light dependency footprint+license: GPL-3+license-file: LICENSE+author: Herbert Valerio Riedel+maintainer: hvr@gnu.org+category: Text, Web, JSON+build-type: Simple+description: {++@microaeson@ aims to provide a [RFC 8259](https://tools.ietf.org/html/rfc8259) compliant JavaScript Object Notation (JSON) implementation.++The [microaeson](https://hackage.haskell.org/package/microaeson) package provides a smaller subset of the [aeson](https://hackage.haskell.org/package/aeson) API with less dependencies and a simpler implementation.+.+The API is designed in such a way to allow to easily convert client code written against @microaeson@'s API to use the full [aeson](https://hackage.haskell.org/package/aeson) API.++}++source-repository head+ type: git+ location: https://github.com/hvr/microaeson.git++library+ default-language: Haskell2010+ other-extensions: CPP+ DeriveDataTypeable+ DeriveGeneric+ FlexibleInstances+ GeneralizedNewtypeDeriving+ MagicHash+ OverloadedStrings++ hs-source-dirs: src++ exposed-modules: Data.Aeson.Micro+ other-modules: Data.Aeson.Micro.Parser+ Data.Aeson.Micro.Scanner++ build-depends: array ^>= 0.5.1.0+ , base ^>= 4.8.0.0+ || ^>= 4.9.0.0+ || ^>= 4.10.0.0+ || ^>= 4.11.0.0+ , bytestring ^>= 0.10.6.0+ , containers ^>= 0.5.6.2+ , deepseq ^>= 1.4.1.1+ , text ^>= 1.2.2.2++ build-tools: alex ^>= 3.2.0++ ghc-options: -Wall++ if impl(ghc >= 8.0)+ ghc-options: -Wcompat -Wnoncanonical-monad-instances -Wnoncanonical-monadfail-instances++test-suite microaeson+ default-language: Haskell2010++ hs-source-dirs: src-tests+ main-is: tests.hs++ type: exitcode-stdio-1.0++ -- internal dependency+ build-depends: microaeson++ -- constraints inherited via lib:microaeson component+ build-depends: base+ , bytestring+ , containers++ -- dependencies requiring constraints+ build-depends: aeson ^>= 1.3.1.0+ , QuickCheck ^>= 2.11.3+ , quickcheck-instances ^>= 0.3.16+ , tasty ^>= 1.0.1.1+ , tasty-quickcheck ^>= 0.10+ , text ^>= 1.2.2.2+ , unordered-containers ^>= 0.2.8.0+ , vector ^>= 0.12.0.1++ ghc-options: -Wall++ if impl(ghc >= 8.0)+ ghc-options: -Wcompat -Wnoncanonical-monad-instances -Wnoncanonical-monadfail-instances
+ src-tests/tests.hs view
@@ -0,0 +1,72 @@+{-# OPTIONS_GHC -fno-warn-orphans #-}++module Main where++import qualified Data.HashMap.Strict as HM+import qualified Data.Map.Strict as Map+import qualified Data.Vector as V++import Test.Tasty+import Test.Tasty.QuickCheck as QC+import Test.QuickCheck.Instances ()++import qualified Data.Aeson as REF+import qualified Data.Aeson.Micro as IUT++main :: IO ()+main = defaultMain tests++tests :: TestTree+tests = testGroup "Tests" [qcProps]+ where+ qcProps = testGroup "QC"+ [ QC.testProperty "roundtrip(ref/ref)" $+ \x -> (fmap fromAeson . REF.decode . REF.encode . toAeson) x == Just x++ , QC.testProperty "roundtrip(ref/iut)" $+ \x -> (fmap fromAeson . REF.decode . IUT.encode) x == Just x++ , QC.testProperty "roundtrip(iut/ref)" $+ \x -> (IUT.decode . REF.encode . toAeson) x == Just x++ , QC.testProperty "roundtrip(iut/iut)" $+ \x -> (IUT.decodeStrict . IUT.encodeStrict) x == Just (x :: IUT.Value)+ ]+++instance Arbitrary IUT.Value where+ arbitrary = sized value+ where+ value 0 = oneof [ IUT.String <$> arbitrary+ , IUT.Number <$> arbitrary+ , IUT.Bool <$> arbitrary+ , pure IUT.Null+ ]+ value n | n>0+ = oneof [ IUT.String <$> arbitrary+ , IUT.Number <$> arbitrary+ , IUT.Bool <$> arbitrary+ , pure IUT.Null+ , IUT.Array <$> resize ((10*n) `div` 14) arbitrary+ , IUT.Object <$> resize ((10*n) `div` 14) arbitrary+ ]+ | otherwise = pure IUT.Null+++toAeson :: IUT.Value -> REF.Value+toAeson j = case j of+ IUT.String t -> REF.String t+ IUT.Number n -> REF.toJSON n+ IUT.Bool b -> REF.Bool b+ IUT.Null -> REF.Null+ IUT.Array l -> REF.Array (V.fromList (map toAeson l))+ IUT.Object m -> REF.object [ (k, toAeson v) | (k,v) <- Map.toList m ]++fromAeson :: REF.Value -> IUT.Value+fromAeson j = case j of+ REF.String t -> IUT.String t+ REF.Bool b -> IUT.Bool b+ REF.Null -> IUT.Null+ REF.Number s -> IUT.Number (realToFrac s)+ REF.Array v -> IUT.Array (map fromAeson (V.toList v))+ REF.Object m -> IUT.object [ (k, fromAeson v) | (k,v) <- HM.toList m ]
+ src/Data/Aeson/Micro.hs view
@@ -0,0 +1,540 @@+{-# LANGUAGE DeriveDataTypeable #-}+{-# LANGUAGE DeriveGeneric #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE GeneralizedNewtypeDeriving #-}+{-# LANGUAGE OverloadedStrings #-}++-- | Minimal JavaScript Object Notation (JSON) support as per <https://tools.ietf.org/html/rfc8259 RFC 8259>.+--+-- This API provides a subset (with a couple of divergences; see below) of+-- [aeson API](https://hackage.haskell.org/package/aeson/docs/Data-Aeson.html)+-- but puts the emphasis on simplicity rather than performance and features.+--+-- The 'ToJSON' and 'FromJSON' instances are intended to have an encoding+-- compatible with @aeson@'s encoding.+--+-- == Limitations and divergences from @aeson@'s API+--+-- In order to reduce the dependency footprint and keep the code+-- simpler, the following divergences from the @aeson@ API have to be+-- made:+--+-- * There are no `FromJSON`/`ToJSON` instances for `Char` & `String`.+-- * The type synonym (& the constructor of the same name) 'Object' uses @containers@'s 'Map.Map' rather than a 'HashMap' @unordered-containers@.+-- * 'Array' is represented by an ordinary list rather than a 'Vector' from the @vector@ package.+-- * 'Number' uses 'Double' instead of 'Scientific'+--+module Data.Aeson.Micro+ ( -- * Core JSON types+ Value(..)+ , Object+ , Pair++ -- ** Constructors+ , (.=)+ , object+ , emptyArray+ , emptyObject++ -- ** Accessors+ , (.:)+ , (.:?)+ , (.:!)+ , (.!=)++ -- * Encoding and decoding+ , encode+ , encodeStrict+ , encodeToBuilder++ , decodeStrict+ , decode++ , decodeStrictN++ -- * Prism-style parsers+ , withObject+ , withText+ , withArray+ , withNumber+ , withBool++ -- * Type conversion+ , FromJSON(parseJSON)+ , Parser, parseMaybe+ , ToJSON(toJSON)++ ) where++import Control.Monad+import Data.Char+import Data.Data (Data)+import Data.Int+import Data.List+import Data.Monoid+import Data.String+import Data.Typeable (Typeable)+import Data.Word+import GHC.Generics (Generic)++import Control.DeepSeq+import qualified Data.ByteString as BS+import Data.ByteString.Builder (Builder)+import qualified Data.ByteString.Builder as BB+import qualified Data.ByteString.Lazy as BS.Lazy+import qualified Data.Map.Strict as Map+import Data.Text (Text)+import qualified Data.Text as T+import qualified Data.Text.Encoding as T+import qualified Data.Text.Lazy as TL++import Data.Aeson.Micro.Parser+import Data.Aeson.Micro.Scanner (Lexeme (..), scanLexemes)++-- TODO: We may want to replace 'String' with 'Text' or 'ByteString'++-- | A JSON value represented as a Haskell value.+data Value = Object !Object+ | Array [Value]+ | String !Text+ | Number !Double+ | Bool !Bool+ | Null+ deriving (Eq, Read, Show, Generic, Data, Typeable)++instance NFData Value++instance IsString Value where+ fromString = String . fromString++-- | A key\/value pair for an 'Object'+type Pair = (Text, Value)++-- | A JSON \"object\" (key/value map).+type Object = Map.Map Text Value++infixr 8 .=++-- | A key-value pair for encoding a JSON object.+(.=) :: ToJSON v => Text -> v -> Pair+k .= v = (k, toJSON v)++-- | Create a 'Value' from a list of name\/value 'Pair's.+object :: [Pair] -> Value+object = Object . Map.fromList++-- | The empty JSON 'Object' (i.e. @{}@).+emptyObject :: Value+emptyObject = Object mempty++-- | The empty JSON 'Array' (i.e. @[]@).+emptyArray :: Value+emptyArray = Array mempty++----------------------------------------------------------------------------++(.:) :: FromJSON a => Object -> Text -> Parser a+m .: k = maybe (pfail "key not found") parseJSON (Map.lookup k m)++(.:?) :: FromJSON a => Object -> Text -> Parser (Maybe a)+m .:? k = maybe (pure Nothing) parseJSON (Map.lookup k m)++(.:!) :: FromJSON a => Object -> Text -> Parser (Maybe a)+m .:! k = maybe (pure Nothing) (fmap Just . parseJSON) (Map.lookup k m)++(.!=) :: Parser (Maybe a) -> a -> Parser a+mv .!= def = fmap (maybe def id) mv++----------------------------------------------------------------------------++-- | A type that can be converted to JSON.+class ToJSON a where+ -- | Convert a Haskell value to a JSON-friendly intermediate type.+ toJSON :: a -> Value++instance ToJSON () where+ toJSON () = Array []++instance ToJSON Value where+ toJSON = id++instance ToJSON Bool where+ toJSON = Bool++instance ToJSON a => ToJSON [a] where+ toJSON = Array . map toJSON++instance ToJSON v => ToJSON (Map.Map Text v) where+ toJSON = Object . Map.map toJSON++instance ToJSON a => ToJSON (Maybe a) where+ toJSON Nothing = Null+ toJSON (Just a) = toJSON a++instance (ToJSON a,ToJSON b) => ToJSON (a,b) where+ toJSON (a,b) = Array [toJSON a, toJSON b]++instance (ToJSON a,ToJSON b,ToJSON c) => ToJSON (a,b,c) where+ toJSON (a,b,c) = Array [toJSON a, toJSON b, toJSON c]++instance (ToJSON a,ToJSON b,ToJSON c, ToJSON d) => ToJSON (a,b,c,d) where+ toJSON (a,b,c,d) = Array [toJSON a, toJSON b, toJSON c, toJSON d]++instance ToJSON Text where+ toJSON = String++instance ToJSON TL.Text where+ toJSON = toJSON . TL.toStrict++instance ToJSON Float where+ toJSON = Number . realToFrac++instance ToJSON Double where+ toJSON = Number++instance ToJSON Int where toJSON = Number . realToFrac+instance ToJSON Int8 where toJSON = Number . realToFrac+instance ToJSON Int16 where toJSON = Number . realToFrac+instance ToJSON Int32 where toJSON = Number . realToFrac++instance ToJSON Word where toJSON = Number . realToFrac+instance ToJSON Word8 where toJSON = Number . realToFrac+instance ToJSON Word16 where toJSON = Number . realToFrac+instance ToJSON Word32 where toJSON = Number . realToFrac++-- | Possibly lossy due to conversion to 'Double'+instance ToJSON Int64 where toJSON = Number . realToFrac++-- | Possibly lossy due to conversion to 'Double'+instance ToJSON Word64 where toJSON = Number . realToFrac++-- | Possibly lossy due to conversion to 'Double'+instance ToJSON Integer where toJSON = Number . fromInteger++------------------------------------------------------------------------------+-- 'BB.Builder'-based encoding++-- | Serialise value as JSON/UTF-8-encoded strict 'BS.ByteString'+encodeStrict :: ToJSON a => a -> BS.ByteString+encodeStrict = BS.Lazy.toStrict . encode++-- | Serialise value as JSON/UTF-8-encoded lazy 'BS.Lazy.ByteString'+encode :: ToJSON a => a -> BS.Lazy.ByteString+encode = BB.toLazyByteString . encodeToBuilder++-- | Serialise value as JSON/UTF8-encoded 'Builder'+encodeToBuilder :: ToJSON a => a -> Builder+encodeToBuilder = encodeValueBB . toJSON++encodeValueBB :: Value -> Builder+encodeValueBB jv = case jv of+ Bool True -> "true"+ Bool False -> "false"+ Null -> "null"+ Number n+ | isNaN n || isInfinite n -> encodeValueBB Null+ | Just i <- doubleToInt64 n -> BB.int64Dec i+ | otherwise -> BB.doubleDec n+ Array a -> encodeArrayBB a+ String s -> encodeStringBB s+ Object o -> encodeObjectBB o++encodeArrayBB :: [Value] -> Builder+encodeArrayBB [] = "[]"+encodeArrayBB jvs = BB.char8 '[' <> go jvs <> BB.char8 ']'+ where+ go = Data.Monoid.mconcat . intersperse (BB.char8 ',') . map encodeValueBB++encodeObjectBB :: Object -> Builder+encodeObjectBB m+ | Map.null m = "{}"+ | otherwise = BB.char8 '{' <> go jvs <> BB.char8 '}'+ where+ jvs = Map.toList m+ go = Data.Monoid.mconcat . intersperse (BB.char8 ',') . map encPair+ encPair (l,x) = encodeStringBB l <> BB.char8 ':' <> encodeValueBB x++encodeStringBB :: Text -> Builder+encodeStringBB str = BB.char8 '"' <> go str <> BB.char8 '"'+ where+ go = T.encodeUtf8Builder . escapeText++------------------------------------------------------------------------------+-- helpers++-- | Try to convert 'Double' into 'Int64', return 'Nothing' if not+-- representable loss-free as integral 'Int64' value.+doubleToInt64 :: Double -> Maybe Int64+doubleToInt64 x+ | fromInteger x' == x+ , x' <= toInteger (maxBound :: Int64)+ , x' >= toInteger (minBound :: Int64)+ = Just (fromIntegral x')+ | otherwise = Nothing+ where+ x' = round x++-- | Minimally escape a 'String' in accordance with [RFC 8259, "7. Strings"](https://tools.ietf.org/html/rfc8259#section-7)+escapeText :: Text -> Text+escapeText s+ | not (T.any needsEscape s) = s+ | otherwise = (T.pack . escape . T.unpack) s+ where+ escape [] = []+ escape (x:xs) = case x of+ '\\' -> '\\':'\\':escape xs+ '"' -> '\\':'"':escape xs+ '\b' -> '\\':'b':escape xs+ '\f' -> '\\':'f':escape xs+ '\n' -> '\\':'n':escape xs+ '\r' -> '\\':'r':escape xs+ '\t' -> '\\':'t':escape xs+ c | ord c < 0x10 -> '\\':'u':'0':'0':'0':intToDigit (ord c):escape xs+ | ord c < 0x20 -> '\\':'u':'0':'0':'1':intToDigit (ord c - 0x10):escape xs+ | otherwise -> c : escape xs++ -- unescaped = %x20-21 / %x23-5B / %x5D-10FFFF+ needsEscape c = ord c < 0x20 || c `elem` ['\\','"']++----------------------------------------------------------------------------+----------------------------------------------------------------------------++-- | JSON Parser 'Monad' used by 'FromJSON'+newtype Parser a = P { unP :: Maybe a }+ deriving (Functor,Applicative,Monad)++-- | Run 'Parser'.+--+-- A common use-case is @'parseMaybe' 'parseJSON'@.+parseMaybe :: (a -> Parser b) -> a -> Maybe b+parseMaybe m v = unP (m v)++pfail :: String -> Parser a+pfail _ = P Nothing++-- | A type that JSON can be deserialised into+class FromJSON a where+ -- | Decode a JSON value into a native Haskell type+ parseJSON :: Value -> Parser a++instance FromJSON Value where+ parseJSON = pure++instance FromJSON Bool where+ parseJSON = withBool "Bool" pure++instance FromJSON Text where+ parseJSON = withText "Text" pure++instance FromJSON TL.Text where+ parseJSON = withText "Text" (pure . TL.fromStrict)++instance FromJSON a => FromJSON [a] where+ parseJSON = withArray "[a]" (mapM parseJSON)++instance FromJSON Double where+ parseJSON Null = pure (0/0)+ parseJSON j = withNumber "Double" pure j++instance FromJSON Float where+ parseJSON Null = pure (0/0)+ parseJSON j = withNumber "Float" (pure . realToFrac) j++-- FIXME: lossy conversions++instance FromJSON Integer where+ parseJSON = withNumber "Int" (pure . round)++instance FromJSON Int where+ parseJSON = withNumber "Int" (pure . fromInteger . round)++instance FromJSON Int8 where+ parseJSON = withNumber "Int8" (pure . fromInteger . round)++instance FromJSON Int16 where+ parseJSON = withNumber "Int16" (pure . fromInteger . round)++instance FromJSON Int32 where+ parseJSON = withNumber "Int32" (pure . fromInteger . round)++instance FromJSON Int64 where+ parseJSON = withNumber "Int64" (pure . fromInteger . round)++instance FromJSON Word where+ parseJSON = withNumber "Word" (pure . fromInteger . round)++instance FromJSON Word8 where+ parseJSON = withNumber "Word8" (pure . fromInteger . round)++instance FromJSON Word16 where+ parseJSON = withNumber "Word16" (pure . fromInteger . round)++instance FromJSON Word32 where+ parseJSON = withNumber "Word32" (pure . fromInteger . round)++instance FromJSON Word64 where+ parseJSON = withNumber "Word64" (pure . fromInteger . round)+++instance FromJSON () where+ parseJSON = withArray "()" $ \lst ->+ case lst of+ [] -> pure ()+ _ -> pfail "expected ()"++instance (FromJSON a, FromJSON b) => FromJSON (a,b) where+ parseJSON = withArray "(a,b)" $ \lst ->+ case lst of+ [a,b] -> liftM2 (,) (parseJSON a) (parseJSON b)+ _ -> pfail "expected (a,b)"++instance (FromJSON a, FromJSON b, FromJSON c) => FromJSON (a,b,c) where+ parseJSON = withArray "(a,b,c)" $ \lst ->+ case lst of+ [a,b,c] -> liftM3 (,,) (parseJSON a) (parseJSON b) (parseJSON c)+ _ -> pfail "expected (a,b,c)"++instance (FromJSON a, FromJSON b, FromJSON c, FromJSON d) => FromJSON (a,b,c,d) where+ parseJSON = withArray "(a,b,c,d)" $ \lst ->+ case lst of+ [a,b,c,d] -> liftM4 (,,,) (parseJSON a) (parseJSON b) (parseJSON c) (parseJSON d)+ _ -> pfail "expected (a,b,c,d)"++instance FromJSON a => FromJSON (Maybe a) where+ parseJSON Null = pure Nothing+ parseJSON j = Just <$> parseJSON j++instance FromJSON Ordering where+ parseJSON = withText "{'LT','EQ','GT'}" $ \s ->+ case s of+ "LT" -> pure LT+ "EQ" -> pure EQ+ "GT" -> pure GT+ _ -> pfail "expected {'LT','EQ','GT'}"++instance FromJSON v => FromJSON (Map.Map Text v) where+ parseJSON = withObject "Map Text v" $ mapM parseJSON++-- "prisms"++withBool :: String -> (Bool -> Parser a) -> Value -> Parser a+withBool _ f (Bool arr) = f arr+withBool expected _ v = typeMismatch expected v++withText :: String -> (Text -> Parser a) -> Value -> Parser a+withText _ f (String txt) = f txt+withText expected _ v = typeMismatch expected v++withArray :: String -> ([Value] -> Parser a) -> Value -> Parser a+withArray _ f (Array lst) = f lst+withArray expected _ v = typeMismatch expected v++withObject :: String -> (Object -> Parser a) -> Value -> Parser a+withObject _ f (Object obj) = f obj+withObject expected _ v = typeMismatch expected v++withNumber :: String -> (Double -> Parser a) -> Value -> Parser a+withNumber _ f (Number n) = f n+withNumber expected _ v = typeMismatch expected v++typeMismatch :: String -> Value -> Parser a+typeMismatch expected _ = pfail ("expected " ++ expected)++----------------------------------------------------------------------------++-- | Decode a single JSON document+decode :: FromJSON a => BS.Lazy.ByteString -> Maybe a+decode = decodeStrict . BS.Lazy.toStrict++-- | Decode a single JSON document+decodeStrict :: FromJSON a => BS.ByteString -> Maybe a+decodeStrict bs = do+ v <- decodeValue bs+ unP (parseJSON v)++-- | Decode multiple concatenated JSON documents+decodeStrictN :: FromJSON a => BS.ByteString -> Maybe [a]+decodeStrictN = go [] . scanLexemes+ where+ go acc [] = Just $! reverse acc+ go acc ls = do+ (ls', v) <- parseValue ls+ a <- unP (parseJSON v)+ go (a:acc) ls'++----++type LexStream = [(Lexeme,BS.ByteString)]++decodeValue :: BS.ByteString -> Maybe Value+decodeValue bs = case parseValue (scanLexemes bs) of+ Just ([], v) -> Just v+ _ -> Nothing++parseValue :: LexStream -> Maybe (LexStream, Value)+parseValue = goValue+ where+ goValue :: LexStream -> Maybe (LexStream, Value)+ goValue ((L_True,_):xs) = Just (xs,Bool True)+ goValue ((L_False,_):xs) = Just (xs,Bool False)+ goValue ((L_Null,_):xs) = Just (xs,Null)+ goValue ((L_Number,bs):xs) = (\n->(xs,Number n)) <$> decodeNumber bs+ goValue ((L_StrStart,_):xs) = goString xs+ goValue ((L_ArrStart,_):xs) = goArray xs+ goValue ((L_ObjStart,_):xs) = goObject xs+ goValue _ = Nothing++ goArray :: LexStream -> Maybe (LexStream, Value)+ goArray xs0 = (Array <$>) <$> go0 xs0+ where+ go0 ((L_ArrEnd,_):xs) = pure (xs, [])+ go0 xs = do+ (xs', v) <- goValue xs+ go1 [v] xs'++ go1 acc ((L_ArrEnd,_):xs) = pure (xs, reverse acc)+ go1 acc ((L_Comma, _):xs) = do+ (xs', v) <- goValue xs+ go1 (v:acc) xs'+ go1 _ _ = Nothing++ goObject :: LexStream -> Maybe (LexStream, Value)+ goObject xs0 = ((Object . Map.fromList) <$>) <$> go0 xs0+ where+ go0 ((L_ObjEnd,_):xs) = pure (xs, [])+ go0 xs = do+ ((L_Colon,_):xs', String k) <- goValue xs+ (xs'',v) <- goValue xs'+ go1 [(k,v)] xs''++ go1 acc ((L_ObjEnd,_):xs) = pure (xs, reverse acc)+ go1 acc ((L_Comma, _):xs) = do+ ((L_Colon,_):xs', String k) <- goValue xs+ (xs'',v) <- goValue xs'+ go1 ((k,v):acc) xs''+ go1 _ _ = Nothing++ goString :: LexStream -> Maybe (LexStream, Value)+ goString xs0 = ((String . T.pack) <$>) <$> go [] xs0+ where+ go _ [] = Nothing+ go acc ((lx,chunk):xs) = case lx of+ L_StrEnd -> pure (xs, concat (reverse acc))++ L_StrUnescaped -> do+ s <- decodeUnescaped chunk+ go (s:acc) xs++ L_StrEscaped -> do+ c <- decodeEscaped chunk+ go ([c]:acc) xs++ L_StrEscapedHex -> do+ c <- decodeEscapedHex chunk+ go ([c]:acc) xs++ L_StrEscapedHexSurr -> do+ c <- decodeEscapedHexSurr chunk+ go ([c]:acc) xs++ _ -> Nothing
+ src/Data/Aeson/Micro/Parser.hs view
@@ -0,0 +1,74 @@+module Data.Aeson.Micro.Parser where++import Control.Exception as E+import Control.Monad+import Data.Char+import Data.Word+import qualified GHC.Foreign as GHC+import GHC.IO.Encoding+import System.IO.Unsafe+import Text.Read (readMaybe)++import qualified Data.ByteString as BS+import qualified Data.ByteString.Char8 as BS.Char8++decodeEscapedHex :: BS.ByteString -> Maybe Char+decodeEscapedHex bs = do+ [0x5c,0x75,d1,d2,d3,d4] <- pure (BS.unpack bs)++ let cp = (0x10*((0x10*((0x10 * h2n d1) + h2n d2)) + h2n d3)) + h2n d4++ guard (not (0xd800 <= cp && cp <= 0xdfff))++ pure (chr cp)++decodeEscapedHexSurr :: BS.ByteString -> Maybe Char+decodeEscapedHexSurr bs = do+ [0x5c,0x75,h1,h2,h3,h4,0x5c,0x75,l1,l2,l3,l4] <- pure (BS.unpack bs)++ let hsurr = (0x10*((0x10*((0x10 * h2n h1) + h2n h2)) + h2n h3)) + h2n h4+ lsurr = (0x10*((0x10*((0x10 * h2n l1) + h2n l2)) + h2n l3)) + h2n l4++ guard ((0xd800 <= hsurr && hsurr <= 0xdbff) && (0xdc00 <= lsurr && lsurr <= 0xdfff))++ let cp = 0x10000 + ((hsurr-0xd800)*0x400) + (lsurr-0xdc00)++ pure (chr cp)++decodeNumber :: BS.ByteString -> Maybe Double+decodeNumber = readMaybe . BS.Char8.unpack++h2n :: Word8 -> Int+h2n w+ | 0x30 <= w && w <= 0x39 = fromIntegral (w-0x30)+ | 0x41 <= w && w <= 0x46 = fromIntegral (w-0x37)+ | 0x61 <= w && w <= 0x66 = fromIntegral (w-0x57)+ | otherwise = undefined++decodeEscaped :: BS.ByteString -> Maybe Char+decodeEscaped bs = do+ [0x5c,c] <- pure (BS.unpack bs)+ case c of+ 0x22 -> pure '\x22'+ 0x5c -> pure '\x5c'+ 0x2f -> pure '\x2f'+ 0x62 -> pure '\x08'+ 0x66 -> pure '\x0c'+ 0x6e -> pure '\x0a'+ 0x72 -> pure '\x0d'+ 0x74 -> pure '\x09'+ _ -> Nothing++decodeUnescaped :: BS.ByteString -> Maybe String+decodeUnescaped = decodeString utf8++decodeString :: TextEncoding -> BS.ByteString -> Maybe String+decodeString te bs = unsafePerformIO (decodeStringIO te bs)++{-# NOINLINE decodeStringIO #-}+decodeStringIO :: TextEncoding -> BS.ByteString -> IO (Maybe String)+decodeStringIO te bs = cvtEx <$> try (BS.useAsCStringLen bs (GHC.peekCStringLen te))+ where+ cvtEx :: Either IOException a -> Maybe a+ cvtEx = either (const Nothing) Just+
+ src/Data/Aeson/Micro/Scanner.x view
@@ -0,0 +1,99 @@+-- -*- haskell -*-+{+module Data.Aeson.Micro.Scanner (Lexeme(..), scanLexemes) where++import qualified Data.ByteString as B+import Data.Word+}++%encoding "latin1"++-- c.f. RFC 7159++$ws = [\x20\x09\x0a\x0d]++-- unescaped = %x20-21 / %x23-5B / %x5D-10FFFF+$escaped = [\x00-\x1f\x22\x5c]+$unescaped = [\x00-\xff] # $escaped++-- zero / ( digit1-9 *DIGIT )+@int = "0"|[1-9][0-9]*++-- decimal-point 1*DIGIT+@frac = "."[0-9]+++-- e [ minus / plus ] 1*DIGIT+@exp = [eE][\-\+]?[0-9]+++-- [ minus ] int [ frac ] [ exp ]+@num = "-"? @int @frac? @exp?++:-++<0> $ws ;+<0> "{" { L_ObjStart }+<0> "}" { L_ObjEnd }+<0> "[" { L_ArrStart }+<0> "]" { L_ArrEnd }+<0> \" { L_StrStart }+<0> \: { L_Colon }+<0> \, { L_Comma }+<0> "true" { L_True }+<0> "false" { L_False }+<0> "null" { L_Null }+<0> @num { L_Number }++<string> [\x22] { L_StrEnd }+<string> $unescaped+ { L_StrUnescaped }+<string> \\[\x22\x5c\x2f\x62\x66\x6e\x72\x74] { L_StrEscaped }++<string> \\"u"[0-9a-cA-CefEF][0-9a-fA-F]{3} { L_StrEscapedHex }+<string> \\"u"[dD][0-7][0-9a-fA-F]{2} { L_StrEscapedHex }+<string> \\"u"[dD][89abAB][0-9a-fA-F]{2} \\"u"[dD][c-fC-F][0-9a-fA-F]{2} { L_StrEscapedHexSurr }++{+data Lexeme+ = L_ArrStart+ | L_ArrEnd+ | L_Colon+ | L_Comma+ | L_False+ | L_Null+ | L_Number+ | L_ObjStart+ | L_ObjEnd+ | L_StrStart+ | L_StrEnd+ | L_StrEscaped+ | L_StrEscapedHex+ | L_StrEscapedHexSurr+ | L_StrUnescaped+ | L_True+ | L_LexError+ deriving (Eq,Ord,Show)++type AlexInput = B.ByteString++alexGetByte :: AlexInput -> Maybe (Word8,AlexInput)+alexGetByte = B.uncons++-- alexInputPrevChar :: AlexInput -> Char++-- generated by @alex@+alexScan :: AlexInput -> Int -> AlexReturn Lexeme++scanLexemes :: B.ByteString -> [(Lexeme, B.ByteString)]+scanLexemes = go False+ where+ go inStr bs = case alexScan bs (if inStr then string else 0) of+ AlexEOF -> []+ AlexError inp' -> [(L_LexError,inp')]+ AlexSkip inp' _len -> go inStr inp'+ AlexToken inp' len L_StrUnescaped -- workaround for https://github.com/simonmar/alex/issues/119+ | B.length bs - B.length inp' > len+ -> (L_StrUnescaped,B.take (B.length bs - B.length inp') bs)+ : go inStr inp'+ AlexToken inp' len act+ -> (act,B.take len bs)+ : go (if inStr then act /= L_StrEnd else act == L_StrStart) inp'+}