@tablecraft-app/plugin-duckdb-linux-x64 1.31.0 → 1.37.0

package/LICENSE

@@ -1,21 +1,674 @@
-MIT License
-
-Copyright (c) 2026 tranphucbol
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
+                    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>.

package/LICENSE-EXCEPTION

@@ -0,0 +1,13 @@
+TableCraft plugin exception
+
+Additional permission under GNU GPL version 3 section 7
+
+If you modify TableCraft, or any covered work, by combining it with a datasource plugin (or a
+modified version of one) that interacts with TableCraft only through the interfaces published in
+@tablecraft-app/plugin-api, the licensors of TableCraft grant you additional permission to convey
+the resulting work. Such a plugin need not be licensed under the GNU GPL, and its Corresponding
+Source need not be provided. The parts of the resulting work that are TableCraft remain under the
+GNU GPL.
+
+You may remove this additional permission from your copy of TableCraft, or from a modified
+version of it, as section 7 of the GNU GPL allows.

package/index.js

@@ -5537,7 +5537,8 @@ var CAPABILITIES$1 = [
 	"maintenance",
 	"coordination",
 	"bulkTransfer",
-	"savepoints"
+	"savepoints",
+	"rowLimit"
 ];
 /**
 * Whether a switch over `targets` can name `namespace`. Not by `Namespace.kind` alone: MySQL lists
@@ -5828,6 +5829,9 @@ strictObject({
 }).refine((manifest) => !manifest.capabilities.includes("savepoints") || manifest.capabilities.includes("sql") && manifest.capabilities.includes("transactions"), {
 	message: "the savepoints capability requires sql and transactions",
 	path: ["capabilities"]
+}).refine((manifest) => !manifest.capabilities.includes("rowLimit") || manifest.capabilities.includes("sql"), {
+	message: "the rowLimit capability requires sql",
+	path: ["capabilities"]
 });
 // ../plugin-api/src/services.ts
 var SESSION_KEYS = {
@@ -5858,7 +5862,8 @@ var LANGUAGE_KEYS = {
 	bulkInsert: true,
 	objects: true,
 	routineCall: true,
-	savepoints: true
+	savepoints: true,
+	rowLimit: true
 };
 Object.keys(SESSION_KEYS);
 Object.keys(LANGUAGE_KEYS);
@@ -16440,7 +16445,7 @@ var NOT_A_NAME$1 = /* @__PURE__ */ new Set([
 	"NULL"
 ]);
 var AS$5 = "AS";
-var WITH$5 = "WITH";
+var WITH$6 = "WITH";
 var RECURSIVE$1 = "RECURSIVE";
 var CTE_MODIFIERS$1 = /* @__PURE__ */ new Set(["NOT", "MATERIALIZED"]);
 var SELECT_MODIFIERS$2 = /* @__PURE__ */ new Set(["DISTINCT", "ALL"]);
