initial commit

.gitignore

@@ -0,0 +1,7 @@
+/lib
+/meson-*
+build.ninja
+compile_commands.json
+/tests
+.ninja_log
+.ninja_deps

LICENSE

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://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 <https://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
+<https://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
+<https://www.gnu.org/licenses/why-not-lgpl.html>.

src/lib/Concrete/ArrayEnumerable.vala

@@ -0,0 +1,24 @@
+
+namespace Invercargill {
+
+    internal class ArrayEnumerable<T> : Enumerable<T> {
+
+        private T[] array;
+
+        public ArrayEnumerable(T[] input) {
+            assert_false (typeof(T).is_value_type ());
+            array = input;
+        }
+
+        public override bool iterate_if (Invercargill.PredicateDelegate<T> handler) {
+            foreach (var item in array) {
+                if(!handler(item)) {
+                    break;
+                }
+            }
+            return true;
+        }
+
+    }
+
+}

src/lib/Concrete/ConcatEnumerable.vala

@@ -0,0 +1,23 @@
+
+namespace Invercargill {
+
+    internal class ConcatEnumerable<T> : Enumerable<T> {
+
+        private Enumerable<T> e1;
+        private Enumerable<T> e2;
+
+        public ConcatEnumerable(Enumerable<T> first, Enumerable<T> second) {
+            e1 = first;
+            e2 = second;
+        }
+
+        public override bool iterate_if (Invercargill.PredicateDelegate<T> handler) {
+            if(e1.iterate_if (handler)) {
+                return e2.iterate_if (handler);
+            }
+            return false;
+        }
+
+    }
+
+}

src/lib/Concrete/DirEnumerable.vala

@@ -0,0 +1,26 @@
+
+namespace Invercargill {
+
+    internal class DirEnumerable : Enumerable<string> {
+
+        private Dir dir;
+
+        public DirEnumerable(owned Dir dir) {
+            this.dir = (owned)dir;
+        }
+
+        public override bool iterate_if (Invercargill.PredicateDelegate<T> handler) {
+            string? name = null;
+            while ((name = dir.read_name ()) != null) {
+                if(!handler(name)) {
+                    dir.rewind();
+                    return false;
+                }
+            }
+            dir.rewind();
+            return true;
+        }
+
+    }
+
+}

src/lib/Concrete/GeeEnumerable.vala

@@ -0,0 +1,25 @@
+
+using Gee;
+
+namespace Invercargill {
+
+    private class GeeEnumerable<T> : Enumerable<T> {
+
+        private Iterable<T> iterable;
+
+        public GeeEnumerable(Iterable<T> gee) {
+            iterable = gee;
+        }
+
+        public override bool iterate_if (Invercargill.PredicateDelegate<T> handler) {
+            foreach(var item in iterable) {
+                if(!handler(item)) {
+                    return false;
+                }
+            }
+            return true;
+        }
+
+    }
+
+}

src/lib/Concrete/ListEnumerable.vala

@@ -0,0 +1,23 @@
+
+//  namespace Invercargill {
+
+//      internal class ListEnumerable<T> : Enumerable<T> {
+
+//          private List<T> list;
+
+//          public ListEnumerable(owned List<T> input) {
+//              list = input;
+//          }
+
+//          public override bool iterate_if (Invercargill.PredicateDelegate<T> handler) {
+//              foreach (var item in list) {
+//                  if(!handler(item)) {
+//                      break;
+//                  }
+//              }
+//              return true;
+//          }
+
+//      }
+
+//  }

src/lib/Concrete/PairEnumerable.vala

@@ -0,0 +1,28 @@
+namespace Invercargill {
+
+    public class PairEnumerable<T1, T2> : Enumerable<Pair<T1, T2>> {
+
+        private Sequence<T1> s1;
+        private Sequence<T2> s2;
+
+        public PairEnumerable(Sequence<T1> seq1, Sequence<T2> seq2) {
+            s1 = seq1;
+            s2 = seq2;
+        }
+
+        public override bool iterate_if (PredicateDelegate<T> handler) {
+            var current1 = s1.root;
+            var current2 = s2.root;
+            while(current1 != null || current2 != null) {
+                if(!handler(new Pair<T1, T2>(current1?.value, current2?.value))) {
+                    return false;
+                }
+                current1 = current1?.next;
+                current2 = current2?.next;
+            }
+            return true;
+        }
+
+    }
+
+}

