git-fs-s3 0.11.0 → 0.12.0

package/LICENSE

@@ -1,21 +1,661 @@
-MIT License
-
-Copyright (c) 2026 Nandan Varma
-
-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 AFFERO GENERAL PUBLIC LICENSE
+                       Version 3, 19 November 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 Affero General Public License is a free, copyleft license for
+software and other kinds of works, specifically designed to ensure
+cooperation with the community in the case of network server software.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+our General Public Licenses are 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.
+
+  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.
+
+  Developers that use our General Public Licenses protect your rights
+with two steps: (1) assert copyright on the software, and (2) offer
+you this License which gives you legal permission to copy, distribute
+and/or modify the software.
+
+  A secondary benefit of defending all users' freedom is that
+improvements made in alternate versions of the program, if they
+receive widespread use, become available for other developers to
+incorporate.  Many developers of free software are heartened and
+encouraged by the resulting cooperation.  However, in the case of
+software used on network servers, this result may fail to come about.
+The GNU General Public License permits making a modified version and
+letting the public access it on a server without ever releasing its
+source code to the public.
+
+  The GNU Affero General Public License is designed specifically to
+ensure that, in such cases, the modified source code becomes available
+to the community.  It requires the operator of a network server to
+provide the source code of the modified version running there to the
+users of that server.  Therefore, public use of a modified version, on
+a publicly accessible server, gives the public access to the source
+code of the modified version.
+
+  An older license, called the Affero General Public License and
+published by Affero, was designed to accomplish similar goals.  This is
+a different license, not a version of the Affero GPL, but Affero has
+released a new version of the Affero GPL which permits relicensing under
+this license.
+
+  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 Affero 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. Remote Network Interaction; Use with the GNU General Public License.
+
+  Notwithstanding any other provision of this License, if you modify the
+Program, your modified version must prominently offer all users
+interacting with it remotely through a computer network (if your version
+supports such interaction) an opportunity to receive the Corresponding
+Source of your version by providing access to the Corresponding Source
+from a network server at no charge, through some standard or customary
+means of facilitating copying of software.  This Corresponding Source
+shall include the Corresponding Source for any work covered by version 3
+of the GNU General Public License that is incorporated pursuant to the
+following paragraph.
+
+  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 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 work with which it is combined will remain governed by version
+3 of the GNU General Public License.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU Affero 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 Affero 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 Affero 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 Affero 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 Affero 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 Affero General Public License for more details.
+
+    You should have received a copy of the GNU Affero 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 your software can interact with users remotely through a computer
+network, you should also make sure that it provides a way for users to
+get its source.  For example, if your program is a web application, its
+interface could display a "Source" link that leads users to an archive
+of the code.  There are many ways you could offer source, and different
+solutions will be better for different programs; see section 13 for the
+specific requirements.
+
+  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 AGPL, see
+<https://www.gnu.org/licenses/>.

package/README.md

@@ -309,6 +309,25 @@ validation and authorization to other repositories belong to the application.
 
 - More stores out of the box (Google Cloud Storage, Azure Blob)
 
+## Changelog
+
+Release notes for every published version are in [CHANGELOG.md](CHANGELOG.md).
+
 ## License
 
-[MIT](LICENSE)
+Copyright (C) 2026 Nandan Varma.
+
+`git-fs-s3` is free software: you can redistribute it and/or modify it under the
+terms of the GNU Affero General Public License as published by the Free Software
+Foundation, either version 3 of the License, or (at your option) any later
+version.
+
+It 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 Affero General Public License](LICENSE) for
+the full terms.
+
+**Licence change:** published versions up to and including `0.11.0` remain
+MIT and are still installable. From the next release onward this package is
+AGPL-3.0-or-later, so a network service built on it must offer its users the
+corresponding source.

package/dist/index.js

@@ -592,12 +592,16 @@ function createRetryStore(store, options = {}) {
     }
     throw lastError;
   }