@@ -16596,7 +16601,7 @@ var QueryReader = class {
 	}
 	read() {
 		const statement = this.#statement;
-		if (statement.word(this.#index()) === WITH$5) this.#readCtes();
+		if (statement.word(this.#index()) === WITH$6) this.#readCtes();
 		let expectRelation = false;
 		let fromList = false;
 		let into = false;
@@ -17052,7 +17057,7 @@ var SELECT_READ_ONLY_REASONS = {
 	derived: "the result reads a subquery or function, not a table",
 	noTable: "the result reads no table"
 };
-var SELECT$1 = "SELECT";
+var SELECT$2 = "SELECT";
 var FROM = "FROM";
 var AS$4 = "AS";
 var STAR$1 = "*";
@@ -17064,7 +17069,7 @@ var OVER = "OVER";
 var ONLY = "ONLY";
 var ON$2 = "ON";
 var NOT = "NOT";
-var WITH$4 = "WITH";
+var WITH$5 = "WITH";
 var DISTINCT = /* @__PURE__ */ new Set([
 	"DISTINCT",
 	"DISTINCTROW",
@@ -17091,7 +17096,7 @@ var JOINS = /* @__PURE__ */ new Set([
 	"OUTER"
 ]);
 var GROUPING = /* @__PURE__ */ new Set(["GROUP", "HAVING"]);
-var SET_OPERATIONS = /* @__PURE__ */ new Set([
+var SET_OPERATIONS$1 = /* @__PURE__ */ new Set([
 	"UNION",
 	"INTERSECT",
 	"EXCEPT",
@@ -17189,7 +17194,7 @@ var Reader = class {
 			if (symbol === CLOSE$4) subqueries.pop();
 			depth.push(subqueries.length);
 			inSubquery.push(subqueries.some(Boolean));
-			if (symbol === OPEN$5) subqueries.push(this.word(this.tokens[index + 1]) === SELECT$1);
+			if (symbol === OPEN$5) subqueries.push(this.word(this.tokens[index + 1]) === SELECT$2);
 		});
 		return {
 			depth,
@@ -17257,7 +17262,7 @@ function tailRefusal(reader, from, depth) {
 	if (from < tokens.length && (first === null || !TAIL_CLAUSES.has(first))) {
 		if (reader.symbol(tokens[from]) === COMMA$7 || first !== null && JOINS.has(first)) return SELECT_READ_ONLY_REASONS.joins;
 		if (first !== null && GROUPING.has(first)) return SELECT_READ_ONLY_REASONS.aggregates;
-		if (first !== null && SET_OPERATIONS.has(first)) return SELECT_READ_ONLY_REASONS.combines;
+		if (first !== null && SET_OPERATIONS$1.has(first)) return SELECT_READ_ONLY_REASONS.combines;
 		return SELECT_READ_ONLY_REASONS.notSelect;
 	}
 	for (let at = from; at < tokens.length; at += 1) {
@@ -17265,7 +17270,7 @@ function tailRefusal(reader, from, depth) {
 		const word = reader.word(tokens[at]);
 		if (word === null) continue;
 		if (GROUPING.has(word)) return SELECT_READ_ONLY_REASONS.aggregates;
-		if (SET_OPERATIONS.has(word)) return SELECT_READ_ONLY_REASONS.combines;
+		if (SET_OPERATIONS$1.has(word)) return SELECT_READ_ONLY_REASONS.combines;
 		if (JOINS.has(word) || word === ON$2 && at > from) return SELECT_READ_ONLY_REASONS.joins;
 		if (OTHER_TAIL.has(word) && word !== NOT) return SELECT_READ_ONLY_REASONS.notSelect;
 	}
@@ -17279,9 +17284,9 @@ function parseSimpleSelect(sql, dialect) {
 	const tokens = significantTokens(sql, dialect).filter((token) => token.kind !== "delimiter");
 	const reader = new Reader(sql, tokens);
 	const head = reader.word(tokens[0]);
-	if (head === WITH$4) return { readOnly: SELECT_READ_ONLY_REASONS.with };
+	if (head === WITH$5) return { readOnly: SELECT_READ_ONLY_REASONS.with };
 	if (reader.symbol(tokens[0]) === OPEN$5) return { readOnly: SELECT_READ_ONLY_REASONS.combines };
-	if (head !== SELECT$1) return { readOnly: SELECT_READ_ONLY_REASONS.notSelect };
+	if (head !== SELECT$2) return { readOnly: SELECT_READ_ONLY_REASONS.notSelect };
 	const { depth, inSubquery } = reader.depths();
 	let at = 1;
 	const modifier = reader.word(tokens[at]);
@@ -17326,7 +17331,7 @@ function parseSimpleSelect(sql, dialect) {
 	};
 }
 function isClauseWord(word) {
-	return TAIL_CLAUSES.has(word) || JOINS.has(word) || GROUPING.has(word) || SET_OPERATIONS.has(word) || OTHER_TAIL.has(word) || word === ON$2 || word === ONLY;
+	return TAIL_CLAUSES.has(word) || JOINS.has(word) || GROUPING.has(word) || SET_OPERATIONS$1.has(word) || OTHER_TAIL.has(word) || word === ON$2 || word === ONLY;
 }
 // ../plugin-api/src/sql/namespace.ts
 var USE = "USE";
@@ -18534,10 +18539,10 @@ function sqlCompleter(options) {
 	};
 }
 // ../plugin-api/src/sql/words.ts
-var OPEN_PAREN = "(";
-var CLOSE_PAREN = ")";
-var WITH$3 = "WITH";
-var MAIN_VERBS = /* @__PURE__ */ new Set([
+var OPEN_PAREN$1 = "(";
+var CLOSE_PAREN$1 = ")";
+var WITH$4 = "WITH";
+var MAIN_VERBS$1 = /* @__PURE__ */ new Set([
 	"SELECT",
 	"INSERT",
 	"UPDATE",
@@ -18550,8 +18555,8 @@ function words(sql, tokens) {
 	let depth = 0;
 	for (const token of tokens) if (token.kind === "symbol") {
 		const char = sql.charAt(token.from);
-		if (char === OPEN_PAREN) depth += 1;
-		else if (char === CLOSE_PAREN) depth = Math.max(0, depth - 1);
+		if (char === OPEN_PAREN$1) depth += 1;
+		else if (char === CLOSE_PAREN$1) depth = Math.max(0, depth - 1);
 	} else if (token.kind === "word") found.push({
 		word: wordOf(sql, token),
 		depth
@@ -18560,8 +18565,8 @@ function words(sql, tokens) {
 }
 /** The verb that decides what a `WITH …` statement does: the first one outside the CTEs' parentheses. */
 function mainVerb(list) {
-	if (list[0]?.word !== WITH$3) return 0;
-	const index = list.findIndex((entry, at) => at > 0 && entry.depth === 0 && MAIN_VERBS.has(entry.word));
+	if (list[0]?.word !== WITH$4) return 0;
+	const index = list.findIndex((entry, at) => at > 0 && entry.depth === 0 && MAIN_VERBS$1.has(entry.word));
 	return index < 0 ? 0 : index;
 }
 /** MySQL reads `DESCRIBE` and `DESC` before a statement as `EXPLAIN`, `ANALYZE` included. */
@@ -18624,7 +18629,7 @@ var BY_OWNERS$1 = /* @__PURE__ */ new Set([
 var ON$1 = "ON";
 /** `ON DUPLICATE KEY UPDATE` and `ON CONFLICT`: an `ON` that starts an action, not a join condition. */
 var ON_ACTIONS = /* @__PURE__ */ new Set(["DUPLICATE", "CONFLICT"]);
-var WITH$2 = "WITH";
+var WITH$3 = "WITH";
 var CREATE$1 = "CREATE";
 var AS$3 = "AS";
 /** Statements whose clauses the inspections understand; anything else gets only the lexical checks. */
@@ -18636,7 +18641,7 @@ var INSPECTED_VERBS = /* @__PURE__ */ new Set([
 	"REPLACE"
 ]);
 var CREATED_FROM_QUERY = /* @__PURE__ */ new Set(["TABLE", "VIEW"]);
-var QUERY_STARTS = /* @__PURE__ */ new Set(["SELECT", WITH$2]);
+var QUERY_STARTS = /* @__PURE__ */ new Set(["SELECT", WITH$3]);
 /** Words an expression may hold that no built-in keyword list names, so they are never taken for columns. */
 var EXPRESSION_WORDS = [
 	"INTERVAL",
@@ -19276,7 +19281,7 @@ var ASC = "ASC";
 var ELSE$1 = "ELSE";
 var END$3 = "END";
 var AS$1 = "AS";
-var WITH$1 = "WITH";
+var WITH$2 = "WITH";
 var ROW = "ROW";
 var VALUES_WORDS = /* @__PURE__ */ new Set(["VALUES", "VALUE"]);
 var RECURSIVE = "RECURSIVE";
@@ -19571,7 +19576,7 @@ function cteRemoval(view, nameIndex, close) {
 	}
 	const withIndex = view.word(nameIndex - 1) === RECURSIVE ? nameIndex - 2 : nameIndex - 1;
 	const withToken = view.token(withIndex);
-	if (view.word(withIndex) !== WITH$1 || withToken === void 0 || following === void 0) return null;
+	if (view.word(withIndex) !== WITH$2 || withToken === void 0 || following === void 0) return null;
 	return removal("Remove CTE", {
 		from: withToken.from,
 		to: following.from
@@ -19656,7 +19661,7 @@ var OPEN$1 = "(";
 var CLOSE$1 = ")";
 var COMMA$3 = ",";
 var BY = "BY";
-var SELECT = "SELECT";
+var SELECT$1 = "SELECT";
 var EXPRESSION_EXPECTED = "Expression expected";
 /** Keywords that start the next clause, so a clause keyword right before one has no body. */
 var CLAUSE_STARTS = /* @__PURE__ */ new Set([
@@ -19693,7 +19698,7 @@ var NEEDS_BODY = /* @__PURE__ */ new Set([
 	"HAVING",
 	"ON",
 	"SET",
-	SELECT
+	SELECT$1
 ]);
 var BY_OWNERS = /* @__PURE__ */ new Set([
 	"ORDER",
@@ -19737,14 +19742,14 @@ function emptyClause(view, index) {
 		if (owner === null || !BY_OWNERS.has(owner)) return null;
 		first = index - 1;
 	} else if (!NEEDS_BODY.has(word)) return null;
-	if (word === SELECT) while (SELECT_MODIFIERS$1.has(view.word(last + 1) ?? "")) last += 1;
+	if (word === SELECT$1) while (SELECT_MODIFIERS$1.has(view.word(last + 1) ?? "")) last += 1;
 	if (!nothingFollows(view, last)) return null;
 	const start = view.token(first);
 	const end = view.token(last);
 	if (start === void 0 || end === void 0) return null;
 	const label = view.text.slice(start.from, end.to).toUpperCase().replace(/\s+/g, " ");
 	const fixes = [];
-	if (word !== SELECT) {
+	if (word !== SELECT$1) {
 		const following = view.token(last + 1);
 		const span = following === void 0 || view.isSymbol(last + 1, CLOSE$1) ? view.withLeadingSpace(first, last) : {
 			from: start.from,
@@ -19988,7 +19993,7 @@ var START$1 = "START";
 var TRANSACTION = "TRANSACTION";
 var WHERE = "WHERE";
 var LIMIT$1 = "LIMIT";
-var WITH = "WITH";
+var WITH$1 = "WITH";
 /** Prefixes the explained statement's destructive reason, so the confirmation says why it matters. */
 var EXPLAIN_ANALYZE_REASON_PREFIX = "EXPLAIN ANALYZE runs it: ";
 function hasTopLevel(list, from, word) {
@@ -20047,7 +20052,7 @@ function classifyWords(list) {
 	const verbAt = mainVerb(list);
 	const verb = list[verbAt]?.word ?? first;
 	return {
-		kind: first === WITH && verbAt === 0 ? "read" : KINDS.get(verb) ?? "other",
+		kind: first === WITH$1 && verbAt === 0 ? "read" : KINDS.get(verb) ?? "other",
 		destructive: destructiveReason(list, verbAt)
 	};
 }
@@ -28354,7 +28359,7 @@ var SET_OPERATORS = /* @__PURE__ */ new Set([
 	"EXCEPT",
 	"MINUS"
 ]);
-var SET_QUANTIFIERS = /* @__PURE__ */ new Set(["ALL", "DISTINCT"]);
+var SET_QUANTIFIERS$1 = /* @__PURE__ */ new Set(["ALL", "DISTINCT"]);
 var SELECT_MODIFIERS = /* @__PURE__ */ new Set([
 	"ALL",
 	"DISTINCT",
@@ -28641,7 +28646,7 @@ var AlignedPrinter = class {
 			if (node.type === "tok" && node.keyword && SET_OPERATORS.has(node.upper)) {
 				const operator = [node];
 				const quantifier = nodes[index + 1];
-				if (quantifier?.type === "tok" && quantifier.keyword && SET_QUANTIFIERS.has(quantifier.upper)) {
+				if (quantifier?.type === "tok" && quantifier.keyword && SET_QUANTIFIERS$1.has(quantifier.upper)) {
 					operator.push(quantifier);
 					index += 1;
 				}
@@ -29587,6 +29592,121 @@ function sqlExplainable(options) {
 	};
 	return { explainable };
 }
+// ../plugin-api/src/sql/limit.ts
+var SELECT = "SELECT";
+var WITH = "WITH";
+var TOP = "TOP";
+var OPEN_PAREN = "(";
+var CLOSE_PAREN = ")";
+/** What may stand between `SELECT` and `TOP`. */
+var SET_QUANTIFIERS = /* @__PURE__ */ new Set(["ALL", "DISTINCT"]);
+var MAIN_VERBS = /* @__PURE__ */ new Set([
+	"SELECT",
+	"INSERT",
+	"UPDATE",
+	"DELETE",
+	"MERGE"
+]);
+/** A top-level row limit the statement already has. */
+var OWN_LIMITS = /* @__PURE__ */ new Set([
+	"LIMIT",
+	"OFFSET",
+	"FETCH"
+]);
+/**
+* Top-level words that make a SELECT more than a read of rows a limit may trim: `INTO` writes,
+* `FOR UPDATE` and `LOCK IN SHARE MODE` lock what they read, `PROCEDURE` hands the rows to MySQL.
+*/
+var NOT_A_PLAIN_READ = /* @__PURE__ */ new Set([
+	"INTO",
+	"FOR",
+	"LOCK",
+	"PROCEDURE"
+]);
+/** A data-modifying CTE or subquery runs whatever the limit trims. */
+var WRITES = /* @__PURE__ */ new Set([
+	"INSERT",
+	"UPDATE",
+	"DELETE",
+	"MERGE"
+]);
+/** `TOP` limits only the SELECT it opens, not the whole combined query. */
+var SET_OPERATIONS = /* @__PURE__ */ new Set([
+	"UNION",
+	"INTERSECT",
+	"EXCEPT",
+	"MINUS"
+]);
+function placedWords(sql, tokens) {
+	const found = [];
+	let depth = 0;
+	for (const token of tokens) if (token.kind === "symbol") {
+		const char = sql.charAt(token.from);
+		if (char === OPEN_PAREN) depth += 1;
+		else if (char === CLOSE_PAREN) depth = Math.max(0, depth - 1);
+	} else if (token.kind === "word") found.push({
+		word: wordOf(sql, token),
+		depth,
+		token
+	});
+	return found;
+}
+function mainSelect(list) {
+	const first = list[0];
+	if (first === void 0 || first.depth !== 0) return null;
+	if (first.word === SELECT) return 0;
+	if (first.word !== WITH) return null;
+	const verb = list.findIndex((entry, at) => at > 0 && entry.depth === 0 && MAIN_VERBS.has(entry.word));
+	return verb > 0 && list[verb]?.word === SELECT ? verb : null;
+}
+/** The statement's tokens up to its delimiter; null when another statement follows it. */
+function ownTokens(tokens) {
+	const end = tokens.findIndex((token) => token.kind === "delimiter");
+	if (end < 0) return tokens;
+	return tokens.slice(end).every((token) => token.kind === "delimiter") ? tokens.slice(0, end) : null;
+}
+function insert(sql, offset, text) {
+	return {
+		sql: sql.slice(0, offset) + text + sql.slice(offset),
+		inserted: {
+			offset,
+			length: text.length
+		}
+	};
+}
+function topOffset(list, verb) {
+	let at = verb + 1;
+	if (SET_QUANTIFIERS.has(list[at]?.word ?? "")) at += 1;
+	if (list[at]?.word === TOP) return null;
+	return list[at - 1]?.token.to ?? null;
+}
+/**
+* The `rowLimit` language service for a dialect (decision 162). It limits a plain SELECT, `WITH`
+* included, by one insertion, and answers null for anything it cannot limit without changing what
+* the statement does or reading it wrongly: another verb, a limit of its own, `INTO`, a locking
+* read, a data-modifying CTE, more than one statement, and under `top` a combined query.
+*/
+function sqlRowLimiter(options, style) {
+	return { limit(sql, rows) {
+		if (!Number.isSafeInteger(rows) || rows < 1) throw new RangeError(`A row limit is a positive integer, not ${rows}`);
+		const tokens = ownTokens(significantTokens(sql, options));
+		const last = tokens?.at(-1);
+		if (tokens === null || last === void 0) return null;
+		const list = placedWords(sql, tokens);
+		const verb = mainSelect(list);
+		if (verb === null) return null;
+		if (list.some((entry) => WRITES.has(entry.word))) return null;
+		const top = list.slice(verb + 1).filter((entry) => entry.depth === 0);
+		if (top.some((entry) => OWN_LIMITS.has(entry.word) || NOT_A_PLAIN_READ.has(entry.word))) return null;
+		if (style === "top") {
+			if (top.some((entry) => SET_OPERATIONS.has(entry.word))) return null;
+			const offset = topOffset(list, verb);
+			return offset === null ? null : insert(sql, offset, ` ${TOP} (${rows})`);
+		}
+		const clause = style === "limit" ? ` LIMIT ${rows}` : ` FETCH FIRST ${rows} ROWS ONLY`;
+		return insert(sql, last.to, clause);
+	} };
+}
 // ../../plugins/duckdb/src/explain.ts
 /** What DuckDB's `EXPLAIN` plans; anything else answers an empty tree. */
 var EXPLAIN_VERBS = [
@@ -40329,7 +40449,8 @@ var CAPABILITIES = [
 	"ddl",
 	"explain",
 	"explainAnalyze",
-	"bulkInsert"
+	"bulkInsert",
+	"rowLimit"
 ];
 /** DuckDB reads PostgreSQL's lexis: dollar quotes and nested block comments. */
 var DIALECT = {
@@ -40434,7 +40555,8 @@ var language = {
 			keywords: KEYWORDS,
 			types: IMPORT_TYPES,
 			decimal: duckdbDecimal
-		})
+		}),
+		rowLimit: sqlRowLimiter(DIALECT, "limit")
 	}
 };
 // ../../plugins/duckdb/src/errorPosition.ts

package/package.json

@@ -1,13 +1,14 @@
 {
   "name": "@tablecraft-app/plugin-duckdb-linux-x64",
-  "version": "1.31.0",
+  "version": "1.37.0",
   "description": "The DuckDB datasource plugin for TableCraft, downloaded by the app when a data source needs it. This package is for linux-x64.",
-  "license": "MIT",
+  "license": "GPL-3.0-or-later",
   "type": "module",
   "main": "index.js",
   "files": [
     "index.js",
     "table-craft-plugin.json",
+    "LICENSE-EXCEPTION",
     "duckdb.node",
     "libduckdb.so",
     "THIRD-PARTY-NOTICES"
@@ -27,7 +28,7 @@
   },
   "tableCraft": {
     "id": "duckdb",
-    "apiVersion": "2.0.0",
+    "apiVersion": "2.2.0",
     "platform": "linux-x64"
   },
   "os": [

package/table-craft-plugin.json

@@ -1,8 +1,8 @@
 {
   "id": "duckdb",
   "name": "DuckDB",
-  "version": "1.31.0",
-  "apiVersion": "2.0.0",
+  "version": "1.37.0",
+  "apiVersion": "2.2.0",
   "entry": "index.js",
   "capabilities": [
     "sql",
@@ -12,7 +12,8 @@
     "ddl",
     "explain",
     "explainAnalyze",
-    "bulkInsert"
+    "bulkInsert",
+    "rowLimit"
   ],
   "highlight": "postgresql",
   "brands": [