src/lib/Concrete/RangeEnumerable.vala

@@ -0,0 +1,27 @@
+
+namespace Invercargill {
+
+    internal class RangeEnumerable : Enumerable<int> {
+
+        private int start;
+        private int stride;
+        private int stop;
+
+        public RangeEnumerable(int initial, int end, int stride) {
+            start = initial;
+            stop = end;
+            this.stride = stride;
+        }
+
+        public override bool iterate_if (Invercargill.PredicateDelegate<int> handler) {
+            for(int i = start; i < stop; i += stride) {
+                if(!handler(i)) {
+                    return false;
+                }
+            }
+            return true;
+        }
+
+    }
+
+}

src/lib/Concrete/Sequence.vala

@@ -0,0 +1,65 @@
+namespace Invercargill {
+
+    public class Sequence<T> : Enumerable<T> {
+     
+        internal class SequenceItem<T> {
+            public SequenceItem next = null;
+            public T value;
+
+            public SequenceItem(T value) {
+                this.value = value;
+            }
+        }
+
+        internal SequenceItem<T> root;
+        internal SequenceItem<T> end;
+        private int n_items = 0;
+
+        public Sequence() {}
+
+        public override bool iterate_if (PredicateDelegate<T> handler) {
+            var current = root;
+            while(current != null) {
+                if(!handler(current.value)) {
+                    return false;
+                }
+                current = current.next;
+            }
+            return true;
+        }
+
+        public override T[] to_array () {
+            var arr = new T[n_items];
+            var count = 0;
+            iterate(i => {
+                arr[count] = i;
+                count++;
+            });
+            return arr;
+        }
+
+        public void add(T item) {
+            lock(root) {
+                n_items++;
+                var si = new SequenceItem<T>(item);
+                if(root == null) {
+                    root = si;
+                    end = si;
+                    return;
+                }
+                end.next = si;
+                end = si;
+            }
+        }
+
+        public override int count() {
+            return n_items;
+        }
+
+        public override Enumerable<Pair<T, Tother>> pair<Tother>(Enumerable<Tother> other) {
+            return new PairEnumerable<T, Tother>(this, other.to_sequence());
+        }
+
+    }
+
+}

src/lib/Delegates.vala

@@ -0,0 +1,19 @@
+namespace Invercargill {
+
+    public delegate void ItemDelegate<T>(T item);
+
+    public delegate Tout TransformDelegate<Tin, Tout>(Tin item);
+
+    public delegate bool PredicateDelegate<T>(T item);
+
+    public delegate Taggrigate AggrigateDelegate<Taggrigate, Tin>(Taggrigate aggrigate, Tin item);
+
+    public delegate int CompareDelegate<T>(T a, T b);
+
+    public delegate bool EqualityDelegate<T>(T a, T b);
+
+    public delegate Tout ErrorThrowingDelegate<Tin, Tout>(Tin item) throws Error;
+
+    public delegate Tout ErrorCatchingDelegate<Tin, Tout>(Tin item, Error error);
+
+}

src/lib/Enumerable.vala