+  const range = store.getRange?.bind(store);
   return {
     get: (key) => run("get", key, () => store.get(key)),
     put: (key, data) => run("put", key, () => store.put(key, data)),
     delete: (key) => run("delete", key, () => store.delete(key)),
     head: (key) => run("head", key, () => store.head(key)),
-    list: (prefix, listOptions) => run("list", prefix, () => store.list(prefix, listOptions))
+    list: (prefix, listOptions) => run("list", prefix, () => store.list(prefix, listOptions)),
+    ...range ? {
+      getRange: (key, start, end) => run("getRange", key, () => range(key, start, end))
+    } : {}
   };
 }
 

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/cache.ts","../src/errors.ts","../src/git-fs.ts","../src/path.ts","../src/retry.ts","../src/stores/memory.ts"],"sourcesContent":["import { LRUCache } from \"lru-cache\";\nimport type {\n\tListOptions,\n\tListResult,\n\tObjectStat,\n\tObjectStore,\n} from \"./types.js\";\n\nexport interface CacheOptions {\n\t/** Maximum bytes of object data held in memory. Default 50 MiB. */\n\tmaxBytes?: number;\n\t/**\n\t * Largest single entry admitted to the cache. Defaults to a tenth of\n\t * `maxBytes` so one huge packfile cannot evict the whole working set.\n\t */\n\tmaxEntryBytes?: number;\n\t/** Entry time-to-live in milliseconds. Default 60 000. */\n\tttlMs?: number;\n\t/**\n\t * Override the TTL for a specific key (get/head) or list prefix (list),\n\t * in milliseconds. Return `undefined` to fall back to `ttlMs`. Git refs\n\t * (`refs/heads/<branch>`, `HEAD`) are mutable — the same key's value\n\t * changes on every push — unlike content-addressed object keys, which\n\t * never change for a given key and are safe to cache for the full\n\t * `ttlMs`. Without this, a long `ttlMs` tuned for objects also caches\n\t * ref reads that long, so a warm process can keep serving a\n\t * pre-push ref value for the rest of that TTL even though nothing\n\t * changed *this* process's own cache (see `invalidate`) — it just never\n\t * knew to. Give ref-like keys a short override (a few seconds) instead:\n\t * a ref read is one small object, so re-reading it far more often than\n\t * `ttlMs` is cheap, and every read downstream of a fresh ref (tree,\n\t * commit, blob — all keyed by the sha it resolves to) still gets the\n\t * full-length cache/coalescing benefit.\n\t */\n\tttlForKey?: (key: string) => number | undefined;\n\t/**\n\t * Also cache \"key does not exist\" results. Loose-object probes on packed\n\t * repositories are almost always misses, so this saves many round trips —\n\t * but only enable it when a single process is the only writer, otherwise\n\t * another instance's push can be masked for up to `ttlMs`.\n\t */\n\tcacheMisses?: boolean;\n\t/**\n\t * Also cache `list()` results (directory listings and `limit: 1`\n\t * existence probes). Writes through this store keep cached listings\n\t * consistent; after writing to the backend by any other means, call\n\t * `invalidate()` with the affected prefix. Default false.\n\t */\n\tcacheLists?: boolean;\n\t/**\n\t * Collapse concurrent `get`/`head`/`list` calls for the same key into a\n\t * single backend request. Default true.\n\t */\n\tcoalesce?: boolean;\n\t/**\n\t * Return defensive copies from `get` (and copy on admit), so a caller\n\t * mutating returned bytes can't corrupt the cache. Default true. Set\n\t * false when no reader mutates results (isomorphic-git doesn't): every\n\t * hit otherwise copies the whole entry, which for packfiles is megabytes\n\t * per read.\n\t */\n\tcopy?: boolean;\n\t/** Called when a read is answered from cache. */\n\tonHit?: (key: string) => void;\n\t/** Called when a read has to go to the backing store. */\n\tonMiss?: (key: string) => void;\n}\n\n/** An {@link ObjectStore} wrapper that also supports explicit invalidation. */\nexport interface CachedObjectStore extends ObjectStore {\n\t/**\n\t * Drop every cached entry — contents, misses, and listings — whose key\n\t * falls under `prefix` (exact keys included). Call this after the backing\n\t * store was modified by something other than this wrapper.\n\t */\n\tinvalidate(prefix: string): void;\n}\n\nconst MISS = Symbol(\"miss\");\ntype CacheEntry = Uint8Array | typeof MISS;\n\ninterface ListEntry {\n\tresult: ListResult;\n\t/** The raw list prefix this entry describes. */\n\tprefix: string;\n\t/** True for `limit: 1` existence probes. */\n\tprobe: boolean;\n\t/** True when the listing came back with no objects or prefixes. */\n\tempty: boolean;\n}\n\nfunction listEntrySize(entry: ListEntry): number {\n\tlet size = entry.prefix.length + 16;\n\tfor (const o of entry.result.objects) size += o.key.length + 8;\n\tfor (const p of entry.result.prefixes) size += p.length;\n\treturn size;\n}\n\nfunction copyListResult(result: ListResult): ListResult {\n\treturn {\n\t\tobjects: result.objects.map((o) => ({ ...o })),\n\t\tprefixes: [...result.prefixes],\n\t};\n}\n\n/**\n * Wrap an {@link ObjectStore} with an in-process LRU read cache.\n *\n * Git object keys are content-addressed and therefore immutable, which makes\n * them ideal cache entries; mutable keys (refs, packed-refs) are bounded by\n * `ttlMs`. Writes and deletes through this wrapper invalidate their key and\n * any cached listings they affect — with one asymmetry: a non-empty `limit: 1`\n * probe (a \"directory exists\" answer) survives writes underneath it, because\n * adding a key below a prefix cannot make that prefix stop existing, while\n * empty probes and full listings are always dropped.\n */\nexport function createCachedStore(\n\tstore: ObjectStore,\n\toptions: CacheOptions = {},\n): CachedObjectStore {\n\tconst maxBytes = options.maxBytes ?? 50 * 1024 * 1024;\n\tconst maxEntryBytes = options.maxEntryBytes ?? Math.ceil(maxBytes / 10);\n\tconst ttl = options.ttlMs ?? 60_000;\n\tconst ttlForKey = options.ttlForKey;\n\tconst cacheMisses = options.cacheMisses ?? false;\n\tconst cacheLists = options.cacheLists ?? false;\n\tconst range = store.getRange?.bind(store);\n\tconst coalesce = options.coalesce ?? true;\n\tconst copy = options.copy ?? true;\n\tconst clone = (data: Uint8Array) => (copy ? data.slice() : data);\n\tconst onHit = options.onHit;\n\tconst onMiss = options.onMiss;\n\n\tconst cache = new LRUCache<string, CacheEntry>({\n\t\tmaxSize: maxBytes,\n\t\tsizeCalculation: (value) => (value === MISS ? 1 : value.byteLength || 1),\n\t\tttl,\n\t});\n\tconst listCache = new LRUCache<string, ListEntry>({\n\t\tmaxSize: Math.max(1, Math.ceil(maxBytes / 10)),\n\t\tsizeCalculation: listEntrySize,\n\t\tttl,\n\t});\n\n\tconst pendingGets = new Map<string, Promise<Uint8Array | null>>();\n\tconst pendingHeads = new Map<string, Promise<ObjectStat | null>>();\n\tconst pendingLists = new Map<string, Promise<ListResult>>();\n\n\t/**\n\t * Bumped by every write, delete and invalidation. A backend read that\n\t * started before one of those may finish after it carrying the old answer\n\t * (the old bytes, or \"missing\" for a key that now exists); it still\n\t * answers its own callers, but only a read that saw no write in between\n\t * may populate the cache — otherwise a stale miss could hide a freshly\n\t * written object for the whole TTL.\n\t */\n\tlet generation = 0;\n\tconst unchangedSince = (start: number) => generation === start;\n\n\tconst admit = (key: string, data: Uint8Array) => {\n\t\tif (data.byteLength <= maxEntryBytes) {\n\t\t\tcache.set(key, clone(data), { ttl: ttlForKey?.(key) });\n\t\t}\n\t};\n\n\t/** Drop list entries a write/delete at `key` may have made stale. */\n\tfunction clearStaleListEntries(key: string): void {\n\t\tfor (const [listKey, entry] of listCache.entries()) {\n\t\t\tif (!key.startsWith(entry.prefix)) continue;\n\t\t\tif (entry.probe && !entry.empty) continue;\n\t\t\tlistCache.delete(listKey);\n\t\t}\n\t\t// Readers arriving after this write must not join a listing that\n\t\t// started before it.\n\t\tfor (const listKey of pendingLists.keys()) {\n\t\t\tconst prefix = listKey.split(\"|\").slice(2).join(\"|\");\n\t\t\tif (key.startsWith(prefix)) pendingLists.delete(listKey);\n\t\t}\n\t}\n\n\t/** A write to `key` happened: no in-flight read of it may be joined or cached. */\n\tfunction noteWrite(key: string): void {\n\t\tgeneration++;\n\t\tpendingGets.delete(key);\n\t\tpendingHeads.delete(key);\n\t}\n\n\tfunction coalesced<T>(\n\t\tpending: Map<string, Promise<T>>,\n\t\tkey: string,\n\t\tfn: () => Promise<T>,\n\t): Promise<T> {\n\t\tif (!coalesce) return fn();\n\t\tconst inflight = pending.get(key);\n\t\tif (inflight !== undefined) return inflight;\n\t\tconst p = fn().finally(() => {\n\t\t\tif (pending.get(key) === p) pending.delete(key);\n\t\t});\n\t\tpending.set(key, p);\n\t\treturn p;\n\t}\n\n\treturn {\n\t\tasync get(key: string): Promise<Uint8Array | null> {\n\t\t\tconst cached = cache.get(key);\n\t\t\tif (cached !== undefined) {\n\t\t\t\tonHit?.(key);\n\t\t\t\treturn cached === MISS ? null : clone(cached);\n\t\t\t}\n\t\t\tconst data = await coalesced(pendingGets, key, async () => {\n\t\t\t\tonMiss?.(key);\n\t\t\t\tconst start = generation;\n\t\t\t\tconst fetched = await store.get(key);\n\t\t\t\tif (unchangedSince(start)) {\n\t\t\t\t\tif (fetched !== null) {\n\t\t\t\t\t\tadmit(key, fetched);\n\t\t\t\t\t} else if (cacheMisses) {\n\t\t\t\t\t\tcache.set(key, MISS, { ttl: ttlForKey?.(key) });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn fetched;\n\t\t\t});\n\t\t\treturn data === null ? null : clone(data);\n\t\t},\n\n\t\tasync put(key: string, data: Uint8Array): Promise<void> {\n\t\t\tnoteWrite(key);\n\t\t\ttry {\n\t\t\t\tawait store.put(key, data);\n\t\t\t} finally {\n\t\t\t\t// Even a failed put may have landed; never keep serving the\n\t\t\t\t// pre-write answer for this key.\n\t\t\t\tnoteWrite(key);\n\t\t\t\tcache.delete(key);\n\t\t\t\tclearStaleListEntries(key);\n\t\t\t}\n\t\t\tadmit(key, data);\n\t\t},\n\n\t\tasync delete(key: string): Promise<void> {\n\t\t\tnoteWrite(key);\n\t\t\ttry {\n\t\t\t\tawait store.delete(key);\n\t\t\t} finally {\n\t\t\t\tnoteWrite(key);\n\t\t\t\tcache.delete(key);\n\t\t\t\tclearStaleListEntries(key);\n\t\t\t}\n\t\t\tif (cacheMisses) {\n\t\t\t\tcache.set(key, MISS, { ttl: ttlForKey?.(key) });\n\t\t\t} else {\n\t\t\t\tcache.delete(key);\n\t\t\t}\n\t\t},\n\n\t\tasync head(key: string): Promise<ObjectStat | null> {\n\t\t\tconst cached = cache.get(key);\n\t\t\tif (cached !== undefined) {\n\t\t\t\tonHit?.(key);\n\t\t\t\treturn cached === MISS ? null : { size: cached.byteLength };\n\t\t\t}\n\t\t\treturn coalesced(pendingHeads, key, async () => {\n\t\t\t\tonMiss?.(key);\n\t\t\t\tconst start = generation;\n\t\t\t\tconst stat = await store.head(key);\n\t\t\t\tif (stat === null && cacheMisses && unchangedSince(start)) {\n\t\t\t\t\tcache.set(key, MISS, { ttl: ttlForKey?.(key) });\n\t\t\t\t}\n\t\t\t\treturn stat;\n\t\t\t});\n\t\t},\n\n\t\tasync list(prefix: string, listOptions?: ListOptions): Promise<ListResult> {\n\t\t\tif (!cacheLists) return store.list(prefix, listOptions);\n\t\t\tconst listKey = `${listOptions?.delimiter ?? \"\"}|${listOptions?.limit ?? \"\"}|${prefix}`;\n\t\t\tconst cached = listCache.get(listKey);\n\t\t\tif (cached !== undefined) {\n\t\t\t\tonHit?.(prefix);\n\t\t\t\treturn copyListResult(cached.result);\n\t\t\t}\n\t\t\tconst result = await coalesced(pendingLists, listKey, async () => {\n\t\t\t\tonMiss?.(prefix);\n\t\t\t\tconst start = generation;\n\t\t\t\tconst fetched = await store.list(prefix, listOptions);\n\t\t\t\tif (!unchangedSince(start)) return fetched;\n\t\t\t\tlistCache.set(\n\t\t\t\t\tlistKey,\n\t\t\t\t\t{\n\t\t\t\t\t\tresult: copyListResult(fetched),\n\t\t\t\t\t\tprefix,\n\t\t\t\t\t\tprobe: listOptions?.limit === 1,\n\t\t\t\t\t\tempty:\n\t\t\t\t\t\t\tfetched.objects.length === 0 && fetched.prefixes.length === 0,\n\t\t\t\t\t},\n\t\t\t\t\t{ ttl: ttlForKey?.(prefix) },\n\t\t\t\t);\n\t\t\t\treturn fetched;\n\t\t\t});\n\t\t\treturn copyListResult(result);\n\t\t},\n\n\t\t// Forwarded straight to the backing store: a range read is a handful of\n\t\t// bytes at a known offset, so caching one buys nothing, and bypassing the\n\t\t// cache here keeps this wrapper's read paths unchanged.\n\t\t...(range\n\t\t\t? {\n\t\t\t\t\tgetRange: (key: string, start: number, end: number) =>\n\t\t\t\t\t\trange(key, start, end),\n\t\t\t\t}\n\t\t\t: {}),\n\n\t\tinvalidate(prefix: string): void {\n\t\t\tgeneration++;\n\t\t\tfor (const key of [...pendingGets.keys()]) {\n\t\t\t\tif (key.startsWith(prefix)) pendingGets.delete(key);\n\t\t\t}\n\t\t\tfor (const key of [...pendingHeads.keys()]) {\n\t\t\t\tif (key.startsWith(prefix)) pendingHeads.delete(key);\n\t\t\t}\n\t\t\tpendingLists.clear();\n\t\t\tfor (const key of cache.keys()) {\n\t\t\t\tif (key.startsWith(prefix)) cache.delete(key);\n\t\t\t}\n\t\t\tfor (const [listKey, entry] of listCache.entries()) {\n\t\t\t\tif (\n\t\t\t\t\tentry.prefix.startsWith(prefix) ||\n\t\t\t\t\tprefix.startsWith(entry.prefix)\n\t\t\t\t) {\n\t\t\t\t\tlistCache.delete(listKey);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n}\n","/**\n * Node-style filesystem error carrying a `code` property, which is what\n * isomorphic-git inspects to distinguish \"file not found\" from real failures.\n */\nexport class FsError extends Error {\n\treadonly code: string;\n\treadonly syscall: string;\n\treadonly path: string;\n\n\tconstructor(code: string, syscall: string, path: string) {\n\t\tsuper(`${code}: ${syscall} '${path}'`);\n\t\tthis.name = \"FsError\";\n\t\tthis.code = code;\n\t\tthis.syscall = syscall;\n\t\tthis.path = path;\n\t}\n}\n\nexport const enoent = (syscall: string, path: string) =>\n\tnew FsError(\"ENOENT\", syscall, path);\n\nexport const enotdir = (syscall: string, path: string) =>\n\tnew FsError(\"ENOTDIR\", syscall, path);\n\nexport const enotempty = (syscall: string, path: string) =>\n\tnew FsError(\"ENOTEMPTY\", syscall, path);\n\nexport const einval = (syscall: string, path: string) =>\n\tnew FsError(\"EINVAL\", syscall, path);\n\nexport const eperm = (syscall: string, path: string) =>\n\tnew FsError(\"EPERM\", syscall, path);\n","import { LRUCache } from \"lru-cache\";\nimport { enoent, enotdir, enotempty, eperm } from \"./errors.js\";\nimport { parseLooseObjectPath } from \"./git-layout.js\";\nimport { parsePackDirectory, READABLE_PACK_FILE_KINDS } from \"./pack-files.js\";\nimport { normalizePath, toKey as toKeyWithPrefix } from \"./path.js\";\nimport type {\n\tEncoding,\n\tGitdirFacts,\n\tGitFsClient,\n\tGitFsOptions,\n\tObjectStore,\n\tReadFileOptions,\n\tStat,\n\tWriteFileOptions,\n} from \"./types.js\";\n\nconst FILE_MODE = 0o100644;\nconst DIR_MODE = 0o40000;\n\nconst textEncoder = new TextEncoder();\nconst textDecoder = new TextDecoder();\n\nfunction makeStat(type: \"file\" | \"dir\", size: number): Stat {\n\tconst epoch = new Date(0);\n\treturn {\n\t\ttype,\n\t\tmode: type === \"file\" ? FILE_MODE : DIR_MODE,\n\t\tsize,\n\t\tino: 0,\n\t\tmtimeMs: 0,\n\t\tctimeMs: 0,\n\t\tuid: 0,\n\t\tgid: 0,\n\t\tdev: 0,\n\t\tmtime: epoch,\n\t\tctime: epoch,\n\t\tisFile: () => type === \"file\",\n\t\tisDirectory: () => type === \"dir\",\n\t\tisSymbolicLink: () => false,\n\t};\n}\n\nfunction resolveEncoding(\n\toptions?: ReadFileOptions | WriteFileOptions | Encoding,\n): Encoding | undefined {\n\tif (typeof options === \"string\") return options;\n\treturn options?.encoding;\n}\n\n/**\n * The filesystem returned by {@link createGitFs}: the isomorphic-git client\n * plus git-aware maintenance hooks.\n */\nexport interface GitFs extends GitFsClient {\n\t/**\n\t * Return every file below a directory in one object-store listing. Unlike\n\t * `readdir`, this deliberately does not use a delimiter: object storage can\n\t * enumerate a ref namespace recursively without the stat-per-entry walk a\n\t * POSIX filesystem needs to distinguish files from implicit directories.\n\t * Paths are relative to `dirpath` and never include directory entries.\n\t */\n\tlistFilesRecursively(dirpath: string): Promise<string[]>;\n\t/**\n\t * Probe, with one bounded list, whether `gitdir` contains any loose\n\t * objects, and remember the answer. This is the only way a loose-object\n\t * hint is ever created; call it before full-history walks (commit logs,\n\t * reachability traversals) so fully packed repositories skip every\n\t * guaranteed-miss loose-object read. A later loose write flips the hint\n\t * back, so it cannot go stale mid-push.\n\t */\n\tdetectLooseObjects(gitdir: string): Promise<void>;\n\t/**\n\t * Warm the cache with every pack file under `gitdir` in parallel (plus\n\t * the loose-object hint) before a sequential history walk. Skipped when\n\t * the pack directory holds more than `maxPacks * 2` entries — warming\n\t * only helps when the cache budget actually fits the packs.\n\t */\n\tprefetchPacks(gitdir: string, options?: { maxPacks?: number }): Promise<void>;\n\t/**\n\t * Clear fs-level state (loose-object hints) under `pathPrefix`, and\n\t * forward to the store's `invalidate` when it has one. Call after the\n\t * backing store was modified by something other than this fs.\n\t */\n\tinvalidate(pathPrefix: string): void;\n\t/**\n\t * Declare that `gitdir` exists, so `stat` answers \"directory\" for it with\n\t * zero store calls. isomorphic-git stats the gitdir on every command\n\t * (`discoverGitdir`); in object storage that is a HEAD that always misses\n\t * plus a listing. Register once the caller has confirmed the repository\n\t * exists by other means (e.g. its database row); `invalidate` forgets it.\n\t */\n\tregisterGitdir(gitdir: string, facts?: GitdirFacts): void;\n}\n\n/**\n * Create a promise-based filesystem client for isomorphic-git backed by an\n * {@link ObjectStore}.\n *\n * Semantics:\n * - Directories are implicit, as in object storage: `mkdir` is a no-op and a\n *   directory \"exists\" whenever at least one key lives under its prefix.\n * - Symbolic links are not supported (`readlink`/`symlink` throw). Bare\n *   repositories never contain them.\n * - Designed for bare, server-side repositories (`git.init({bare: true})`,\n *   plumbing commands, ref updates). Worktree checkouts belong on a real disk.\n */\nexport function createGitFs(\n\tstore: ObjectStore,\n\toptions: GitFsOptions = {},\n): GitFs {\n\tconst prefix = options.prefix ?? \"\";\n\tconst useLooseHints = options.looseObjectHints ?? false;\n\tconst onNote = options.onNote;\n\n\tconst toKey = (path: string): string => toKeyWithPrefix(prefix, path);\n\n\t/**\n\t * Per-gitdir \"does any loose object exist\" hint. Entries are only created\n\t * by {@link GitFs.detectLooseObjects}, so a pathological ref that merely\n\t * looks like a loose object (`refs/heads/objects/aa/…`) derives a scope\n\t * that was never registered and can never be wrongly short-circuited.\n\t */\n\tconst looseHints = new LRUCache<string, \"none\" | \"present\">({\n\t\tmax: 1024,\n\t\tttl: options.hintTtlMs ?? 3_600_000,\n\t});\n\n\t/** Gitdirs the caller vouched for via {@link GitFs.registerGitdir}. */\n\tconst registeredGitdirs = new LRUCache<string, ReadonlySet<string>>({\n\t\tmax: 4096,\n\t});\n\n\t/** Whether `path` is a top-level file its registered gitdir lacks. */\n\tfunction registeredAbsent(path: string): boolean {\n\t\tconst slash = path.lastIndexOf(\"/\");\n\t\tif (slash < 0) return false;\n\t\tconst absent = registeredGitdirs.get(path.slice(0, slash));\n\t\treturn absent?.has(path.slice(slash + 1)) ?? false;\n\t}\n\n\t/** The gitdir scope of a loose-object path, or null when it isn't one. */\n\tfunction looseScope(path: string): string | null {\n\t\treturn parseLooseObjectPath(path)?.gitdir ?? null;\n\t}\n\n\tconst pendingDetections = new Map<string, Promise<void>>();\n\n\t/**\n\t * Resolve the loose-object hint for `path`'s gitdir before answering, so a\n\t * read that runs before any explicit `detectLooseObjects` call (e.g. the\n\t * first commit read of a request) doesn't pay a doomed GET. One coalesced\n\t * listing per gitdir, cached for `hintTtlMs`.\n\t */\n\tasync function knownAbsent(path: string): Promise<boolean> {\n\t\tif (registeredAbsent(path)) return true;\n\t\tif (!useLooseHints) return false;\n\t\tconst scope = looseScope(path);\n\t\tif (scope === null) return false;\n\t\tif (!looseHints.has(scope)) {\n\t\t\tlet pending = pendingDetections.get(scope);\n\t\t\tif (!pending) {\n\t\t\t\tpending = detectLooseObjects(scope).finally(() =>\n\t\t\t\t\tpendingDetections.delete(scope),\n\t\t\t\t);\n\t\t\t\tpendingDetections.set(scope, pending);\n\t\t\t}\n\t\t\tawait pending;\n\t\t}\n\t\treturn looseHints.get(scope) === \"none\";\n\t}\n\n\tasync function isDirectory(dirKey: string): Promise<boolean> {\n\t\tconst { objects, prefixes } = await store.list(`${dirKey}/`, {\n\t\t\tlimit: 1,\n\t\t});\n\t\treturn objects.length > 0 || prefixes.length > 0;\n\t}\n\n\tasync function stat(filepath: string, syscall: string): Promise<Stat> {\n\t\tconst path = normalizePath(filepath);\n\t\tif (await knownAbsent(path)) throw enoent(syscall, filepath);\n\t\tconst k = toKey(path);\n\t\tif (k === prefix || k === \"\" || registeredGitdirs.has(path)) {\n\t\t\treturn makeStat(\"dir\", 0);\n\t\t}\n\t\tconst fileStat = await store.head(k);\n\t\tif (fileStat) return makeStat(\"file\", fileStat.size);\n\t\t// A loose-object path is always a leaf; when the object itself is\n\t\t// absent there is no point probing for a directory of the same name.\n\t\tif (useLooseHints && looseScope(path) !== null) {\n\t\t\tthrow enoent(syscall, filepath);\n\t\t}\n\t\tif (await isDirectory(k)) return makeStat(\"dir\", 0);\n\t\tthrow enoent(syscall, filepath);\n\t}\n\n\tconst range = store.getRange?.bind(store);\n\n\tconst promises: GitFsClient[\"promises\"] = {\n\t\t// Only defined when the backing store supports ranges, so a caller can\n\t\t// test for it rather than have to interpret a failure.\n\t\t...(range\n\t\t\t? {\n\t\t\t\t\tgetRange: (filepath: string, start: number, end: number) =>\n\t\t\t\t\t\trange(toKey(normalizePath(filepath)), start, end),\n\t\t\t\t}\n\t\t\t: {}),\n\n\t\tasync readFile(filepath, opts) {\n\t\t\tconst path = normalizePath(filepath);\n\t\t\tif (await knownAbsent(path)) throw enoent(\"open\", filepath);\n\t\t\tconst data = await store.get(toKey(path));\n\t\t\tif (data === null) throw enoent(\"open\", filepath);\n\t\t\treturn resolveEncoding(opts) === \"utf8\" ? textDecoder.decode(data) : data;\n\t\t},\n\n\t\tasync writeFile(filepath, data, _opts) {\n\t\t\tconst path = normalizePath(filepath);\n\t\t\tif (useLooseHints) {\n\t\t\t\tconst scope = looseScope(path);\n\t\t\t\t// Flip before the write lands so a racing read can never\n\t\t\t\t// short-circuit an object that is in the middle of arriving.\n\t\t\t\tif (scope !== null) looseHints.set(scope, \"present\");\n\t\t\t}\n\t\t\tconst bytes = typeof data === \"string\" ? textEncoder.encode(data) : data;\n\t\t\tawait store.put(toKey(path), bytes);\n\t\t},\n\n\t\tasync unlink(filepath) {\n\t\t\tconst k = toKey(normalizePath(filepath));\n\t\t\tif ((await store.head(k)) === null) throw enoent(\"unlink\", filepath);\n\t\t\tawait store.delete(k);\n\t\t},\n\n\t\tasync readdir(dirpath) {\n\t\t\tconst k = toKey(normalizePath(dirpath));\n\t\t\tconst isRoot = k === prefix || k === \"\";\n\t\t\tconst listPrefix = isRoot && k === \"\" ? \"\" : `${k}/`;\n\t\t\tconst { objects, prefixes } = await store.list(listPrefix, {\n\t\t\t\tdelimiter: \"/\",\n\t\t\t});\n\t\t\tif (objects.length === 0 && prefixes.length === 0) {\n\t\t\t\tif (!isRoot && (await store.head(k)) !== null) {\n\t\t\t\t\tthrow enotdir(\"scandir\", dirpath);\n\t\t\t\t}\n\t\t\t\tif (!isRoot) throw enoent(\"scandir\", dirpath);\n\t\t\t}\n\t\t\tconst names = objects.map((o) => o.key.slice(listPrefix.length));\n\t\t\tconst dirNames = prefixes.map((p) =>\n\t\t\t\tp.slice(listPrefix.length).replace(/\\/$/, \"\"),\n\t\t\t);\n\t\t\treturn [...names, ...dirNames].sort();\n\t\t},\n\n\t\tasync mkdir(_dirpath, _opts) {\n\t\t\t// Directories are implicit in object storage.\n\t\t},\n\n\t\tasync rmdir(dirpath) {\n\t\t\tconst k = toKey(normalizePath(dirpath));\n\t\t\tconst { objects, prefixes } = await store.list(`${k}/`, { limit: 1 });\n\t\t\tif (objects.length > 0 || prefixes.length > 0) {\n\t\t\t\tthrow enotempty(\"rmdir\", dirpath);\n\t\t\t}\n\t\t\t// Empty implicit directories don't exist; nothing to remove.\n\t\t},\n\n\t\tstat: (filepath) => stat(filepath, \"stat\"),\n\t\tlstat: (filepath) => stat(filepath, \"lstat\"),\n\n\t\tasync readlink(filepath): Promise<never> {\n\t\t\tthrow enoent(\"readlink\", filepath);\n\t\t},\n\n\t\tasync symlink(_target, filepath): Promise<never> {\n\t\t\tthrow eperm(\"symlink\", filepath);\n\t\t},\n\n\t\tasync chmod(_filepath, _mode) {\n\t\t\t// POSIX modes don't exist in object storage.\n\t\t},\n\t};\n\n\tasync function detectLooseObjects(gitdir: string): Promise<void> {\n\t\tif (!useLooseHints) return;\n\t\tconst scope = normalizePath(gitdir);\n\t\t// A live hint must win over re-detection: after a loose write flips it\n\t\t// to \"present\", re-deriving from a (possibly cached, pre-write) listing\n\t\t// could wrongly reinstate \"none\" and mask real objects.\n\t\tif (looseHints.has(scope)) return;\n\t\ttry {\n\t\t\tconst { objects } = await store.list(`${toKey(scope)}/objects/`, {\n\t\t\t\tlimit: 1,\n\t\t\t});\n\t\t\t// Loose fan-out directories (two hex digits) sort before \"info/\"\n\t\t\t// and \"pack/\", so when any loose object exists it is the first key.\n\t\t\tconst first = objects[0]?.key;\n\t\t\tconst hint =\n\t\t\t\tfirst !== undefined && parseLooseObjectPath(first) !== null\n\t\t\t\t\t? \"present\"\n\t\t\t\t\t: \"none\";\n\t\t\tlooseHints.set(scope, hint);\n\t\t\tonNote?.(`loose objects ${hint} under ${scope}`);\n\t\t} catch {\n\t\t\t// Leave unknown — reads fall back to their normal round trip.\n\t\t}\n\t}\n\n\tasync function prefetchPacks(\n\t\tgitdir: string,\n\t\tprefetchOptions?: { maxPacks?: number },\n\t): Promise<void> {\n\t\tconst maxPacks = prefetchOptions?.maxPacks ?? 30;\n\t\tconst packDir = `${normalizePath(gitdir)}/objects/pack`;\n\t\t// isomorphic-git never reads .bitmap/.rev/.keep, so fetching them is a\n\t\t// wasted GET and wasted cache space.\n\t\tconst entries = parsePackDirectory(\n\t\t\tawait promises.readdir(packDir).catch(() => []),\n\t\t)\n\t\t\t.filter((file) => READABLE_PACK_FILE_KINDS.has(file.kind))\n\t\t\t.map((file) => file.name);\n\t\tif (entries.length > maxPacks * 2) {\n\t\t\tawait detectLooseObjects(gitdir);\n\t\t\treturn;\n\t\t}\n\t\tawait Promise.all([\n\t\t\tdetectLooseObjects(gitdir),\n\t\t\t...entries.map((name) =>\n\t\t\t\tpromises.readFile(`${packDir}/${name}`).catch(() => undefined),\n\t\t\t),\n\t\t]);\n\t}\n\n\tasync function listFilesRecursively(dirpath: string): Promise<string[]> {\n\t\tconst directory = toKey(normalizePath(dirpath));\n\t\tconst listPrefix = directory === \"\" ? \"\" : `${directory}/`;\n\t\tconst { objects } = await store.list(listPrefix);\n\t\treturn objects\n\t\t\t.map((object) => object.key.slice(listPrefix.length))\n\t\t\t.filter((path) => path.length > 0)\n\t\t\t.sort();\n\t}\n\n\tfunction registerGitdir(gitdir: string, facts?: GitdirFacts): void {\n\t\tregisteredGitdirs.set(\n\t\t\tnormalizePath(gitdir),\n\t\t\tnew Set(facts?.absentFiles ?? []),\n\t\t);\n\t}\n\n\tfunction invalidate(pathPrefix: string): void {\n\t\tconst normalized = normalizePath(pathPrefix);\n\t\tfor (const dir of registeredGitdirs.keys()) {\n\t\t\tif (dir.startsWith(normalized)) registeredGitdirs.delete(dir);\n\t\t}\n\t\tfor (const scope of looseHints.keys()) {\n\t\t\tif (scope.startsWith(normalized)) looseHints.delete(scope);\n\t\t}\n\t\tconst maybe = store as ObjectStore & {\n\t\t\tinvalidate?: (prefix: string) => void;\n\t\t};\n\t\tmaybe.invalidate?.(toKey(normalized));\n\t}\n\n\treturn {\n\t\tpromises,\n\t\tlistFilesRecursively,\n\t\tdetectLooseObjects,\n\t\tprefetchPacks,\n\t\tinvalidate,\n\t\tregisterGitdir,\n\t};\n}\n","import { einval } from \"./errors.js\";\n\n/**\n * Normalize an absolute-or-relative filesystem path into a storage key\n * segment: no leading/trailing slashes, `.` segments dropped, `..` resolved.\n * A `..` that would escape the root throws EINVAL — paths handed to the fs\n * must never address keys outside the configured prefix.\n */\nexport function normalizePath(filepath: string): string {\n\tconst segments = filepath.split(\"/\");\n\tconst out: string[] = [];\n\tfor (const segment of segments) {\n\t\tif (segment === \"\" || segment === \".\") continue;\n\t\tif (segment === \"..\") {\n\t\t\tif (out.length === 0) throw einval(\"resolve\", filepath);\n\t\t\tout.pop();\n\t\t\tcontinue;\n\t\t}\n\t\tout.push(segment);\n\t}\n\treturn out.join(\"/\");\n}\n\n/** Join a configured key prefix with a normalized path. */\nexport function toKey(prefix: string, filepath: string): string {\n\tconst normalized = normalizePath(filepath);\n\tif (prefix === \"\") return normalized;\n\treturn normalized === \"\" ? prefix : `${prefix}/${normalized}`;\n}\n","import type { ObjectStore } from \"./types.js\";\n\n/** Options accepted by {@link createRetryStore}. */\nexport interface RetryOptions {\n\t/** Retries after the first attempt (total attempts = retries + 1). Default 3. */\n\tretries?: number;\n\t/** Backoff base delay in milliseconds, doubled each attempt. Default 100. */\n\tinitialDelayMs?: number;\n\t/** Upper bound for the backoff base delay. Default 5000. */\n\tmaxDelayMs?: number;\n\t/** Random jitter added to each delay, as a fraction of it. Default 0.3. */\n\tjitter?: number;\n\t/**\n\t * Decide whether an error is worth retrying. The store contract maps\n\t * \"not found\" to `null` rather than throwing, so any thrown error is a\n\t * genuine failure; the default retries network faults, throttling, and\n\t * HTTP 5xx responses.\n\t */\n\tisRetryable?: (error: unknown) => boolean;\n\t/**\n\t * Circuit breaker configuration, or `false` to disable. After `threshold`\n\t * consecutive failures the store fails fast for `resetMs`, then lets one\n\t * request probe the backend again. Defaults: 5 failures, 30 000 ms.\n\t */\n\tbreaker?: false | { threshold?: number; resetMs?: number };\n\t/** Called before each retry sleep; useful for logging/metrics. */\n\tonRetry?: (info: {\n\t\tkey: string;\n\t\top: string;\n\t\tattempt: number;\n\t\tdelayMs: number;\n\t}) => void;\n}\n\n/**\n * Thrown instead of calling the backend while the circuit breaker is open.\n * Carries `code: \"EUNAVAILABLE\"` so callers can map it to a 503.\n */\nexport class CircuitOpenError extends Error {\n\treadonly code = \"EUNAVAILABLE\";\n\n\tconstructor() {\n\t\tsuper(\"Circuit breaker is open, object store unavailable\");\n\t\tthis.name = \"CircuitOpenError\";\n\t}\n}\n\nconst RETRYABLE_NAMES = new Set([\n\t\"TimeoutError\",\n\t\"RequestTimeout\",\n\t\"RequestTimeoutException\",\n\t\"SlowDown\",\n\t\"ThrottlingException\",\n\t\"TooManyRequestsException\",\n]);\n\nconst RETRYABLE_CODES = new Set([\n\t\"ECONNRESET\",\n\t\"ECONNREFUSED\",\n\t\"EPIPE\",\n\t\"ETIMEDOUT\",\n\t\"ENOTFOUND\",\n\t\"EAI_AGAIN\",\n\t\"EPROTO\",\n]);\n\nfunction defaultIsRetryable(error: unknown): boolean {\n\tif (typeof error !== \"object\" || error === null) return false;\n\tconst err = error as {\n\t\tname?: string;\n\t\tcode?: string;\n\t\t$metadata?: { httpStatusCode?: number };\n\t};\n\tif (err.name !== undefined && RETRYABLE_NAMES.has(err.name)) return true;\n\tif (err.code !== undefined && RETRYABLE_CODES.has(err.code)) return true;\n\tconst status = err.$metadata?.httpStatusCode;\n\treturn status !== undefined && (status >= 500 || status === 429);\n}\n\nconst sleep = (ms: number) => new Promise((resolve) => setTimeout(resolve, ms));\n\n/**\n * Wrap an {@link ObjectStore} with retries (exponential backoff + jitter) and\n * an optional per-instance circuit breaker.\n *\n * Place this decorator closest to the network store, underneath any cache:\n * the cache then never stores transient failures, and callers coalesced onto\n * one request share a single retried attempt.\n */\nexport function createRetryStore(\n\tstore: ObjectStore,\n\toptions: RetryOptions = {},\n): ObjectStore {\n\tconst retries = options.retries ?? 3;\n\tconst initialDelayMs = options.initialDelayMs ?? 100;\n\tconst maxDelayMs = options.maxDelayMs ?? 5000;\n\tconst jitter = options.jitter ?? 0.3;\n\tconst isRetryable = options.isRetryable ?? defaultIsRetryable;\n\tconst breaker =\n\t\toptions.breaker === false\n\t\t\t? null\n\t\t\t: {\n\t\t\t\t\tthreshold: options.breaker?.threshold ?? 5,\n\t\t\t\t\tresetMs: options.breaker?.resetMs ?? 30_000,\n\t\t\t\t};\n\n\tlet failures = 0;\n\tlet lastFailureAt = 0;\n\tlet state: \"closed\" | \"open\" | \"half-open\" = \"closed\";\n\tlet probing = false;\n\n\t/**\n\t * Consecutive transient failures open the circuit; any success closes it\n\t * and resets the count. Non-retryable errors (a 403, a malformed request)\n\t * say nothing about the backend's health and never count. Once the reset\n\t * window passes, exactly one request probes the backend (half-open);\n\t * everything else keeps failing fast until that probe settles.\n\t */\n\tasync function guarded<T>(fn: () => Promise<T>): Promise<T> {\n\t\tif (breaker === null) return fn();\n\t\tlet isProbe = false;\n\t\tif (state !== \"closed\") {\n\t\t\tif (\n\t\t\t\tprobing ||\n\t\t\t\t(state === \"open\" && Date.now() - lastFailureAt < breaker.resetMs)\n\t\t\t) {\n\t\t\t\tthrow new CircuitOpenError();\n\t\t\t}\n\t\t\tstate = \"half-open\";\n\t\t\tprobing = true;\n\t\t\tisProbe = true;\n\t\t}\n\t\ttry {\n\t\t\tconst result = await fn();\n\t\t\tfailures = 0;\n\t\t\tstate = \"closed\";\n\t\t\treturn result;\n\t\t} catch (error) {\n\t\t\tif (isRetryable(error)) {\n\t\t\t\tfailures++;\n\t\t\t\tlastFailureAt = Date.now();\n\t\t\t\tif (failures >= breaker.threshold || isProbe) state = \"open\";\n\t\t\t} else if (isProbe) {\n\t\t\t\t// The backend answered; it's up.\n\t\t\t\tfailures = 0;\n\t\t\t\tstate = \"closed\";\n\t\t\t}\n\t\t\tthrow error;\n\t\t} finally {\n\t\t\tif (isProbe) probing = false;\n\t\t}\n\t}\n\n\tasync function run<T>(op: string, key: string, fn: () => Promise<T>) {\n\t\tlet lastError: unknown;\n\t\tfor (let attempt = 0; attempt <= retries; attempt++) {\n\t\t\ttry {\n\t\t\t\treturn await guarded(fn);\n\t\t\t} catch (error) {\n\t\t\t\tlastError = error;\n\t\t\t\tif (error instanceof CircuitOpenError) throw error;\n\t\t\t\tif (!isRetryable(error) || attempt === retries) throw error;\n\t\t\t\tconst base = Math.min(initialDelayMs * 2 ** attempt, maxDelayMs);\n\t\t\t\tconst delayMs = Math.round(base + Math.random() * base * jitter);\n\t\t\t\toptions.onRetry?.({ key, op, attempt: attempt + 1, delayMs });\n\t\t\t\tawait sleep(delayMs);\n\t\t\t}\n\t\t}\n\t\tthrow lastError;\n\t}\n\n\treturn {\n\t\tget: (key) => run(\"get\", key, () => store.get(key)),\n\t\tput: (key, data) => run(\"put\", key, () => store.put(key, data)),\n\t\tdelete: (key) => run(\"delete\", key, () => store.delete(key)),\n\t\thead: (key) => run(\"head\", key, () => store.head(key)),\n\t\tlist: (prefix, listOptions) =>\n\t\t\trun(\"list\", prefix, () => store.list(prefix, listOptions)),\n\t};\n}\n","import type {\n\tListOptions,\n\tListResult,\n\tObjectStat,\n\tObjectStore,\n} from \"../types.js\";\n\n/**\n * In-memory {@link ObjectStore}. Useful for tests, examples, and ephemeral\n * repositories; also the reference implementation for the list/delimiter\n * semantics other stores must match.\n */\nexport class MemoryObjectStore implements ObjectStore {\n\tprivate readonly objects = new Map<string, Uint8Array>();\n\n\tasync get(key: string): Promise<Uint8Array | null> {\n\t\tconst data = this.objects.get(key);\n\t\treturn data ? data.slice() : null;\n\t}\n\n\tasync getRange(\n\t\tkey: string,\n\t\tstart: number,\n\t\tend: number,\n\t): Promise<Uint8Array | null> {\n\t\tconst data = this.objects.get(key);\n\t\treturn data ? data.slice(start, end + 1) : null;\n\t}\n\n\tasync put(key: string, data: Uint8Array): Promise<void> {\n\t\tthis.objects.set(key, data.slice());\n\t}\n\n\tasync delete(key: string): Promise<void> {\n\t\tthis.objects.delete(key);\n\t}\n\n\tasync head(key: string): Promise<ObjectStat | null> {\n\t\tconst data = this.objects.get(key);\n\t\treturn data ? { size: data.byteLength } : null;\n\t}\n\n\tasync list(prefix: string, options?: ListOptions): Promise<ListResult> {\n\t\tconst delimiter = options?.delimiter;\n\t\tconst limit = options?.limit ?? Number.POSITIVE_INFINITY;\n\t\tconst objects: ListResult[\"objects\"] = [];\n\t\tconst prefixes = new Set<string>();\n\n\t\tfor (const [key, data] of this.objects) {\n\t\t\tif (!key.startsWith(prefix)) continue;\n\t\t\tconst rest = key.slice(prefix.length);\n\t\t\tif (delimiter !== undefined) {\n\t\t\t\tconst idx = rest.indexOf(delimiter);\n\t\t\t\tif (idx !== -1) {\n\t\t\t\t\tprefixes.add(prefix + rest.slice(0, idx + delimiter.length));\n\t\t\t\t} else {\n\t\t\t\t\tobjects.push({ key, size: data.byteLength });\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tobjects.push({ key, size: data.byteLength });\n\t\t\t}\n\t\t\tif (objects.length + prefixes.size >= limit) break;\n\t\t}\n\n\t\treturn { objects, prefixes: [...prefixes] };\n\t}\n\n\t/** Number of stored objects (test convenience, not part of ObjectStore). */\n\tget size(): number {\n\t\treturn this.objects.size;\n\t}\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAS,gBAAgB;AA8EzB,IAAM,OAAO,uBAAO,MAAM;AAa1B,SAAS,cAAc,OAA0B;AAChD,MAAI,OAAO,MAAM,OAAO,SAAS;AACjC,aAAW,KAAK,MAAM,OAAO,QAAS,SAAQ,EAAE,IAAI,SAAS;AAC7D,aAAW,KAAK,MAAM,OAAO,SAAU,SAAQ,EAAE;AACjD,SAAO;AACR;AAEA,SAAS,eAAe,QAAgC;AACvD,SAAO;AAAA,IACN,SAAS,OAAO,QAAQ,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;AAAA,IAC7C,UAAU,CAAC,GAAG,OAAO,QAAQ;AAAA,EAC9B;AACD;AAaO,SAAS,kBACf,OACA,UAAwB,CAAC,GACL;AACpB,QAAM,WAAW,QAAQ,YAAY,KAAK,OAAO;AACjD,QAAM,gBAAgB,QAAQ,iBAAiB,KAAK,KAAK,WAAW,EAAE;AACtE,QAAM,MAAM,QAAQ,SAAS;AAC7B,QAAM,YAAY,QAAQ;AAC1B,QAAM,cAAc,QAAQ,eAAe;AAC3C,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,QAAQ,MAAM,UAAU,KAAK,KAAK;AACxC,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,QAAQ,CAAC,SAAsB,OAAO,KAAK,MAAM,IAAI;AAC3D,QAAM,QAAQ,QAAQ;AACtB,QAAM,SAAS,QAAQ;AAEvB,QAAM,QAAQ,IAAI,SAA6B;AAAA,IAC9C,SAAS;AAAA,IACT,iBAAiB,CAAC,UAAW,UAAU,OAAO,IAAI,MAAM,cAAc;AAAA,IACtE;AAAA,EACD,CAAC;AACD,QAAM,YAAY,IAAI,SAA4B;AAAA,IACjD,SAAS,KAAK,IAAI,GAAG,KAAK,KAAK,WAAW,EAAE,CAAC;AAAA,IAC7C,iBAAiB;AAAA,IACjB;AAAA,EACD,CAAC;AAED,QAAM,cAAc,oBAAI,IAAwC;AAChE,QAAM,eAAe,oBAAI,IAAwC;AACjE,QAAM,eAAe,oBAAI,IAAiC;AAU1D,MAAI,aAAa;AACjB,QAAM,iBAAiB,CAAC,UAAkB,eAAe;AAEzD,QAAM,QAAQ,CAAC,KAAa,SAAqB;AAChD,QAAI,KAAK,cAAc,eAAe;AACrC,YAAM,IAAI,KAAK,MAAM,IAAI,GAAG,EAAE,KAAK,YAAY,GAAG,EAAE,CAAC;AAAA,IACtD;AAAA,EACD;AAGA,WAAS,sBAAsB,KAAmB;AACjD,eAAW,CAAC,SAAS,KAAK,KAAK,UAAU,QAAQ,GAAG;AACnD,UAAI,CAAC,IAAI,WAAW,MAAM,MAAM,EAAG;AACnC,UAAI,MAAM,SAAS,CAAC,MAAM,MAAO;AACjC,gBAAU,OAAO,OAAO;AAAA,IACzB;AAGA,eAAW,WAAW,aAAa,KAAK,GAAG;AAC1C,YAAM,SAAS,QAAQ,MAAM,GAAG,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG;AACnD,UAAI,IAAI,WAAW,MAAM,EAAG,cAAa,OAAO,OAAO;AAAA,IACxD;AAAA,EACD;AAGA,WAAS,UAAU,KAAmB;AACrC;AACA,gBAAY,OAAO,GAAG;AACtB,iBAAa,OAAO,GAAG;AAAA,EACxB;AAEA,WAAS,UACR,SACA,KACA,IACa;AACb,QAAI,CAAC,SAAU,QAAO,GAAG;AACzB,UAAM,WAAW,QAAQ,IAAI,GAAG;AAChC,QAAI,aAAa,OAAW,QAAO;AACnC,UAAM,IAAI,GAAG,EAAE,QAAQ,MAAM;AAC5B,UAAI,QAAQ,IAAI,GAAG,MAAM,EAAG,SAAQ,OAAO,GAAG;AAAA,IAC/C,CAAC;AACD,YAAQ,IAAI,KAAK,CAAC;AAClB,WAAO;AAAA,EACR;AAEA,SAAO;AAAA,IACN,MAAM,IAAI,KAAyC;AAClD,YAAM,SAAS,MAAM,IAAI,GAAG;AAC5B,UAAI,WAAW,QAAW;AACzB,gBAAQ,GAAG;AACX,eAAO,WAAW,OAAO,OAAO,MAAM,MAAM;AAAA,MAC7C;AACA,YAAM,OAAO,MAAM,UAAU,aAAa,KAAK,YAAY;AAC1D,iBAAS,GAAG;AACZ,cAAM,QAAQ;AACd,cAAM,UAAU,MAAM,MAAM,IAAI,GAAG;AACnC,YAAI,eAAe,KAAK,GAAG;AAC1B,cAAI,YAAY,MAAM;AACrB,kBAAM,KAAK,OAAO;AAAA,UACnB,WAAW,aAAa;AACvB,kBAAM,IAAI,KAAK,MAAM,EAAE,KAAK,YAAY,GAAG,EAAE,CAAC;AAAA,UAC/C;AAAA,QACD;AACA,eAAO;AAAA,MACR,CAAC;AACD,aAAO,SAAS,OAAO,OAAO,MAAM,IAAI;AAAA,IACzC;AAAA,IAEA,MAAM,IAAI,KAAa,MAAiC;AACvD,gBAAU,GAAG;AACb,UAAI;AACH,cAAM,MAAM,IAAI,KAAK,IAAI;AAAA,MAC1B,UAAE;AAGD,kBAAU,GAAG;AACb,cAAM,OAAO,GAAG;AAChB,8BAAsB,GAAG;AAAA,MAC1B;AACA,YAAM,KAAK,IAAI;AAAA,IAChB;AAAA,IAEA,MAAM,OAAO,KAA4B;AACxC,gBAAU,GAAG;AACb,UAAI;AACH,cAAM,MAAM,OAAO,GAAG;AAAA,MACvB,UAAE;AACD,kBAAU,GAAG;AACb,cAAM,OAAO,GAAG;AAChB,8BAAsB,GAAG;AAAA,MAC1B;AACA,UAAI,aAAa;AAChB,cAAM,IAAI,KAAK,MAAM,EAAE,KAAK,YAAY,GAAG,EAAE,CAAC;AAAA,MAC/C,OAAO;AACN,cAAM,OAAO,GAAG;AAAA,MACjB;AAAA,IACD;AAAA,IAEA,MAAM,KAAK,KAAyC;AACnD,YAAM,SAAS,MAAM,IAAI,GAAG;AAC5B,UAAI,WAAW,QAAW;AACzB,gBAAQ,GAAG;AACX,eAAO,WAAW,OAAO,OAAO,EAAE,MAAM,OAAO,WAAW;AAAA,MAC3D;AACA,aAAO,UAAU,cAAc,KAAK,YAAY;AAC/C,iBAAS,GAAG;AACZ,cAAM,QAAQ;AACd,cAAM,OAAO,MAAM,MAAM,KAAK,GAAG;AACjC,YAAI,SAAS,QAAQ,eAAe,eAAe,KAAK,GAAG;AAC1D,gBAAM,IAAI,KAAK,MAAM,EAAE,KAAK,YAAY,GAAG,EAAE,CAAC;AAAA,QAC/C;AACA,eAAO;AAAA,MACR,CAAC;AAAA,IACF;AAAA,IAEA,MAAM,KAAK,QAAgB,aAAgD;AAC1E,UAAI,CAAC,WAAY,QAAO,MAAM,KAAK,QAAQ,WAAW;AACtD,YAAM,UAAU,GAAG,aAAa,aAAa,EAAE,IAAI,aAAa,SAAS,EAAE,IAAI,MAAM;AACrF,YAAM,SAAS,UAAU,IAAI,OAAO;AACpC,UAAI,WAAW,QAAW;AACzB,gBAAQ,MAAM;AACd,eAAO,eAAe,OAAO,MAAM;AAAA,MACpC;AACA,YAAM,SAAS,MAAM,UAAU,cAAc,SAAS,YAAY;AACjE,iBAAS,MAAM;AACf,cAAM,QAAQ;AACd,cAAM,UAAU,MAAM,MAAM,KAAK,QAAQ,WAAW;AACpD,YAAI,CAAC,eAAe,KAAK,EAAG,QAAO;AACnC,kBAAU;AAAA,UACT;AAAA,UACA;AAAA,YACC,QAAQ,eAAe,OAAO;AAAA,YAC9B;AAAA,YACA,OAAO,aAAa,UAAU;AAAA,YAC9B,OACC,QAAQ,QAAQ,WAAW,KAAK,QAAQ,SAAS,WAAW;AAAA,UAC9D;AAAA,UACA,EAAE,KAAK,YAAY,MAAM,EAAE;AAAA,QAC5B;AACA,eAAO;AAAA,MACR,CAAC;AACD,aAAO,eAAe,MAAM;AAAA,IAC7B;AAAA;AAAA;AAAA;AAAA,IAKA,GAAI,QACD;AAAA,MACA,UAAU,CAAC,KAAa,OAAe,QACtC,MAAM,KAAK,OAAO,GAAG;AAAA,IACvB,IACC,CAAC;AAAA,IAEJ,WAAW,QAAsB;AAChC;AACA,iBAAW,OAAO,CAAC,GAAG,YAAY,KAAK,CAAC,GAAG;AAC1C,YAAI,IAAI,WAAW,MAAM,EAAG,aAAY,OAAO,GAAG;AAAA,MACnD;AACA,iBAAW,OAAO,CAAC,GAAG,aAAa,KAAK,CAAC,GAAG;AAC3C,YAAI,IAAI,WAAW,MAAM,EAAG,cAAa,OAAO,GAAG;AAAA,MACpD;AACA,mBAAa,MAAM;AACnB,iBAAW,OAAO,MAAM,KAAK,GAAG;AAC/B,YAAI,IAAI,WAAW,MAAM,EAAG,OAAM,OAAO,GAAG;AAAA,MAC7C;AACA,iBAAW,CAAC,SAAS,KAAK,KAAK,UAAU,QAAQ,GAAG;AACnD,YACC,MAAM,OAAO,WAAW,MAAM,KAC9B,OAAO,WAAW,MAAM,MAAM,GAC7B;AACD,oBAAU,OAAO,OAAO;AAAA,QACzB;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACD;;;ACzUO,IAAM,UAAN,cAAsB,MAAM;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,MAAc,SAAiB,MAAc;AACxD,UAAM,GAAG,IAAI,KAAK,OAAO,KAAK,IAAI,GAAG;AACrC,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,UAAU;AACf,SAAK,OAAO;AAAA,EACb;AACD;AAEO,IAAM,SAAS,CAAC,SAAiB,SACvC,IAAI,QAAQ,UAAU,SAAS,IAAI;AAE7B,IAAM,UAAU,CAAC,SAAiB,SACxC,IAAI,QAAQ,WAAW,SAAS,IAAI;AAE9B,IAAM,YAAY,CAAC,SAAiB,SAC1C,IAAI,QAAQ,aAAa,SAAS,IAAI;AAEhC,IAAM,SAAS,CAAC,SAAiB,SACvC,IAAI,QAAQ,UAAU,SAAS,IAAI;AAE7B,IAAM,QAAQ,CAAC,SAAiB,SACtC,IAAI,QAAQ,SAAS,SAAS,IAAI;;;AC/BnC,SAAS,YAAAA,iBAAgB;;;ACQlB,SAAS,cAAc,UAA0B;AACvD,QAAM,WAAW,SAAS,MAAM,GAAG;AACnC,QAAM,MAAgB,CAAC;AACvB,aAAW,WAAW,UAAU;AAC/B,QAAI,YAAY,MAAM,YAAY,IAAK;AACvC,QAAI,YAAY,MAAM;AACrB,UAAI,IAAI,WAAW,EAAG,OAAM,OAAO,WAAW,QAAQ;AACtD,UAAI,IAAI;AACR;AAAA,IACD;AACA,QAAI,KAAK,OAAO;AAAA,EACjB;AACA,SAAO,IAAI,KAAK,GAAG;AACpB;AAGO,SAAS,MAAM,QAAgB,UAA0B;AAC/D,QAAM,aAAa,cAAc,QAAQ;AACzC,MAAI,WAAW,GAAI,QAAO;AAC1B,SAAO,eAAe,KAAK,SAAS,GAAG,MAAM,IAAI,UAAU;AAC5D;;;ADZA,IAAM,YAAY;AAClB,IAAM,WAAW;AAEjB,IAAM,cAAc,IAAI,YAAY;AACpC,IAAM,cAAc,IAAI,YAAY;AAEpC,SAAS,SAAS,MAAsB,MAAoB;AAC3D,QAAM,QAAQ,oBAAI,KAAK,CAAC;AACxB,SAAO;AAAA,IACN;AAAA,IACA,MAAM,SAAS,SAAS,YAAY;AAAA,IACpC;AAAA,IACA,KAAK;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO;AAAA,IACP,OAAO;AAAA,IACP,QAAQ,MAAM,SAAS;AAAA,IACvB,aAAa,MAAM,SAAS;AAAA,IAC5B,gBAAgB,MAAM;AAAA,EACvB;AACD;AAEA,SAAS,gBACR,SACuB;AACvB,MAAI,OAAO,YAAY,SAAU,QAAO;AACxC,SAAO,SAAS;AACjB;AA2DO,SAAS,YACf,OACA,UAAwB,CAAC,GACjB;AACR,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,gBAAgB,QAAQ,oBAAoB;AAClD,QAAM,SAAS,QAAQ;AAEvB,QAAMC,SAAQ,CAAC,SAAyB,MAAgB,QAAQ,IAAI;AAQpE,QAAM,aAAa,IAAIC,UAAqC;AAAA,IAC3D,KAAK;AAAA,IACL,KAAK,QAAQ,aAAa;AAAA,EAC3B,CAAC;AAGD,QAAM,oBAAoB,IAAIA,UAAsC;AAAA,IACnE,KAAK;AAAA,EACN,CAAC;AAGD,WAAS,iBAAiB,MAAuB;AAChD,UAAM,QAAQ,KAAK,YAAY,GAAG;AAClC,QAAI,QAAQ,EAAG,QAAO;AACtB,UAAM,SAAS,kBAAkB,IAAI,KAAK,MAAM,GAAG,KAAK,CAAC;AACzD,WAAO,QAAQ,IAAI,KAAK,MAAM,QAAQ,CAAC,CAAC,KAAK;AAAA,EAC9C;AAGA,WAAS,WAAW,MAA6B;AAChD,WAAO,qBAAqB,IAAI,GAAG,UAAU;AAAA,EAC9C;AAEA,QAAM,oBAAoB,oBAAI,IAA2B;AAQzD,iBAAe,YAAY,MAAgC;AAC1D,QAAI,iBAAiB,IAAI,EAAG,QAAO;AACnC,QAAI,CAAC,cAAe,QAAO;AAC3B,UAAM,QAAQ,WAAW,IAAI;AAC7B,QAAI,UAAU,KAAM,QAAO;AAC3B,QAAI,CAAC,WAAW,IAAI,KAAK,GAAG;AAC3B,UAAI,UAAU,kBAAkB,IAAI,KAAK;AACzC,UAAI,CAAC,SAAS;AACb,kBAAU,mBAAmB,KAAK,EAAE;AAAA,UAAQ,MAC3C,kBAAkB,OAAO,KAAK;AAAA,QAC/B;AACA,0BAAkB,IAAI,OAAO,OAAO;AAAA,MACrC;AACA,YAAM;AAAA,IACP;AACA,WAAO,WAAW,IAAI,KAAK,MAAM;AAAA,EAClC;AAEA,iBAAe,YAAY,QAAkC;AAC5D,UAAM,EAAE,SAAS,SAAS,IAAI,MAAM,MAAM,KAAK,GAAG,MAAM,KAAK;AAAA,MAC5D,OAAO;AAAA,IACR,CAAC;AACD,WAAO,QAAQ,SAAS,KAAK,SAAS,SAAS;AAAA,EAChD;AAEA,iBAAe,KAAK,UAAkB,SAAgC;AACrE,UAAM,OAAO,cAAc,QAAQ;AACnC,QAAI,MAAM,YAAY,IAAI,EAAG,OAAM,OAAO,SAAS,QAAQ;AAC3D,UAAM,IAAID,OAAM,IAAI;AACpB,QAAI,MAAM,UAAU,MAAM,MAAM,kBAAkB,IAAI,IAAI,GAAG;AAC5D,aAAO,SAAS,OAAO,CAAC;AAAA,IACzB;AACA,UAAM,WAAW,MAAM,MAAM,KAAK,CAAC;AACnC,QAAI,SAAU,QAAO,SAAS,QAAQ,SAAS,IAAI;AAGnD,QAAI,iBAAiB,WAAW,IAAI,MAAM,MAAM;AAC/C,YAAM,OAAO,SAAS,QAAQ;AAAA,IAC/B;AACA,QAAI,MAAM,YAAY,CAAC,EAAG,QAAO,SAAS,OAAO,CAAC;AAClD,UAAM,OAAO,SAAS,QAAQ;AAAA,EAC/B;AAEA,QAAM,QAAQ,MAAM,UAAU,KAAK,KAAK;AAExC,QAAM,WAAoC;AAAA;AAAA;AAAA,IAGzC,GAAI,QACD;AAAA,MACA,UAAU,CAAC,UAAkB,OAAe,QAC3C,MAAMA,OAAM,cAAc,QAAQ,CAAC,GAAG,OAAO,GAAG;AAAA,IAClD,IACC,CAAC;AAAA,IAEJ,MAAM,SAAS,UAAU,MAAM;AAC9B,YAAM,OAAO,cAAc,QAAQ;AACnC,UAAI,MAAM,YAAY,IAAI,EAAG,OAAM,OAAO,QAAQ,QAAQ;AAC1D,YAAM,OAAO,MAAM,MAAM,IAAIA,OAAM,IAAI,CAAC;AACxC,UAAI,SAAS,KAAM,OAAM,OAAO,QAAQ,QAAQ;AAChD,aAAO,gBAAgB,IAAI,MAAM,SAAS,YAAY,OAAO,IAAI,IAAI;AAAA,IACtE;AAAA,IAEA,MAAM,UAAU,UAAU,MAAM,OAAO;AACtC,YAAM,OAAO,cAAc,QAAQ;AACnC,UAAI,eAAe;AAClB,cAAM,QAAQ,WAAW,IAAI;AAG7B,YAAI,UAAU,KAAM,YAAW,IAAI,OAAO,SAAS;AAAA,MACpD;AACA,YAAM,QAAQ,OAAO,SAAS,WAAW,YAAY,OAAO,IAAI,IAAI;AACpE,YAAM,MAAM,IAAIA,OAAM,IAAI,GAAG,KAAK;AAAA,IACnC;AAAA,IAEA,MAAM,OAAO,UAAU;AACtB,YAAM,IAAIA,OAAM,cAAc,QAAQ,CAAC;AACvC,UAAK,MAAM,MAAM,KAAK,CAAC,MAAO,KAAM,OAAM,OAAO,UAAU,QAAQ;AACnE,YAAM,MAAM,OAAO,CAAC;AAAA,IACrB;AAAA,IAEA,MAAM,QAAQ,SAAS;AACtB,YAAM,IAAIA,OAAM,cAAc,OAAO,CAAC;AACtC,YAAM,SAAS,MAAM,UAAU,MAAM;AACrC,YAAM,aAAa,UAAU,MAAM,KAAK,KAAK,GAAG,CAAC;AACjD,YAAM,EAAE,SAAS,SAAS,IAAI,MAAM,MAAM,KAAK,YAAY;AAAA,QAC1D,WAAW;AAAA,MACZ,CAAC;AACD,UAAI,QAAQ,WAAW,KAAK,SAAS,WAAW,GAAG;AAClD,YAAI,CAAC,UAAW,MAAM,MAAM,KAAK,CAAC,MAAO,MAAM;AAC9C,gBAAM,QAAQ,WAAW,OAAO;AAAA,QACjC;AACA,YAAI,CAAC,OAAQ,OAAM,OAAO,WAAW,OAAO;AAAA,MAC7C;AACA,YAAM,QAAQ,QAAQ,IAAI,CAAC,MAAM,EAAE,IAAI,MAAM,WAAW,MAAM,CAAC;AAC/D,YAAM,WAAW,SAAS;AAAA,QAAI,CAAC,MAC9B,EAAE,MAAM,WAAW,MAAM,EAAE,QAAQ,OAAO,EAAE;AAAA,MAC7C;AACA,aAAO,CAAC,GAAG,OAAO,GAAG,QAAQ,EAAE,KAAK;AAAA,IACrC;AAAA,IAEA,MAAM,MAAM,UAAU,OAAO;AAAA,IAE7B;AAAA,IAEA,MAAM,MAAM,SAAS;AACpB,YAAM,IAAIA,OAAM,cAAc,OAAO,CAAC;AACtC,YAAM,EAAE,SAAS,SAAS,IAAI,MAAM,MAAM,KAAK,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC;AACpE,UAAI,QAAQ,SAAS,KAAK,SAAS,SAAS,GAAG;AAC9C,cAAM,UAAU,SAAS,OAAO;AAAA,MACjC;AAAA,IAED;AAAA,IAEA,MAAM,CAAC,aAAa,KAAK,UAAU,MAAM;AAAA,IACzC,OAAO,CAAC,aAAa,KAAK,UAAU,OAAO;AAAA,IAE3C,MAAM,SAAS,UAA0B;AACxC,YAAM,OAAO,YAAY,QAAQ;AAAA,IAClC;AAAA,IAEA,MAAM,QAAQ,SAAS,UAA0B;AAChD,YAAM,MAAM,WAAW,QAAQ;AAAA,IAChC;AAAA,IAEA,MAAM,MAAM,WAAW,OAAO;AAAA,IAE9B;AAAA,EACD;AAEA,iBAAe,mBAAmB,QAA+B;AAChE,QAAI,CAAC,cAAe;AACpB,UAAM,QAAQ,cAAc,MAAM;AAIlC,QAAI,WAAW,IAAI,KAAK,EAAG;AAC3B,QAAI;AACH,YAAM,EAAE,QAAQ,IAAI,MAAM,MAAM,KAAK,GAAGA,OAAM,KAAK,CAAC,aAAa;AAAA,QAChE,OAAO;AAAA,MACR,CAAC;AAGD,YAAM,QAAQ,QAAQ,CAAC,GAAG;AAC1B,YAAM,OACL,UAAU,UAAa,qBAAqB,KAAK,MAAM,OACpD,YACA;AACJ,iBAAW,IAAI,OAAO,IAAI;AAC1B,eAAS,iBAAiB,IAAI,UAAU,KAAK,EAAE;AAAA,IAChD,QAAQ;AAAA,IAER;AAAA,EACD;AAEA,iBAAe,cACd,QACA,iBACgB;AAChB,UAAM,WAAW,iBAAiB,YAAY;AAC9C,UAAM,UAAU,GAAG,cAAc,MAAM,CAAC;AAGxC,UAAM,UAAU;AAAA,MACf,MAAM,SAAS,QAAQ,OAAO,EAAE,MAAM,MAAM,CAAC,CAAC;AAAA,IAC/C,EACE,OAAO,CAAC,SAAS,yBAAyB,IAAI,KAAK,IAAI,CAAC,EACxD,IAAI,CAAC,SAAS,KAAK,IAAI;AACzB,QAAI,QAAQ,SAAS,WAAW,GAAG;AAClC,YAAM,mBAAmB,MAAM;AAC/B;AAAA,IACD;AACA,UAAM,QAAQ,IAAI;AAAA,MACjB,mBAAmB,MAAM;AAAA,MACzB,GAAG,QAAQ;AAAA,QAAI,CAAC,SACf,SAAS,SAAS,GAAG,OAAO,IAAI,IAAI,EAAE,EAAE,MAAM,MAAM,MAAS;AAAA,MAC9D;AAAA,IACD,CAAC;AAAA,EACF;AAEA,iBAAe,qBAAqB,SAAoC;AACvE,UAAM,YAAYA,OAAM,cAAc,OAAO,CAAC;AAC9C,UAAM,aAAa,cAAc,KAAK,KAAK,GAAG,SAAS;AACvD,UAAM,EAAE,QAAQ,IAAI,MAAM,MAAM,KAAK,UAAU;AAC/C,WAAO,QACL,IAAI,CAAC,WAAW,OAAO,IAAI,MAAM,WAAW,MAAM,CAAC,EACnD,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,EAChC,KAAK;AAAA,EACR;AAEA,WAAS,eAAe,QAAgB,OAA2B;AAClE,sBAAkB;AAAA,MACjB,cAAc,MAAM;AAAA,MACpB,IAAI,IAAI,OAAO,eAAe,CAAC,CAAC;AAAA,IACjC;AAAA,EACD;AAEA,WAAS,WAAW,YAA0B;AAC7C,UAAM,aAAa,cAAc,UAAU;AAC3C,eAAW,OAAO,kBAAkB,KAAK,GAAG;AAC3C,UAAI,IAAI,WAAW,UAAU,EAAG,mBAAkB,OAAO,GAAG;AAAA,IAC7D;AACA,eAAW,SAAS,WAAW,KAAK,GAAG;AACtC,UAAI,MAAM,WAAW,UAAU,EAAG,YAAW,OAAO,KAAK;AAAA,IAC1D;AACA,UAAM,QAAQ;AAGd,UAAM,aAAaA,OAAM,UAAU,CAAC;AAAA,EACrC;AAEA,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACD;;;AE9UO,IAAM,mBAAN,cAA+B,MAAM;AAAA,EAClC,OAAO;AAAA,EAEhB,cAAc;AACb,UAAM,mDAAmD;AACzD,SAAK,OAAO;AAAA,EACb;AACD;AAEA,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD,CAAC;AAED,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD,CAAC;AAED,SAAS,mBAAmB,OAAyB;AACpD,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,QAAM,MAAM;AAKZ,MAAI,IAAI,SAAS,UAAa,gBAAgB,IAAI,IAAI,IAAI,EAAG,QAAO;AACpE,MAAI,IAAI,SAAS,UAAa,gBAAgB,IAAI,IAAI,IAAI,EAAG,QAAO;AACpE,QAAM,SAAS,IAAI,WAAW;AAC9B,SAAO,WAAW,WAAc,UAAU,OAAO,WAAW;AAC7D;AAEA,IAAM,QAAQ,CAAC,OAAe,IAAI,QAAQ,CAAC,YAAY,WAAW,SAAS,EAAE,CAAC;AAUvE,SAAS,iBACf,OACA,UAAwB,CAAC,GACX;AACd,QAAM,UAAU,QAAQ,WAAW;AACnC,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,cAAc,QAAQ,eAAe;AAC3C,QAAM,UACL,QAAQ,YAAY,QACjB,OACA;AAAA,IACA,WAAW,QAAQ,SAAS,aAAa;AAAA,IACzC,SAAS,QAAQ,SAAS,WAAW;AAAA,EACtC;AAEH,MAAI,WAAW;AACf,MAAI,gBAAgB;AACpB,MAAI,QAAyC;AAC7C,MAAI,UAAU;AASd,iBAAe,QAAW,IAAkC;AAC3D,QAAI,YAAY,KAAM,QAAO,GAAG;AAChC,QAAI,UAAU;AACd,QAAI,UAAU,UAAU;AACvB,UACC,WACC,UAAU,UAAU,KAAK,IAAI,IAAI,gBAAgB,QAAQ,SACzD;AACD,cAAM,IAAI,iBAAiB;AAAA,MAC5B;AACA,cAAQ;AACR,gBAAU;AACV,gBAAU;AAAA,IACX;AACA,QAAI;AACH,YAAM,SAAS,MAAM,GAAG;AACxB,iBAAW;AACX,cAAQ;AACR,aAAO;AAAA,IACR,SAAS,OAAO;AACf,UAAI,YAAY,KAAK,GAAG;AACvB;AACA,wBAAgB,KAAK,IAAI;AACzB,YAAI,YAAY,QAAQ,aAAa,QAAS,SAAQ;AAAA,MACvD,WAAW,SAAS;AAEnB,mBAAW;AACX,gBAAQ;AAAA,MACT;AACA,YAAM;AAAA,IACP,UAAE;AACD,UAAI,QAAS,WAAU;AAAA,IACxB;AAAA,EACD;AAEA,iBAAe,IAAO,IAAY,KAAa,IAAsB;AACpE,QAAI;AACJ,aAAS,UAAU,GAAG,WAAW,SAAS,WAAW;AACpD,UAAI;AACH,eAAO,MAAM,QAAQ,EAAE;AAAA,MACxB,SAAS,OAAO;AACf,oBAAY;AACZ,YAAI,iBAAiB,iBAAkB,OAAM;AAC7C,YAAI,CAAC,YAAY,KAAK,KAAK,YAAY,QAAS,OAAM;AACtD,cAAM,OAAO,KAAK,IAAI,iBAAiB,KAAK,SAAS,UAAU;AAC/D,cAAM,UAAU,KAAK,MAAM,OAAO,KAAK,OAAO,IAAI,OAAO,MAAM;AAC/D,gBAAQ,UAAU,EAAE,KAAK,IAAI,SAAS,UAAU,GAAG,QAAQ,CAAC;AAC5D,cAAM,MAAM,OAAO;AAAA,MACpB;AAAA,IACD;AACA,UAAM;AAAA,EACP;AAEA,SAAO;AAAA,IACN,KAAK,CAAC,QAAQ,IAAI,OAAO,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC;AAAA,IAClD,KAAK,CAAC,KAAK,SAAS,IAAI,OAAO,KAAK,MAAM,MAAM,IAAI,KAAK,IAAI,CAAC;AAAA,IAC9D,QAAQ,CAAC,QAAQ,IAAI,UAAU,KAAK,MAAM,MAAM,OAAO,GAAG,CAAC;AAAA,IAC3D,MAAM,CAAC,QAAQ,IAAI,QAAQ,KAAK,MAAM,MAAM,KAAK,GAAG,CAAC;AAAA,IACrD,MAAM,CAAC,QAAQ,gBACd,IAAI,QAAQ,QAAQ,MAAM,MAAM,KAAK,QAAQ,WAAW,CAAC;AAAA,EAC3D;AACD;;;ACvKO,IAAM,oBAAN,MAA+C;AAAA,EACpC,UAAU,oBAAI,IAAwB;AAAA,EAEvD,MAAM,IAAI,KAAyC;AAClD,UAAM,OAAO,KAAK,QAAQ,IAAI,GAAG;AACjC,WAAO,OAAO,KAAK,MAAM,IAAI;AAAA,EAC9B;AAAA,EAEA,MAAM,SACL,KACA,OACA,KAC6B;AAC7B,UAAM,OAAO,KAAK,QAAQ,IAAI,GAAG;AACjC,WAAO,OAAO,KAAK,MAAM,OAAO,MAAM,CAAC,IAAI;AAAA,EAC5C;AAAA,EAEA,MAAM,IAAI,KAAa,MAAiC;AACvD,SAAK,QAAQ,IAAI,KAAK,KAAK,MAAM,CAAC;AAAA,EACnC;AAAA,EAEA,MAAM,OAAO,KAA4B;AACxC,SAAK,QAAQ,OAAO,GAAG;AAAA,EACxB;AAAA,EAEA,MAAM,KAAK,KAAyC;AACnD,UAAM,OAAO,KAAK,QAAQ,IAAI,GAAG;AACjC,WAAO,OAAO,EAAE,MAAM,KAAK,WAAW,IAAI;AAAA,EAC3C;AAAA,EAEA,MAAM,KAAK,QAAgB,SAA4C;AACtE,UAAM,YAAY,SAAS;AAC3B,UAAM,QAAQ,SAAS,SAAS,OAAO;AACvC,UAAM,UAAiC,CAAC;AACxC,UAAM,WAAW,oBAAI,IAAY;AAEjC,eAAW,CAAC,KAAK,IAAI,KAAK,KAAK,SAAS;AACvC,UAAI,CAAC,IAAI,WAAW,MAAM,EAAG;AAC7B,YAAM,OAAO,IAAI,MAAM,OAAO,MAAM;AACpC,UAAI,cAAc,QAAW;AAC5B,cAAM,MAAM,KAAK,QAAQ,SAAS;AAClC,YAAI,QAAQ,IAAI;AACf,mBAAS,IAAI,SAAS,KAAK,MAAM,GAAG,MAAM,UAAU,MAAM,CAAC;AAAA,QAC5D,OAAO;AACN,kBAAQ,KAAK,EAAE,KAAK,MAAM,KAAK,WAAW,CAAC;AAAA,QAC5C;AAAA,MACD,OAAO;AACN,gBAAQ,KAAK,EAAE,KAAK,MAAM,KAAK,WAAW,CAAC;AAAA,MAC5C;AACA,UAAI,QAAQ,SAAS,SAAS,QAAQ,MAAO;AAAA,IAC9C;AAEA,WAAO,EAAE,SAAS,UAAU,CAAC,GAAG,QAAQ,EAAE;AAAA,EAC3C;AAAA;AAAA,EAGA,IAAI,OAAe;AAClB,WAAO,KAAK,QAAQ;AAAA,EACrB;AACD;","names":["LRUCache","toKey","LRUCache"]}
+{"version":3,"sources":["../src/cache.ts","../src/errors.ts","../src/git-fs.ts","../src/path.ts","../src/retry.ts","../src/stores/memory.ts"],"sourcesContent":["import { LRUCache } from \"lru-cache\";\nimport type {\n\tListOptions,\n\tListResult,\n\tObjectStat,\n\tObjectStore,\n} from \"./types.js\";\n\nexport interface CacheOptions {\n\t/** Maximum bytes of object data held in memory. Default 50 MiB. */\n\tmaxBytes?: number;\n\t/**\n\t * Largest single entry admitted to the cache. Defaults to a tenth of\n\t * `maxBytes` so one huge packfile cannot evict the whole working set.\n\t */\n\tmaxEntryBytes?: number;\n\t/** Entry time-to-live in milliseconds. Default 60 000. */\n\tttlMs?: number;\n\t/**\n\t * Override the TTL for a specific key (get/head) or list prefix (list),\n\t * in milliseconds. Return `undefined` to fall back to `ttlMs`. Git refs\n\t * (`refs/heads/<branch>`, `HEAD`) are mutable — the same key's value\n\t * changes on every push — unlike content-addressed object keys, which\n\t * never change for a given key and are safe to cache for the full\n\t * `ttlMs`. Without this, a long `ttlMs` tuned for objects also caches\n\t * ref reads that long, so a warm process can keep serving a\n\t * pre-push ref value for the rest of that TTL even though nothing\n\t * changed *this* process's own cache (see `invalidate`) — it just never\n\t * knew to. Give ref-like keys a short override (a few seconds) instead:\n\t * a ref read is one small object, so re-reading it far more often than\n\t * `ttlMs` is cheap, and every read downstream of a fresh ref (tree,\n\t * commit, blob — all keyed by the sha it resolves to) still gets the\n\t * full-length cache/coalescing benefit.\n\t */\n\tttlForKey?: (key: string) => number | undefined;\n\t/**\n\t * Also cache \"key does not exist\" results. Loose-object probes on packed\n\t * repositories are almost always misses, so this saves many round trips —\n\t * but only enable it when a single process is the only writer, otherwise\n\t * another instance's push can be masked for up to `ttlMs`.\n\t */\n\tcacheMisses?: boolean;\n\t/**\n\t * Also cache `list()` results (directory listings and `limit: 1`\n\t * existence probes). Writes through this store keep cached listings\n\t * consistent; after writing to the backend by any other means, call\n\t * `invalidate()` with the affected prefix. Default false.\n\t */\n\tcacheLists?: boolean;\n\t/**\n\t * Collapse concurrent `get`/`head`/`list` calls for the same key into a\n\t * single backend request. Default true.\n\t */\n\tcoalesce?: boolean;\n\t/**\n\t * Return defensive copies from `get` (and copy on admit), so a caller\n\t * mutating returned bytes can't corrupt the cache. Default true. Set\n\t * false when no reader mutates results (isomorphic-git doesn't): every\n\t * hit otherwise copies the whole entry, which for packfiles is megabytes\n\t * per read.\n\t */\n\tcopy?: boolean;\n\t/** Called when a read is answered from cache. */\n\tonHit?: (key: string) => void;\n\t/** Called when a read has to go to the backing store. */\n\tonMiss?: (key: string) => void;\n}\n\n/** An {@link ObjectStore} wrapper that also supports explicit invalidation. */\nexport interface CachedObjectStore extends ObjectStore {\n\t/**\n\t * Drop every cached entry — contents, misses, and listings — whose key\n\t * falls under `prefix` (exact keys included). Call this after the backing\n\t * store was modified by something other than this wrapper.\n\t */\n\tinvalidate(prefix: string): void;\n}\n\nconst MISS = Symbol(\"miss\");\ntype CacheEntry = Uint8Array | typeof MISS;\n\ninterface ListEntry {\n\tresult: ListResult;\n\t/** The raw list prefix this entry describes. */\n\tprefix: string;\n\t/** True for `limit: 1` existence probes. */\n\tprobe: boolean;\n\t/** True when the listing came back with no objects or prefixes. */\n\tempty: boolean;\n}\n\nfunction listEntrySize(entry: ListEntry): number {\n\tlet size = entry.prefix.length + 16;\n\tfor (const o of entry.result.objects) size += o.key.length + 8;\n\tfor (const p of entry.result.prefixes) size += p.length;\n\treturn size;\n}\n\nfunction copyListResult(result: ListResult): ListResult {\n\treturn {\n\t\tobjects: result.objects.map((o) => ({ ...o })),\n\t\tprefixes: [...result.prefixes],\n\t};\n}\n\n/**\n * Wrap an {@link ObjectStore} with an in-process LRU read cache.\n *\n * Git object keys are content-addressed and therefore immutable, which makes\n * them ideal cache entries; mutable keys (refs, packed-refs) are bounded by\n * `ttlMs`. Writes and deletes through this wrapper invalidate their key and\n * any cached listings they affect — with one asymmetry: a non-empty `limit: 1`\n * probe (a \"directory exists\" answer) survives writes underneath it, because\n * adding a key below a prefix cannot make that prefix stop existing, while\n * empty probes and full listings are always dropped.\n */\nexport function createCachedStore(\n\tstore: ObjectStore,\n\toptions: CacheOptions = {},\n): CachedObjectStore {\n\tconst maxBytes = options.maxBytes ?? 50 * 1024 * 1024;\n\tconst maxEntryBytes = options.maxEntryBytes ?? Math.ceil(maxBytes / 10);\n\tconst ttl = options.ttlMs ?? 60_000;\n\tconst ttlForKey = options.ttlForKey;\n\tconst cacheMisses = options.cacheMisses ?? false;\n\tconst cacheLists = options.cacheLists ?? false;\n\tconst range = store.getRange?.bind(store);\n\tconst coalesce = options.coalesce ?? true;\n\tconst copy = options.copy ?? true;\n\tconst clone = (data: Uint8Array) => (copy ? data.slice() : data);\n\tconst onHit = options.onHit;\n\tconst onMiss = options.onMiss;\n\n\tconst cache = new LRUCache<string, CacheEntry>({\n\t\tmaxSize: maxBytes,\n\t\tsizeCalculation: (value) => (value === MISS ? 1 : value.byteLength || 1),\n\t\tttl,\n\t});\n\tconst listCache = new LRUCache<string, ListEntry>({\n\t\tmaxSize: Math.max(1, Math.ceil(maxBytes / 10)),\n\t\tsizeCalculation: listEntrySize,\n\t\tttl,\n\t});\n\n\tconst pendingGets = new Map<string, Promise<Uint8Array | null>>();\n\tconst pendingHeads = new Map<string, Promise<ObjectStat | null>>();\n\tconst pendingLists = new Map<string, Promise<ListResult>>();\n\n\t/**\n\t * Bumped by every write, delete and invalidation. A backend read that\n\t * started before one of those may finish after it carrying the old answer\n\t * (the old bytes, or \"missing\" for a key that now exists); it still\n\t * answers its own callers, but only a read that saw no write in between\n\t * may populate the cache — otherwise a stale miss could hide a freshly\n\t * written object for the whole TTL.\n\t */\n\tlet generation = 0;\n\tconst unchangedSince = (start: number) => generation === start;\n\n\tconst admit = (key: string, data: Uint8Array) => {\n\t\tif (data.byteLength <= maxEntryBytes) {\n\t\t\tcache.set(key, clone(data), { ttl: ttlForKey?.(key) });\n\t\t}\n\t};\n\n\t/** Drop list entries a write/delete at `key` may have made stale. */\n\tfunction clearStaleListEntries(key: string): void {\n\t\tfor (const [listKey, entry] of listCache.entries()) {\n\t\t\tif (!key.startsWith(entry.prefix)) continue;\n\t\t\tif (entry.probe && !entry.empty) continue;\n\t\t\tlistCache.delete(listKey);\n\t\t}\n\t\t// Readers arriving after this write must not join a listing that\n\t\t// started before it.\n\t\tfor (const listKey of pendingLists.keys()) {\n\t\t\tconst prefix = listKey.split(\"|\").slice(2).join(\"|\");\n\t\t\tif (key.startsWith(prefix)) pendingLists.delete(listKey);\n\t\t}\n\t}\n\n\t/** A write to `key` happened: no in-flight read of it may be joined or cached. */\n\tfunction noteWrite(key: string): void {\n\t\tgeneration++;\n\t\tpendingGets.delete(key);\n\t\tpendingHeads.delete(key);\n\t}\n\n\tfunction coalesced<T>(\n\t\tpending: Map<string, Promise<T>>,\n\t\tkey: string,\n\t\tfn: () => Promise<T>,\n\t): Promise<T> {\n\t\tif (!coalesce) return fn();\n\t\tconst inflight = pending.get(key);\n\t\tif (inflight !== undefined) return inflight;\n\t\tconst p = fn().finally(() => {\n\t\t\tif (pending.get(key) === p) pending.delete(key);\n\t\t});\n\t\tpending.set(key, p);\n\t\treturn p;\n\t}\n\n\treturn {\n\t\tasync get(key: string): Promise<Uint8Array | null> {\n\t\t\tconst cached = cache.get(key);\n\t\t\tif (cached !== undefined) {\n\t\t\t\tonHit?.(key);\n\t\t\t\treturn cached === MISS ? null : clone(cached);\n\t\t\t}\n\t\t\tconst data = await coalesced(pendingGets, key, async () => {\n\t\t\t\tonMiss?.(key);\n\t\t\t\tconst start = generation;\n\t\t\t\tconst fetched = await store.get(key);\n\t\t\t\tif (unchangedSince(start)) {\n\t\t\t\t\tif (fetched !== null) {\n\t\t\t\t\t\tadmit(key, fetched);\n\t\t\t\t\t} else if (cacheMisses) {\n\t\t\t\t\t\tcache.set(key, MISS, { ttl: ttlForKey?.(key) });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn fetched;\n\t\t\t});\n\t\t\treturn data === null ? null : clone(data);\n\t\t},\n\n\t\tasync put(key: string, data: Uint8Array): Promise<void> {\n\t\t\tnoteWrite(key);\n\t\t\ttry {\n\t\t\t\tawait store.put(key, data);\n\t\t\t} finally {\n\t\t\t\t// Even a failed put may have landed; never keep serving the\n\t\t\t\t// pre-write answer for this key.\n\t\t\t\tnoteWrite(key);\n\t\t\t\tcache.delete(key);\n\t\t\t\tclearStaleListEntries(key);\n\t\t\t}\n\t\t\tadmit(key, data);\n\t\t},\n\n\t\tasync delete(key: string): Promise<void> {\n\t\t\tnoteWrite(key);\n\t\t\ttry {\n\t\t\t\tawait store.delete(key);\n\t\t\t} finally {\n\t\t\t\tnoteWrite(key);\n\t\t\t\tcache.delete(key);\n\t\t\t\tclearStaleListEntries(key);\n\t\t\t}\n\t\t\tif (cacheMisses) {\n\t\t\t\tcache.set(key, MISS, { ttl: ttlForKey?.(key) });\n\t\t\t} else {\n\t\t\t\tcache.delete(key);\n\t\t\t}\n\t\t},\n\n\t\tasync head(key: string): Promise<ObjectStat | null> {\n\t\t\tconst cached = cache.get(key);\n\t\t\tif (cached !== undefined) {\n\t\t\t\tonHit?.(key);\n\t\t\t\treturn cached === MISS ? null : { size: cached.byteLength };\n\t\t\t}\n\t\t\treturn coalesced(pendingHeads, key, async () => {\n\t\t\t\tonMiss?.(key);\n\t\t\t\tconst start = generation;\n\t\t\t\tconst stat = await store.head(key);\n\t\t\t\tif (stat === null && cacheMisses && unchangedSince(start)) {\n\t\t\t\t\tcache.set(key, MISS, { ttl: ttlForKey?.(key) });\n\t\t\t\t}\n\t\t\t\treturn stat;\n\t\t\t});\n\t\t},\n\n\t\tasync list(prefix: string, listOptions?: ListOptions): Promise<ListResult> {\n\t\t\tif (!cacheLists) return store.list(prefix, listOptions);\n\t\t\tconst listKey = `${listOptions?.delimiter ?? \"\"}|${listOptions?.limit ?? \"\"}|${prefix}`;\n\t\t\tconst cached = listCache.get(listKey);\n\t\t\tif (cached !== undefined) {\n\t\t\t\tonHit?.(prefix);\n\t\t\t\treturn copyListResult(cached.result);\n\t\t\t}\n\t\t\tconst result = await coalesced(pendingLists, listKey, async () => {\n\t\t\t\tonMiss?.(prefix);\n\t\t\t\tconst start = generation;\n\t\t\t\tconst fetched = await store.list(prefix, listOptions);\n\t\t\t\tif (!unchangedSince(start)) return fetched;\n\t\t\t\tlistCache.set(\n\t\t\t\t\tlistKey,\n\t\t\t\t\t{\n\t\t\t\t\t\tresult: copyListResult(fetched),\n\t\t\t\t\t\tprefix,\n\t\t\t\t\t\tprobe: listOptions?.limit === 1,\n\t\t\t\t\t\tempty:\n\t\t\t\t\t\t\tfetched.objects.length === 0 && fetched.prefixes.length === 0,\n\t\t\t\t\t},\n\t\t\t\t\t{ ttl: ttlForKey?.(prefix) },\n\t\t\t\t);\n\t\t\t\treturn fetched;\n\t\t\t});\n\t\t\treturn copyListResult(result);\n\t\t},\n\n\t\t// Forwarded straight to the backing store: a range read is a handful of\n\t\t// bytes at a known offset, so caching one buys nothing, and bypassing the\n\t\t// cache here keeps this wrapper's read paths unchanged.\n\t\t...(range\n\t\t\t? {\n\t\t\t\t\tgetRange: (key: string, start: number, end: number) =>\n\t\t\t\t\t\trange(key, start, end),\n\t\t\t\t}\n\t\t\t: {}),\n\n\t\tinvalidate(prefix: string): void {\n\t\t\tgeneration++;\n\t\t\tfor (const key of [...pendingGets.keys()]) {\n\t\t\t\tif (key.startsWith(prefix)) pendingGets.delete(key);\n\t\t\t}\n\t\t\tfor (const key of [...pendingHeads.keys()]) {\n\t\t\t\tif (key.startsWith(prefix)) pendingHeads.delete(key);\n\t\t\t}\n\t\t\tpendingLists.clear();\n\t\t\tfor (const key of cache.keys()) {\n\t\t\t\tif (key.startsWith(prefix)) cache.delete(key);\n\t\t\t}\n\t\t\tfor (const [listKey, entry] of listCache.entries()) {\n\t\t\t\tif (\n\t\t\t\t\tentry.prefix.startsWith(prefix) ||\n\t\t\t\t\tprefix.startsWith(entry.prefix)\n\t\t\t\t) {\n\t\t\t\t\tlistCache.delete(listKey);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n}\n","/**\n * Node-style filesystem error carrying a `code` property, which is what\n * isomorphic-git inspects to distinguish \"file not found\" from real failures.\n */\nexport class FsError extends Error {\n\treadonly code: string;\n\treadonly syscall: string;\n\treadonly path: string;\n\n\tconstructor(code: string, syscall: string, path: string) {\n\t\tsuper(`${code}: ${syscall} '${path}'`);\n\t\tthis.name = \"FsError\";\n\t\tthis.code = code;\n\t\tthis.syscall = syscall;\n\t\tthis.path = path;\n\t}\n}\n\nexport const enoent = (syscall: string, path: string) =>\n\tnew FsError(\"ENOENT\", syscall, path);\n\nexport const enotdir = (syscall: string, path: string) =>\n\tnew FsError(\"ENOTDIR\", syscall, path);\n\nexport const enotempty = (syscall: string, path: string) =>\n\tnew FsError(\"ENOTEMPTY\", syscall, path);\n\nexport const einval = (syscall: string, path: string) =>\n\tnew FsError(\"EINVAL\", syscall, path);\n\nexport const eperm = (syscall: string, path: string) =>\n\tnew FsError(\"EPERM\", syscall, path);\n","import { LRUCache } from \"lru-cache\";\nimport { enoent, enotdir, enotempty, eperm } from \"./errors.js\";\nimport { parseLooseObjectPath } from \"./git-layout.js\";\nimport { parsePackDirectory, READABLE_PACK_FILE_KINDS } from \"./pack-files.js\";\nimport { normalizePath, toKey as toKeyWithPrefix } from \"./path.js\";\nimport type {\n\tEncoding,\n\tGitdirFacts,\n\tGitFsClient,\n\tGitFsOptions,\n\tObjectStore,\n\tReadFileOptions,\n\tStat,\n\tWriteFileOptions,\n} from \"./types.js\";\n\nconst FILE_MODE = 0o100644;\nconst DIR_MODE = 0o40000;\n\nconst textEncoder = new TextEncoder();\nconst textDecoder = new TextDecoder();\n\nfunction makeStat(type: \"file\" | \"dir\", size: number): Stat {\n\tconst epoch = new Date(0);\n\treturn {\n\t\ttype,\n\t\tmode: type === \"file\" ? FILE_MODE : DIR_MODE,\n\t\tsize,\n\t\tino: 0,\n\t\tmtimeMs: 0,\n\t\tctimeMs: 0,\n\t\tuid: 0,\n\t\tgid: 0,\n\t\tdev: 0,\n\t\tmtime: epoch,\n\t\tctime: epoch,\n\t\tisFile: () => type === \"file\",\n\t\tisDirectory: () => type === \"dir\",\n\t\tisSymbolicLink: () => false,\n\t};\n}\n\nfunction resolveEncoding(\n\toptions?: ReadFileOptions | WriteFileOptions | Encoding,\n): Encoding | undefined {\n\tif (typeof options === \"string\") return options;\n\treturn options?.encoding;\n}\n\n/**\n * The filesystem returned by {@link createGitFs}: the isomorphic-git client\n * plus git-aware maintenance hooks.\n */\nexport interface GitFs extends GitFsClient {\n\t/**\n\t * Return every file below a directory in one object-store listing. Unlike\n\t * `readdir`, this deliberately does not use a delimiter: object storage can\n\t * enumerate a ref namespace recursively without the stat-per-entry walk a\n\t * POSIX filesystem needs to distinguish files from implicit directories.\n\t * Paths are relative to `dirpath` and never include directory entries.\n\t */\n\tlistFilesRecursively(dirpath: string): Promise<string[]>;\n\t/**\n\t * Probe, with one bounded list, whether `gitdir` contains any loose\n\t * objects, and remember the answer. This is the only way a loose-object\n\t * hint is ever created; call it before full-history walks (commit logs,\n\t * reachability traversals) so fully packed repositories skip every\n\t * guaranteed-miss loose-object read. A later loose write flips the hint\n\t * back, so it cannot go stale mid-push.\n\t */\n\tdetectLooseObjects(gitdir: string): Promise<void>;\n\t/**\n\t * Warm the cache with every pack file under `gitdir` in parallel (plus\n\t * the loose-object hint) before a sequential history walk. Skipped when\n\t * the pack directory holds more than `maxPacks * 2` entries — warming\n\t * only helps when the cache budget actually fits the packs.\n\t */\n\tprefetchPacks(gitdir: string, options?: { maxPacks?: number }): Promise<void>;\n\t/**\n\t * Clear fs-level state (loose-object hints) under `pathPrefix`, and\n\t * forward to the store's `invalidate` when it has one. Call after the\n\t * backing store was modified by something other than this fs.\n\t */\n\tinvalidate(pathPrefix: string): void;\n\t/**\n\t * Declare that `gitdir` exists, so `stat` answers \"directory\" for it with\n\t * zero store calls. isomorphic-git stats the gitdir on every command\n\t * (`discoverGitdir`); in object storage that is a HEAD that always misses\n\t * plus a listing. Register once the caller has confirmed the repository\n\t * exists by other means (e.g. its database row); `invalidate` forgets it.\n\t */\n\tregisterGitdir(gitdir: string, facts?: GitdirFacts): void;\n}\n\n/**\n * Create a promise-based filesystem client for isomorphic-git backed by an\n * {@link ObjectStore}.\n *\n * Semantics:\n * - Directories are implicit, as in object storage: `mkdir` is a no-op and a\n *   directory \"exists\" whenever at least one key lives under its prefix.\n * - Symbolic links are not supported (`readlink`/`symlink` throw). Bare\n *   repositories never contain them.\n * - Designed for bare, server-side repositories (`git.init({bare: true})`,\n *   plumbing commands, ref updates). Worktree checkouts belong on a real disk.\n */\nexport function createGitFs(\n\tstore: ObjectStore,\n\toptions: GitFsOptions = {},\n): GitFs {\n\tconst prefix = options.prefix ?? \"\";\n\tconst useLooseHints = options.looseObjectHints ?? false;\n\tconst onNote = options.onNote;\n\n\tconst toKey = (path: string): string => toKeyWithPrefix(prefix, path);\n\n\t/**\n\t * Per-gitdir \"does any loose object exist\" hint. Entries are only created\n\t * by {@link GitFs.detectLooseObjects}, so a pathological ref that merely\n\t * looks like a loose object (`refs/heads/objects/aa/…`) derives a scope\n\t * that was never registered and can never be wrongly short-circuited.\n\t */\n\tconst looseHints = new LRUCache<string, \"none\" | \"present\">({\n\t\tmax: 1024,\n\t\tttl: options.hintTtlMs ?? 3_600_000,\n\t});\n\n\t/** Gitdirs the caller vouched for via {@link GitFs.registerGitdir}. */\n\tconst registeredGitdirs = new LRUCache<string, ReadonlySet<string>>({\n\t\tmax: 4096,\n\t});\n\n\t/** Whether `path` is a top-level file its registered gitdir lacks. */\n\tfunction registeredAbsent(path: string): boolean {\n\t\tconst slash = path.lastIndexOf(\"/\");\n\t\tif (slash < 0) return false;\n\t\tconst absent = registeredGitdirs.get(path.slice(0, slash));\n\t\treturn absent?.has(path.slice(slash + 1)) ?? false;\n\t}\n\n\t/** The gitdir scope of a loose-object path, or null when it isn't one. */\n\tfunction looseScope(path: string): string | null {\n\t\treturn parseLooseObjectPath(path)?.gitdir ?? null;\n\t}\n\n\tconst pendingDetections = new Map<string, Promise<void>>();\n\n\t/**\n\t * Resolve the loose-object hint for `path`'s gitdir before answering, so a\n\t * read that runs before any explicit `detectLooseObjects` call (e.g. the\n\t * first commit read of a request) doesn't pay a doomed GET. One coalesced\n\t * listing per gitdir, cached for `hintTtlMs`.\n\t */\n\tasync function knownAbsent(path: string): Promise<boolean> {\n\t\tif (registeredAbsent(path)) return true;\n\t\tif (!useLooseHints) return false;\n\t\tconst scope = looseScope(path);\n\t\tif (scope === null) return false;\n\t\tif (!looseHints.has(scope)) {\n\t\t\tlet pending = pendingDetections.get(scope);\n\t\t\tif (!pending) {\n\t\t\t\tpending = detectLooseObjects(scope).finally(() =>\n\t\t\t\t\tpendingDetections.delete(scope),\n\t\t\t\t);\n\t\t\t\tpendingDetections.set(scope, pending);\n\t\t\t}\n\t\t\tawait pending;\n\t\t}\n\t\treturn looseHints.get(scope) === \"none\";\n\t}\n\n\tasync function isDirectory(dirKey: string): Promise<boolean> {\n\t\tconst { objects, prefixes } = await store.list(`${dirKey}/`, {\n\t\t\tlimit: 1,\n\t\t});\n\t\treturn objects.length > 0 || prefixes.length > 0;\n\t}\n\n\tasync function stat(filepath: string, syscall: string): Promise<Stat> {\n\t\tconst path = normalizePath(filepath);\n\t\tif (await knownAbsent(path)) throw enoent(syscall, filepath);\n\t\tconst k = toKey(path);\n\t\tif (k === prefix || k === \"\" || registeredGitdirs.has(path)) {\n\t\t\treturn makeStat(\"dir\", 0);\n\t\t}\n\t\tconst fileStat = await store.head(k);\n\t\tif (fileStat) return makeStat(\"file\", fileStat.size);\n\t\t// A loose-object path is always a leaf; when the object itself is\n\t\t// absent there is no point probing for a directory of the same name.\n\t\tif (useLooseHints && looseScope(path) !== null) {\n\t\t\tthrow enoent(syscall, filepath);\n\t\t}\n\t\tif (await isDirectory(k)) return makeStat(\"dir\", 0);\n\t\tthrow enoent(syscall, filepath);\n\t}\n\n\tconst range = store.getRange?.bind(store);\n\n\tconst promises: GitFsClient[\"promises\"] = {\n\t\t// Only defined when the backing store supports ranges, so a caller can\n\t\t// test for it rather than have to interpret a failure.\n\t\t...(range\n\t\t\t? {\n\t\t\t\t\tgetRange: (filepath: string, start: number, end: number) =>\n\t\t\t\t\t\trange(toKey(normalizePath(filepath)), start, end),\n\t\t\t\t}\n\t\t\t: {}),\n\n\t\tasync readFile(filepath, opts) {\n\t\t\tconst path = normalizePath(filepath);\n\t\t\tif (await knownAbsent(path)) throw enoent(\"open\", filepath);\n\t\t\tconst data = await store.get(toKey(path));\n\t\t\tif (data === null) throw enoent(\"open\", filepath);\n\t\t\treturn resolveEncoding(opts) === \"utf8\" ? textDecoder.decode(data) : data;\n\t\t},\n\n\t\tasync writeFile(filepath, data, _opts) {\n\t\t\tconst path = normalizePath(filepath);\n\t\t\tif (useLooseHints) {\n\t\t\t\tconst scope = looseScope(path);\n\t\t\t\t// Flip before the write lands so a racing read can never\n\t\t\t\t// short-circuit an object that is in the middle of arriving.\n\t\t\t\tif (scope !== null) looseHints.set(scope, \"present\");\n\t\t\t}\n\t\t\tconst bytes = typeof data === \"string\" ? textEncoder.encode(data) : data;\n\t\t\tawait store.put(toKey(path), bytes);\n\t\t},\n\n\t\tasync unlink(filepath) {\n\t\t\tconst k = toKey(normalizePath(filepath));\n\t\t\tif ((await store.head(k)) === null) throw enoent(\"unlink\", filepath);\n\t\t\tawait store.delete(k);\n\t\t},\n\n\t\tasync readdir(dirpath) {\n\t\t\tconst k = toKey(normalizePath(dirpath));\n\t\t\tconst isRoot = k === prefix || k === \"\";\n\t\t\tconst listPrefix = isRoot && k === \"\" ? \"\" : `${k}/`;\n\t\t\tconst { objects, prefixes } = await store.list(listPrefix, {\n\t\t\t\tdelimiter: \"/\",\n\t\t\t});\n\t\t\tif (objects.length === 0 && prefixes.length === 0) {\n\t\t\t\tif (!isRoot && (await store.head(k)) !== null) {\n\t\t\t\t\tthrow enotdir(\"scandir\", dirpath);\n\t\t\t\t}\n\t\t\t\tif (!isRoot) throw enoent(\"scandir\", dirpath);\n\t\t\t}\n\t\t\tconst names = objects.map((o) => o.key.slice(listPrefix.length));\n\t\t\tconst dirNames = prefixes.map((p) =>\n\t\t\t\tp.slice(listPrefix.length).replace(/\\/$/, \"\"),\n\t\t\t);\n\t\t\treturn [...names, ...dirNames].sort();\n\t\t},\n\n\t\tasync mkdir(_dirpath, _opts) {\n\t\t\t// Directories are implicit in object storage.\n\t\t},\n\n\t\tasync rmdir(dirpath) {\n\t\t\tconst k = toKey(normalizePath(dirpath));\n\t\t\tconst { objects, prefixes } = await store.list(`${k}/`, { limit: 1 });\n\t\t\tif (objects.length > 0 || prefixes.length > 0) {\n\t\t\t\tthrow enotempty(\"rmdir\", dirpath);\n\t\t\t}\n\t\t\t// Empty implicit directories don't exist; nothing to remove.\n\t\t},\n\n\t\tstat: (filepath) => stat(filepath, \"stat\"),\n\t\tlstat: (filepath) => stat(filepath, \"lstat\"),\n\n\t\tasync readlink(filepath): Promise<never> {\n\t\t\tthrow enoent(\"readlink\", filepath);\n\t\t},\n\n\t\tasync symlink(_target, filepath): Promise<never> {\n\t\t\tthrow eperm(\"symlink\", filepath);\n\t\t},\n\n\t\tasync chmod(_filepath, _mode) {\n\t\t\t// POSIX modes don't exist in object storage.\n\t\t},\n\t};\n\n\tasync function detectLooseObjects(gitdir: string): Promise<void> {\n\t\tif (!useLooseHints) return;\n\t\tconst scope = normalizePath(gitdir);\n\t\t// A live hint must win over re-detection: after a loose write flips it\n\t\t// to \"present\", re-deriving from a (possibly cached, pre-write) listing\n\t\t// could wrongly reinstate \"none\" and mask real objects.\n\t\tif (looseHints.has(scope)) return;\n\t\ttry {\n\t\t\tconst { objects } = await store.list(`${toKey(scope)}/objects/`, {\n\t\t\t\tlimit: 1,\n\t\t\t});\n\t\t\t// Loose fan-out directories (two hex digits) sort before \"info/\"\n\t\t\t// and \"pack/\", so when any loose object exists it is the first key.\n\t\t\tconst first = objects[0]?.key;\n\t\t\tconst hint =\n\t\t\t\tfirst !== undefined && parseLooseObjectPath(first) !== null\n\t\t\t\t\t? \"present\"\n\t\t\t\t\t: \"none\";\n\t\t\tlooseHints.set(scope, hint);\n\t\t\tonNote?.(`loose objects ${hint} under ${scope}`);\n\t\t} catch {\n\t\t\t// Leave unknown — reads fall back to their normal round trip.\n\t\t}\n\t}\n\n\tasync function prefetchPacks(\n\t\tgitdir: string,\n\t\tprefetchOptions?: { maxPacks?: number },\n\t): Promise<void> {\n\t\tconst maxPacks = prefetchOptions?.maxPacks ?? 30;\n\t\tconst packDir = `${normalizePath(gitdir)}/objects/pack`;\n\t\t// isomorphic-git never reads .bitmap/.rev/.keep, so fetching them is a\n\t\t// wasted GET and wasted cache space.\n\t\tconst entries = parsePackDirectory(\n\t\t\tawait promises.readdir(packDir).catch(() => []),\n\t\t)\n\t\t\t.filter((file) => READABLE_PACK_FILE_KINDS.has(file.kind))\n\t\t\t.map((file) => file.name);\n\t\tif (entries.length > maxPacks * 2) {\n\t\t\tawait detectLooseObjects(gitdir);\n\t\t\treturn;\n\t\t}\n\t\tawait Promise.all([\n\t\t\tdetectLooseObjects(gitdir),\n\t\t\t...entries.map((name) =>\n\t\t\t\tpromises.readFile(`${packDir}/${name}`).catch(() => undefined),\n\t\t\t),\n\t\t]);\n\t}\n\n\tasync function listFilesRecursively(dirpath: string): Promise<string[]> {\n\t\tconst directory = toKey(normalizePath(dirpath));\n\t\tconst listPrefix = directory === \"\" ? \"\" : `${directory}/`;\n\t\tconst { objects } = await store.list(listPrefix);\n\t\treturn objects\n\t\t\t.map((object) => object.key.slice(listPrefix.length))\n\t\t\t.filter((path) => path.length > 0)\n\t\t\t.sort();\n\t}\n\n\tfunction registerGitdir(gitdir: string, facts?: GitdirFacts): void {\n\t\tregisteredGitdirs.set(\n\t\t\tnormalizePath(gitdir),\n\t\t\tnew Set(facts?.absentFiles ?? []),\n\t\t);\n\t}\n\n\tfunction invalidate(pathPrefix: string): void {\n\t\tconst normalized = normalizePath(pathPrefix);\n\t\tfor (const dir of registeredGitdirs.keys()) {\n\t\t\tif (dir.startsWith(normalized)) registeredGitdirs.delete(dir);\n\t\t}\n\t\tfor (const scope of looseHints.keys()) {\n\t\t\tif (scope.startsWith(normalized)) looseHints.delete(scope);\n\t\t}\n\t\tconst maybe = store as ObjectStore & {\n\t\t\tinvalidate?: (prefix: string) => void;\n\t\t};\n\t\tmaybe.invalidate?.(toKey(normalized));\n\t}\n\n\treturn {\n\t\tpromises,\n\t\tlistFilesRecursively,\n\t\tdetectLooseObjects,\n\t\tprefetchPacks,\n\t\tinvalidate,\n\t\tregisterGitdir,\n\t};\n}\n","import { einval } from \"./errors.js\";\n\n/**\n * Normalize an absolute-or-relative filesystem path into a storage key\n * segment: no leading/trailing slashes, `.` segments dropped, `..` resolved.\n * A `..` that would escape the root throws EINVAL — paths handed to the fs\n * must never address keys outside the configured prefix.\n */\nexport function normalizePath(filepath: string): string {\n\tconst segments = filepath.split(\"/\");\n\tconst out: string[] = [];\n\tfor (const segment of segments) {\n\t\tif (segment === \"\" || segment === \".\") continue;\n\t\tif (segment === \"..\") {\n\t\t\tif (out.length === 0) throw einval(\"resolve\", filepath);\n\t\t\tout.pop();\n\t\t\tcontinue;\n\t\t}\n\t\tout.push(segment);\n\t}\n\treturn out.join(\"/\");\n}\n\n/** Join a configured key prefix with a normalized path. */\nexport function toKey(prefix: string, filepath: string): string {\n\tconst normalized = normalizePath(filepath);\n\tif (prefix === \"\") return normalized;\n\treturn normalized === \"\" ? prefix : `${prefix}/${normalized}`;\n}\n","import type { ObjectStore } from \"./types.js\";\n\n/** Options accepted by {@link createRetryStore}. */\nexport interface RetryOptions {\n\t/** Retries after the first attempt (total attempts = retries + 1). Default 3. */\n\tretries?: number;\n\t/** Backoff base delay in milliseconds, doubled each attempt. Default 100. */\n\tinitialDelayMs?: number;\n\t/** Upper bound for the backoff base delay. Default 5000. */\n\tmaxDelayMs?: number;\n\t/** Random jitter added to each delay, as a fraction of it. Default 0.3. */\n\tjitter?: number;\n\t/**\n\t * Decide whether an error is worth retrying. The store contract maps\n\t * \"not found\" to `null` rather than throwing, so any thrown error is a\n\t * genuine failure; the default retries network faults, throttling, and\n\t * HTTP 5xx responses.\n\t */\n\tisRetryable?: (error: unknown) => boolean;\n\t/**\n\t * Circuit breaker configuration, or `false` to disable. After `threshold`\n\t * consecutive failures the store fails fast for `resetMs`, then lets one\n\t * request probe the backend again. Defaults: 5 failures, 30 000 ms.\n\t */\n\tbreaker?: false | { threshold?: number; resetMs?: number };\n\t/** Called before each retry sleep; useful for logging/metrics. */\n\tonRetry?: (info: {\n\t\tkey: string;\n\t\top: string;\n\t\tattempt: number;\n\t\tdelayMs: number;\n\t}) => void;\n}\n\n/**\n * Thrown instead of calling the backend while the circuit breaker is open.\n * Carries `code: \"EUNAVAILABLE\"` so callers can map it to a 503.\n */\nexport class CircuitOpenError extends Error {\n\treadonly code = \"EUNAVAILABLE\";\n\n\tconstructor() {\n\t\tsuper(\"Circuit breaker is open, object store unavailable\");\n\t\tthis.name = \"CircuitOpenError\";\n\t}\n}\n\nconst RETRYABLE_NAMES = new Set([\n\t\"TimeoutError\",\n\t\"RequestTimeout\",\n\t\"RequestTimeoutException\",\n\t\"SlowDown\",\n\t\"ThrottlingException\",\n\t\"TooManyRequestsException\",\n]);\n\nconst RETRYABLE_CODES = new Set([\n\t\"ECONNRESET\",\n\t\"ECONNREFUSED\",\n\t\"EPIPE\",\n\t\"ETIMEDOUT\",\n\t\"ENOTFOUND\",\n\t\"EAI_AGAIN\",\n\t\"EPROTO\",\n]);\n\nfunction defaultIsRetryable(error: unknown): boolean {\n\tif (typeof error !== \"object\" || error === null) return false;\n\tconst err = error as {\n\t\tname?: string;\n\t\tcode?: string;\n\t\t$metadata?: { httpStatusCode?: number };\n\t};\n\tif (err.name !== undefined && RETRYABLE_NAMES.has(err.name)) return true;\n\tif (err.code !== undefined && RETRYABLE_CODES.has(err.code)) return true;\n\tconst status = err.$metadata?.httpStatusCode;\n\treturn status !== undefined && (status >= 500 || status === 429);\n}\n\nconst sleep = (ms: number) => new Promise((resolve) => setTimeout(resolve, ms));\n\n/**\n * Wrap an {@link ObjectStore} with retries (exponential backoff + jitter) and\n * an optional per-instance circuit breaker.\n *\n * Place this decorator closest to the network store, underneath any cache:\n * the cache then never stores transient failures, and callers coalesced onto\n * one request share a single retried attempt.\n */\nexport function createRetryStore(\n\tstore: ObjectStore,\n\toptions: RetryOptions = {},\n): ObjectStore {\n\tconst retries = options.retries ?? 3;\n\tconst initialDelayMs = options.initialDelayMs ?? 100;\n\tconst maxDelayMs = options.maxDelayMs ?? 5000;\n\tconst jitter = options.jitter ?? 0.3;\n\tconst isRetryable = options.isRetryable ?? defaultIsRetryable;\n\tconst breaker =\n\t\toptions.breaker === false\n\t\t\t? null\n\t\t\t: {\n\t\t\t\t\tthreshold: options.breaker?.threshold ?? 5,\n\t\t\t\t\tresetMs: options.breaker?.resetMs ?? 30_000,\n\t\t\t\t};\n\n\tlet failures = 0;\n\tlet lastFailureAt = 0;\n\tlet state: \"closed\" | \"open\" | \"half-open\" = \"closed\";\n\tlet probing = false;\n\n\t/**\n\t * Consecutive transient failures open the circuit; any success closes it\n\t * and resets the count. Non-retryable errors (a 403, a malformed request)\n\t * say nothing about the backend's health and never count. Once the reset\n\t * window passes, exactly one request probes the backend (half-open);\n\t * everything else keeps failing fast until that probe settles.\n\t */\n\tasync function guarded<T>(fn: () => Promise<T>): Promise<T> {\n\t\tif (breaker === null) return fn();\n\t\tlet isProbe = false;\n\t\tif (state !== \"closed\") {\n\t\t\tif (\n\t\t\t\tprobing ||\n\t\t\t\t(state === \"open\" && Date.now() - lastFailureAt < breaker.resetMs)\n\t\t\t) {\n\t\t\t\tthrow new CircuitOpenError();\n\t\t\t}\n\t\t\tstate = \"half-open\";\n\t\t\tprobing = true;\n\t\t\tisProbe = true;\n\t\t}\n\t\ttry {\n\t\t\tconst result = await fn();\n\t\t\tfailures = 0;\n\t\t\tstate = \"closed\";\n\t\t\treturn result;\n\t\t} catch (error) {\n\t\t\tif (isRetryable(error)) {\n\t\t\t\tfailures++;\n\t\t\t\tlastFailureAt = Date.now();\n\t\t\t\tif (failures >= breaker.threshold || isProbe) state = \"open\";\n\t\t\t} else if (isProbe) {\n\t\t\t\t// The backend answered; it's up.\n\t\t\t\tfailures = 0;\n\t\t\t\tstate = \"closed\";\n\t\t\t}\n\t\t\tthrow error;\n\t\t} finally {\n\t\t\tif (isProbe) probing = false;\n\t\t}\n\t}\n\n\tasync function run<T>(op: string, key: string, fn: () => Promise<T>) {\n\t\tlet lastError: unknown;\n\t\tfor (let attempt = 0; attempt <= retries; attempt++) {\n\t\t\ttry {\n\t\t\t\treturn await guarded(fn);\n\t\t\t} catch (error) {\n\t\t\t\tlastError = error;\n\t\t\t\tif (error instanceof CircuitOpenError) throw error;\n\t\t\t\tif (!isRetryable(error) || attempt === retries) throw error;\n\t\t\t\tconst base = Math.min(initialDelayMs * 2 ** attempt, maxDelayMs);\n\t\t\t\tconst delayMs = Math.round(base + Math.random() * base * jitter);\n\t\t\t\toptions.onRetry?.({ key, op, attempt: attempt + 1, delayMs });\n\t\t\t\tawait sleep(delayMs);\n\t\t\t}\n\t\t}\n\t\tthrow lastError;\n\t}\n\n\t// Optional methods must be forwarded explicitly: this returns a new object,\n\t// so anything not listed here is dropped — and a dropped `getRange` is\n\t// invisible, because callers that want it report \"unknown\" rather than\n\t// failing. `object-size.test.ts` asserts it survives the whole stack.\n\tconst range = store.getRange?.bind(store);\n\n\treturn {\n\t\tget: (key) => run(\"get\", key, () => store.get(key)),\n\t\tput: (key, data) => run(\"put\", key, () => store.put(key, data)),\n\t\tdelete: (key) => run(\"delete\", key, () => store.delete(key)),\n\t\thead: (key) => run(\"head\", key, () => store.head(key)),\n\t\tlist: (prefix, listOptions) =>\n\t\t\trun(\"list\", prefix, () => store.list(prefix, listOptions)),\n\t\t...(range\n\t\t\t? {\n\t\t\t\t\tgetRange: (key: string, start: number, end: number) =>\n\t\t\t\t\t\trun(\"getRange\", key, () => range(key, start, end)),\n\t\t\t\t}\n\t\t\t: {}),\n\t};\n}\n","import type {\n\tListOptions,\n\tListResult,\n\tObjectStat,\n\tObjectStore,\n} from \"../types.js\";\n\n/**\n * In-memory {@link ObjectStore}. Useful for tests, examples, and ephemeral\n * repositories; also the reference implementation for the list/delimiter\n * semantics other stores must match.\n */\nexport class MemoryObjectStore implements ObjectStore {\n\tprivate readonly objects = new Map<string, Uint8Array>();\n\n\tasync get(key: string): Promise<Uint8Array | null> {\n\t\tconst data = this.objects.get(key);\n\t\treturn data ? data.slice() : null;\n\t}\n\n\tasync getRange(\n\t\tkey: string,\n\t\tstart: number,\n\t\tend: number,\n\t): Promise<Uint8Array | null> {\n\t\tconst data = this.objects.get(key);\n\t\treturn data ? data.slice(start, end + 1) : null;\n\t}\n\n\tasync put(key: string, data: Uint8Array): Promise<void> {\n\t\tthis.objects.set(key, data.slice());\n\t}\n\n\tasync delete(key: string): Promise<void> {\n\t\tthis.objects.delete(key);\n\t}\n\n\tasync head(key: string): Promise<ObjectStat | null> {\n\t\tconst data = this.objects.get(key);\n\t\treturn data ? { size: data.byteLength } : null;\n\t}\n\n\tasync list(prefix: string, options?: ListOptions): Promise<ListResult> {\n\t\tconst delimiter = options?.delimiter;\n\t\tconst limit = options?.limit ?? Number.POSITIVE_INFINITY;\n\t\tconst objects: ListResult[\"objects\"] = [];\n\t\tconst prefixes = new Set<string>();\n\n\t\tfor (const [key, data] of this.objects) {\n\t\t\tif (!key.startsWith(prefix)) continue;\n\t\t\tconst rest = key.slice(prefix.length);\n\t\t\tif (delimiter !== undefined) {\n\t\t\t\tconst idx = rest.indexOf(delimiter);\n\t\t\t\tif (idx !== -1) {\n\t\t\t\t\tprefixes.add(prefix + rest.slice(0, idx + delimiter.length));\n\t\t\t\t} else {\n\t\t\t\t\tobjects.push({ key, size: data.byteLength });\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tobjects.push({ key, size: data.byteLength });\n\t\t\t}\n\t\t\tif (objects.length + prefixes.size >= limit) break;\n\t\t}\n\n\t\treturn { objects, prefixes: [...prefixes] };\n\t}\n\n\t/** Number of stored objects (test convenience, not part of ObjectStore). */\n\tget size(): number {\n\t\treturn this.objects.size;\n\t}\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAS,gBAAgB;AA8EzB,IAAM,OAAO,uBAAO,MAAM;AAa1B,SAAS,cAAc,OAA0B;AAChD,MAAI,OAAO,MAAM,OAAO,SAAS;AACjC,aAAW,KAAK,MAAM,OAAO,QAAS,SAAQ,EAAE,IAAI,SAAS;AAC7D,aAAW,KAAK,MAAM,OAAO,SAAU,SAAQ,EAAE;AACjD,SAAO;AACR;AAEA,SAAS,eAAe,QAAgC;AACvD,SAAO;AAAA,IACN,SAAS,OAAO,QAAQ,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;AAAA,IAC7C,UAAU,CAAC,GAAG,OAAO,QAAQ;AAAA,EAC9B;AACD;AAaO,SAAS,kBACf,OACA,UAAwB,CAAC,GACL;AACpB,QAAM,WAAW,QAAQ,YAAY,KAAK,OAAO;AACjD,QAAM,gBAAgB,QAAQ,iBAAiB,KAAK,KAAK,WAAW,EAAE;AACtE,QAAM,MAAM,QAAQ,SAAS;AAC7B,QAAM,YAAY,QAAQ;AAC1B,QAAM,cAAc,QAAQ,eAAe;AAC3C,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,QAAQ,MAAM,UAAU,KAAK,KAAK;AACxC,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,QAAQ,CAAC,SAAsB,OAAO,KAAK,MAAM,IAAI;AAC3D,QAAM,QAAQ,QAAQ;AACtB,QAAM,SAAS,QAAQ;AAEvB,QAAM,QAAQ,IAAI,SAA6B;AAAA,IAC9C,SAAS;AAAA,IACT,iBAAiB,CAAC,UAAW,UAAU,OAAO,IAAI,MAAM,cAAc;AAAA,IACtE;AAAA,EACD,CAAC;AACD,QAAM,YAAY,IAAI,SAA4B;AAAA,IACjD,SAAS,KAAK,IAAI,GAAG,KAAK,KAAK,WAAW,EAAE,CAAC;AAAA,IAC7C,iBAAiB;AAAA,IACjB;AAAA,EACD,CAAC;AAED,QAAM,cAAc,oBAAI,IAAwC;AAChE,QAAM,eAAe,oBAAI,IAAwC;AACjE,QAAM,eAAe,oBAAI,IAAiC;AAU1D,MAAI,aAAa;AACjB,QAAM,iBAAiB,CAAC,UAAkB,eAAe;AAEzD,QAAM,QAAQ,CAAC,KAAa,SAAqB;AAChD,QAAI,KAAK,cAAc,eAAe;AACrC,YAAM,IAAI,KAAK,MAAM,IAAI,GAAG,EAAE,KAAK,YAAY,GAAG,EAAE,CAAC;AAAA,IACtD;AAAA,EACD;AAGA,WAAS,sBAAsB,KAAmB;AACjD,eAAW,CAAC,SAAS,KAAK,KAAK,UAAU,QAAQ,GAAG;AACnD,UAAI,CAAC,IAAI,WAAW,MAAM,MAAM,EAAG;AACnC,UAAI,MAAM,SAAS,CAAC,MAAM,MAAO;AACjC,gBAAU,OAAO,OAAO;AAAA,IACzB;AAGA,eAAW,WAAW,aAAa,KAAK,GAAG;AAC1C,YAAM,SAAS,QAAQ,MAAM,GAAG,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG;AACnD,UAAI,IAAI,WAAW,MAAM,EAAG,cAAa,OAAO,OAAO;AAAA,IACxD;AAAA,EACD;AAGA,WAAS,UAAU,KAAmB;AACrC;AACA,gBAAY,OAAO,GAAG;AACtB,iBAAa,OAAO,GAAG;AAAA,EACxB;AAEA,WAAS,UACR,SACA,KACA,IACa;AACb,QAAI,CAAC,SAAU,QAAO,GAAG;AACzB,UAAM,WAAW,QAAQ,IAAI,GAAG;AAChC,QAAI,aAAa,OAAW,QAAO;AACnC,UAAM,IAAI,GAAG,EAAE,QAAQ,MAAM;AAC5B,UAAI,QAAQ,IAAI,GAAG,MAAM,EAAG,SAAQ,OAAO,GAAG;AAAA,IAC/C,CAAC;AACD,YAAQ,IAAI,KAAK,CAAC;AAClB,WAAO;AAAA,EACR;AAEA,SAAO;AAAA,IACN,MAAM,IAAI,KAAyC;AAClD,YAAM,SAAS,MAAM,IAAI,GAAG;AAC5B,UAAI,WAAW,QAAW;AACzB,gBAAQ,GAAG;AACX,eAAO,WAAW,OAAO,OAAO,MAAM,MAAM;AAAA,MAC7C;AACA,YAAM,OAAO,MAAM,UAAU,aAAa,KAAK,YAAY;AAC1D,iBAAS,GAAG;AACZ,cAAM,QAAQ;AACd,cAAM,UAAU,MAAM,MAAM,IAAI,GAAG;AACnC,YAAI,eAAe,KAAK,GAAG;AAC1B,cAAI,YAAY,MAAM;AACrB,kBAAM,KAAK,OAAO;AAAA,UACnB,WAAW,aAAa;AACvB,kBAAM,IAAI,KAAK,MAAM,EAAE,KAAK,YAAY,GAAG,EAAE,CAAC;AAAA,UAC/C;AAAA,QACD;AACA,eAAO;AAAA,MACR,CAAC;AACD,aAAO,SAAS,OAAO,OAAO,MAAM,IAAI;AAAA,IACzC;AAAA,IAEA,MAAM,IAAI,KAAa,MAAiC;AACvD,gBAAU,GAAG;AACb,UAAI;AACH,cAAM,MAAM,IAAI,KAAK,IAAI;AAAA,MAC1B,UAAE;AAGD,kBAAU,GAAG;AACb,cAAM,OAAO,GAAG;AAChB,8BAAsB,GAAG;AAAA,MAC1B;AACA,YAAM,KAAK,IAAI;AAAA,IAChB;AAAA,IAEA,MAAM,OAAO,KAA4B;AACxC,gBAAU,GAAG;AACb,UAAI;AACH,cAAM,MAAM,OAAO,GAAG;AAAA,MACvB,UAAE;AACD,kBAAU,GAAG;AACb,cAAM,OAAO,GAAG;AAChB,8BAAsB,GAAG;AAAA,MAC1B;AACA,UAAI,aAAa;AAChB,cAAM,IAAI,KAAK,MAAM,EAAE,KAAK,YAAY,GAAG,EAAE,CAAC;AAAA,MAC/C,OAAO;AACN,cAAM,OAAO,GAAG;AAAA,MACjB;AAAA,IACD;AAAA,IAEA,MAAM,KAAK,KAAyC;AACnD,YAAM,SAAS,MAAM,IAAI,GAAG;AAC5B,UAAI,WAAW,QAAW;AACzB,gBAAQ,GAAG;AACX,eAAO,WAAW,OAAO,OAAO,EAAE,MAAM,OAAO,WAAW;AAAA,MAC3D;AACA,aAAO,UAAU,cAAc,KAAK,YAAY;AAC/C,iBAAS,GAAG;AACZ,cAAM,QAAQ;AACd,cAAM,OAAO,MAAM,MAAM,KAAK,GAAG;AACjC,YAAI,SAAS,QAAQ,eAAe,eAAe,KAAK,GAAG;AAC1D,gBAAM,IAAI,KAAK,MAAM,EAAE,KAAK,YAAY,GAAG,EAAE,CAAC;AAAA,QAC/C;AACA,eAAO;AAAA,MACR,CAAC;AAAA,IACF;AAAA,IAEA,MAAM,KAAK,QAAgB,aAAgD;AAC1E,UAAI,CAAC,WAAY,QAAO,MAAM,KAAK,QAAQ,WAAW;AACtD,YAAM,UAAU,GAAG,aAAa,aAAa,EAAE,IAAI,aAAa,SAAS,EAAE,IAAI,MAAM;AACrF,YAAM,SAAS,UAAU,IAAI,OAAO;AACpC,UAAI,WAAW,QAAW;AACzB,gBAAQ,MAAM;AACd,eAAO,eAAe,OAAO,MAAM;AAAA,MACpC;AACA,YAAM,SAAS,MAAM,UAAU,cAAc,SAAS,YAAY;AACjE,iBAAS,MAAM;AACf,cAAM,QAAQ;AACd,cAAM,UAAU,MAAM,MAAM,KAAK,QAAQ,WAAW;AACpD,YAAI,CAAC,eAAe,KAAK,EAAG,QAAO;AACnC,kBAAU;AAAA,UACT;AAAA,UACA;AAAA,YACC,QAAQ,eAAe,OAAO;AAAA,YAC9B;AAAA,YACA,OAAO,aAAa,UAAU;AAAA,YAC9B,OACC,QAAQ,QAAQ,WAAW,KAAK,QAAQ,SAAS,WAAW;AAAA,UAC9D;AAAA,UACA,EAAE,KAAK,YAAY,MAAM,EAAE;AAAA,QAC5B;AACA,eAAO;AAAA,MACR,CAAC;AACD,aAAO,eAAe,MAAM;AAAA,IAC7B;AAAA;AAAA;AAAA;AAAA,IAKA,GAAI,QACD;AAAA,MACA,UAAU,CAAC,KAAa,OAAe,QACtC,MAAM,KAAK,OAAO,GAAG;AAAA,IACvB,IACC,CAAC;AAAA,IAEJ,WAAW,QAAsB;AAChC;AACA,iBAAW,OAAO,CAAC,GAAG,YAAY,KAAK,CAAC,GAAG;AAC1C,YAAI,IAAI,WAAW,MAAM,EAAG,aAAY,OAAO,GAAG;AAAA,MACnD;AACA,iBAAW,OAAO,CAAC,GAAG,aAAa,KAAK,CAAC,GAAG;AAC3C,YAAI,IAAI,WAAW,MAAM,EAAG,cAAa,OAAO,GAAG;AAAA,MACpD;AACA,mBAAa,MAAM;AACnB,iBAAW,OAAO,MAAM,KAAK,GAAG;AAC/B,YAAI,IAAI,WAAW,MAAM,EAAG,OAAM,OAAO,GAAG;AAAA,MAC7C;AACA,iBAAW,CAAC,SAAS,KAAK,KAAK,UAAU,QAAQ,GAAG;AACnD,YACC,MAAM,OAAO,WAAW,MAAM,KAC9B,OAAO,WAAW,MAAM,MAAM,GAC7B;AACD,oBAAU,OAAO,OAAO;AAAA,QACzB;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACD;;;ACzUO,IAAM,UAAN,cAAsB,MAAM;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,MAAc,SAAiB,MAAc;AACxD,UAAM,GAAG,IAAI,KAAK,OAAO,KAAK,IAAI,GAAG;AACrC,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,UAAU;AACf,SAAK,OAAO;AAAA,EACb;AACD;AAEO,IAAM,SAAS,CAAC,SAAiB,SACvC,IAAI,QAAQ,UAAU,SAAS,IAAI;AAE7B,IAAM,UAAU,CAAC,SAAiB,SACxC,IAAI,QAAQ,WAAW,SAAS,IAAI;AAE9B,IAAM,YAAY,CAAC,SAAiB,SAC1C,IAAI,QAAQ,aAAa,SAAS,IAAI;AAEhC,IAAM,SAAS,CAAC,SAAiB,SACvC,IAAI,QAAQ,UAAU,SAAS,IAAI;AAE7B,IAAM,QAAQ,CAAC,SAAiB,SACtC,IAAI,QAAQ,SAAS,SAAS,IAAI;;;AC/BnC,SAAS,YAAAA,iBAAgB;;;ACQlB,SAAS,cAAc,UAA0B;AACvD,QAAM,WAAW,SAAS,MAAM,GAAG;AACnC,QAAM,MAAgB,CAAC;AACvB,aAAW,WAAW,UAAU;AAC/B,QAAI,YAAY,MAAM,YAAY,IAAK;AACvC,QAAI,YAAY,MAAM;AACrB,UAAI,IAAI,WAAW,EAAG,OAAM,OAAO,WAAW,QAAQ;AACtD,UAAI,IAAI;AACR;AAAA,IACD;AACA,QAAI,KAAK,OAAO;AAAA,EACjB;AACA,SAAO,IAAI,KAAK,GAAG;AACpB;AAGO,SAAS,MAAM,QAAgB,UAA0B;AAC/D,QAAM,aAAa,cAAc,QAAQ;AACzC,MAAI,WAAW,GAAI,QAAO;AAC1B,SAAO,eAAe,KAAK,SAAS,GAAG,MAAM,IAAI,UAAU;AAC5D;;;ADZA,IAAM,YAAY;AAClB,IAAM,WAAW;AAEjB,IAAM,cAAc,IAAI,YAAY;AACpC,IAAM,cAAc,IAAI,YAAY;AAEpC,SAAS,SAAS,MAAsB,MAAoB;AAC3D,QAAM,QAAQ,oBAAI,KAAK,CAAC;AACxB,SAAO;AAAA,IACN;AAAA,IACA,MAAM,SAAS,SAAS,YAAY;AAAA,IACpC;AAAA,IACA,KAAK;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO;AAAA,IACP,OAAO;AAAA,IACP,QAAQ,MAAM,SAAS;AAAA,IACvB,aAAa,MAAM,SAAS;AAAA,IAC5B,gBAAgB,MAAM;AAAA,EACvB;AACD;AAEA,SAAS,gBACR,SACuB;AACvB,MAAI,OAAO,YAAY,SAAU,QAAO;AACxC,SAAO,SAAS;AACjB;AA2DO,SAAS,YACf,OACA,UAAwB,CAAC,GACjB;AACR,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,gBAAgB,QAAQ,oBAAoB;AAClD,QAAM,SAAS,QAAQ;AAEvB,QAAMC,SAAQ,CAAC,SAAyB,MAAgB,QAAQ,IAAI;AAQpE,QAAM,aAAa,IAAIC,UAAqC;AAAA,IAC3D,KAAK;AAAA,IACL,KAAK,QAAQ,aAAa;AAAA,EAC3B,CAAC;AAGD,QAAM,oBAAoB,IAAIA,UAAsC;AAAA,IACnE,KAAK;AAAA,EACN,CAAC;AAGD,WAAS,iBAAiB,MAAuB;AAChD,UAAM,QAAQ,KAAK,YAAY,GAAG;AAClC,QAAI,QAAQ,EAAG,QAAO;AACtB,UAAM,SAAS,kBAAkB,IAAI,KAAK,MAAM,GAAG,KAAK,CAAC;AACzD,WAAO,QAAQ,IAAI,KAAK,MAAM,QAAQ,CAAC,CAAC,KAAK;AAAA,EAC9C;AAGA,WAAS,WAAW,MAA6B;AAChD,WAAO,qBAAqB,IAAI,GAAG,UAAU;AAAA,EAC9C;AAEA,QAAM,oBAAoB,oBAAI,IAA2B;AAQzD,iBAAe,YAAY,MAAgC;AAC1D,QAAI,iBAAiB,IAAI,EAAG,QAAO;AACnC,QAAI,CAAC,cAAe,QAAO;AAC3B,UAAM,QAAQ,WAAW,IAAI;AAC7B,QAAI,UAAU,KAAM,QAAO;AAC3B,QAAI,CAAC,WAAW,IAAI,KAAK,GAAG;AAC3B,UAAI,UAAU,kBAAkB,IAAI,KAAK;AACzC,UAAI,CAAC,SAAS;AACb,kBAAU,mBAAmB,KAAK,EAAE;AAAA,UAAQ,MAC3C,kBAAkB,OAAO,KAAK;AAAA,QAC/B;AACA,0BAAkB,IAAI,OAAO,OAAO;AAAA,MACrC;AACA,YAAM;AAAA,IACP;AACA,WAAO,WAAW,IAAI,KAAK,MAAM;AAAA,EAClC;AAEA,iBAAe,YAAY,QAAkC;AAC5D,UAAM,EAAE,SAAS,SAAS,IAAI,MAAM,MAAM,KAAK,GAAG,MAAM,KAAK;AAAA,MAC5D,OAAO;AAAA,IACR,CAAC;AACD,WAAO,QAAQ,SAAS,KAAK,SAAS,SAAS;AAAA,EAChD;AAEA,iBAAe,KAAK,UAAkB,SAAgC;AACrE,UAAM,OAAO,cAAc,QAAQ;AACnC,QAAI,MAAM,YAAY,IAAI,EAAG,OAAM,OAAO,SAAS,QAAQ;AAC3D,UAAM,IAAID,OAAM,IAAI;AACpB,QAAI,MAAM,UAAU,MAAM,MAAM,kBAAkB,IAAI,IAAI,GAAG;AAC5D,aAAO,SAAS,OAAO,CAAC;AAAA,IACzB;AACA,UAAM,WAAW,MAAM,MAAM,KAAK,CAAC;AACnC,QAAI,SAAU,QAAO,SAAS,QAAQ,SAAS,IAAI;AAGnD,QAAI,iBAAiB,WAAW,IAAI,MAAM,MAAM;AAC/C,YAAM,OAAO,SAAS,QAAQ;AAAA,IAC/B;AACA,QAAI,MAAM,YAAY,CAAC,EAAG,QAAO,SAAS,OAAO,CAAC;AAClD,UAAM,OAAO,SAAS,QAAQ;AAAA,EAC/B;AAEA,QAAM,QAAQ,MAAM,UAAU,KAAK,KAAK;AAExC,QAAM,WAAoC;AAAA;AAAA;AAAA,IAGzC,GAAI,QACD;AAAA,MACA,UAAU,CAAC,UAAkB,OAAe,QAC3C,MAAMA,OAAM,cAAc,QAAQ,CAAC,GAAG,OAAO,GAAG;AAAA,IAClD,IACC,CAAC;AAAA,IAEJ,MAAM,SAAS,UAAU,MAAM;AAC9B,YAAM,OAAO,cAAc,QAAQ;AACnC,UAAI,MAAM,YAAY,IAAI,EAAG,OAAM,OAAO,QAAQ,QAAQ;AAC1D,YAAM,OAAO,MAAM,MAAM,IAAIA,OAAM,IAAI,CAAC;AACxC,UAAI,SAAS,KAAM,OAAM,OAAO,QAAQ,QAAQ;AAChD,aAAO,gBAAgB,IAAI,MAAM,SAAS,YAAY,OAAO,IAAI,IAAI;AAAA,IACtE;AAAA,IAEA,MAAM,UAAU,UAAU,MAAM,OAAO;AACtC,YAAM,OAAO,cAAc,QAAQ;AACnC,UAAI,eAAe;AAClB,cAAM,QAAQ,WAAW,IAAI;AAG7B,YAAI,UAAU,KAAM,YAAW,IAAI,OAAO,SAAS;AAAA,MACpD;AACA,YAAM,QAAQ,OAAO,SAAS,WAAW,YAAY,OAAO,IAAI,IAAI;AACpE,YAAM,MAAM,IAAIA,OAAM,IAAI,GAAG,KAAK;AAAA,IACnC;AAAA,IAEA,MAAM,OAAO,UAAU;AACtB,YAAM,IAAIA,OAAM,cAAc,QAAQ,CAAC;AACvC,UAAK,MAAM,MAAM,KAAK,CAAC,MAAO,KAAM,OAAM,OAAO,UAAU,QAAQ;AACnE,YAAM,MAAM,OAAO,CAAC;AAAA,IACrB;AAAA,IAEA,MAAM,QAAQ,SAAS;AACtB,YAAM,IAAIA,OAAM,cAAc,OAAO,CAAC;AACtC,YAAM,SAAS,MAAM,UAAU,MAAM;AACrC,YAAM,aAAa,UAAU,MAAM,KAAK,KAAK,GAAG,CAAC;AACjD,YAAM,EAAE,SAAS,SAAS,IAAI,MAAM,MAAM,KAAK,YAAY;AAAA,QAC1D,WAAW;AAAA,MACZ,CAAC;AACD,UAAI,QAAQ,WAAW,KAAK,SAAS,WAAW,GAAG;AAClD,YAAI,CAAC,UAAW,MAAM,MAAM,KAAK,CAAC,MAAO,MAAM;AAC9C,gBAAM,QAAQ,WAAW,OAAO;AAAA,QACjC;AACA,YAAI,CAAC,OAAQ,OAAM,OAAO,WAAW,OAAO;AAAA,MAC7C;AACA,YAAM,QAAQ,QAAQ,IAAI,CAAC,MAAM,EAAE,IAAI,MAAM,WAAW,MAAM,CAAC;AAC/D,YAAM,WAAW,SAAS;AAAA,QAAI,CAAC,MAC9B,EAAE,MAAM,WAAW,MAAM,EAAE,QAAQ,OAAO,EAAE;AAAA,MAC7C;AACA,aAAO,CAAC,GAAG,OAAO,GAAG,QAAQ,EAAE,KAAK;AAAA,IACrC;AAAA,IAEA,MAAM,MAAM,UAAU,OAAO;AAAA,IAE7B;AAAA,IAEA,MAAM,MAAM,SAAS;AACpB,YAAM,IAAIA,OAAM,cAAc,OAAO,CAAC;AACtC,YAAM,EAAE,SAAS,SAAS,IAAI,MAAM,MAAM,KAAK,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC;AACpE,UAAI,QAAQ,SAAS,KAAK,SAAS,SAAS,GAAG;AAC9C,cAAM,UAAU,SAAS,OAAO;AAAA,MACjC;AAAA,IAED;AAAA,IAEA,MAAM,CAAC,aAAa,KAAK,UAAU,MAAM;AAAA,IACzC,OAAO,CAAC,aAAa,KAAK,UAAU,OAAO;AAAA,IAE3C,MAAM,SAAS,UAA0B;AACxC,YAAM,OAAO,YAAY,QAAQ;AAAA,IAClC;AAAA,IAEA,MAAM,QAAQ,SAAS,UAA0B;AAChD,YAAM,MAAM,WAAW,QAAQ;AAAA,IAChC;AAAA,IAEA,MAAM,MAAM,WAAW,OAAO;AAAA,IAE9B;AAAA,EACD;AAEA,iBAAe,mBAAmB,QAA+B;AAChE,QAAI,CAAC,cAAe;AACpB,UAAM,QAAQ,cAAc,MAAM;AAIlC,QAAI,WAAW,IAAI,KAAK,EAAG;AAC3B,QAAI;AACH,YAAM,EAAE,QAAQ,IAAI,MAAM,MAAM,KAAK,GAAGA,OAAM,KAAK,CAAC,aAAa;AAAA,QAChE,OAAO;AAAA,MACR,CAAC;AAGD,YAAM,QAAQ,QAAQ,CAAC,GAAG;AAC1B,YAAM,OACL,UAAU,UAAa,qBAAqB,KAAK,MAAM,OACpD,YACA;AACJ,iBAAW,IAAI,OAAO,IAAI;AAC1B,eAAS,iBAAiB,IAAI,UAAU,KAAK,EAAE;AAAA,IAChD,QAAQ;AAAA,IAER;AAAA,EACD;AAEA,iBAAe,cACd,QACA,iBACgB;AAChB,UAAM,WAAW,iBAAiB,YAAY;AAC9C,UAAM,UAAU,GAAG,cAAc,MAAM,CAAC;AAGxC,UAAM,UAAU;AAAA,MACf,MAAM,SAAS,QAAQ,OAAO,EAAE,MAAM,MAAM,CAAC,CAAC;AAAA,IAC/C,EACE,OAAO,CAAC,SAAS,yBAAyB,IAAI,KAAK,IAAI,CAAC,EACxD,IAAI,CAAC,SAAS,KAAK,IAAI;AACzB,QAAI,QAAQ,SAAS,WAAW,GAAG;AAClC,YAAM,mBAAmB,MAAM;AAC/B;AAAA,IACD;AACA,UAAM,QAAQ,IAAI;AAAA,MACjB,mBAAmB,MAAM;AAAA,MACzB,GAAG,QAAQ;AAAA,QAAI,CAAC,SACf,SAAS,SAAS,GAAG,OAAO,IAAI,IAAI,EAAE,EAAE,MAAM,MAAM,MAAS;AAAA,MAC9D;AAAA,IACD,CAAC;AAAA,EACF;AAEA,iBAAe,qBAAqB,SAAoC;AACvE,UAAM,YAAYA,OAAM,cAAc,OAAO,CAAC;AAC9C,UAAM,aAAa,cAAc,KAAK,KAAK,GAAG,SAAS;AACvD,UAAM,EAAE,QAAQ,IAAI,MAAM,MAAM,KAAK,UAAU;AAC/C,WAAO,QACL,IAAI,CAAC,WAAW,OAAO,IAAI,MAAM,WAAW,MAAM,CAAC,EACnD,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,EAChC,KAAK;AAAA,EACR;AAEA,WAAS,eAAe,QAAgB,OAA2B;AAClE,sBAAkB;AAAA,MACjB,cAAc,MAAM;AAAA,MACpB,IAAI,IAAI,OAAO,eAAe,CAAC,CAAC;AAAA,IACjC;AAAA,EACD;AAEA,WAAS,WAAW,YAA0B;AAC7C,UAAM,aAAa,cAAc,UAAU;AAC3C,eAAW,OAAO,kBAAkB,KAAK,GAAG;AAC3C,UAAI,IAAI,WAAW,UAAU,EAAG,mBAAkB,OAAO,GAAG;AAAA,IAC7D;AACA,eAAW,SAAS,WAAW,KAAK,GAAG;AACtC,UAAI,MAAM,WAAW,UAAU,EAAG,YAAW,OAAO,KAAK;AAAA,IAC1D;AACA,UAAM,QAAQ;AAGd,UAAM,aAAaA,OAAM,UAAU,CAAC;AAAA,EACrC;AAEA,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACD;;;AE9UO,IAAM,mBAAN,cAA+B,MAAM;AAAA,EAClC,OAAO;AAAA,EAEhB,cAAc;AACb,UAAM,mDAAmD;AACzD,SAAK,OAAO;AAAA,EACb;AACD;AAEA,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD,CAAC;AAED,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD,CAAC;AAED,SAAS,mBAAmB,OAAyB;AACpD,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,QAAM,MAAM;AAKZ,MAAI,IAAI,SAAS,UAAa,gBAAgB,IAAI,IAAI,IAAI,EAAG,QAAO;AACpE,MAAI,IAAI,SAAS,UAAa,gBAAgB,IAAI,IAAI,IAAI,EAAG,QAAO;AACpE,QAAM,SAAS,IAAI,WAAW;AAC9B,SAAO,WAAW,WAAc,UAAU,OAAO,WAAW;AAC7D;AAEA,IAAM,QAAQ,CAAC,OAAe,IAAI,QAAQ,CAAC,YAAY,WAAW,SAAS,EAAE,CAAC;AAUvE,SAAS,iBACf,OACA,UAAwB,CAAC,GACX;AACd,QAAM,UAAU,QAAQ,WAAW;AACnC,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,cAAc,QAAQ,eAAe;AAC3C,QAAM,UACL,QAAQ,YAAY,QACjB,OACA;AAAA,IACA,WAAW,QAAQ,SAAS,aAAa;AAAA,IACzC,SAAS,QAAQ,SAAS,WAAW;AAAA,EACtC;AAEH,MAAI,WAAW;AACf,MAAI,gBAAgB;AACpB,MAAI,QAAyC;AAC7C,MAAI,UAAU;AASd,iBAAe,QAAW,IAAkC;AAC3D,QAAI,YAAY,KAAM,QAAO,GAAG;AAChC,QAAI,UAAU;AACd,QAAI,UAAU,UAAU;AACvB,UACC,WACC,UAAU,UAAU,KAAK,IAAI,IAAI,gBAAgB,QAAQ,SACzD;AACD,cAAM,IAAI,iBAAiB;AAAA,MAC5B;AACA,cAAQ;AACR,gBAAU;AACV,gBAAU;AAAA,IACX;AACA,QAAI;AACH,YAAM,SAAS,MAAM,GAAG;AACxB,iBAAW;AACX,cAAQ;AACR,aAAO;AAAA,IACR,SAAS,OAAO;AACf,UAAI,YAAY,KAAK,GAAG;AACvB;AACA,wBAAgB,KAAK,IAAI;AACzB,YAAI,YAAY,QAAQ,aAAa,QAAS,SAAQ;AAAA,MACvD,WAAW,SAAS;AAEnB,mBAAW;AACX,gBAAQ;AAAA,MACT;AACA,YAAM;AAAA,IACP,UAAE;AACD,UAAI,QAAS,WAAU;AAAA,IACxB;AAAA,EACD;AAEA,iBAAe,IAAO,IAAY,KAAa,IAAsB;AACpE,QAAI;AACJ,aAAS,UAAU,GAAG,WAAW,SAAS,WAAW;AACpD,UAAI;AACH,eAAO,MAAM,QAAQ,EAAE;AAAA,MACxB,SAAS,OAAO;AACf,oBAAY;AACZ,YAAI,iBAAiB,iBAAkB,OAAM;AAC7C,YAAI,CAAC,YAAY,KAAK,KAAK,YAAY,QAAS,OAAM;AACtD,cAAM,OAAO,KAAK,IAAI,iBAAiB,KAAK,SAAS,UAAU;AAC/D,cAAM,UAAU,KAAK,MAAM,OAAO,KAAK,OAAO,IAAI,OAAO,MAAM;AAC/D,gBAAQ,UAAU,EAAE,KAAK,IAAI,SAAS,UAAU,GAAG,QAAQ,CAAC;AAC5D,cAAM,MAAM,OAAO;AAAA,MACpB;AAAA,IACD;AACA,UAAM;AAAA,EACP;AAMA,QAAM,QAAQ,MAAM,UAAU,KAAK,KAAK;AAExC,SAAO;AAAA,IACN,KAAK,CAAC,QAAQ,IAAI,OAAO,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC;AAAA,IAClD,KAAK,CAAC,KAAK,SAAS,IAAI,OAAO,KAAK,MAAM,MAAM,IAAI,KAAK,IAAI,CAAC;AAAA,IAC9D,QAAQ,CAAC,QAAQ,IAAI,UAAU,KAAK,MAAM,MAAM,OAAO,GAAG,CAAC;AAAA,IAC3D,MAAM,CAAC,QAAQ,IAAI,QAAQ,KAAK,MAAM,MAAM,KAAK,GAAG,CAAC;AAAA,IACrD,MAAM,CAAC,QAAQ,gBACd,IAAI,QAAQ,QAAQ,MAAM,MAAM,KAAK,QAAQ,WAAW,CAAC;AAAA,IAC1D,GAAI,QACD;AAAA,MACA,UAAU,CAAC,KAAa,OAAe,QACtC,IAAI,YAAY,KAAK,MAAM,MAAM,KAAK,OAAO,GAAG,CAAC;AAAA,IACnD,IACC,CAAC;AAAA,EACL;AACD;;;ACnLO,IAAM,oBAAN,MAA+C;AAAA,EACpC,UAAU,oBAAI,IAAwB;AAAA,EAEvD,MAAM,IAAI,KAAyC;AAClD,UAAM,OAAO,KAAK,QAAQ,IAAI,GAAG;AACjC,WAAO,OAAO,KAAK,MAAM,IAAI;AAAA,EAC9B;AAAA,EAEA,MAAM,SACL,KACA,OACA,KAC6B;AAC7B,UAAM,OAAO,KAAK,QAAQ,IAAI,GAAG;AACjC,WAAO,OAAO,KAAK,MAAM,OAAO,MAAM,CAAC,IAAI;AAAA,EAC5C;AAAA,EAEA,MAAM,IAAI,KAAa,MAAiC;AACvD,SAAK,QAAQ,IAAI,KAAK,KAAK,MAAM,CAAC;AAAA,EACnC;AAAA,EAEA,MAAM,OAAO,KAA4B;AACxC,SAAK,QAAQ,OAAO,GAAG;AAAA,EACxB;AAAA,EAEA,MAAM,KAAK,KAAyC;AACnD,UAAM,OAAO,KAAK,QAAQ,IAAI,GAAG;AACjC,WAAO,OAAO,EAAE,MAAM,KAAK,WAAW,IAAI;AAAA,EAC3C;AAAA,EAEA,MAAM,KAAK,QAAgB,SAA4C;AACtE,UAAM,YAAY,SAAS;AAC3B,UAAM,QAAQ,SAAS,SAAS,OAAO;AACvC,UAAM,UAAiC,CAAC;AACxC,UAAM,WAAW,oBAAI,IAAY;AAEjC,eAAW,CAAC,KAAK,IAAI,KAAK,KAAK,SAAS;AACvC,UAAI,CAAC,IAAI,WAAW,MAAM,EAAG;AAC7B,YAAM,OAAO,IAAI,MAAM,OAAO,MAAM;AACpC,UAAI,cAAc,QAAW;AAC5B,cAAM,MAAM,KAAK,QAAQ,SAAS;AAClC,YAAI,QAAQ,IAAI;AACf,mBAAS,IAAI,SAAS,KAAK,MAAM,GAAG,MAAM,UAAU,MAAM,CAAC;AAAA,QAC5D,OAAO;AACN,kBAAQ,KAAK,EAAE,KAAK,MAAM,KAAK,WAAW,CAAC;AAAA,QAC5C;AAAA,MACD,OAAO;AACN,gBAAQ,KAAK,EAAE,KAAK,MAAM,KAAK,WAAW,CAAC;AAAA,MAC5C;AACA,UAAI,QAAQ,SAAS,SAAS,QAAQ,MAAO;AAAA,IAC9C;AAEA,WAAO,EAAE,SAAS,UAAU,CAAC,GAAG,QAAQ,EAAE;AAAA,EAC3C;AAAA;AAAA,EAGA,IAAI,OAAe;AAClB,WAAO,KAAK,QAAQ;AAAA,EACrB;AACD;","names":["LRUCache","toKey","LRUCache"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "git-fs-s3",
-  "version": "0.11.0",
+  "version": "0.12.0",
   "description": "isomorphic-git filesystem backend for S3-compatible object storage (AWS S3, Cloudflare R2, MinIO) \u2014 run git servers without a disk",
   "type": "module",
   "exports": {
@@ -49,7 +49,7 @@
     "fs"
   ],
   "author": "Nandan Varma",
-  "license": "MIT",
+  "license": "AGPL-3.0-or-later",
   "repository": {
     "type": "git",
     "url": "git+https://github.com/nandan-varma/git-fs-s3.git"