PKGS := \
symantic-grammar \
- symantic-document \
symantic \
symantic-lib
HS = $(shell find $(PKGS) -name '*.hs' -not -name 'HLint.hs')
HLint.hs: $(HS)
sed -i -e '/^-- BEGIN: generated hints/,/^-- END: Generated by hlint/d' HLint.hs
echo '-- BEGIN: generated hints' >> HLint.hs
- hlint $(foreach p,$(PKGS),--find $p) | grep '^'infix | sort -u >> HLint.hs
+ hlint -XTypeApplications $(foreach p,$(PKGS),--find $p) | sed -ne 's/^- infix: "\([^"]*\)"/\1/p' | sort -u >>HLint.hs
echo '-- END: generated hints' >> HLint.hs
lint: $(PKGS:=/lint) $(HS)
ignore "Use list literal"
-- BEGIN: generated hints
+infix 1 `tyQual`
+infixl 2 `Dup`
+infixl 5 `ebnf_arg`
+infixl 5 `setSource`
+infixl 9 :@
+infixl 9 `tyApp`
+infixr 0 ~>
+infixr 0 :$
+infixr 0 #>
+infixr 2 #
+infixr 2 #~
+infixr 5 ++
+infixr 5 `CtxTeS`
+infixr 5 `CtxTyS`
+infixr 5 `KiFun`
+infixr 5 `TokenS`
+infixr 5 `TypesS`
+infixr 5 `VarS`
-- END: generated hints
+++ /dev/null
- 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>.
+++ /dev/null
-../HLint.hs
\ No newline at end of file
+++ /dev/null
-module Symantic.Document
- ( module Symantic.Document.Sym
- ) where
-import Symantic.Document.Sym
+++ /dev/null
-../HLint.hs
\ No newline at end of file
+++ /dev/null
-{-# LANGUAGE GeneralizedNewtypeDeriving #-}
-module Symantic.Document.Sym where
-
-import Data.Bool
-import Data.Char (Char)
-import Data.Eq (Eq(..))
-import Data.Foldable (Foldable, foldr, foldr1)
-import Data.Function ((.), ($))
-import Data.Functor (Functor(..))
-import Data.Int (Int)
-import Data.Maybe (Maybe(..))
-import Data.Monoid (Monoid(..))
-import Data.Ord (Ord(..), Ordering(..))
-import Data.Semigroup (Semigroup(..))
-import Data.String (String, IsString)
-import Prelude (Integer, fromIntegral, Num(..), pred, undefined, Integral, Real, Enum)
-import Text.Show (Show(..))
-import qualified Data.Foldable as Foldable
-import qualified Data.List as List
-import qualified Data.Text as Text
-import qualified Data.Text.Lazy as TL
-
--- * Type 'Nat'
-newtype Nat = Nat { unNat :: Integer } -- TODO: use GHC's Natural
- deriving (Eq, Ord, Show, Integral, Real, Enum)
-unLength :: Nat -> Integer
-unLength (Nat i) = i
-instance Num Nat where
- fromInteger i | 0 <= i = Nat i
- | otherwise = undefined
- abs = Nat . abs . unLength
- signum = signum . signum
- Nat x + Nat y = Nat (x + y)
- Nat x * Nat y = Nat (x * y)
- Nat x - Nat y | x >= y = Nat (x - y)
- | otherwise = undefined
-
--- * Class 'Lengthable'
-class Lengthable a where
- length :: a -> Nat
-instance Lengthable Char where
- length _ = Nat 1
-instance Lengthable [a] where
- length = Nat . fromIntegral . List.length
-instance Lengthable Text.Text where
- length = Nat . fromIntegral . Text.length
-instance Lengthable TL.Text where
- length = Nat . fromIntegral . TL.length
-
--- * Class 'Splitable'
-class Monoid a => Splitable a where
- null :: a -> Bool
- tail :: a -> a
- break :: (Char -> Bool) -> a -> (a, a)
- lines :: a -> [a]
- lines = splitOnChar (== '\n')
- words :: a -> [a]
- words = splitOnChar (== ' ')
- splitOnChar :: (Char -> Bool) -> a -> [a]
- splitOnChar c a =
- if null a then []
- else let (l,a') = break c a in
- l : if null a' then []
- else let a'' = tail a' in
- if null a'' then [mempty] else splitOnChar c a''
-instance Splitable String where
- null = List.null
- tail = List.tail
- break = List.break
-instance Splitable Text.Text where
- null = Text.null
- tail = Text.tail
- break = Text.break
-instance Splitable TL.Text where
- null = TL.null
- tail = TL.tail
- break = TL.break
-
--- * Type 'Column'
-type Column = Nat
-
--- ** Type 'Indent'
-type Indent = Column
-
--- * Class 'Textable'
-class (IsString d, Semigroup d) => Textable d where
- empty :: d
- charH :: Char -- ^ XXX: MUST NOT be '\n'
- -> d
- stringH :: String -- ^ XXX: MUST NOT contain '\n'
- -> d
- textH :: Text.Text -- ^ XXX: MUST NOT contain '\n'
- -> d
- ltextH :: TL.Text -- ^ XXX: MUST NOT contain '\n'
- -> d
- default empty :: Textable (UnTrans d) => Trans d => d
- default charH :: Textable (UnTrans d) => Trans d => Char -> d
- default stringH :: Textable (UnTrans d) => Trans d => String -> d
- default textH :: Textable (UnTrans d) => Trans d => Text.Text -> d
- default ltextH :: Textable (UnTrans d) => Trans d => TL.Text -> d
- empty = noTrans empty
- charH = noTrans . charH
- stringH = noTrans . stringH
- textH = noTrans . textH
- ltextH = noTrans . ltextH
-
- newline :: d
- space :: d
- -- | @x '<+>' y = x '<>' 'space' '<>' y@
- (<+>) :: d -> d -> d
- -- | @x '</>' y = x '<>' 'newline' '<>' y@
- (</>) :: d -> d -> d
- int :: Int -> d
- integer :: Integer -> d
- char :: Char -> d
- -- | WARNING: trailing spaces @(' ')@ are not made 'breakableSpace's
- string :: String -> d
- -- | WARNING: trailing spaces @(' ')@ are not made 'breakableSpace's
- text :: Text.Text -> d
- -- | WARNING: trailing spaces @(' ')@ are not made 'breakableSpace's
- ltext :: TL.Text -> d
- catH :: Foldable f => f d -> d
- catV :: Foldable f => f d -> d
- unwords :: Foldable f => f d -> d
- unlines :: Foldable f => f d -> d
- foldrWith :: Foldable f => (d -> d -> d) -> f d -> d
- interWith :: Foldable f => (d -> d) -> f d -> d
- intercalate :: Foldable f => d -> f d -> d
- between :: d -> d -> d -> d
- replicate :: Int -> d -> d
-
- newline = "\n"
- space = char ' '
- x <+> y = x <> space <> y
- x </> y = x <> newline <> y
- int = stringH . show
- integer = stringH . show
- char = \case '\n' -> newline; c -> charH c
- default string :: Breakable d => String -> d
- default text :: Breakable d => Text.Text -> d
- default ltext :: Breakable d => TL.Text -> d
- string = catV . fmap ((breakableSpaces . (fmap stringH) . words)) . lines
- text = catV . fmap ((breakableSpaces . (fmap textH) . words)) . lines
- ltext = catV . fmap ((breakableSpaces . (fmap ltextH) . words)) . lines
- catH = foldr (<>) empty
- catV = foldrWith (\x y -> x<>newline<>y)
- unwords = foldrWith (\x y -> x<>space<>y)
- unlines = foldr (\x y -> x<>newline<>y) empty
- foldrWith f ds = if Foldable.null ds then empty else foldr1 f ds
- interWith f = foldrWith $ \a acc -> a <> f acc
- intercalate sep = foldrWith (\x y -> x<>sep<>y)
- between o c d = o<>d<>c
- replicate cnt t | cnt <= 0 = empty
- | otherwise = t <> replicate (pred cnt) t
-
--- * Class 'Indentable'
-class Textable d => Indentable d where
- -- | @('align' d)@ make @d@ uses current 'Column' as 'Indent' level.
- align :: d -> d
- default align :: Indentable (UnTrans d) => Trans d => d -> d
- align = noTrans1 align
- -- | @('incrIndent' ind d)@ make @d@ uses current 'Indent' plus @ind@ as 'Indent' level.
- incrIndent :: Indent -> d -> d
- default incrIndent :: Indentable (UnTrans d) => Trans d => Indent -> d -> d
- incrIndent = noTrans1 . incrIndent
- -- | @('withIndent' ind d)@ make @d@ uses @ind@ as 'Indent' level.
- withIndent :: Indent -> d -> d
- default withIndent :: Indentable (UnTrans d) => Trans d => Indent -> d -> d
- withIndent = noTrans1 . withIndent
- -- | @('withNewline' nl d)@ make @d@ uses @nl@ as 'newline'.
- --
- -- Useful values for @nl@ are: 'empty', 'newlineWithIndent', 'newlineWithoutIndent'.
- withNewline :: d -> d -> d
- newlineWithoutIndent :: d
- newlineWithIndent :: d
- default withNewline :: Indentable (UnTrans d) => Trans d => d -> d -> d
- default newlineWithoutIndent :: Indentable (UnTrans d) => Trans d => d
- default newlineWithIndent :: Indentable (UnTrans d) => Trans d => d
- withNewline = noTrans2 withNewline
- newlineWithoutIndent = noTrans newlineWithoutIndent
- newlineWithIndent = noTrans newlineWithIndent
- -- | @('column' f)@ write @f@ applied to the current 'Column'.
- column :: (Column -> d) -> d
- default column :: Indentable (UnTrans d) => Trans d => (Column -> d) -> d
- column f = noTrans $ column (unTrans . f)
- -- | @('indent' f)@ write @f@ applied to the current 'Indent'.
- indent :: (Indent -> d) -> d
- default indent :: Indentable (UnTrans d) => Trans d => (Indent -> d) -> d
- indent f = noTrans $ indent (unTrans . f)
-
- -- | @('hang' ind d)@ make @d@ uses current 'Column' plus @ind@ as 'Indent' level.
- hang :: Indent -> d -> d
- hang ind = align . incrIndent ind
-
- -- | @('endToEndWidth' d f)@ write @d@ then
- -- @f@ applied to the absolute value of the difference between
- -- the end 'Column' and start 'Column' of @d@.
- --
- -- Note that @f@ is given the end-to-end width,
- -- which is not necessarily the maximal width.
- endToEndWidth :: d -> (Column -> d) -> d
- endToEndWidth d f =
- column $ \c1 ->
- (d <>) $
- column $ \c2 ->
- f $ if c2 - c1 >= 0
- then c2 - c1
- else c1 - c2
-
- -- | @'spaces' ind = 'replicate' ind 'space'@
- spaces :: Indent -> d
- spaces i = replicate (fromIntegral i) space
-
- -- | @('fill' ind d)@ write @d@,
- -- then if @d@ is not wider than @ind@,
- -- write the difference with 'spaces'.
- fill :: Indent -> d -> d
- fill m d =
- endToEndWidth d $ \w ->
- case w`compare`m of
- LT -> spaces $ m - w
- _ -> empty
-
- -- | @('breakableFill' ind d)@ write @d@,
- -- then if @d@ is not wider than @ind@, write the difference with 'spaces'
- -- otherwise write a 'newline' indented to to the start 'Column' of @d@ plus @ind@.
- breakableFill :: Indent -> d -> d
- breakableFill m d =
- column $ \c ->
- endToEndWidth d $ \w ->
- case w`compare`m of
- LT -> spaces (m - w)
- EQ -> empty
- GT -> withIndent (c + m) newline
-
--- * Class 'Breakable'
-class (Textable d, Indentable d) => Breakable d where
- -- | @('breakable' f)@ write @f@ applied to whether breaks are activated or not.
- breakable :: (Maybe Column -> d) -> d
- default breakable :: Breakable (UnTrans d) => Trans d => (Maybe Column -> d) -> d
- breakable f = noTrans $ breakable (unTrans . f)
- -- | @('withBreakable' b d)@ whether to active breaks or not within @d@.
- withBreakable :: Maybe Column -> d -> d
- default withBreakable :: Breakable (UnTrans d) => Trans d => Maybe Column -> d -> d
- withBreakable = noTrans1 . withBreakable
-
- -- | @('ifBreak' onWrap onNoWrap)@
- -- write @onWrap@ if @onNoWrap@ leads to a 'Column'
- -- greater or equal to the one sets with 'withBreakable',
- -- otherwise write @onNoWrap@.
- ifBreak :: d -> d -> d
- default ifBreak :: Breakable (UnTrans d) => Trans d => d -> d -> d
- ifBreak = noTrans2 ifBreak
- -- | @('breakpoint' onNoBreak onBreak d)@
- -- write @onNoBreak@ then @d@ if they fit,
- -- @onBreak@ otherwise.
- breakpoint :: d -> d -> d -> d
- default breakpoint :: Breakable (UnTrans d) => Trans d => d -> d -> d -> d
- breakpoint = noTrans3 breakpoint
-
- -- | @('breakableEmpty' d)@ write @d@ if it fits, 'newline' then @d@ otherwise.
- breakableEmpty :: d -> d
- breakableEmpty = breakpoint empty newline
-
- -- | @x '><' y = x '<>' 'breakableEmpty' y@
- (><) :: d -> d -> d
- x >< y = x <> breakableEmpty y
-
- -- | @('breakableSpace' d)@ write 'space' then @d@ it they fit,
- -- 'newline' then @d@ otherwise.
- breakableSpace :: d -> d
- breakableSpace = breakpoint space newline
-
- -- | @x '>+<' y = x '<>' 'breakableSpace' y@
- (>+<) :: d -> d -> d
- x >+< y = x <> breakableSpace y
-
- -- | @'breakableSpaces' ds@ intercalate a 'breakableSpace'
- -- between items of @ds@.
- breakableSpaces :: Foldable f => f d -> d
- breakableSpaces = interWith breakableSpace
-
- -- | @('intercalateHorV' sep ds)@
- -- write @ds@ with @sep@ intercalated if the whole fits,
- -- otherwise write 'align' of @ds@ with 'newline' and @sep@ intercalated.
- intercalateHorV :: Foldable f => d -> f d -> d
- intercalateHorV sep xs =
- ifBreak
- (align $ interWith ((newline <> sep) <>) xs)
- (interWith (sep <>) xs)
-
--- * Class 'Colorable'
-class Colorable d where
- -- | @('colorable' f)@ write @f@ applied to whether colors are activated or not.
- colorable :: (Bool -> d) -> d
- default colorable :: Colorable (UnTrans d) => Trans d => (Bool -> d) -> d
- colorable f = noTrans $ colorable (unTrans . f)
- -- | @('withColor' b d)@ whether to active colors or not within @d@.
- withColorable :: Bool -> d -> d
- default withColorable :: Colorable (UnTrans d) => Trans d => Bool -> d -> d
- withColorable = noTrans1 . withColorable
-
- reverse :: d -> d
-
- -- Foreground colors
- -- Dull
- black :: d -> d
- red :: d -> d
- green :: d -> d
- yellow :: d -> d
- blue :: d -> d
- magenta :: d -> d
- cyan :: d -> d
- white :: d -> d
-
- -- Vivid
- blacker :: d -> d
- redder :: d -> d
- greener :: d -> d
- yellower :: d -> d
- bluer :: d -> d
- magentaer :: d -> d
- cyaner :: d -> d
- whiter :: d -> d
-
- -- Background colors
- -- Dull
- onBlack :: d -> d
- onRed :: d -> d
- onGreen :: d -> d
- onYellow :: d -> d
- onBlue :: d -> d
- onMagenta :: d -> d
- onCyan :: d -> d
- onWhite :: d -> d
-
- -- Vivid
- onBlacker :: d -> d
- onRedder :: d -> d
- onGreener :: d -> d
- onYellower :: d -> d
- onBluer :: d -> d
- onMagentaer :: d -> d
- onCyaner :: d -> d
- onWhiter :: d -> d
-
- default reverse :: Colorable (UnTrans d) => Trans d => d -> d
- default black :: Colorable (UnTrans d) => Trans d => d -> d
- default red :: Colorable (UnTrans d) => Trans d => d -> d
- default green :: Colorable (UnTrans d) => Trans d => d -> d
- default yellow :: Colorable (UnTrans d) => Trans d => d -> d
- default blue :: Colorable (UnTrans d) => Trans d => d -> d
- default magenta :: Colorable (UnTrans d) => Trans d => d -> d
- default cyan :: Colorable (UnTrans d) => Trans d => d -> d
- default white :: Colorable (UnTrans d) => Trans d => d -> d
- default blacker :: Colorable (UnTrans d) => Trans d => d -> d
- default redder :: Colorable (UnTrans d) => Trans d => d -> d
- default greener :: Colorable (UnTrans d) => Trans d => d -> d
- default yellower :: Colorable (UnTrans d) => Trans d => d -> d
- default bluer :: Colorable (UnTrans d) => Trans d => d -> d
- default magentaer :: Colorable (UnTrans d) => Trans d => d -> d
- default cyaner :: Colorable (UnTrans d) => Trans d => d -> d
- default whiter :: Colorable (UnTrans d) => Trans d => d -> d
- default onBlack :: Colorable (UnTrans d) => Trans d => d -> d
- default onRed :: Colorable (UnTrans d) => Trans d => d -> d
- default onGreen :: Colorable (UnTrans d) => Trans d => d -> d
- default onYellow :: Colorable (UnTrans d) => Trans d => d -> d
- default onBlue :: Colorable (UnTrans d) => Trans d => d -> d
- default onMagenta :: Colorable (UnTrans d) => Trans d => d -> d
- default onCyan :: Colorable (UnTrans d) => Trans d => d -> d
- default onWhite :: Colorable (UnTrans d) => Trans d => d -> d
- default onBlacker :: Colorable (UnTrans d) => Trans d => d -> d
- default onRedder :: Colorable (UnTrans d) => Trans d => d -> d
- default onGreener :: Colorable (UnTrans d) => Trans d => d -> d
- default onYellower :: Colorable (UnTrans d) => Trans d => d -> d
- default onBluer :: Colorable (UnTrans d) => Trans d => d -> d
- default onMagentaer :: Colorable (UnTrans d) => Trans d => d -> d
- default onCyaner :: Colorable (UnTrans d) => Trans d => d -> d
- default onWhiter :: Colorable (UnTrans d) => Trans d => d -> d
-
- reverse = noTrans1 reverse
- black = noTrans1 black
- red = noTrans1 red
- green = noTrans1 green
- yellow = noTrans1 yellow
- blue = noTrans1 blue
- magenta = noTrans1 magenta
- cyan = noTrans1 cyan
- white = noTrans1 white
- blacker = noTrans1 blacker
- redder = noTrans1 redder
- greener = noTrans1 greener
- yellower = noTrans1 yellower
- bluer = noTrans1 bluer
- magentaer = noTrans1 magentaer
- cyaner = noTrans1 cyaner
- whiter = noTrans1 whiter
- onBlack = noTrans1 onBlack
- onRed = noTrans1 onRed
- onGreen = noTrans1 onGreen
- onYellow = noTrans1 onYellow
- onBlue = noTrans1 onBlue
- onMagenta = noTrans1 onMagenta
- onCyan = noTrans1 onCyan
- onWhite = noTrans1 onWhite
- onBlacker = noTrans1 onBlacker
- onRedder = noTrans1 onRedder
- onGreener = noTrans1 onGreener
- onYellower = noTrans1 onYellower
- onBluer = noTrans1 onBluer
- onMagentaer = noTrans1 onMagentaer
- onCyaner = noTrans1 onCyaner
- onWhiter = noTrans1 onWhiter
-
--- * Class 'Decorable'
-class Decorable d where
- -- | @('decorable' f)@ write @f@ applied to whether decorations are activated or not.
- decorable :: (Bool -> d) -> d
- default decorable :: Decorable (UnTrans d) => Trans d => (Bool -> d) -> d
- decorable f = noTrans $ decorable (unTrans . f)
- -- | @('withColor' b d)@ whether to active decorations or not within @d@.
- withDecorable :: Bool -> d -> d
- default withDecorable :: Decorable (UnTrans d) => Trans d => Bool -> d -> d
- withDecorable = noTrans1 . withDecorable
-
- bold :: d -> d
- underline :: d -> d
- italic :: d -> d
- default bold :: Decorable (UnTrans d) => Trans d => d -> d
- default underline :: Decorable (UnTrans d) => Trans d => d -> d
- default italic :: Decorable (UnTrans d) => Trans d => d -> d
- bold = noTrans1 bold
- underline = noTrans1 underline
- italic = noTrans1 italic
-
--- * Class 'Trans'
-class Trans repr where
- -- | Return the underlying @repr@ of the transformer.
- type UnTrans repr :: *
-
- -- | Lift a repr to the transformer's.
- noTrans :: UnTrans repr -> repr
- -- | Unlift a repr from the transformer's.
- unTrans :: repr -> UnTrans repr
-
- -- | Identity transformation for a unary symantic method.
- noTrans1 :: (UnTrans repr -> UnTrans repr) -> (repr -> repr)
- noTrans1 f = noTrans . f . unTrans
-
- -- | Identity transformation for a binary symantic method.
- noTrans2
- :: (UnTrans repr -> UnTrans repr -> UnTrans repr)
- -> (repr -> repr -> repr)
- noTrans2 f a b = noTrans (f (unTrans a) (unTrans b))
-
- -- | Identity transformation for a ternary symantic method.
- noTrans3
- :: (UnTrans repr -> UnTrans repr -> UnTrans repr -> UnTrans repr)
- -> (repr -> repr -> repr -> repr)
- noTrans3 f a b c = noTrans (f (unTrans a) (unTrans b) (unTrans c))
+++ /dev/null
-module Symantic.Document.Term
- ( module Symantic.Document.Sym
- , module Symantic.Document.Term
- ) where
-
-import Control.Applicative (Applicative(..))
-import Data.Bool
-import Data.Function (($), (.), id)
-import Data.Maybe (Maybe(..))
-import Data.Monoid (Monoid(..))
-import Data.Ord (Ord(..))
-import Data.Semigroup (Semigroup(..))
-import Data.String (IsString(..))
-import GHC.Exts (IsList(..))
-import Prelude (pred, fromIntegral, Num(..))
-import System.Console.ANSI
-import qualified Data.List as List
-import qualified Data.Text.Lazy as TL
-import qualified Data.Text.Lazy.Builder as TLB
-
-import Symantic.Document.Sym
-
--- * Type 'TermInh'
-data TermInh = TermInh
- { termInh_indent :: !Indent -- ^ Current indentation level, used by 'newline'.
- , termInh_newline :: Term -- ^ How to display 'newline'.
- , termInh_sgr :: ![SGR] -- ^ Active ANSI codes.
- , termInh_breakable :: !(Maybe Column) -- ^ 'Column' after which to break, or 'Nothing'
- , termInh_colorable :: !Bool -- ^ Whether colors are activated or not.
- , termInh_decorable :: !Bool -- ^ Whether decorations are activated or not.
- }
-
--- | Default 'TermInh'.
-defTermInh :: TermInh
-defTermInh = TermInh
- { termInh_indent = 0
- , termInh_newline = newlineWithIndent
- , termInh_sgr = []
- , termInh_breakable = Nothing
- , termInh_colorable = True
- , termInh_decorable = True
- }
-
--- * Type 'TermState'
-type TermState = Column
-
--- | Default 'TermState'.
-defTermState :: TermState
-defTermState = 0
-
--- * Type 'Term'
-newtype Term = Term
- { unTerm :: TermInh -> TermState ->
- (TermState -> TLB.Builder -> TLB.Builder) -> -- normal continuation
- (TermState -> TLB.Builder -> TLB.Builder) -> -- should-break continuation
- TLB.Builder }
-
--- | Render a 'Term' into a 'TL.Text'.
-textTerm :: Term -> TL.Text
-textTerm = TLB.toLazyText . runTerm
-
--- | Render a 'Term' into a 'TLB.Builder'.
-runTerm :: Term -> TLB.Builder
-runTerm (Term t) = t defTermInh defTermState oko oko
- where oko _st = id
-
-instance IsList Term where
- type Item Term = Term
- fromList = mconcat
- toList = pure
-instance Semigroup Term where
- x <> y = Term $ \ro st ok ko ->
- unTerm x ro st
- (\sx tx -> unTerm y ro sx
- (\sy ty -> ok sy (tx<>ty))
- (\sy ty -> ko sy (tx<>ty)))
- (\sx tx -> unTerm y ro sx
- (\sy ty -> ko sy (tx<>ty))
- (\sy ty -> ko sy (tx<>ty)))
-instance Monoid Term where
- mempty = empty
- mappend = (<>)
-instance IsString Term where
- fromString = string
-
-writeH :: Column -> TLB.Builder -> Term
-writeH len t =
- Term $ \ro currCol ok ko ->
- let newCol = currCol + len in
- (case termInh_breakable ro of
- Just breakCol | breakCol < newCol -> ko
- _ -> ok)
- newCol t
-
-instance Textable Term where
- empty = Term $ \_ro st ok _ko -> ok st mempty
- charH t = writeH (Nat 1) (TLB.singleton t)
- stringH t = writeH (length t) (fromString t)
- textH t = writeH (length t) (TLB.fromText t)
- ltextH t = writeH (length t) (TLB.fromLazyText t)
- replicate cnt t | cnt <= 0 = empty
- | otherwise = t <> replicate (pred cnt) t
- newline = Term $ \ro -> unTerm (termInh_newline ro) ro
-instance Indentable Term where
- align t = Term $ \ro st -> unTerm t ro{termInh_indent=st} st
- withNewline nl t = Term $ \ro -> unTerm t ro{termInh_newline=nl}
- withIndent ind t = Term $ \ro -> unTerm t ro{termInh_indent=ind}
- incrIndent ind t = Term $ \ro -> unTerm t ro{termInh_indent=termInh_indent ro + ind}
- column f = Term $ \ro st -> unTerm (f st) ro st
- indent f = Term $ \ro -> unTerm (f (termInh_indent ro)) ro
- newlineWithoutIndent = Term $ \_ro _st ok _ko ->
- ok 0 $ TLB.singleton '\n'
- newlineWithIndent = Term $ \ro _st ok _ko ->
- ok (termInh_indent ro) $
- TLB.singleton '\n' <>
- fromString (List.replicate (fromIntegral $ termInh_indent ro) ' ')
-instance Breakable Term where
- breakable f = Term $ \ro -> unTerm (f (termInh_breakable ro)) ro
- withBreakable b t = Term $ \ro -> unTerm t ro{termInh_breakable=b}
- ifBreak y x = Term $ \ro st ok ko ->
- unTerm x ro st ok $
- case termInh_breakable ro of
- Nothing -> ko
- Just{} -> (\_sx _tx -> unTerm y ro st ok ko)
- breakpoint onNoBreak onBreak t = Term $ \ro st ok ko ->
- unTerm (onNoBreak <> t) ro st ok $
- case termInh_breakable ro of
- Nothing -> ko
- Just{} -> (\_sp _tp -> unTerm (onBreak <> t) ro st ok ko)
-
-writeSGR :: (TermInh -> Bool) -> SGR -> Term -> Term
-writeSGR isOn s (Term t) =
- Term $ \ro ->
- if isOn ro
- then unTerm (o <> m <> c) ro
- else t ro
- where
- o = Term $ \_ro st ok _ko -> ok st $ fromString $ setSGRCode [s]
- m = Term $ \ro -> t ro{termInh_sgr=s:termInh_sgr ro}
- c = Term $ \ro st ok _ko -> ok st $ fromString $ setSGRCode $ Reset:List.reverse (termInh_sgr ro)
-
-instance Colorable Term where
- colorable f = Term $ \ro -> unTerm (f (termInh_colorable ro)) ro
- withColorable b t = Term $ \ro -> unTerm t ro{termInh_colorable=b}
- reverse = writeSGR termInh_colorable $ SetSwapForegroundBackground True
- black = writeSGR termInh_colorable $ SetColor Foreground Dull Black
- red = writeSGR termInh_colorable $ SetColor Foreground Dull Red
- green = writeSGR termInh_colorable $ SetColor Foreground Dull Green
- yellow = writeSGR termInh_colorable $ SetColor Foreground Dull Yellow
- blue = writeSGR termInh_colorable $ SetColor Foreground Dull Blue
- magenta = writeSGR termInh_colorable $ SetColor Foreground Dull Magenta
- cyan = writeSGR termInh_colorable $ SetColor Foreground Dull Cyan
- white = writeSGR termInh_colorable $ SetColor Foreground Dull White
- blacker = writeSGR termInh_colorable $ SetColor Foreground Vivid Black
- redder = writeSGR termInh_colorable $ SetColor Foreground Vivid Red
- greener = writeSGR termInh_colorable $ SetColor Foreground Vivid Green
- yellower = writeSGR termInh_colorable $ SetColor Foreground Vivid Yellow
- bluer = writeSGR termInh_colorable $ SetColor Foreground Vivid Blue
- magentaer = writeSGR termInh_colorable $ SetColor Foreground Vivid Magenta
- cyaner = writeSGR termInh_colorable $ SetColor Foreground Vivid Cyan
- whiter = writeSGR termInh_colorable $ SetColor Foreground Vivid White
- onBlack = writeSGR termInh_colorable $ SetColor Background Dull Black
- onRed = writeSGR termInh_colorable $ SetColor Background Dull Red
- onGreen = writeSGR termInh_colorable $ SetColor Background Dull Green
- onYellow = writeSGR termInh_colorable $ SetColor Background Dull Yellow
- onBlue = writeSGR termInh_colorable $ SetColor Background Dull Blue
- onMagenta = writeSGR termInh_colorable $ SetColor Background Dull Magenta
- onCyan = writeSGR termInh_colorable $ SetColor Background Dull Cyan
- onWhite = writeSGR termInh_colorable $ SetColor Background Dull White
- onBlacker = writeSGR termInh_colorable $ SetColor Background Vivid Black
- onRedder = writeSGR termInh_colorable $ SetColor Background Vivid Red
- onGreener = writeSGR termInh_colorable $ SetColor Background Vivid Green
- onYellower = writeSGR termInh_colorable $ SetColor Background Vivid Yellow
- onBluer = writeSGR termInh_colorable $ SetColor Background Vivid Blue
- onMagentaer = writeSGR termInh_colorable $ SetColor Background Vivid Magenta
- onCyaner = writeSGR termInh_colorable $ SetColor Background Vivid Cyan
- onWhiter = writeSGR termInh_colorable $ SetColor Background Vivid White
-instance Decorable Term where
- decorable f = Term $ \ro -> unTerm (f (termInh_decorable ro)) ro
- withDecorable b t = Term $ \ro -> unTerm t ro{termInh_decorable=b}
- bold = writeSGR termInh_decorable $ SetConsoleIntensity BoldIntensity
- underline = writeSGR termInh_decorable $ SetUnderlining SingleUnderline
- italic = writeSGR termInh_decorable $ SetItalicized True
+++ /dev/null
-module Symantic.Document.Term.Dimension
- ( module Symantic.Document.Sym
- , module Symantic.Document.Term.Dimension
- ) where
-
-import Control.Applicative (Applicative(..))
-import Data.Bool
-import Data.Eq (Eq(..))
-import Data.Function (($), (.), id)
-import Data.Maybe (Maybe(..))
-import Data.Monoid (Monoid(..))
-import Data.Ord (Ord(..))
-import Data.Semigroup (Semigroup(..))
-import Data.String (IsString(..))
-import GHC.Exts (IsList(..))
-import Prelude ((+))
-import Text.Show (Show(..))
-
-import Symantic.Document.Sym
-
--- * Type 'Dim'
-data Dim
- = Dim
- { dim_width :: Nat -- ^ Maximun line length.
- , dim_height :: Nat -- ^ Number of newlines.
- , dim_width_first :: Nat -- ^ Nat of the first line.
- , dim_width_last :: Nat -- ^ Nat of the last line.
- } deriving (Eq, Show)
-instance Semigroup Dim where
- Dim{dim_width=wx, dim_height=hx, dim_width_first=wfx, dim_width_last=wlx} <>
- Dim{dim_width=wy, dim_height=hy, dim_width_first=wfy, dim_width_last=wly} =
- let h = hx + hy in
- case (hx, hy) of
- (0, 0) -> let w = wx + wy in Dim w h w w
- (0, _) -> let v = wx + wfy in Dim (max v wy) h v wly
- (_, 0) -> let v = wlx + wy in Dim (max v wx) h wfx v
- _ -> Dim (max wx wy) h wfx wly
-instance Monoid Dim where
- mempty = Dim 0 0 0 0
- mappend = (<>)
-
--- * Type 'DimInh'
-data DimInh
- = DimInh
- { dimInh_indent :: !Indent -- ^ Current indentation level, used by 'newline'.
- , dimInh_newline :: Dimension -- ^ How to display 'newline'.
- , dimInh_breakable :: !(Maybe Column) -- ^ 'Column' after which to break, or 'Nothing'
- , dimInh_colorable :: !Bool -- ^ Whether colors are activated or not.
- , dimInh_decorable :: !Bool -- ^ Whether decorations are activated or not.
- }
-
--- | Default 'DimInh'.
-defDimInh :: DimInh
-defDimInh = DimInh
- { dimInh_indent = 0
- , dimInh_newline = newlineWithIndent
- , dimInh_breakable = Nothing
- , dimInh_colorable = True
- , dimInh_decorable = True
- }
-
--- * Type 'DimState'
-type DimState = Column
-
-defDimState :: DimState
-defDimState = 0
-
--- * Type 'Dimension'
-newtype Dimension = Dimension
- { unDimension :: DimInh -> DimState ->
- (DimState -> Dim -> Dim) -> -- normal continuation
- (DimState -> Dim -> Dim) -> -- should-break continuation
- Dim }
-
-dim :: Dimension -> Dim
-dim (Dimension p) = p defDimInh defDimState oko oko
- where oko _st = id
-
-instance IsList Dimension where
- type Item Dimension = Dimension
- fromList = mconcat
- toList = pure
-instance Semigroup Dimension where
- x <> y = Dimension $ \ro st ok ko ->
- unDimension x ro st
- (\sx tx -> unDimension y ro sx
- (\sy ty -> ok sy (tx<>ty))
- (\sy ty -> ko sy (tx<>ty)))
- (\sx tx -> unDimension y ro sx
- (\sy ty -> ko sy (tx<>ty))
- (\sy ty -> ko sy (tx<>ty)))
-instance Monoid Dimension where
- mempty = empty
- mappend = (<>)
-instance IsString Dimension where
- fromString = string
-
-writeH :: Column -> Dimension
-writeH len =
- Dimension $ \ro currCol ok ko ->
- let newCol = currCol + len in
- (case dimInh_breakable ro of
- Just breakCol | breakCol < newCol -> ko
- _ -> ok)
- newCol Dim
- { dim_width = len
- , dim_height = 0
- , dim_width_last = len
- , dim_width_first = len
- }
-
-instance Textable Dimension where
- empty = Dimension $ \_ro st ok _ko -> ok st mempty
- charH _ = writeH 1
- stringH = writeH . length
- textH = writeH . length
- ltextH = writeH . length
- newline = Dimension $ \ro -> unDimension (dimInh_newline ro) ro
-instance Indentable Dimension where
- align p = Dimension $ \ro st -> unDimension p ro{dimInh_indent=st} st
- withNewline nl p = Dimension $ \ro -> unDimension p ro{dimInh_newline=nl}
- withIndent ind p = Dimension $ \ro -> unDimension p ro{dimInh_indent=ind}
- incrIndent ind p = Dimension $ \ro -> unDimension p ro{dimInh_indent=dimInh_indent ro + ind}
- column f = Dimension $ \ro st -> unDimension (f st) ro st
- indent f = Dimension $ \ro -> unDimension (f (dimInh_indent ro)) ro
- newlineWithoutIndent = Dimension $ \_ro _st ok _ko ->
- ok 0 Dim
- { dim_width = 0
- , dim_height = 1
- , dim_width_first = 0
- , dim_width_last = 0
- }
- newlineWithIndent = Dimension $ \ro _st ok _ko ->
- let ind = dimInh_indent ro in
- ok ind Dim
- { dim_width = ind
- , dim_height = 1
- , dim_width_first = 0
- , dim_width_last = ind
- }
-
-instance Breakable Dimension where
- breakable f = Dimension $ \ro -> unDimension (f (dimInh_breakable ro)) ro
- withBreakable col p = Dimension $ \ro -> unDimension p ro{dimInh_breakable=col}
- ifBreak y x = Dimension $ \ro st ok ko ->
- unDimension x ro st ok $
- case dimInh_breakable ro of
- Nothing -> ko
- Just{} -> (\_sx _tx -> unDimension y ro st ok ko)
- breakpoint onNoBreak onBreak t = Dimension $ \ro st ok ko ->
- unDimension (onNoBreak <> t) ro st ok $
- case dimInh_breakable ro of
- Nothing -> ko
- Just{} -> (\_sp _tp -> unDimension (onBreak <> t) ro st ok ko)
-instance Colorable Dimension where
- colorable f = Dimension $ \ro -> unDimension (f (dimInh_colorable ro)) ro
- withColorable b t = Dimension $ \ro -> unDimension t ro{dimInh_colorable=b}
- reverse = id
- black = id
- red = id
- green = id
- yellow = id
- blue = id
- magenta = id
- cyan = id
- white = id
- blacker = id
- redder = id
- greener = id
- yellower = id
- bluer = id
- magentaer = id
- cyaner = id
- whiter = id
- onBlack = id
- onRed = id
- onGreen = id
- onYellow = id
- onBlue = id
- onMagenta = id
- onCyan = id
- onWhite = id
- onBlacker = id
- onRedder = id
- onGreener = id
- onYellower = id
- onBluer = id
- onMagentaer = id
- onCyaner = id
- onWhiter = id
-instance Decorable Dimension where
- decorable f = Dimension $ \ro -> unDimension (f (dimInh_decorable ro)) ro
- withDecorable b t = Dimension $ \ro -> unDimension t ro{dimInh_decorable=b}
- bold = id
- underline = id
- italic = id
+++ /dev/null
-../HLint.hs
\ No newline at end of file
+++ /dev/null
-module Symantic.Document.Term.IO
- ( module Symantic.Document.Sym
- , module Symantic.Document.Term.IO
- ) where
-
-import Control.Applicative (Applicative(..))
-import Data.Bool
-import Data.Function (($), id)
-import Data.Maybe (Maybe(..))
-import Data.Monoid (Monoid(..))
-import Data.Ord (Ord(..))
-import Data.Semigroup (Semigroup(..))
-import Data.String (IsString(..))
-import GHC.Exts (IsList(..))
-import Prelude (fromIntegral, Num(..))
-import System.Console.ANSI
-import System.IO (IO)
-import qualified Data.List as List
-import qualified Data.Text.IO as Text
-import qualified Data.Text.Lazy.IO as TL
-import qualified System.IO as IO
-
-import Symantic.Document.Sym
-
--- * Type 'TermIOInh'
-data TermIOInh = TermIOInh
- { termIOInh_indent :: !Indent -- ^ Current indentation level, used by 'newline'.
- , termIOInh_newline :: TermIO -- ^ How to display 'newline'.
- , termIOInh_sgr :: ![SGR] -- ^ Active ANSI codes.
- , termIOInh_handle :: !IO.Handle -- ^ Where to write.
- , termIOInh_breakable :: !(Maybe Column) -- ^ 'Column' after which to break.
- , termIOInh_colorable :: !Bool -- ^ Whether colors are activated or not.
- , termIOInh_decorable :: !Bool -- ^ Whether decorations are activated or not.
- }
-
--- | Default 'TermIOInh'.
-defTermIOInh :: TermIOInh
-defTermIOInh = TermIOInh
- { termIOInh_indent = 0
- , termIOInh_newline = newlineWithIndent
- , termIOInh_sgr = []
- , termIOInh_handle = IO.stdout
- , termIOInh_breakable = Nothing
- , termIOInh_colorable = True
- , termIOInh_decorable = True
- }
-
--- * Type 'TermIOState'
-type TermIOState = Column
-
--- | Default 'TermIOState'.
-defTermIOState :: TermIOState
-defTermIOState = 0
-
--- * Type 'TermIO'
-newtype TermIO = TermIO
- { unTermIO :: TermIOInh -> TermIOState ->
- (TermIOState -> IO () -> IO ()) -> -- normal continuation
- (TermIOState -> IO () -> IO ()) -> -- should-break continuation
- IO () }
-
--- | Write a 'TermIO'.
-runTermIO :: IO.Handle -> TermIO -> IO ()
-runTermIO h (TermIO t) = t defTermIOInh{termIOInh_handle=h} defTermIOState oko oko
- where oko _st = id
-
-instance IsList TermIO where
- type Item TermIO = TermIO
- fromList = mconcat
- toList = pure
-instance Semigroup TermIO where
- x <> y = TermIO $ \ro st ok ko ->
- unTermIO x ro st
- (\sx tx -> unTermIO y ro sx
- (\sy ty -> ok sy (tx<>ty))
- (\sy ty -> ko sy (tx<>ty)))
- (\sx tx -> unTermIO y ro sx
- (\sy ty -> ko sy (tx<>ty))
- (\sy ty -> ko sy (tx<>ty)))
-instance Monoid TermIO where
- mempty = empty
- mappend = (<>)
-instance IsString TermIO where
- fromString = string
-
-writeH :: Column -> (IO.Handle -> IO ()) -> TermIO
-writeH len t =
- TermIO $ \ro currCol ok ko ->
- let newCol = currCol + len in
- (case termIOInh_breakable ro of
- Just breakCol | breakCol < newCol -> ko
- _ -> ok)
- newCol (t (termIOInh_handle ro))
-
-instance Textable TermIO where
- empty = TermIO $ \_ro st ok _ko -> ok st mempty
- charH t = writeH 1 (`IO.hPutChar` t)
- stringH t = writeH (length t) (`IO.hPutStr` t)
- textH t = writeH (length t) (`Text.hPutStr` t)
- ltextH t = writeH (length t) (`TL.hPutStr` t)
- newline = TermIO $ \ro -> unTermIO (termIOInh_newline ro) ro
-instance Indentable TermIO where
- align t = TermIO $ \ro st -> unTermIO t ro{termIOInh_indent=st} st
- withNewline nl t = TermIO $ \ro -> unTermIO t ro{termIOInh_newline=nl}
- withIndent ind t = TermIO $ \ro -> unTermIO t ro{termIOInh_indent=ind}
- incrIndent ind t = TermIO $ \ro -> unTermIO t ro{termIOInh_indent=termIOInh_indent ro + ind}
- column f = TermIO $ \ro st -> unTermIO (f st) ro st
- indent f = TermIO $ \ro -> unTermIO (f (termIOInh_indent ro)) ro
- newlineWithoutIndent = TermIO $ \ro _st ok _ko ->
- ok 0 $ IO.hPutChar (termIOInh_handle ro) '\n'
- newlineWithIndent = TermIO $ \ro@TermIOInh{termIOInh_handle=h} _st ok _ko ->
- ok (termIOInh_indent ro) $ do
- IO.hPutChar h '\n'
- IO.hPutStr h $ List.replicate (fromIntegral $ termIOInh_indent ro) ' '
-instance Breakable TermIO where
- breakable f = TermIO $ \ro -> unTermIO (f (termIOInh_breakable ro)) ro
- withBreakable b t = TermIO $ \ro -> unTermIO t ro{termIOInh_breakable=b}
- ifBreak y x = TermIO $ \ro st ok ko ->
- unTermIO x ro st ok $
- case termIOInh_breakable ro of
- Nothing -> ko
- Just{} -> (\_sx _tx -> unTermIO y ro st ok ko)
- breakpoint onNoBreak onBreak t = TermIO $ \ro st ok ko ->
- unTermIO (onNoBreak <> t) ro st ok $
- case termIOInh_breakable ro of
- Nothing -> ko
- Just{} -> (\_sp _tp -> unTermIO (onBreak <> t) ro st ok ko)
-
-writeSGR :: (TermIOInh -> Bool) -> SGR -> TermIO -> TermIO
-writeSGR isOn s (TermIO t) =
- TermIO $ \ro ->
- if isOn ro
- then unTermIO (o <> m <> c) ro
- else t ro
- where
- o = TermIO $ \ro st ok _ko -> ok st $ hSetSGR (termIOInh_handle ro) [s]
- m = TermIO $ \ro -> t ro{termIOInh_sgr=s:termIOInh_sgr ro}
- c = TermIO $ \ro st ok _ko -> ok st $ hSetSGR (termIOInh_handle ro) $ Reset:List.reverse (termIOInh_sgr ro)
-
-instance Colorable TermIO where
- colorable f = TermIO $ \ro -> unTermIO (f (termIOInh_colorable ro)) ro
- withColorable b t = TermIO $ \ro -> unTermIO t ro{termIOInh_colorable=b}
- reverse = writeSGR termIOInh_colorable $ SetSwapForegroundBackground True
- black = writeSGR termIOInh_colorable $ SetColor Foreground Dull Black
- red = writeSGR termIOInh_colorable $ SetColor Foreground Dull Red
- green = writeSGR termIOInh_colorable $ SetColor Foreground Dull Green
- yellow = writeSGR termIOInh_colorable $ SetColor Foreground Dull Yellow
- blue = writeSGR termIOInh_colorable $ SetColor Foreground Dull Blue
- magenta = writeSGR termIOInh_colorable $ SetColor Foreground Dull Magenta
- cyan = writeSGR termIOInh_colorable $ SetColor Foreground Dull Cyan
- white = writeSGR termIOInh_colorable $ SetColor Foreground Dull White
- blacker = writeSGR termIOInh_colorable $ SetColor Foreground Vivid Black
- redder = writeSGR termIOInh_colorable $ SetColor Foreground Vivid Red
- greener = writeSGR termIOInh_colorable $ SetColor Foreground Vivid Green
- yellower = writeSGR termIOInh_colorable $ SetColor Foreground Vivid Yellow
- bluer = writeSGR termIOInh_colorable $ SetColor Foreground Vivid Blue
- magentaer = writeSGR termIOInh_colorable $ SetColor Foreground Vivid Magenta
- cyaner = writeSGR termIOInh_colorable $ SetColor Foreground Vivid Cyan
- whiter = writeSGR termIOInh_colorable $ SetColor Foreground Vivid White
- onBlack = writeSGR termIOInh_colorable $ SetColor Background Dull Black
- onRed = writeSGR termIOInh_colorable $ SetColor Background Dull Red
- onGreen = writeSGR termIOInh_colorable $ SetColor Background Dull Green
- onYellow = writeSGR termIOInh_colorable $ SetColor Background Dull Yellow
- onBlue = writeSGR termIOInh_colorable $ SetColor Background Dull Blue
- onMagenta = writeSGR termIOInh_colorable $ SetColor Background Dull Magenta
- onCyan = writeSGR termIOInh_colorable $ SetColor Background Dull Cyan
- onWhite = writeSGR termIOInh_colorable $ SetColor Background Dull White
- onBlacker = writeSGR termIOInh_colorable $ SetColor Background Vivid Black
- onRedder = writeSGR termIOInh_colorable $ SetColor Background Vivid Red
- onGreener = writeSGR termIOInh_colorable $ SetColor Background Vivid Green
- onYellower = writeSGR termIOInh_colorable $ SetColor Background Vivid Yellow
- onBluer = writeSGR termIOInh_colorable $ SetColor Background Vivid Blue
- onMagentaer = writeSGR termIOInh_colorable $ SetColor Background Vivid Magenta
- onCyaner = writeSGR termIOInh_colorable $ SetColor Background Vivid Cyan
- onWhiter = writeSGR termIOInh_colorable $ SetColor Background Vivid White
-instance Decorable TermIO where
- decorable f = TermIO $ \ro -> unTermIO (f (termIOInh_decorable ro)) ro
- withDecorable b t = TermIO $ \ro -> unTermIO t ro{termIOInh_decorable=b}
- bold = writeSGR termIOInh_decorable $ SetConsoleIntensity BoldIntensity
- underline = writeSGR termIOInh_decorable $ SetUnderlining SingleUnderline
- italic = writeSGR termIOInh_decorable $ SetItalicized True
+++ /dev/null
-../HLint.hs
\ No newline at end of file
+++ /dev/null
-resolver: lts-13.19
-packages:
-- '.'
+++ /dev/null
-name: symantic-document
--- PVP: +-+------- breaking API changes
--- | | +----- non-breaking API additions
--- | | | +--- code changes with no API change
-version: 0.2.0.20190530
-category: Text
-synopsis: Document symantics.
-description: Symantics for generating documents.
-extra-doc-files:
-license: GPL-3
-license-file: COPYING
-stability: experimental
-author: Julien Moutinho <julm+symantic@autogeree.net>
-maintainer: Julien Moutinho <julm+symantic@autogeree.net>
-bug-reports: Julien Moutinho <julm+symantic@autogeree.net>
--- homepage:
-
-build-type: Simple
-cabal-version: >= 1.24
-tested-with: GHC==8.4.4
-extra-source-files:
- stack.yaml
-extra-tmp-files:
-
-Source-Repository head
- location: git://git.autogeree.net/symantic
- type: git
-
-Library
- exposed-modules:
- Symantic.Document
- Symantic.Document.Sym
- Symantic.Document.Term
- Symantic.Document.Term.Dimension
- Symantic.Document.Term.IO
- default-language: Haskell2010
- default-extensions:
- DataKinds
- DefaultSignatures
- FlexibleContexts
- FlexibleInstances
- LambdaCase
- MultiParamTypeClasses
- NamedFieldPuns
- NoImplicitPrelude
- OverloadedStrings
- ScopedTypeVariables
- StandaloneDeriving
- TupleSections
- TypeFamilies
- TypeOperators
- ghc-options:
- -Wall
- -Wincomplete-uni-patterns
- -Wincomplete-record-updates
- -fno-warn-tabs
- -fhide-source-paths
- build-depends:
- ansi-terminal >= 0.7
- , base >= 4.6 && < 5
- , text >= 1.2
- , transformers >= 0.5
-
-Test-Suite symantic-document-test
- type: exitcode-stdio-1.0
- hs-source-dirs: test
- main-is: Main.hs
- other-modules:
- HUnit
- default-language: Haskell2010
- default-extensions:
- DataKinds
- FlexibleContexts
- FlexibleInstances
- LambdaCase
- MultiParamTypeClasses
- NoImplicitPrelude
- NoMonomorphismRestriction
- OverloadedStrings
- ScopedTypeVariables
- TupleSections
- TypeApplications
- TypeFamilies
- TypeOperators
- ghc-options:
- -Wall
- -Wincomplete-uni-patterns
- -Wincomplete-record-updates
- -fno-warn-tabs
- -fhide-source-paths
- -fprint-explicit-kinds
- -- -O0
- -- -fmax-simplifier-iterations=0
- -- -dshow-passes
- build-depends:
- symantic-document
- , base >= 4.6 && < 5
- , containers >= 0.5
- , tasty >= 0.11
- , tasty-hunit >= 0.9
- , text >= 1.2
- , transformers >= 0.5
+++ /dev/null
-../HLint.hs
\ No newline at end of file
+++ /dev/null
-{-# LANGUAGE OverloadedLists #-}
-{-# LANGUAGE TypeApplications #-}
-module HUnit where
-
-import Test.Tasty
-import Test.Tasty.HUnit
-
-import Data.Foldable (Foldable(..))
-import Data.Function (($), (.))
-import Data.Functor ((<$>))
-import Data.Int (Int)
-import Data.Maybe (Maybe(..))
-import Data.Monoid (Monoid(..))
-import Data.Ord (Ord(..))
-import Data.Semigroup (Semigroup(..))
-import Data.String (String)
-import Text.Show (Show(..))
-import qualified Data.List as List
-import qualified Data.Text.Lazy as TL
-
-import qualified Symantic.Document.Term as Doc
-import qualified Symantic.Document.Term.Dimension as Dim
-import Symantic.Document.Term ((<+>))
-
--- * Tests
-hunits :: TestTree
-hunits = testGroup "HUnit" $
- [ hunitsTerm
- , hunitsTermDimension
- ]
-
-testList :: String -> [Assertion] -> TestTree
-testList n as = testGroup n $ List.zipWith testCase (show <$> [1::Int ..]) as
-
-testMessage :: TL.Text -> String
-testMessage msg =
- foldMap esc $ TL.unpack $
- if 42 < TL.length msg then excerpt else msg
- where
- excerpt = TL.take 42 msg <> "…"
- esc = \case
- '\n' -> "\\n"
- c -> [c]
-
-hunitsTerm :: TestTree
-hunitsTerm = testGroup "Term"
- [ testList "Textable"
- [ Doc.newline ==> "\n"
- , Doc.stringH "hello" ==> "hello"
- , "hello" ==> "hello"
- , Doc.catV @_ @[] ["hello", "world"] ==> "hello\nworld"
- ]
- , testList "Indentable"
- [ "hello\nworld" ==> "hello\nworld"
- , " "<> "hello\nworld\n!" ==> " hello\nworld\n!"
- , "__"<>Doc.align "hello\nworld\n!" ==> "__hello\n world\n !"
- , Doc.hang 2 "hello\nworld\n!" ==> "hello\n world\n !"
- , Doc.hang 2 "hello\nworld\n!"<>"\nhello\n!" ==> "hello\n world\n !\nhello\n!"
- , "let " <> Doc.align (Doc.catV $
- (\(name, typ) -> Doc.fill 6 (Doc.stringH name) <+> "::" <+> Doc.stringH typ)
- `List.map` [ ("abcdef","Doc")
- , ("abcde","Int -> Doc -> Doc")
- , ("abcdefghi","Doc") ])
- ==> "let abcdef :: Doc\n abcde :: Int -> Doc -> Doc\n abcdefghi :: Doc"
- , "let " <> Doc.align (Doc.catV $
- (\(name, typ) -> Doc.breakableFill 6 (Doc.stringH name) <> " ::" <+> Doc.stringH typ)
- `List.map` [ ("abcdef","Doc")
- , ("abcde","Int -> Doc -> Doc")
- , ("abcdefghi","Doc") ])
- ==> "let abcdef :: Doc\n abcde :: Int -> Doc -> Doc\n abcdefghi\n :: Doc"
- , "let " <> Doc.align (Doc.catV $
- (\(name, typ) -> Doc.breakableFill 6 (Doc.stringH name) <> " ::" <+> typ)
- `List.map` [("abcdefghi","Doc ->\nDoc")])
- ==> "let abcdefghi\n :: Doc ->\n Doc"
- , "let " <> Doc.align (Doc.catV $
- (\(name, typ) -> Doc.breakableFill 6 (Doc.stringH name) <> Doc.align (" ::" <+> typ))
- `List.map` [("abcdefghi","Doc ->\nDoc")])
- ==> "let abcdefghi\n :: Doc ->\n Doc"
- ]
- , testList "Breakable"
- [ 10`wc` be ["hello", "world"] ==> "helloworld"
- , 9`wc` be ["hello", "world"] ==> "hello\nworld"
- , 6`wc` be ["he", "ll", "o!"] ==> "hello!"
- , 6`wc` be ["he", "ll", "o!", "wo", "rl", "d!"] ==> "hello!\nworld!"
- , 5`wc` be ["hello", "world"] ==> "hello\nworld"
- , 5`wc` be ["he", "llo", "world"] ==> "hello\nworld"
- , 5`wc` be ["he", "ll", "o!"] ==> "hell\no!"
- , 4`wc` be ["hello", "world"] ==> "hello\nworld"
- , 4`wc` be ["he", "ll", "o!"] ==> "hell\no!"
- , 4`wc` be ["he", "llo", "world"] ==> "he\nllo\nworld"
- , 4`wc` be ["he", "llo", "w", "orld"] ==> "he\nllow\norld"
- , 4`wc` be ["he", "ll", "o!", "wo", "rl", "d!"] ==> "hell\no!wo\nrld!"
- , 3`wc` be ["hello", "world"] ==> "hello\nworld"
- , 3`wc` be ["he", "ll"] ==> "he\nll"
- , 3`wc` be ["he", "ll", "o!"] ==> "he\nll\no!"
- , 1`wc` be ["he", "ll", "o!"] ==> "he\nll\no!"
- , 4`wc` ["__", Doc.align $ be ["he", "ll", "o!", "wo", "rl", "d!"]] ==> "__he\n ll\n o!\n wo\n rl\n d!"
- , 6`wc` ["__", Doc.align $ be ["he", "ll", "o!", "wo", "rl", "d!"]] ==> "__hell\n o!wo\n rld!"
- , 16`wc` ["__", listHorV ["hello", "world"]] ==> "__[hello, world]"
- , 4`wc` ["__", listHorV ["hello", "world"]] ==> "__[ hello\n , world\n ]"
- , 11`wc` bs ["hello", "world"] ==> "hello world"
- , 10`wc` bs ["hello", "world"] ==> "hello\nworld"
- , 6`wc` bs ["hel", "lo", "wo", "rld"] ==> "hel lo\nwo rld"
- , 6`wc` bs ["hel", "lo", "wo", "rld", "HEL", "LO", "WO", "RLD"] ==> "hel lo\nwo rld\nHEL LO\nWO RLD"
- , 5`wc` bs ["hello", "world"] ==> "hello\nworld"
- , 19`wc` fun (fun $ fun $ fun $ fun $ listHorV ["abcdefg", "abcdefg"])
- ==> "function(function(\n function(\n function(\n function(\n [ abcdefg\n , abcdefg\n ]\n )\n )\n )\n ))"
- , 19`wc` fun (fun $ fun $ fun $ fun $ listHorV ["abcdefgh", "abcdefgh"])
- ==> "function(\n function(\n function(\n function(\n function(\n [ abcdefgh\n , abcdefgh\n ]\n )\n )\n )\n )\n )"
- ]
- ]
- where
- (==>) :: Doc.Term -> TL.Text -> Assertion; infix 0 ==>
- p ==> expected = got @?= expected
- where got = Doc.textTerm p
-
-hunitsTermDimension :: TestTree
-hunitsTermDimension = testGroup "Term.Dimension"
- [ testList "Textable"
- [ Doc.newline ==> mempty
- { Dim.dim_width = 0
- , Dim.dim_height = 1
- , Dim.dim_width_first = 0
- , Dim.dim_width_last = 0
- }
- , Doc.newline <> Doc.newline ==> mempty
- { Dim.dim_height = 2
- }
- , Doc.space ==> Dim.Dim 1 0 1 1
- , Doc.newline <> Doc.space ==> mempty
- { Dim.dim_width = 1
- , Dim.dim_height = 1
- , Dim.dim_width_first = 0
- , Dim.dim_width_last = 1
- }
- , Doc.stringH "hello" ==> mempty
- { Dim.dim_width = 5
- , Dim.dim_height = 0
- , Dim.dim_width_first = 5
- , Dim.dim_width_last = 5
- }
- , "hello" ==> mempty
- { Dim.dim_width = 5
- , Dim.dim_height = 0
- , Dim.dim_width_first = 5
- , Dim.dim_width_last = 5
- }
- , Doc.newline <> "hello" ==> mempty
- { Dim.dim_width = 5
- , Dim.dim_height = 1
- , Dim.dim_width_first = 0
- , Dim.dim_width_last = 5
- }
- , "hel" <> Doc.newline ==> mempty
- { Dim.dim_width = 3
- , Dim.dim_height = 1
- , Dim.dim_width_first = 3
- , Dim.dim_width_last = 0
- }
- , ("hel" <> Doc.newline) <> "lo" ==> mempty
- { Dim.dim_width = 3
- , Dim.dim_height = 1
- , Dim.dim_width_first = 3
- , Dim.dim_width_last = 2
- }
- , Doc.catV @_ @[] ["hello", "world"] ==> mempty
- { Dim.dim_width = 5
- , Dim.dim_height = 1
- , Dim.dim_width_first = 5
- , Dim.dim_width_last = 5
- }
- , "hel\nlo" <> Doc.empty ==> Dim.Dim 3 1 3 2
- , "hel\nlo " ==> Dim.Dim 3 1 3 3
- , "lo" ==> Dim.Dim 2 0 2 2
- , Doc.charH 'X' ==> Dim.Dim 1 0 1 1
- , "lo"<>Doc.charH 'X' ==> Dim.Dim 3 0 3 3
- , "lo"<>Doc.charH ' ' ==> Dim.Dim 3 0 3 3
- , "lo"<>Doc.space ==> Dim.Dim 3 0 3 3
- , (Doc.newline<>"lo")<>Doc.space ==> Dim.Dim 3 1 0 3
- , (("hel"<>Doc.newline)<>"lo")<>Doc.space ==> Dim.Dim 3 1 3 3
- , "hel\nlo" <> Doc.space ==> Dim.Dim 3 1 3 3
- , (Dim.Dim 2 0 2 2 <> Dim.Dim 1 0 1 1) @?= Dim.Dim 3 0 3 3
- ]
- ]
- where
- (==>) :: Dim.Dimension -> Dim.Dim -> Assertion; infix 0 ==>
- p ==> expected = got @?= expected
- where got = Dim.dim p
-
-be :: Doc.Breakable d => [d] -> d
-be = Doc.interWith Doc.breakableEmpty
-bs :: Doc.Breakable d => [d] -> d
-bs = Doc.interWith Doc.breakableSpace
-wc :: Doc.Breakable d => Doc.Column -> d -> d
-wc = Doc.withBreakable . Just
-
-fun :: (Doc.Indentable d, Doc.Breakable d) => d -> d
-fun x = "function(" <> Doc.incrIndent 2 (Doc.ifBreak (Doc.newline<>x<>Doc.newline) x) <> ")"
-
-listHorV :: (Doc.Indentable d, Doc.Breakable d) => [d] -> d
-listHorV [] = "[]"
-listHorV [x] = "["<>x<>"]"
-listHorV xs =
- Doc.ifBreak
- (Doc.align $ Doc.stringH "[ " <> foldr1 (\a acc -> a <> Doc.newline <> Doc.stringH ", " <> acc) xs <> Doc.newline <> "]")
- ("[" <> Doc.intercalate (Doc.stringH ", ") xs <> "]")
+++ /dev/null
-module Main where
-
-import Data.Function (($))
-import System.IO (IO)
-import Test.Tasty
-
-import HUnit
-
-main :: IO ()
-main = do
- defaultMain $
- testGroup "Document"
- [ hunits
- ]
-resolver: lts-13.3
+resolver: lts-13.19
packages:
- '.'
-- PVP: +-+------- breaking API changes
-- | | +----- non-breaking API additions
-- | | | +--- code changes with no API change
-version: 0.3.2.20181109
+version: 0.3.3.20190614
category: Language
synopsis: Library for symantic grammars.
description: This library defines an embedded DSL for regular or context-free grammars,
build-depends:
symantic-grammar
, base >= 4.6 && < 5
- , megaparsec >= 6.3
+ , megaparsec >= 7.0
, tasty >= 0.11
, tasty-hunit >= 0.9
, text >= 1.2
instance ParsecC e s => Gram_Rule (P.ParsecT e s m) where
rule = P.label . Text.unpack
instance ParsecC e s => Gram_Char (P.ParsecT e s m) where
- any = P.anyChar
+ any = P.anySingle
eoi = P.eof
char = P.char
unicat cat = P.satisfy $ (`elem` cats) . Char.generalCategory
-resolver: lts-13.3
+resolver: lts-13.19
packages:
- '.'
- location: '../symantic'
extra-dep: true
- location: '../symantic-grammar'
extra-dep: true
-- location: '../symantic-document'
+- location: '../../symantic-document'
extra-dep: true
extra-deps:
- monad-classes-0.3.2.2
, base >= 4.6 && < 5
, bytestring >= 0.10
, containers >= 0.5
- , megaparsec >= 6.3
+ , megaparsec >= 7.0
, monad-classes >= 0.3.2
, mono-traversable >= 1.0
, tasty >= 0.11
import Data.Semigroup (Semigroup(..))
import Data.String (String)
-- import System.FilePath (FilePath)
-import System.IO (IO)
+import System.IO (IO, FilePath)
import qualified Data.ByteString.Lazy as BSL
import qualified Data.List as List
import qualified Data.Text.Lazy as TL
module HUnit.Applicative where
import Test.Tasty
+import Control.Applicative (Applicative)
+import Data.Bool
+import Data.Either (Either(..))
+import Data.Functor (Functor)
+import Data.Maybe (Maybe(..))
import Data.Proxy (Proxy(..))
+import Prelude (Integer)
import Language.Symantic.Lib
import Testing.Compiling
module HUnit.Foldable where
import Test.Tasty
+import Control.Applicative (Applicative)
+import Data.Either (Either(..))
+import Data.Foldable (Foldable)
+import Data.Int (Int)
import Data.Proxy (Proxy(..))
+import Prelude (Integer)
import Language.Symantic.Lib
import Testing.Compiling
module HUnit.Functor where
import Test.Tasty
+import Data.Bool
+import Data.Either (Either(..))
+import Data.Functor (Functor)
+import Data.Maybe (Maybe(..))
import Data.Proxy (Proxy(..))
+import Prelude (Integer)
import Language.Symantic ()
import Language.Symantic.Lib
module HUnit.Map where
import Test.Tasty
+import Data.Char (Char)
+import Data.Either (Either(..))
+import Data.Int (Int)
+import Data.Monoid (Monoid)
import Data.Map.Strict (Map)
import Data.Proxy (Proxy(..))
import Data.Text as Text
+import Prelude (Integer, Num)
import qualified Data.Map.Strict as Map
import Language.Symantic.Lib
module HUnit.MonoFunctor where
import Test.Tasty
+import Data.Bool
+import Data.Char (Char)
+import Data.Either (Either(..))
+import Data.Maybe (Maybe(..))
import Data.Proxy (Proxy(..))
+import Prelude (Integer)
import qualified Data.MonoTraversable as MT
import Language.Symantic.Lib
module HUnit.Tuple2 where
import Test.Tasty
+import Data.Either (Either(..))
import Data.Proxy (Proxy(..))
+import Prelude (Integer)
import Language.Symantic.Lib
import Testing.Compiling
module Main where
import Test.Tasty
+import Data.Function (($))
+import System.IO (IO)
import Golden
import HUnit
import Test.Tasty.HUnit
import Debug.Trace (trace)
+import Control.Applicative (Applicative(..))
import Control.Arrow (left)
+import Control.Monad (Monad(..))
+import Data.Either (Either(..), either)
+import Data.Eq (Eq(..))
+import Data.Function (($), (.), id)
+import Data.Functor ((<$>))
import Data.Functor.Identity (Identity(..))
+import Data.List ((++))
+import Data.Maybe (Maybe(..))
+import Data.Ord (Ord(..))
+import Data.String (String)
import Data.Text (Text)
+import Data.Tuple (snd)
import Data.Type.Equality
import Data.Void (Void)
+import Prelude (error)
+import Text.Show (Show)
import qualified Control.Monad.Classes.Run as MC
import qualified Control.Monad.Trans.State.Strict as S
import qualified Data.List as List
import qualified Data.Text as Text
import qualified Text.Megaparsec as P
+import qualified Text.Show as Show
import Language.Symantic.Grammar
import Language.Symantic
ModulesTyInj ss =>
ModulesInj src ss =>
Gram_Term src ss (G src ss) =>
- Text -> Either (P.ParseError Char Void) (AST_Term src ss)
+ Text -> Either (P.ParseErrorBundle Text Void) (AST_Term src ss)
parseTe inp =
- let modsTe :: Modules src ss = either (error . show) id modulesInj in
+ let modsTe :: Modules src ss = either (error . Show.show) id modulesInj in
let impsTe = [] `importModules` modsTe in
let modsTy = modulesTyInj @ss @src in
let impsTy = importTypes @ss [] in
) =>
Text ->
Either ( Type src '[] t
- , Either (P.ParseError Char Void)
+ , Either (P.ParseErrorBundle Text Void)
(Error_Term src) )
(Type src '[] t, t, Text) ->
TestTree
maybeRight Left{} = Nothing
elide :: Text -> String
-elide s | Text.length s > 42 = List.take 42 (Text.unpack s) List.++ ['…']
+elide s | Text.length s > 42 = List.take 42 (Text.unpack s) ++ ['…']
elide s = Text.unpack s
dbg :: Show a => String -> a -> a
-dbg msg x = trace (msg ++ " = " ++ Prelude.show x) x
+dbg msg x = trace (msg ++ " = " ++ Show.show x) x
import Data.Either (Either(..))
import Data.Function (($), (.))
import Data.Functor (Functor(..), (<$>))
-import Data.List.NonEmpty (NonEmpty(..))
import Data.Ord (Ord(..))
-import Data.String (IsString(..))
+import Data.String (String, IsString(..))
import Data.Typeable ()
import Text.Show (Show(..))
import qualified Control.Applicative as Alt
import qualified Control.Monad.Classes as MC
import qualified Data.Char as Char
+import qualified Data.List as List
import qualified Data.Text as Text
import qualified Data.Text.Lazy as TL
import qualified Text.Megaparsec as P
-- Readers
--
--- NonEmpty P.SourcePos
-instance ParsecC e s => Sym.Gram_Reader (NonEmpty P.SourcePos) (P.ParsecT e s m) where
- askBefore g = do
- s <- P.statePos <$> P.getParserState
- ($ s) <$> g
- askAfter g = do
- f <- g
- f . P.statePos <$> P.getParserState
-type instance MC.CanDo (P.ParsecT e s m) (MC.EffReader (NonEmpty P.SourcePos)) = 'True
-instance ParsecC e s => MC.MonadReaderN 'MC.Zero (NonEmpty P.SourcePos) (P.ParsecT e s m) where
- askN _n = P.statePos <$> P.getParserState
+{-
-- P.SourcePos
instance ParsecC e s => Sym.Gram_Reader P.SourcePos (P.ParsecT e s m) where
askBefore g = do
- s <- P.getPosition
+ s <- P.getSourcePos
($ s) <$> g
askAfter g = do
f <- g
- f <$> P.getPosition
+ f <$> P.getSourcePos
type instance MC.CanDo (P.ParsecT e s m) (MC.EffReader P.SourcePos) = 'True
instance ParsecC e s => MC.MonadReaderN 'MC.Zero P.SourcePos (P.ParsecT e s m) where
- askN _n = P.getPosition
+ askN _n = P.getSourcePos
+-}
-- ()
instance ParsecC e s => Sym.Gram_Reader () (P.ParsecT e s m) where
askBefore = fmap ($ ())
instance ParsecC e s => Sym.Gram_Rule (P.ParsecT e s m) where
rule = P.label . Text.unpack
instance ParsecC e s => Sym.Gram_Char (P.ParsecT e s m) where
- any = P.anyChar
+ any = P.anySingle
eoi = P.eof
char = P.char
- unicat cat = P.satisfy $ (`elem` cats) . Char.generalCategory
+ unicat cat = P.satisfy $ (`List.elem` cats) . Char.generalCategory
where cats = unicode_categories cat
range (l, h) = P.satisfy $ \c -> l <= c && c <= h
Terminal f `but` Terminal p = Terminal $ P.notFollowedBy (P.try p) *> f
import Language.Symantic.Grammar.Fixity
import Language.Symantic.Grammar.Source
import Language.Symantic.Grammar.Error
-
-x = \x -> \x -> x
import Data.Function (id)
import Data.Map.Strict (Map)
import Data.Maybe (fromMaybe)
+import Data.Monoid (Monoid(..))
import Data.Semigroup (Semigroup(..))
import Data.Set (Set)
+import Data.Text (Text)
import Data.Typeable
+import Symantic.Document (DocFrom(..))
import qualified Data.List as L
import qualified Data.Map.Strict as Map
import qualified Data.Set as Set
import qualified Data.Text as T
+import qualified Symantic.Document as Doc
-import qualified Language.Symantic.Document.Sym as Doc
import Language.Symantic.Grammar
import Language.Symantic.Typing.Kind
import Language.Symantic.Typing.Variable
docType ::
forall src vs t d.
Semigroup d =>
- Doc.Textable d =>
- Doc.Colorable d =>
+ DocFrom (Doc.Word Char) d =>
+ DocFrom (Doc.Word Text) d =>
+ Doc.Spaceable d =>
+ Doc.Colorable16 d =>
Config_Doc_Type ->
Precedence ->
Type src vs t -> d
let iv = indexVar v in
case Map.lookup iv v2n of
Nothing -> error "[BUG] docType: variable name missing"
- Just n -> Doc.textH n
+ Just n -> docFrom (Doc.Word n)
-- Const
go _v2n _po (TyConst _src _vs c@Const{}) =
(if isNameTyOp c then docParen else id) $
-- [] Const
go v2n _po (TyApp _ (TyConst _ _ f@Const{}) a)
| Just HRefl <- proj_ConstKi @(K []) @[] f =
- "[" <> go v2n (infixB SideL 0, SideL) a <> "]"
+ Doc.between (docFrom (Doc.Word '[')) (docFrom (Doc.Word ']')) $
+ go v2n (infixB SideL 0, SideL) a
-- Infix Const
go v2n po (TyApp _ (TyApp _ (TyConst _ _ f@Const{}) a) b)
-- () =>
prettyConst f <>
go v2n (op, SideR) b
where
- d_op = Doc.yellower
+ d_op :: Text -> d
+ d_op = Doc.yellower . docFrom . Doc.Word
prettyConst :: forall k c. Const src (c::k) -> d
prettyConst c | Just HRefl <- proj_ConstKi @(K (#>)) @(#>) c = Doc.space <> d_op "=>" <> Doc.space
prettyConst c | Just HRefl <- proj_ConstKi @(K (#)) @(#) c = d_op "," <> Doc.space
docConst imps fam <>
foldlTys (\t acc ->
Doc.space <> go v2n (op, SideL) t <> acc
- ) args Doc.empty
+ ) args mempty
-- | Return a 'Map' associating a distinct 'Name'
-- for all the variables of the given 'Type'.
docTypes ::
forall src vs ts d.
Semigroup d =>
- Doc.Textable d =>
- Doc.Colorable d =>
+ DocFrom (Doc.Word Char) d =>
+ DocFrom (Doc.Word Text) d =>
+ Doc.Spaceable d =>
+ Doc.Colorable16 d =>
Config_Doc_Type ->
Types src vs ts -> d
docTypes conf tys =
- d_op (Doc.charH '[') <> go tys <> d_op (Doc.charH ']')
+ d_op (docFrom (Doc.Word '[')) <> go tys <> d_op (docFrom (Doc.Word ']'))
where
d_op = Doc.yellower
go :: forall xs. Types src vs xs -> d
- go TypesZ = Doc.empty
+ go TypesZ = mempty
go (TypesS t0 (TypesS t1 ts)) =
docType conf 10 t0 <>
- d_op (Doc.charH ',') <> Doc.space <>
+ d_op (docFrom (Doc.Word ',')) <> Doc.space <>
docType conf 10 t1 <>
go ts
go (TypesS t ts) = docType conf 10 t <> go ts
-- * Document 'Const'
-docConst :: Doc.Textable d => Imports NameTy -> Const src c -> d
+docConst ::
+ Monoid d =>
+ DocFrom (Doc.Word Char) d =>
+ DocFrom (Doc.Word Text) d =>
+ Imports NameTy -> Const src c -> d
docConst imps c@Const{} =
docMod docNameTy $
maybe mn (`Mod` n) $
mn@(m `Mod` n) = nameTyOf c
-- * Document 'NameTy'
-docNameTy :: Doc.Textable d => NameTy -> d
-docNameTy (NameTy t) = Doc.textH t
+docNameTy :: DocFrom (Doc.Word Text) d => NameTy -> d
+docNameTy (NameTy t) = docFrom (Doc.Word t)
-- * Document 'Mod'
-docMod :: Doc.Textable d => (a -> d) -> Mod a -> d
+docMod ::
+ Monoid d =>
+ DocFrom (Doc.Word Char) d =>
+ DocFrom (Doc.Word Text) d =>
+ (a -> d) -> Mod a -> d
docMod a2d ([] `Mod` a) = a2d a
-docMod a2d (m `Mod` a) = docPathMod m <> (Doc.charH '.') <> a2d a
+docMod a2d (m `Mod` a) = docPathMod m <> (docFrom (Doc.Word '.')) <> a2d a
-- * Document 'PathMod'
-docPathMod :: Doc.Textable d => PathMod -> d
+docPathMod ::
+ Monoid d =>
+ DocFrom (Doc.Word Char) d =>
+ DocFrom (Doc.Word Text) d =>
+ PathMod -> d
docPathMod (p::PathMod) =
- Doc.catH $
- L.intersperse (Doc.charH '.') $
- (\(NameMod n) -> Doc.textH n) <$> p
+ mconcat $
+ L.intersperse (docFrom (Doc.Word '.')) $
+ (\(NameMod n) -> docFrom (Doc.Word n)) <$> p
-docParen :: Doc.Textable d => d -> d
-docParen = Doc.between (Doc.charH '(') (Doc.charH ')')
+docParen :: Doc.Spaceable d => DocFrom (Doc.Word Char) d => d -> d
+docParen = Doc.between (docFrom (Doc.Word '(')) (docFrom (Doc.Word ')'))
{-
docModules ::
Source src =>
Doc.Textable d =>
- Doc.Colorable d =>
+ Doc.Colorable16 d =>
Doc.Decorationable d =>
ReadTe src ss =>
Sym.Modules src ss -> d
docModules (Sym.Modules mods) =
Map.foldrWithKey
(\p m doc -> docModule p m <> doc)
- Doc.empty
+ mempty
mods
docModule ::
forall src ss d.
Source src =>
Doc.Textable d =>
- Doc.Colorable d =>
+ Doc.Colorable16 d =>
Doc.Decorationable d =>
ReadTe src ss =>
Sym.PathMod -> Sym.Module src ss -> d
Doc.space <> Doc.bold (Doc.yellower "::") <> Doc.space <>
docTokenTerm (t Sym.noSource) <>
Doc.eol <> doc)
- Doc.empty
+ mempty
docTokenTerm ::
forall src ss d.
Source src =>
Doc.Textable d =>
- Doc.Colorable d =>
+ Doc.Colorable16 d =>
ReadTe src ss =>
Sym.Token_Term src ss -> d
docTokenTerm t =
{ config_Doc_Type_vars_numbering = False
} 0 $ Sym.typeOfTerm te
-docFixityInfix :: (Doc.Decorationable t, Doc.Colorable t, Doc.Textable t) => Infix -> t
+docFixityInfix :: (Doc.Decorationable t, Doc.Colorable16 t, Doc.Textable t) => Infix -> t
docFixityInfix = \case
- Sym.Infix Nothing 5 -> Doc.empty
+ Sym.Infix Nothing 5 -> mempty
Sym.Infix a p ->
let docAssoc = \case
Sym.AssocL -> "l"
Sym.AssocR -> "r"
Sym.AssocB Sym.SideL -> "l"
Sym.AssocB Sym.SideR -> "r" in
- Doc.magenta $ " infix" <> maybe Doc.empty docAssoc a <>
+ Doc.magenta $ " infix" <> maybe mempty docAssoc a <>
Doc.space <> Doc.bold (Doc.bluer (Doc.int p))
-docFixityPrefix :: (Doc.Decorationable t, Doc.Colorable t, Doc.Textable t) => Unifix -> t
+docFixityPrefix :: (Doc.Decorationable t, Doc.Colorable16 t, Doc.Textable t) => Unifix -> t
docFixityPrefix p = Doc.magenta $ " prefix " <> Doc.bold (Doc.bluer (Doc.int $ Sym.unifix_prece p))
-docFixityPostfix :: (Doc.Decorationable t, Doc.Colorable t, Doc.Textable t) => Unifix -> t
+docFixityPostfix :: (Doc.Decorationable t, Doc.Colorable16 t, Doc.Textable t) => Unifix -> t
docFixityPostfix p = Doc.magenta $ " postfix " <> Doc.bold (Doc.bluer (Doc.int $ Sym.unifix_prece p))
docPathTe ::
Doc.Textable d =>
- Doc.Colorable d =>
+ Doc.Colorable16 d =>
Sym.PathMod -> Sym.NameTe -> d
docPathTe (ms::Sym.PathMod) (Sym.NameTe n) =
Doc.catH $
module Language.Symantic.Typing.Show where
import qualified Data.Text.Lazy as TL
+import qualified Data.Text.Lazy.Builder as TLB
-import qualified Language.Symantic.Document.Term as Doc
+import qualified Symantic.Document as Doc
import Language.Symantic.Grammar
import Language.Symantic.Typing.Type
import Language.Symantic.Typing.Module
import Language.Symantic.Typing.Document
-stringDocTerm :: Doc.Term -> String
+stringDocTerm :: Doc.PlainText (Doc.Plain TLB.Builder) -> String
stringDocTerm =
TL.unpack .
- Doc.textTerm .
- Doc.withColorable False .
- Doc.withDecorable False
+ TLB.toLazyText .
+ Doc.runPlain .
+ Doc.runPlainText
showType :: Config_Doc_Type -> Type src vs t -> String
showType conf ty = stringDocTerm $ docType conf 0 ty
-resolver: lts-13.3
+resolver: lts-13.19
packages:
- '.'
- location: '../symantic-grammar'
extra-dep: true
-- location: '../symantic-document'
+- location: '../../symantic-document'
extra-dep: true
-fhide-source-paths
build-depends:
symantic-grammar
- , symantic-document
- , base >= 4.6 && < 5
- , containers >= 0.5
- , mono-traversable >= 1.0
- , transformers >= 0.5
- , text >= 1.2
+ , symantic-document >= 0.2
+ , base >= 4.6 && < 5
+ , containers >= 0.5
+ , mono-traversable >= 1.0
+ , transformers >= 0.5
+ , text >= 1.2
sourcephile / git / haskell / symantic.git / commitdiff