@@ -0,0 +1,110 @@
+
+namespace Invercargill {
+
+    public abstract class Enumerable<T> {
+
+        // Returns false if iteration was interrupted
+        // Returns true if iteration reached natural end
+        public abstract bool iterate_if(PredicateDelegate<T> handler);
+
+        public virtual void iterate(ItemDelegate<T> handler) {
+            iterate_if(i => {
+                handler(i);
+                return true;
+            });
+        }
+
+        public virtual Sequence<T> to_sequence() {
+            var sequence = new Sequence<T>();
+            iterate(i => sequence.add(i));
+            return sequence;
+        }
+
+        public virtual Gee.Collection to_collection() {
+            var collection = new Gee.LinkedList<T>();
+            iterate(i => collection.add(i));
+            return collection;
+        }
+
+        public virtual T[] to_array() {
+            return to_collection().to_array();
+        }
+
+        public virtual int count() {
+            var count = 0;
+            iterate(i => count++);
+            return count;
+        }
+
+        public virtual bool any(PredicateDelegate<T> predicate) {
+            var result = false;
+            iterate_if(i => {
+                if(predicate(i)) {
+                    result = true;
+                    return false;
+                }
+                return true;
+            });
+
+            return result;
+        }
+
+        public virtual bool all(PredicateDelegate<T> predicate) {
+            return !any(i => !predicate(i));
+        }
+
+        public virtual bool no(PredicateDelegate<T> predicate) {
+            return all(i => !predicate(i));
+        }
+
+        public Enumerable<T> where(PredicateDelegate<T> predicate) {
+            return new FilterQuery<T>(this, predicate);
+        }
+
+        public Enumerable<Tout> select<Tout>(TransformDelegate<T, Tout> transform) {
+            return new TransformQuery<T, Tout>(this, transform);
+        }
+
+        public Enumerable<Tout> select_many<Tout>(TransformDelegate<T, Enumerable<Tout>> transform) {
+            return new MergeQuery<Tout>(new TransformQuery<T, Enumerable<Tout>>(this, transform));
+        }
+
+        public Enumerable<T> sort(CompareDelegate<T> compare) {
+            return new SortQuery<T>(this, compare);
+        }
+
+        public Enumerable<T> concat(Enumerable<T> other) {
+            return new ConcatEnumerable<T>(this, other);
+        }
+
+        public Enumerable<T> take(int count) {
+            return new TakeQuery<T>(this, count);
+        }
+
+        public Enumerable<T> skip(int count) {
+            return new SkipQuery<T>(this, count);
+        }
+
+        public virtual Tout aggrigate<Tout>(Tout initial, AggrigateDelegate aggrigate_func) {
+            var aggrigate = initial;
+            iterate(i => {
+                aggrigate = aggrigate_func(aggrigate, i);
+            });
+            return aggrigate;
+        }
+
+        public virtual bool contains(T item) {
+            return any(i => i == item);
+        }
+
+        public virtual Enumerable<Pair<T, Tother>> pair<Tother>(Enumerable<Tother> other) {
+            return to_sequence().pair(other);
+        }
+
+        public virtual bool matches(Enumerable<T> other, EqualityDelegate<T> equals) {
+            return pair(other).all(p => equals(p.value1, p.value2));
+        }
+
+    }
+
+}

src/lib/Invercargill.vala

@@ -0,0 +1,50 @@
+
+namespace Invercargill {
+
+    public static Enumerable<T> ate<T>(T[] input) {
+        if(typeof(T).is_value_type()) {
+            // LibGee has already done the hard work around
+            // Vala's funkyness with arrays of type arguments
+            var gee = new Gee.ArrayList<T>.wrap(input);
+            return new GeeEnumerable<T>(gee);
+        }
+
+        return new ArrayEnumerable<T>(input);
+    }
+
+    public static Enumerable<T> gte<T>(Gee.Iterable<T> input) {
+        return new GeeEnumerable<T>(input);
+    }
+
+    public static Enumerable<string> dte(owned Dir input) {
+        return new DirEnumerable((owned)input);
+    }
+
+    public static Enumerable<int> range(int count, int start = 0, int increment = 1) {
+        return new RangeEnumerable(start, count, increment);
+    }
+
+    public static TransformDelegate<Tin, Tout> trycatch<Tin, Tout>(ErrorThrowingDelegate<Tin, Tout> main, ErrorCatchingDelegate<Tin, Tout> handler) {
+        return (i) => {
+            try {
+                return main(i);
+            }
+            catch(Error e) {
+                return handler(i, e);
+            }
+        };
+    }
+
+    public static TransformDelegate<Tin, Tout> trydefault<Tin, Tout>(ErrorThrowingDelegate<Tin, Tout> func, Tout default_value) {
+        return (i) => {
+            try {
+                return func(i);
+            }
+            catch {
+                return default_value;
+            }
+        };
+    }
+
+
+}

src/lib/Pair.vala

