From 3fac985cfff97344275f1e9180652799040b45de Mon Sep 17 00:00:00 2001
From: Julien Moutinho <julm+haskell+treemap@autogeree.net>
Date: Sun, 21 Aug 2016 22:16:59 +0200
Subject: [PATCH 1/1] init

---
 .gitignore                    |   8 +
 COPYING                       | 674 ++++++++++++++++++++++++++++++++++
 Data/TreeMap/HLint.hs         |   1 +
 Data/TreeMap/Strict.hs        | 539 +++++++++++++++++++++++++++
 Data/TreeMap/Strict/HLint.hs  |   1 +
 Data/TreeMap/Strict/Test.hs   | 158 ++++++++
 Data/TreeMap/Strict/Zipper.hs | 215 +++++++++++
 Data/TreeMap/Test.hs          |  19 +
 HLint.hs                      |   3 +
 Setup.hs                      |   2 +
 stack.yaml                    |   6 +
 treemap.cabal                 | 100 +++++
 12 files changed, 1726 insertions(+)
 create mode 100644 .gitignore
 create mode 100644 COPYING
 create mode 120000 Data/TreeMap/HLint.hs
 create mode 100644 Data/TreeMap/Strict.hs
 create mode 120000 Data/TreeMap/Strict/HLint.hs
 create mode 100644 Data/TreeMap/Strict/Test.hs
 create mode 100644 Data/TreeMap/Strict/Zipper.hs
 create mode 100644 Data/TreeMap/Test.hs
 create mode 100644 HLint.hs
 create mode 100644 Setup.hs
 create mode 100644 stack.yaml
 create mode 100644 treemap.cabal

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..ff263ae
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,8 @@
+*.hi
+*.o
+.cabal-sandbox/
+.stack-work/
+cabal.sandbox.config
+dist/
+report.html
+old/
diff --git a/COPYING b/COPYING
new file mode 100644
index 0000000..94a9ed0
--- /dev/null
+++ b/COPYING
@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/Data/TreeMap/HLint.hs b/Data/TreeMap/HLint.hs
new file mode 120000
index 0000000..6c16d1e
--- /dev/null
+++ b/Data/TreeMap/HLint.hs
@@ -0,0 +1 @@
+../../HLint.hs
\ No newline at end of file
diff --git a/Data/TreeMap/Strict.hs b/Data/TreeMap/Strict.hs
new file mode 100644
index 0000000..7ebd52c
--- /dev/null
+++ b/Data/TreeMap/Strict.hs
@@ -0,0 +1,539 @@
+{-# LANGUAGE DeriveDataTypeable #-}
+{-# LANGUAGE NamedFieldPuns #-}
+{-# LANGUAGE StandaloneDeriving #-}
+{-# OPTIONS_GHC -fno-warn-orphans #-}
+
+-- | This module implements a strict 'TreeMap',
+-- which is like a 'Map'
+-- but whose key is now a 'NonEmpty' list of 'Map' keys (a 'Path')
+-- enabling the possibility to gather mapped values
+-- by 'Path' prefixes (inside a 'Node').
+module Data.TreeMap.Strict where
+
+import           Control.Applicative (Applicative(..))
+import           Control.DeepSeq (NFData(..))
+import           Data.Bool
+import           Data.Data (Data)
+import           Data.Eq (Eq)
+import           Data.Foldable (Foldable, foldMap)
+import           Data.Function (($), (.), const, flip, id)
+import           Data.Functor (Functor(..), (<$>))
+import qualified Data.List
+import qualified Data.List.NonEmpty
+import           Data.List.NonEmpty (NonEmpty(..))
+import           Data.Map.Strict (Map)
+import qualified Data.Map.Strict as Data.Map
+import           Data.Maybe (Maybe(..), maybe)
+import           Data.Monoid (Monoid(..))
+import           Data.Ord (Ord(..))
+import qualified Data.Strict.Maybe as Strict
+import           Data.Traversable (Traversable(..))
+import           Data.Typeable (Typeable)
+import           Prelude (Int, Num(..), seq)
+import           Text.Show (Show(..))
+
+-- @Data.Strict@ orphan instances
+deriving instance Data x => Data (Strict.Maybe x)
+deriving instance Typeable Strict.Maybe
+instance Monoid x => Monoid (Strict.Maybe x) where
+	mempty = Strict.Nothing
+	mappend (Strict.Just x) (Strict.Just y) = Strict.Just (x `mappend` y)
+	mappend x Strict.Nothing = x
+	mappend Strict.Nothing y = y
+instance NFData x => NFData (Strict.Maybe x) where
+	rnf Strict.Nothing = ()
+	rnf (Strict.Just x) = rnf x
+
+-- * Type 'TreeMap'
+
+newtype TreeMap k x
+ =      TreeMap (Map k (Node k x))
+ deriving (Data, Eq, Show, Typeable)
+
+instance (Ord k, Monoid v) => Monoid (TreeMap k v) where
+	mempty = empty
+	mappend = union mappend
+	-- mconcat = Data.List.foldr mappend mempty
+instance Ord k => Functor (TreeMap k) where
+	fmap f (TreeMap m) = TreeMap $ fmap (fmap f) m
+instance Ord k => Foldable (TreeMap k) where
+	foldMap f (TreeMap m) = foldMap (foldMap f) m
+instance Ord k => Traversable (TreeMap k) where
+	traverse f (TreeMap m) = TreeMap <$> traverse (traverse f) m
+instance (Ord k, NFData k, NFData x) => NFData (TreeMap k x) where
+	rnf (TreeMap m) = rnf m
+
+-- * Type 'Path'
+
+-- | A 'Path' is a non-empty list of 'Map' keys.
+type Path k = NonEmpty k
+
+path :: k -> [k] -> Path k
+path = (:|)
+
+list :: Path k -> [k]
+list = Data.List.NonEmpty.toList
+
+reverse :: Path k -> Path k
+reverse = Data.List.NonEmpty.reverse
+
+-- * Type 'Node'
+data Node k x
+ =   Node
+ {   node_size        :: !Int -- ^ The number of non-'Strict.Nothing' 'node_value's reachable from this 'Node'.
+ ,   node_value       :: !(Strict.Maybe x) -- ^ Some value, or 'Strict.Nothing' if this 'Node' is intermediary.
+ ,   node_descendants :: !(TreeMap k x) -- ^ Descendants 'Node's.
+ } deriving (Data, Eq, Show, Typeable)
+
+
+instance (Ord k, Monoid v) => Monoid (Node k v) where
+	mempty =
+		Node
+		 { node_value       = Strict.Nothing
+		 , node_size        = 0
+		 , node_descendants = TreeMap mempty
+		 }
+	mappend
+	 Node{node_value=x0, node_descendants=m0}
+	 Node{node_value=x1, node_descendants=m1} =
+		let node_descendants = union const m0 m1 in
+		let node_value = x0 `mappend` x1 in
+		Node
+		 { node_value
+		 , node_size = size node_descendants
+		               + Strict.maybe 0 (const 1) node_value
+		 , node_descendants
+		 }
+	-- mconcat = Data.List.foldr mappend mempty
+instance Ord k => Functor (Node k) where
+	fmap f Node{node_value=x, node_descendants=m, node_size} =
+		Node
+		 { node_value = fmap f x
+		 , node_descendants = map f m
+		 , node_size
+		 }
+instance Ord k => Foldable (Node k) where
+	foldMap f Node{node_value=Strict.Nothing, node_descendants=TreeMap m} =
+		foldMap (foldMap f) m
+	foldMap f Node{node_value=Strict.Just x, node_descendants=TreeMap m} =
+		f x `mappend` foldMap (foldMap f) m
+instance Ord k => Traversable (Node k) where
+	traverse f Node{node_value=Strict.Nothing, node_descendants=TreeMap m, node_size} =
+		Node node_size <$> pure Strict.Nothing <*> (TreeMap <$> traverse (traverse f) m)
+	traverse f Node{node_value=Strict.Just x, node_descendants=TreeMap m, node_size} =
+		Node node_size <$> (Strict.Just <$> f x) <*> (TreeMap <$> traverse (traverse f) m)
+instance (Ord k, NFData k, NFData x) => NFData (Node k x) where
+	rnf (Node s v d) = rnf s `seq` rnf v `seq` rnf d
+
+node_find :: Ord k => [k] -> Node k x -> Strict.Maybe (Node k x)
+node_find [] n = Strict.Just n
+node_find (k:ks) Node{node_descendants=TreeMap m} =
+	maybe Strict.Nothing (node_find ks) $
+	Data.Map.lookup k m
+
+-- * Construct
+
+-- | Return the empty 'TreeMap'.
+empty :: Ord k => TreeMap k x
+empty = TreeMap Data.Map.empty
+
+-- | Return a 'TreeMap' only mapping the given 'Path' to the given value.
+singleton :: Ord k => Path k -> x -> TreeMap k x
+singleton ks x = insert const ks x empty
+
+-- | Return a 'Node' only containing the given value.
+leaf :: Ord k => x -> Node k x
+leaf x =
+	Node
+	 { node_value = Strict.Just x
+	 , node_descendants = empty
+	 , node_size = 1
+	 }
+
+-- | Return the given 'TreeMap' associating the given 'Path' with the given value,
+-- merging values if the given 'TreeMap' already associates the given 'Path'
+-- with a non-'Strict.Nothing' 'node_value'.
+insert :: Ord k => (x -> x -> x) -> Path k -> x -> TreeMap k x -> TreeMap k x
+insert merge (k:|[]) x (TreeMap m) =
+	TreeMap $
+	Data.Map.insertWith
+	 (\_ Node{node_value = x1, node_descendants = m1, node_size = s1} ->
+		Node
+		 { node_value = Strict.maybe (Strict.Just x) (Strict.Just . merge x) x1
+		 , node_descendants = m1
+		 , node_size = Strict.maybe (s1 + 1) (const s1) x1
+		 })
+	 k (leaf x) m
+insert merge (k:|k':ks) x (TreeMap m) =
+	TreeMap $
+	Data.Map.insertWith
+	 (\_ Node{node_value = x1, node_descendants = m1} ->
+		let m' = insert merge (path k' ks) x m1 in
+		let s' = size m' + Strict.maybe 0 (const 1) x1 in
+		Node{node_value=x1, node_descendants=m', node_size=s'})
+	 k
+	 Node
+		 { node_value = Strict.Nothing
+		 , node_descendants = insert merge (path k' ks) x empty
+		 , node_size = 1
+		 }
+	 m
+
+-- | Return a 'TreeMap' associating for each tuple of the given list
+-- the 'Path' to the value,
+-- merging values of identical 'Path's (in respective order).
+from_List :: Ord k => (x -> x -> x) -> [(Path k, x)] -> TreeMap k x
+from_List merge = Data.List.foldl (\acc (p, x) -> insert merge p x acc) empty
+
+-- | Return a 'TreeMap' associating for each key and value of the given 'Map'
+-- the 'Path' to the value,
+-- merging values of identical 'Path's (in respective order).
+from_Map :: Ord k => (x -> x -> x) -> Map (Path k) x -> TreeMap k x
+from_Map merge = Data.Map.foldlWithKey (\acc p x -> insert merge p x acc) empty
+
+-- * Size
+
+-- | Return the 'Map' in the given 'TreeMap'.
+nodes :: Ord k => TreeMap k x -> Map k (Node k x)
+nodes (TreeMap m) = m
+
+-- | Return 'True' iif. the given 'TreeMap' is 'empty'.
+null :: Ord k => TreeMap k x -> Bool
+null (TreeMap m) = Data.Map.null m
+
+-- | Return the number of non-'Strict.Nothing' 'node_value's in the given 'TreeMap'.
+--
+--   * Complexity: O(r) where r is the size of the root 'Map'.
+size :: Ord k => TreeMap k x -> Int
+size = Data.Map.foldr ((+) . node_size) 0 . nodes
+
+-- * Find
+
+-- | Return the value (if any) associated with the given 'Path'.
+find :: Ord k => Path k -> TreeMap k x -> Strict.Maybe x
+find (k:|[]) (TreeMap m) = maybe Strict.Nothing node_value $ Data.Map.lookup k m
+find (k:|k':ks) (TreeMap m) =
+	maybe Strict.Nothing (find (path k' ks) . node_descendants) $
+	Data.Map.lookup k m
+
+-- | Return the values (if any) associated with the prefixes of the given 'Path' (included).
+find_along :: Ord k => Path k -> TreeMap k x -> [x]
+find_along p (TreeMap tm) =
+	go (list p) tm
+	where
+		go :: Ord k => [k] -> Map k (Node k x) -> [x]
+		go [] _m = []
+		go (k:ks) m =
+			case Data.Map.lookup k m of
+			 Nothing -> []
+			 Just node ->
+				Strict.maybe id (:) (node_value node) $
+				go ks $ nodes (node_descendants node)
+
+find_node :: Ord k => Path k -> TreeMap k x -> Strict.Maybe (Node k x)
+find_node (k:|[]) (TreeMap m) = maybe Strict.Nothing Strict.Just $ Data.Map.lookup k m
+find_node (k:|k':ks) (TreeMap m) =
+	maybe Strict.Nothing (find_node (path k' ks) . node_descendants) $
+	Data.Map.lookup k m
+
+-- * Union
+
+-- | Return a 'TreeMap' associating the same 'Path's as both given 'TreeMap's,
+-- merging values (in respective order) when a 'Path' leads
+-- to a non-'Strict.Nothing' 'node_value' in both given 'TreeMap's.
+union :: Ord k => (x -> x -> x) -> TreeMap k x -> TreeMap k x -> TreeMap k x
+union merge (TreeMap tm0) (TreeMap tm1) =
+	TreeMap $
+	Data.Map.unionWith
+	 (\Node{node_value=x0, node_descendants=m0}
+	   Node{node_value=x1, node_descendants=m1} ->
+		let node_descendants = union merge m0 m1 in
+		let node_value = Strict.maybe x1 (\x0' -> Strict.maybe (Strict.Just x0') (Strict.Just . merge x0') x1) x0 in
+		Node
+		 { node_size = size node_descendants + Strict.maybe 0 (const 1) node_value
+		 , node_value
+		 , node_descendants
+		 })
+	 tm0 tm1
+
+-- | Return the 'union' of the given 'TreeMap's.
+--
+-- NOTE: use 'Data.List.foldl'' to reduce demand on the control-stack.
+unions :: Ord k => (x -> x -> x) -> [TreeMap k x] -> TreeMap k x
+unions merge = Data.List.foldl' (union merge) empty
+
+-- foldl' :: (a -> b -> a) -> a -> [b] -> a
+-- foldl' f = go
+-- 	where
+-- 		go z []     = z
+-- 		go z (x:xs) = z `seq` go (f z x) xs
+
+-- * Map
+
+-- | Return the given 'TreeMap' with each non-'Strict.Nothing' 'node_value'
+-- mapped by the given function.
+map :: Ord k => (x -> y) -> TreeMap k x -> TreeMap k y
+map f =
+	TreeMap .
+	Data.Map.map
+	 (\n@Node{node_value=x, node_descendants=m} ->
+		n{ node_value       = fmap f x
+		 , node_descendants = map f m
+		 }) .
+	nodes
+
+-- | Return the given 'TreeMap' with each 'Path' section
+-- and each non-'Strict.Nothing' 'node_value'
+-- mapped by the given functions.
+--
+-- WARNING: the function mapping 'Path' sections must be monotonic,
+-- like in 'Data.Map.mapKeysMonotonic'.
+map_monotonic :: (Ord k, Ord l) => (k -> l) -> (x -> y) -> TreeMap k x -> TreeMap l y
+map_monotonic fk fx =
+	TreeMap .
+	Data.Map.mapKeysMonotonic fk .
+	Data.Map.map
+	 (\n@Node{node_value=x, node_descendants=m} ->
+		n{ node_value       = fmap fx x
+		 , node_descendants = map_monotonic fk fx m
+		 }) .
+	nodes
+
+-- | Return the given 'TreeMap' with each 'node_value'
+-- mapped by the given function supplied with
+-- the already mapped 'node_descendants' of the current 'Node'.
+map_by_depth_first :: Ord k => (TreeMap k y -> Strict.Maybe x -> y) -> TreeMap k x -> TreeMap k y
+map_by_depth_first f =
+	TreeMap .
+	Data.Map.map
+	 (\Node{node_value, node_descendants} ->
+		let m = map_by_depth_first f node_descendants in
+		Node
+		 { node_value = Strict.Just $ f m node_value
+		 , node_descendants = m
+		 , node_size = size m + 1
+		 }) .
+	nodes
+
+-- * Alter
+
+alterl_path :: Ord k => (Strict.Maybe x -> Strict.Maybe x) -> Path k -> TreeMap k x -> TreeMap k x
+alterl_path fct =
+	go fct . list
+	where
+		go :: Ord k
+		 => (Strict.Maybe x -> Strict.Maybe x) -> [k]
+		 -> TreeMap k x -> TreeMap k x
+		go _f [] m = m
+		go f (k:p) (TreeMap m) =
+			TreeMap $
+			Data.Map.alter
+			 (\c ->
+				let (cv, cm) =
+					case c of
+					 Just Node{node_value=v, node_descendants=d} -> (v, d)
+					 Nothing -> (Strict.Nothing, empty) in
+				let fx = f cv in
+				let gm = go f p cm in
+				case (fx, size gm) of
+				 (Strict.Nothing, 0) -> Nothing
+				 (_, s) -> Just
+					Node
+					 { node_value = fx
+					 , node_descendants = gm
+					 , node_size = s + 1
+					 }
+			 ) k m
+
+-- * Fold
+
+-- | Return the given accumulator folded by the given function
+-- applied on non-'Strict.Nothing' 'node_value's
+-- from left to right through the given 'TreeMap'.
+foldl_with_Path :: Ord k => (a -> Path k -> x -> a) -> a -> TreeMap k x -> a
+foldl_with_Path =
+	foldp []
+	where
+		foldp :: Ord k
+		 => [k] -> (a -> Path k -> x -> a)
+		 -> a -> TreeMap k x -> a
+		foldp p fct a (TreeMap m) =
+			Data.Map.foldlWithKey
+			 (\acc k Node{node_value, node_descendants} ->
+				let acc' = Strict.maybe acc (fct acc (reverse $ path k p)) node_value in
+				foldp (k:p) fct acc' node_descendants) a m
+
+-- | Return the given accumulator folded by the given function
+-- applied on non-'Strict.Nothing' 'Node's and 'node_value's
+-- from left to right through the given 'TreeMap'.
+foldl_with_Path_and_Node :: Ord k => (a -> Node k x -> Path k -> x -> a) -> a -> TreeMap k x -> a
+foldl_with_Path_and_Node =
+	foldp []
+	where
+		foldp :: Ord k
+		 => [k] -> (a -> Node k x -> Path k -> x -> a)
+		 -> a -> TreeMap k x -> a
+		foldp p fct a (TreeMap m) =
+			Data.Map.foldlWithKey
+			 (\acc k n@Node{node_value, node_descendants} ->
+				let acc' = Strict.maybe acc (fct acc n (reverse $ path k p)) node_value in
+				foldp (k:p) fct acc' node_descendants) a m
+
+-- | Return the given accumulator folded by the given function
+-- applied on non-'Strict.Nothing' 'node_value's
+-- from right to left through the given 'TreeMap'.
+foldr_with_Path :: Ord k => (Path k -> x -> a -> a) -> a -> TreeMap k x -> a
+foldr_with_Path =
+	foldp []
+	where
+		foldp :: Ord k
+		 => [k] -> (Path k -> x -> a -> a)
+		 -> a -> TreeMap k x -> a
+		foldp p fct a (TreeMap m) =
+			Data.Map.foldrWithKey
+			 (\k Node{node_value, node_descendants} acc ->
+				let acc' = foldp (k:p) fct acc node_descendants in
+				Strict.maybe acc' (\x -> fct (reverse $ path k p) x acc') node_value) a m
+
+-- | Return the given accumulator folded by the given function
+-- applied on non-'Strict.Nothing' 'Node's and 'node_value's
+-- from right to left through the given 'TreeMap'.
+foldr_with_Path_and_Node :: Ord k => (Node k x -> Path k -> x -> a -> a) -> a -> TreeMap k x -> a
+foldr_with_Path_and_Node =
+	foldp []
+	where
+		foldp :: Ord k
+		 => [k] -> (Node k x -> Path k -> x -> a -> a)
+		 -> a -> TreeMap k x -> a
+		foldp p fct a (TreeMap m) =
+			Data.Map.foldrWithKey
+			 (\k n@Node{node_value, node_descendants} acc ->
+				let acc' = foldp (k:p) fct acc node_descendants in
+				Strict.maybe acc' (\x -> fct n (reverse $ path k p) x acc') node_value) a m
+
+-- | Return the given accumulator folded by the given function
+-- applied on non-'Strict.Nothing' 'node_value's
+-- from left to right along the given 'Path'.
+foldl_path :: Ord k => (Path k -> x -> a -> a) -> Path k -> TreeMap k x -> a -> a
+foldl_path fct =
+	go fct [] . list
+	where
+		go :: Ord k
+		 => (Path k -> x -> a -> a) -> [k] -> [k]
+		 -> TreeMap k x -> a -> a
+		go _f _ [] _t a = a
+		go f p (k:n) (TreeMap t) a =
+			case Data.Map.lookup k t of
+			 Nothing -> a
+			 Just Node{node_value=v, node_descendants=d} ->
+				case v of
+				 Strict.Nothing -> go f (k:p) n d a
+				 Strict.Just x  -> go f (k:p) n d (f (reverse $ path k p) x a)
+
+-- | Return the given accumulator folded by the given function
+-- applied on non-'Strict.Nothing' 'node_value's
+-- from right to left along the given 'Path'.
+foldr_path :: Ord k => (Path k -> x -> a -> a) -> Path k -> TreeMap k x -> a -> a
+foldr_path fct =
+	go fct [] . list
+	where
+		go :: Ord k
+		 => (Path k -> x -> a -> a) -> [k] -> [k]
+		 -> TreeMap k x -> a -> a
+		go _f _ [] _t a = a
+		go f p (k:n) (TreeMap t) a =
+			case Data.Map.lookup k t of
+			 Nothing -> a
+			 Just Node{node_value=v, node_descendants=d} ->
+				case v of
+				 Strict.Nothing -> go f (k:p) n d a
+				 Strict.Just x  -> f (reverse $ path k p) x $ go f (k:p) n d a
+
+-- * Flatten
+
+-- | Return a 'Map' associating each 'Path'
+-- leading to a non-'Strict.Nothing' 'node_value' in the given 'TreeMap',
+-- with its value mapped by the given function.
+flatten :: Ord k => (x -> y) -> TreeMap k x -> Map (Path k) y
+flatten = flatten_with_Path . const
+
+-- | Like 'flatten' but with also the current 'Path' given to the mapping function.
+flatten_with_Path :: Ord k => (Path k -> x -> y) -> TreeMap k x -> Map (Path k) y
+flatten_with_Path =
+	flat_map []
+	where
+		flat_map :: Ord k
+		 => [k] -> (Path k -> x -> y)
+		 -> TreeMap k x
+		 -> Map (Path k) y
+		flat_map p f (TreeMap m) =
+			Data.Map.unions $
+			Data.Map.mapKeysMonotonic (reverse . flip path p) (
+			Data.Map.mapMaybeWithKey (\k Node{node_value} ->
+				case node_value of
+				 Strict.Nothing -> Nothing
+				 Strict.Just x  -> Just $ f (reverse $ path k p) x) m
+			) :
+			Data.Map.foldrWithKey
+			 (\k -> (:) . flat_map (k:p) f . node_descendants)
+			 [] m
+
+-- * Filter
+
+-- | Return the given 'TreeMap'
+--   keeping only its non-'Strict.Nothing' 'node_value's
+--   passing the given predicate.
+filter :: Ord k => (x -> Bool) -> TreeMap k x -> TreeMap k x
+filter f =
+	map_Maybe_with_Path
+	 (\_p x -> if f x then Strict.Just x else Strict.Nothing)
+
+-- | Like 'filter' but with also the current 'Path' given to the predicate.
+filter_with_Path :: Ord k => (Path k -> x -> Bool) -> TreeMap k x -> TreeMap k x
+filter_with_Path f =
+	map_Maybe_with_Path
+	 (\p x -> if f p x then Strict.Just x else Strict.Nothing)
+
+-- | Like 'filter_with_Path' but with also the current 'Node' given to the predicate.
+filter_with_Path_and_Node :: Ord k => (Node k x -> Path k -> x -> Bool) -> TreeMap k x -> TreeMap k x
+filter_with_Path_and_Node f =
+	map_Maybe_with_Path_and_Node
+	 (\n p x -> if f n p x then Strict.Just x else Strict.Nothing)
+
+-- | Return the given 'TreeMap'
+--   mapping its non-'Strict.Nothing' 'node_value's
+--   and keeping only the non-'Strict.Nothing' results.
+map_Maybe :: Ord k => (x -> Strict.Maybe y) -> TreeMap k x -> TreeMap k y
+map_Maybe = map_Maybe_with_Path . const
+
+-- | Like 'map_Maybe' but with also the current 'Path' given to the predicate.
+map_Maybe_with_Path :: Ord k => (Path k -> x -> Strict.Maybe y) -> TreeMap k x -> TreeMap k y
+map_Maybe_with_Path = map_Maybe_with_Path_and_Node . const
+
+-- | Like 'map_Maybe_with_Path' but with also the current 'Node' given to the predicate.
+map_Maybe_with_Path_and_Node :: Ord k => (Node k x -> Path k -> x -> Strict.Maybe y) -> TreeMap k x -> TreeMap k y
+map_Maybe_with_Path_and_Node =
+	go []
+	where
+		go :: Ord k
+		 => [k] -> (Node k x -> Path k -> x -> Strict.Maybe y)
+		 -> TreeMap k x
+		 -> TreeMap k y
+		go p test (TreeMap m) =
+			TreeMap $
+			Data.Map.mapMaybeWithKey
+			 (\k node@Node{node_value=v, node_descendants=ns} ->
+				let node_descendants = go (k:p) test ns in
+				let node_size = size node_descendants in
+				case v of
+				 Strict.Just x ->
+					let node_value = test node (reverse $ path k p) x in
+					case node_value of
+					 Strict.Nothing | null node_descendants -> Nothing
+					 Strict.Nothing -> Just Node{node_value, node_descendants, node_size=1 + node_size}
+					 Strict.Just _  -> Just Node{node_value, node_descendants, node_size}
+				 _ ->
+					if null node_descendants
+					then Nothing
+					else Just Node{node_value=Strict.Nothing, node_descendants, node_size}
+			 ) m
diff --git a/Data/TreeMap/Strict/HLint.hs b/Data/TreeMap/Strict/HLint.hs
new file mode 120000
index 0000000..ab18269
--- /dev/null
+++ b/Data/TreeMap/Strict/HLint.hs
@@ -0,0 +1 @@
+../HLint.hs
\ No newline at end of file
diff --git a/Data/TreeMap/Strict/Test.hs b/Data/TreeMap/Strict/Test.hs
new file mode 100644
index 0000000..23d0988
--- /dev/null
+++ b/Data/TreeMap/Strict/Test.hs
@@ -0,0 +1,158 @@
+{-# LANGUAGE NamedFieldPuns #-}
+{-# LANGUAGE OverloadedStrings #-}
+{-# LANGUAGE ScopedTypeVariables #-}
+{-# LANGUAGE TupleSections #-}
+module Strict.Test where
+
+import Data.Function (($), id, const)
+import Data.Int (Int)
+import Data.List.NonEmpty (NonEmpty(..))
+import qualified Data.Map.Strict as Map
+import Data.Monoid ((<>))
+import qualified Data.Strict.Maybe as Strict
+import Prelude (Integer, undefined)
+import Test.Tasty
+import Test.Tasty.HUnit
+
+import qualified Data.TreeMap.Strict as TreeMap
+
+tests :: TestTree
+tests = testGroup "Strict"
+ [ testGroup "insert"
+	 [ testCase "[] 0" $
+			TreeMap.insert const ((0::Int):|[]) () TreeMap.empty
+		 @?=
+			(TreeMap.TreeMap $
+			Map.fromList
+			 [ (0::Int, TreeMap.leaf ())
+			 ])
+	 , testCase "[] 0/1" $
+			TreeMap.insert const ((0::Int):|[1]) () TreeMap.empty
+		 @?=
+			(TreeMap.TreeMap $
+			Map.fromList
+			 [ (0::Int, TreeMap.Node
+				 { TreeMap.node_value = Strict.Nothing
+				 , TreeMap.node_size = 1
+				 , TreeMap.node_descendants =
+					TreeMap.singleton ((1::Int):|[]) ()
+				 })
+			 ])
+	 ]
+ , testGroup "map_by_depth_first"
+	 [ testCase "[0, 0/1, 0/1/2, 1, 1/2/3]" $
+			TreeMap.map_by_depth_first
+			 (\descendants value ->
+				Map.foldl'
+				 (\acc v -> (<>) acc $
+					Strict.fromMaybe undefined $
+					TreeMap.node_value v
+				 )
+				 (Strict.fromMaybe [] value)
+				 (TreeMap.nodes descendants)
+			 )
+			(TreeMap.from_List const
+			 [ ((0::Integer):|[], [0::Integer])
+			 , (0:|[1], [0,1])
+			 , (0:|[1,2], [0,1,2])
+			 , (1:|[], [1])
+			 , (1:|[2,3], [1,2,3])
+			 ])
+		 @?=
+			TreeMap.from_List const
+			 [ ((0::Integer):|[], [0,0,1,0,1,2])
+			 , (0:|[1], [0,1,0,1,2])
+			 , (0:|[1,2], [0,1,2])
+			 , (1:|[], [1,1,2,3])
+			 , (1:|[2], [1,2,3])
+			 , (1:|[2,3], [1,2,3])
+			 ]
+	 , testCase "[0/0]" $
+			TreeMap.map_by_depth_first
+			 (\descendants value ->
+				Map.foldl'
+				 (\acc v -> (<>) acc $
+					Strict.fromMaybe undefined $
+					TreeMap.node_value v
+				 )
+				 (Strict.fromMaybe [] value)
+				 (TreeMap.nodes descendants)
+			 )
+			(TreeMap.from_List const
+			 [ ((0::Integer):|[0], [0::Integer,0])
+			 ])
+		 @?=
+			TreeMap.from_List const
+			 [ ((0::Integer):|[], [0,0])
+			 , (0:|[0], [0,0])
+			 ]
+	 ]
+ , testGroup "flatten"
+	 [ testCase "[0, 0/1, 0/1/2]" $
+			TreeMap.flatten id
+			(TreeMap.from_List const
+			 [ ((0::Integer):|[], ())
+			 , (0:|[1], ())
+			 , (0:|[1,2], ())
+			 ])
+		 @?=
+			Map.fromList
+			 [ ((0::Integer):|[], ())
+			 , (0:|[1], ())
+			 , (0:|[1,2], ())
+			 ]
+	 , testCase "[1, 1/2, 1/22, 1/2/3, 1/2/33, 11, 11/2, 11/2/3, 11/2/33]" $
+			TreeMap.flatten id
+			(TreeMap.from_List const
+			 [ ((1::Integer):|[], ())
+			 , (1:|[2], ())
+			 , (1:|[22], ())
+			 , (1:|[2,3], ())
+			 , (1:|[2,33], ())
+			 , (11:|[], ())
+			 , (11:|[2], ())
+			 , (11:|[2,3], ())
+			 , (11:|[2,33], ())
+			 ])
+		 @?=
+			Map.fromList
+			 [ ((1::Integer):|[], ())
+			 , (1:|[2], ())
+			 , (1:|[22], ())
+			 , (1:|[2,3], ())
+			 , (1:|[2,33], ())
+			 , (11:|[], ())
+			 , (11:|[2], ())
+			 , (11:|[2,3], ())
+			 , (11:|[2,33], ())
+			 ]
+	 ]
+ , testGroup "find_along"
+	 [ testCase "0/1/2/3 [0, 0/1, 0/1/2, 0/1/2/3]" $
+			TreeMap.find_along
+			 (0:|[1,2,3])
+			(TreeMap.from_List const
+			 [ ((0::Integer):|[], [0])
+			 , (0:|[1], [0,1])
+			 , (0:|[1,2], [0,1,2])
+			 , (0:|[1,2,3], [0,1,2,3])
+			 ])
+		 @?=
+			[ [0::Integer]
+			, [0,1]
+			, [0,1,2]
+			, [0,1,2,3]
+			]
+	 , testCase "0/1/2/3 [0, 0/1]" $
+			TreeMap.find_along
+			 (0:|[1,2,3])
+			(TreeMap.from_List const
+			 [ ((0::Integer):|[], [0])
+			 , (0:|[1], [0,1])
+			 ])
+		 @?=
+			[ [0::Integer]
+			, [0,1]
+			]
+	 ]
+ ]
diff --git a/Data/TreeMap/Strict/Zipper.hs b/Data/TreeMap/Strict/Zipper.hs
new file mode 100644
index 0000000..297b2f7
--- /dev/null
+++ b/Data/TreeMap/Strict/Zipper.hs
@@ -0,0 +1,215 @@
+{-# LANGUAGE DeriveDataTypeable #-}
+{-# LANGUAGE NamedFieldPuns #-}
+{-# OPTIONS_GHC -fno-warn-tabs #-}
+
+module Data.TreeMap.Strict.Zipper where
+
+import           Control.Monad (Monad(..), (>=>))
+import           Data.Data (Data)
+import           Data.Eq (Eq)
+import           Data.Function (($), (.))
+import qualified Data.List as List
+import           Data.List.NonEmpty (NonEmpty(..))
+import qualified Data.Map.Strict as Map
+import           Data.Maybe (Maybe(..), maybe, maybeToList)
+import           Data.Ord (Ord(..))
+import           Data.Typeable (Typeable)
+import           Text.Show (Show(..))
+
+import           Data.TreeMap.Strict (TreeMap(..))
+import qualified Data.TreeMap.Strict as TreeMap
+
+-- * Type 'Zipper'
+
+data Zipper k x
+ =   Zipper
+ {   zipper_path :: [Zipper_Step k x]
+ ,   zipper_curr :: TreeMap k x
+ } deriving (Data, Eq, Show, Typeable)
+
+zipper :: TreeMap k x -> Zipper k x
+zipper = Zipper []
+
+zipper_root :: Ord k => Zipper k x -> TreeMap k x
+zipper_root =
+	zipper_curr . List.last .
+	zipper_collect zipper_parent
+
+-- * Type 'Zipper_Step'
+
+data Zipper_Step k x
+ =   Zipper_Step
+ {   zipper_step_prec :: TreeMap k x
+ ,   zipper_step_self :: (k, TreeMap.Node k x)
+ ,   zipper_step_foll :: TreeMap k x
+ } deriving (Data, Eq, Show, Typeable)
+
+-- * Axis
+
+-- | Collect all 'Zipper's along a given axis,
+--   including the first 'Zipper'.
+zipper_collect :: (z -> Maybe z) -> z -> [z]
+zipper_collect f z = z : maybe [] (zipper_collect f) (f z)
+
+-- | Collect all 'Zipper's along a given axis,
+--   excluding the first 'Zipper'.
+zipper_collect_without_self :: (z -> Maybe z) -> z -> [z]
+zipper_collect_without_self f z = maybe [] (zipper_collect f) (f z)
+
+-- ** Axis self
+
+zipper_self :: Ord k => Zipper k x -> Maybe (k, TreeMap.Node k x)
+zipper_self z =
+	case z of
+	 Zipper{ zipper_path=
+	         Zipper_Step{zipper_step_self}
+	         : _ } -> Just zipper_step_self
+	 _ -> Nothing
+
+-- ** Axis child
+
+zipper_child :: Ord k => Zipper k x -> [Zipper k x]
+zipper_child z =
+	maybeToList (zipper_child_first z)
+	>>= zipper_collect zipper_foll
+
+zipper_child_at :: Ord k => k -> Zipper k x -> Maybe (Zipper k x)
+zipper_child_at k (Zipper path (TreeMap m)) =
+	case Map.splitLookup k m of
+	 (_, Nothing, _) -> Nothing
+	 (ps, Just s, fs) ->
+		Just Zipper
+		 { zipper_path = Zipper_Step (TreeMap ps) (k, s) (TreeMap fs) : path
+		 , zipper_curr = TreeMap.node_descendants s
+		 }
+
+zipper_child_first :: Ord k => Zipper k x -> Maybe (Zipper k x)
+zipper_child_first (Zipper path (TreeMap m)) =
+	case Map.minViewWithKey m of
+	 Nothing -> Nothing
+	 Just ((k', s'), fs') ->
+		Just Zipper
+		 { zipper_path = Zipper_Step TreeMap.empty (k', s') (TreeMap fs') : path
+		 , zipper_curr = TreeMap.node_descendants s'
+		 }
+
+zipper_child_last :: Ord k => Zipper k x -> Maybe (Zipper k x)
+zipper_child_last (Zipper path (TreeMap m)) =
+	case Map.maxViewWithKey m of
+	 Nothing -> Nothing
+	 Just ((k', s'), ps') ->
+		Just Zipper
+		 { zipper_path = Zipper_Step (TreeMap ps') (k', s') TreeMap.empty : path
+		 , zipper_curr = TreeMap.node_descendants s'
+		 }
+
+-- ** Axis ancestor
+
+zipper_ancestor :: Ord k => Zipper k x -> [Zipper k x]
+zipper_ancestor = zipper_collect_without_self zipper_parent
+
+zipper_ancestor_or_self :: Ord k => Zipper k x -> [Zipper k x]
+zipper_ancestor_or_self = zipper_collect zipper_parent
+
+-- ** Axis descendant
+
+zipper_descendant_or_self :: Ord k => Zipper k x -> [Zipper k x]
+zipper_descendant_or_self =
+	collect_child []
+	where
+		collect_child acc z =
+			z : maybe acc
+			 (collect_foll acc)
+			 (zipper_child_first z)
+		collect_foll  acc z =
+			collect_child
+			 (maybe acc
+				 (collect_foll acc)
+				 (zipper_foll z)
+			 ) z
+
+zipper_descendant_or_self_reverse :: Ord k => Zipper k x -> [Zipper k x]
+zipper_descendant_or_self_reverse z =
+	z : List.concatMap
+	 zipper_descendant_or_self_reverse
+	 (List.reverse $ zipper_child z)
+
+zipper_descendant :: Ord k => Zipper k x -> [Zipper k x]
+zipper_descendant = List.tail . zipper_descendant_or_self
+
+zipper_descendant_at :: Ord k => TreeMap.Path k -> Zipper k x -> Maybe (Zipper k x)
+zipper_descendant_at (k:|ks) =
+	case ks of
+	 []     -> zipper_child_at k
+	 k':ks' -> zipper_child_at k >=> zipper_descendant_at (k':|ks')
+
+-- ** Axis preceding
+
+zipper_prec :: Ord k => Zipper k x -> Maybe (Zipper k x)
+zipper_prec (Zipper path _curr) =
+	case path of
+	 [] -> Nothing
+	 Zipper_Step (TreeMap ps) (k, s) (TreeMap fs):steps ->
+		case Map.maxViewWithKey ps of
+		 Nothing -> Nothing
+		 Just ((k', s'), ps') ->
+			Just Zipper
+			 { zipper_path = Zipper_Step (TreeMap ps')
+			                             (k', s')
+			                             (TreeMap $ Map.insert k s fs)
+			                 : steps
+			 , zipper_curr = TreeMap.node_descendants s'
+			 }
+
+zipper_preceding :: Ord k => Zipper k x -> [Zipper k x]
+zipper_preceding =
+	zipper_ancestor_or_self >=>
+	zipper_preceding_sibling >=>
+	zipper_descendant_or_self_reverse
+
+zipper_preceding_sibling :: Ord k => Zipper k x -> [Zipper k x]
+zipper_preceding_sibling = zipper_collect_without_self zipper_prec
+
+-- ** Axis following
+
+zipper_foll :: Ord k => Zipper k x -> Maybe (Zipper k x)
+zipper_foll (Zipper path _curr) =
+	case path of
+	 [] -> Nothing
+	 Zipper_Step (TreeMap ps) (k, s) (TreeMap fs):steps ->
+		case Map.minViewWithKey fs of
+		 Nothing -> Nothing
+		 Just ((k', s'), fs') ->
+			Just Zipper
+			 { zipper_path = Zipper_Step (TreeMap $ Map.insert k s ps)
+			                             (k', s')
+			                             (TreeMap fs')
+			                 : steps
+			 , zipper_curr = TreeMap.node_descendants s'
+			 }
+
+zipper_following :: Ord k => Zipper k x -> [Zipper k x]
+zipper_following =
+	zipper_ancestor_or_self >=>
+	zipper_following_sibling >=>
+	zipper_descendant_or_self
+
+zipper_following_sibling :: Ord k => Zipper k x -> [Zipper k x]
+zipper_following_sibling = zipper_collect_without_self zipper_foll
+
+-- ** Axis parent
+
+zipper_parent :: Ord k => Zipper k x -> Maybe (Zipper k x)
+zipper_parent (Zipper path curr) =
+	case path of
+	 [] -> Nothing
+	 Zipper_Step (TreeMap ps) (k, s) (TreeMap fs):steps ->
+		let node = TreeMap.Node
+			 { TreeMap.node_value       = TreeMap.node_value s
+			 , TreeMap.node_size        = TreeMap.size curr
+			 , TreeMap.node_descendants = curr
+			 } in
+		Just Zipper
+		 { zipper_path = steps
+		 , zipper_curr = TreeMap $ Map.union ps $ Map.insert k node fs
+		 }
diff --git a/Data/TreeMap/Test.hs b/Data/TreeMap/Test.hs
new file mode 100644
index 0000000..50828a1
--- /dev/null
+++ b/Data/TreeMap/Test.hs
@@ -0,0 +1,19 @@
+{-# LANGUAGE FlexibleInstances #-}
+{-# LANGUAGE OverloadedStrings #-}
+{-# LANGUAGE ScopedTypeVariables #-}
+{-# LANGUAGE TupleSections #-}
+{-# OPTIONS_GHC -fno-warn-orphans #-}
+module Test where
+
+import Data.Function (($))
+import System.IO (IO)
+import Test.Tasty
+
+import qualified Strict.Test as Strict
+
+main :: IO ()
+main =
+	defaultMain $
+	testGroup "TreeMap"
+	 [ Strict.tests
+	 ]
diff --git a/HLint.hs b/HLint.hs
new file mode 100644
index 0000000..1465960
--- /dev/null
+++ b/HLint.hs
@@ -0,0 +1,3 @@
+import "hint" HLint.HLint
+ignore "Use camelCase"
+ignore "Use import/export shortcut"
diff --git a/Setup.hs b/Setup.hs
new file mode 100644
index 0000000..9a994af
--- /dev/null
+++ b/Setup.hs
@@ -0,0 +1,2 @@
+import Distribution.Simple
+main = defaultMain
diff --git a/stack.yaml b/stack.yaml
new file mode 100644
index 0000000..0394db3
--- /dev/null
+++ b/stack.yaml
@@ -0,0 +1,6 @@
+resolver: lts-6.12
+flags: {}
+packages:
+- '.'
+extra-deps:
+extra-package-dbs: []
diff --git a/treemap.cabal b/treemap.cabal
new file mode 100644
index 0000000..dd3eadd
--- /dev/null
+++ b/treemap.cabal
@@ -0,0 +1,100 @@
+author: Julien Moutinho <julm+haskell+treemap@autogeree.net>
+-- bug-reports: http://bug.autogeree.net/haskell/treemap/
+build-type: Simple
+cabal-version: >= 1.8
+category: Data Structures
+-- data-dir: data
+-- data-files: 
+description: A tree of Data.Map,
+ which is like a 'Map'
+ but whose key is now a 'NonEmpty' list of 'Map' keys (a 'Path')
+ enabling the possibility to gather mapped values
+ by 'Path' prefixes (inside a 'Node').
+extra-source-files:
+  stack.yaml
+extra-tmp-files:
+-- homepage: http://pad.autogeree.net/informatique/haskell/treemap/
+license: GPL-3
+license-file: COPYING
+maintainer: Julien Moutinho <julm+haskell+treemap@autogeree.net>
+name: treemap
+stability: experimental
+synopsis: A tree of Data.Map.
+tested-with: GHC==7.10.3
+version: 1.20160814
+
+source-repository head
+  location: git://git.autogeree.net/haskell/treemap
+  type:     git
+
+Flag dev
+  Default:     False
+  Description: Turn on development settings.
+  Manual:      True
+
+Flag dump
+  Default:     False
+  Description: Dump some intermediate files.
+  Manual:      True
+
+Flag prof
+  Default:     False
+  Description: Turn on profiling settings.
+  Manual:      True
+
+Flag threaded
+  Default:     False
+  Description: Enable threads.
+  Manual:      True
+
+Library
+  extensions: NoImplicitPrelude
+  ghc-options: -Wall -fno-warn-tabs
+  if flag(dev)
+    cpp-options: -DDEVELOPMENT
+    ghc-options:
+  if flag(dump)
+    ghc-options: -ddump-simpl -ddump-stg -ddump-to-file
+  if flag(prof)
+    cpp-options: -DPROFILING
+    ghc-options: -fprof-auto
+  -- default-language: Haskell2010
+  exposed-modules:
+    Data.TreeMap.Strict
+    Data.TreeMap.Strict.Zipper
+  build-depends:
+    base >= 4.6 && < 5
+    , containers >= 0.5 && < 0.6
+    , deepseq
+    , semigroups
+    , strict
+    , transformers >= 0.4 && < 0.5
+
+Test-Suite treemap-test
+  type: exitcode-stdio-1.0
+  -- default-language: Haskell2010
+  extensions: NoImplicitPrelude
+  ghc-options: -Wall -fno-warn-tabs
+               -main-is Test
+  hs-source-dirs: Data/TreeMap
+  main-is: Test.hs
+  other-modules:
+    Strict.Test
+  if flag(threaded)
+    ghc-options: -threaded -rtsopts -with-rtsopts=-N
+  if flag(dev)
+    cpp-options: -DDEVELOPMENT
+    ghc-options:
+  if flag(prof)
+    cpp-options: -DPROFILING
+    ghc-options: -fprof-auto
+  build-depends:
+    base >= 4.6 && < 5
+    , containers >= 0.5 && < 0.6
+    , semigroups
+    , strict
+    , tasty >= 0.11
+    , tasty-hunit
+    , text
+    , transformers >= 0.4 && < 0.5
+    , treemap
-- 
2.47.0