@@ -0,0 +1,15 @@
+
+namespace Invercargill {
+
+    public class Pair<T1, T2> {
+
+        public T1 value1 {get; set;}
+        public T2 value2 {get; set;}
+
+        public Pair(T1 v1, T2 v2) {
+            value1 = v1;
+            value2 = v2;
+        }
+    }
+
+}

src/lib/Queries/Filter.vala

@@ -0,0 +1,23 @@
+namespace Invercargill {
+
+    private class FilterQuery<T> : BaseQuery<T, T> {
+        private PredicateDelegate<T> predicate_func;
+
+        public FilterQuery(Enumerable<T> input, PredicateDelegate<T> func) {
+            this.input = input;
+            predicate_func = x => func(x);
+        }
+
+        public override bool iterate_if (Invercargill.PredicateDelegate<T> handler) {
+            return input.iterate_if(i => {
+                if(predicate_func(i)) {
+                    if(!handler(i)) {
+                        return false;
+                    }
+                }
+                return true;
+            });
+        }
+    }
+
+}

src/lib/Queries/Merge.vala

@@ -0,0 +1,15 @@
+namespace Invercargill {
+
+    private class MergeQuery<T> : BaseQuery<Enumerable<T>, T> {
+
+        public MergeQuery(Enumerable<Enumerable<T>> input) {
+            this.input = input;
+        }
+
+        public override bool iterate_if(Invercargill.PredicateDelegate<T> handler) {
+            return input.iterate_if(i => i.iterate_if(handler));
+        }
+
+    }
+
+}

src/lib/Queries/Query.vala

@@ -0,0 +1,7 @@
+namespace Invercargill {
+
+    private abstract class BaseQuery<Tin, Tout> : Enumerable<Tout> {
+        internal Enumerable<Tin> input {get; set;}
+    }
+
+}

src/lib/Queries/Skip.vala

@@ -0,0 +1,25 @@
+namespace Invercargill {
+
+    private class SkipQuery<T> : BaseQuery<T, T> {
+
+        private int n_items {get; set;}
+
+        public SkipQuery(Enumerable<T> input, int skip) {
+            this.input = input;
+            n_items = skip;
+        }
+
+        public override bool iterate_if (Invercargill.PredicateDelegate<T> handler) {
+            var c = 0;
+            return input.iterate_if(i => {
+                if(c >= n_items) {
+                    c++;
+                    return handler(i);
+                }
+                c++;
+                return true;
+            });
+        }
+    }
+
+}

src/lib/Queries/Sort.vala

@@ -0,0 +1,29 @@
+namespace Invercargill {
+
+    private class SortQuery<T> : BaseQuery<T, T> {
+        private CompareDelegate<T> compare_func;
+
+        public SortQuery(Enumerable<T> input, CompareDelegate<T> compare) {
+            this.input = input;
+            compare_func = (a, b) => compare(a, b);
+        }
+
+        public override bool iterate_if (Invercargill.PredicateDelegate<T> handler) {
+            // Hack for now
+            var list = to_collection();
+            list.order_by ((a, b) => compare_func(a, b));
+            return gte<T>(list).iterate_if(handler);
+        }
+
+        private class SortItem<T> {
+            public CompareDelegate<T> compare_func;
+            public T item;
+
+            public SortItem(T item, CompareDelegate<T> func) {
+                this.item = item;
+                compare_func = (a, b) => func(a, b);
+            }
+        }
+    }
+
+}

src/lib/Queries/Take.vala

@@ -0,0 +1,24 @@
+namespace Invercargill {
+
+    private class TakeQuery<T> : BaseQuery<T, T> {
+
+        private int n_items {get; set;}
+
+        public TakeQuery(Enumerable<T> input, int count) {
+            this.input = input;
+            n_items = count;
+        }
+
+        public override bool iterate_if (Invercargill.PredicateDelegate<T> handler) {
+            var c = 0;
+            return input.iterate_if(i => {
+                if(c < n_items) {
+                    c++;
+                    return handler(i);
+                }
+                return false;             
+            });
+        }
+    }
+
+}

src/lib/Queries/Transform.vala

@@ -0,0 +1,16 @@
+namespace Invercargill {
+
+    private class TransformQuery<Tin, Tout> : BaseQuery<Tin, Tout> {
+        private TransformDelegate<Tin, Tout> transform_func;
+
+        public TransformQuery(Enumerable<Tin> input, TransformDelegate<Tin, Tout> transform) {
+            this.input = input;
+            transform_func = x => transform(x);
+        }
+
+        public override bool iterate_if (Invercargill.PredicateDelegate<Tout> handler) {
+            return input.iterate_if(i => handler(transform_func(i)));
+        }
+    }
+
+}

src/lib/meson.build

@@ -0,0 +1,49 @@
+add_project_arguments('-DFUSE_USE_VERSION=26', language: 'c')
+
+dependencies = [
+    dependency('glib-2.0'),
+    dependency('gobject-2.0'),
+    dependency('gee-0.8')
+]
+
+sources = files('Invercargill.vala')
+sources += files('Enumerable.vala')
+sources += files('Delegates.vala')
+sources += files('Pair.vala')
+
+sources += files('Queries/Query.vala')
+sources += files('Queries/Transform.vala')
+sources += files('Queries/Filter.vala')
+sources += files('Queries/Merge.vala')
+sources += files('Queries/Sort.vala')
+sources += files('Queries/Skip.vala')
+sources += files('Queries/Take.vala')
+
+sources += files('Concrete/ArrayEnumerable.vala')
+sources += files('Concrete/GeeEnumerable.vala')
+sources += files('Concrete/ListEnumerable.vala')
+sources += files('Concrete/RangeEnumerable.vala')
+sources += files('Concrete/ConcatEnumerable.vala')
+sources += files('Concrete/PairEnumerable.vala')
+sources += files('Concrete/DirEnumerable.vala')
+sources += files('Concrete/Sequence.vala')
+
+invercargill = shared_library('invercargill', sources,
+    dependencies: dependencies,
+    install: true,
+    vala_gir: 'invercargill-1.0.gir',
+    install_dir: [true, true, true, true]
+)
+invercargill_dep = declare_dependency(link_with: invercargill, include_directories: include_directories('.'))
+
+pkg = import('pkgconfig')
+pkg.generate(invercargill,
+    version : '0.1',
+    name : 'invercargill',)
+    
+g_ir_compiler = find_program('g-ir-compiler')
+custom_target('invercargill typelib', command: [g_ir_compiler, '--shared-library=invercargill.so', '--output', '@OUTPUT@', meson.current_build_dir() / 'invercargill-1.0.gir'],
+              output: 'invercargill-1.0.typelib',
+              depends: invercargill,
+              install: true,
+              install_dir: get_option('libdir') / 'girepository-1.0')

src/meson.build

@@ -0,0 +1,8 @@
+project('invercargill', 'vala', 'c')
+subdir('lib')
+
+dependencies += invercargill_dep
+subdir('tests')
+
+# dependencies += dependency('fuse')
+# subdir('fuse')

src/tests/Integration/Select.vala

@@ -0,0 +1,58 @@
+using Invercargill;
+
+void select_tests() {
+
+    Test.add_func("/invercargill/operator/select/multiply", () => {
+        var items = ate(new int[] { 1, 2, 3, 4, 5, 6});
+        var expected = ate(new int[] {2, 4, 6, 8, 10, 12});
+
+        var result = items.select<int>(i => i * 2);
+        
+        assert_true(expected.matches(result, (a, b) => a == b));
+    });
+
+    Test.add_func("/invercargill/operator/select/new-type", () => {
+        var items = ate(new int[] { 1, 2, 3, 4, 5, 6});
+        var expected = ate(new double?[] {0.5, 1.0, 1.5, 2.0, 2.5, 3.0});
+
+        var result = items.select<double?>(i => ((double?)i)/2.0);
+        
+        assert_true(expected.matches(result, (a, b) => a == b));
+    });
+
+    Test.add_func("/invercargill/operator/select/non-reference", () => {
+        var items = ate(new Obj1[] { 
+            new Obj1() {
+                firstname = "Billy",
+                lastname = "Barrow"
+            },
+            new Obj1() {
+                firstname = "Dylan",
+                lastname = "Erskine"
+            }
+        });
+
+        var expected = ate(new Obj2[] {
+            new Obj2() {
+                fullname = "Billy Barrow"
+            },
+            new Obj2() {
+                fullname = "Dylan Erskine"
+            }
+        });
+
+        var result = items.select<Obj2>(i => new Obj2() { fullname = @"$(i.firstname) $(i.lastname)"});
+        
+        assert_true(expected.matches(result, (a, b) => a.fullname == b.fullname));
+    });
+
+}
+
+class Obj1 {
+    public string firstname {get; set;}
+    public string lastname {get; set;}
+}
+
+class Obj2 {
+    public string fullname {get; set;}
+}

src/tests/Integration/SelectMany.vala

@@ -0,0 +1,57 @@
+using Invercargill;
+
+void select_many_tests() {
+
+    Test.add_func("/invercargill/operator/select-many", () => {
+        var items = ate(new Obj3[] {
+            new Obj3() {
+                people = new Obj1[] {
+                    new Obj1() {
+                        firstname = "Billy",
+                        lastname = "Barrow",
+                    },
+                    new Obj1() {
+                        firstname = "John",
+                        lastname = "Doe",
+                    },
+                }
+            },
+            new Obj3() {
+                people = new Obj1[] {
+                    new Obj1() {
+                        firstname = "Tim",
+                        lastname = "Shadbolt",
+                    },
+                    new Obj1() {
+                        firstname = "Bob",
+                        lastname = "Parker",
+                    },
+                }
+            }
+        });
+
+        var expected = ate(new Obj2[] {
+            new Obj2() {
+                fullname = "Billy Barrow"
+            },
+            new Obj2() {
+                fullname = "John Doe"
+            },
+            new Obj2() {
+                fullname = "Tim Shadbolt"
+            },
+            new Obj2() {
+                fullname = "Bob Parker"
+            }
+        });
+
+        var result = items.select_many<Obj2>(i => ate(i.people).select<Obj2>(p => new Obj2() { fullname = @"$(p.firstname) $(p.lastname)"}));
+        
+        assert_true(expected.matches(result, (a, b) => a.fullname == b.fullname));
+    });
+
+}
+
+class Obj3 {
+    public Obj1[] people {get; set;}
+}

src/tests/Integration/Where.vala

@@ -0,0 +1,32 @@
+using Invercargill;
+
+void where_tests() {
+
+    Test.add_func("/invercargill/operator/where/all-true", () => {
+        var items = ate(new int[] { 1, 2, 3, 4, 5, 6});
+        var expected = ate(new int[] {1, 2, 3, 4, 5, 6});
+
+        var result = items.where(i => true);
+        
+        assert_true(expected.matches(result, (a, b) => a == b));
+    });
+
+    Test.add_func("/invercargill/operator/where/all-false", () => {
+        var items = ate(new int[] { 1, 2, 3, 4, 5, 6});
+        var expected = ate(new int[] {});
+
+        var result = items.where(i => false);
+        
+        assert_true(expected.matches(result, (a, b) => a == b));
+    });
+
+    Test.add_func("/invercargill/operator/where/gt-4", () => {
+        var items = ate(new int[] { 1, 2, 3, 4, 5, 6});
+        var expected = ate(new int[] {4, 5, 6});
+
+        var result = items.where(i => i > 3);
+        
+        assert_true(expected.matches(result, (a, b) => a == b));
+    });
+
+}

src/tests/TestRunner.vala

@@ -0,0 +1,13 @@
+
+public static int main(string[] args) {
+
+    Test.init(ref args);
+
+    where_tests();
+    select_tests();
+    select_many_tests();
+
+    Test.run();
+
+    return 0;
+}

src/tests/meson.build

@@ -0,0 +1,10 @@
+
+sources = files('TestRunner.vala')
+sources += files('Integration/Where.vala')
+sources += files('Integration/Select.vala')
+sources += files('Integration/SelectMany.vala')
+sources += files('Integration/Skip.vala')
+sources += files('Integration/Take.vala')
+sources += files('Integration/Sort.vala')
+
+executable('invercargill-test-suite', sources, dependencies: dependencies, install: true)