opfs-worker 2.1.0 → 2.1.2

package/dist/{BaseOPFS-Cylz6ijk.js → BaseOPFS-C3NE4BKr.js}

@@ -1,5 +1,5 @@
 var N = /* @__PURE__ */ ((s) => (s.Added = "added", s.Changed = "changed", s.Removed = "removed", s))(N || {});
-const mt = {
+const bt = {
   ENOENT: -2,
   // No such file or directory
   EISDIR: -21,
@@ -36,20 +36,20 @@ class m extends Error {
   syscall;
   path;
   constructor(t, e, n, r, i) {
-    super(t, { cause: i }), this.name = e, this.errno = mt[e] || -1, this.path = n, this.syscall = r;
+    super(t, { cause: i }), this.name = e, this.errno = bt[e] || -1, this.path = n, this.syscall = r;
   }
 }
-class wt extends m {
+class xt extends m {
   constructor(t) {
     super("OPFS is not supported in this browser", "ENOTSUP", void 0, void 0, t);
   }
 }
-class yt extends m {
+class At extends m {
   constructor(t, e, n) {
     super(t, "INVALID_PATH", e, "access", n);
   }
 }
-class k extends m {
+class P extends m {
   constructor(t, e, n) {
     const r = {
       file: `File not found: ${e}`,
@@ -59,28 +59,28 @@ class k extends m {
     super(r[t], "ENOENT", e, "access", n);
   }
 }
-class Et extends m {
+class vt extends m {
   constructor(t, e, n) {
     super(`Permission denied for ${e} on: ${t}`, "EACCES", t, e, n);
   }
 }
-class St extends m {
+class Ot extends m {
   constructor(t, e, n) {
     super(t, "ENOSPC", e, "write", n);
   }
 }
-class xt extends m {
+class $t extends m {
   constructor(t, e) {
     super(`File is busy: ${t}`, "EBUSY", t, "open", e);
   }
 }
-class q extends m {
+class U extends m {
   constructor(t, e, n) {
     const r = t === "directory" ? `Is a directory: ${e}` : `Not a directory: ${e}`, i = t === "directory" ? "EISDIR" : "ENOTDIR";
     super(r, i, e, "access", n);
   }
 }
-class D extends m {
+class $ extends m {
   constructor(t, e, n, r) {
     const i = {
       argument: "EINVAL",
@@ -91,7 +91,7 @@ class D extends m {
     super(e, i[t], n, "validate", r);
   }
 }
-class vt extends m {
+class Nt extends m {
   constructor(t, e) {
     super(`Operation aborted: ${t}`, "EINTR", t, "interrupt", e);
   }
@@ -101,12 +101,12 @@ class J extends m {
     super(t, "EIO", e, "io", n);
   }
 }
-class it extends m {
+class ct extends m {
   constructor(t, e) {
     super(`Operation not supported: ${t}`, "ENOTSUP", t, "operation", e);
   }
 }
-class G extends m {
+class H extends m {
   constructor(t, e, n) {
     const r = {
       RM_FAILED: `Failed to remove entry: ${e}`,
@@ -116,53 +116,53 @@ class G extends m {
     super(r[t] || `Directory operation failed: ${e}`, t, e, "unlink", n);
   }
 }
-class bt extends m {
+class Dt extends m {
   constructor(t, e) {
     super("Failed to initialize OPFS", "INIT_FAILED", t, "init", e);
   }
 }
-class U extends m {
+class j extends m {
   constructor(t, e, n) {
     super(`Failed to ${t}: ${e}`, `${t.toUpperCase()}_FAILED`, e, t, n);
   }
 }
-class X extends m {
+class Q extends m {
   constructor(t, e) {
     super(`Destination already exists: ${t}`, "EEXIST", t, "open", e);
   }
 }
-function We(s, t, e, n) {
+function Ke(s, t, e, n) {
   const r = `${s.toUpperCase()}_FAILED`;
   return new m(`Failed to ${s} file descriptor: ${t}`, r, e, s, n);
 }
-function O(s, t) {
+function v(s, t) {
   const e = t?.path, n = t?.isDirectory, r = t?.existenceType ?? "file", i = t?.operation;
   switch (s.name) {
     case "InvalidStateError":
-      return new xt(e || "unknown", s);
+      return new $t(e || "unknown", s);
     case "QuotaExceededError":
-      return new St(`No space left on device: ${e || "unknown"}`, e, s);
+      return new Ot(`No space left on device: ${e || "unknown"}`, e, s);
     case "NotFoundError":
-      return new k(r, e, s);
+      return new P(r, e, s);
     case "TypeMismatchError":
-      return n !== void 0 ? n ? new q("directory", e || "unknown", s) : new q("file", e || "unknown", s) : new D("argument", `Type mismatch: ${e || "unknown"}`, e, s);
+      return n !== void 0 ? n ? new U("directory", e || "unknown", s) : new U("file", e || "unknown", s) : new $("argument", `Type mismatch: ${e || "unknown"}`, e, s);
     case "NotAllowedError":
     case "SecurityError":
-      return new Et(e, "unknown", s);
+      return new vt(e, "unknown", s);
     case "InvalidModificationError":
-      return i === "remove" ? new G("ENOTEMPTY", e, s) : new D("argument", `Invalid modification: ${e || "unknown"}`, e, s);
+      return i === "remove" ? new H("ENOTEMPTY", e, s) : new $("argument", `Invalid modification: ${e || "unknown"}`, e, s);
     case "AbortError":
-      return new vt(e || "unknown", s);
+      return new Nt(e || "unknown", s);
     case "OperationError":
       return new J(`Operation failed: ${e || "unknown"}`, e, s);
     case "TypeError":
-      return new it(e || "unknown", s);
+      return new ct(e || "unknown", s);
     default:
-      return i === "remove" ? new G("RM_FAILED", e, s) : new J(`I/O error: ${e || "unknown"}`, e, s);
+      return i === "remove" ? new H("RM_FAILED", e, s) : new J(`I/O error: ${e || "unknown"}`, e, s);
   }
 }
-const ot = (s, t, e) => {
-  const n = s instanceof RegExp ? K(s, e) : s, r = t instanceof RegExp ? K(t, e) : t, i = n !== null && r != null && Ot(n, r, e);
+const lt = (s, t, e) => {
+  const n = s instanceof RegExp ? K(s, e) : s, r = t instanceof RegExp ? K(t, e) : t, i = n !== null && r != null && Tt(n, r, e);
   return i && {
     start: i[0],
     end: i[1],
@@ -173,118 +173,151 @@ const ot = (s, t, e) => {
 }, K = (s, t) => {
   const e = t.match(s);
   return e ? e[0] : null;
-}, Ot = (s, t, e) => {
-  let n, r, i, o, a, c = e.indexOf(s), l = e.indexOf(t, c + 1), h = c;
+}, Tt = (s, t, e) => {
+  let n, r, i, o, a, c = e.indexOf(s), l = e.indexOf(t, c + 1), u = c;
   if (c >= 0 && l > 0) {
     if (s === t)
       return [c, l];
-    for (n = [], i = e.length; h >= 0 && !a; ) {
-      if (h === c)
-        n.push(h), c = e.indexOf(s, h + 1);
+    for (n = [], i = e.length; u >= 0 && !a; ) {
+      if (u === c)
+        n.push(u), c = e.indexOf(s, u + 1);
       else if (n.length === 1) {
-        const d = n.pop();
-        d !== void 0 && (a = [d, l]);
+        const h = n.pop();
+        h !== void 0 && (a = [h, l]);
       } else
-        r = n.pop(), r !== void 0 && r < i && (i = r, o = l), l = e.indexOf(t, h + 1);
-      h = c < l && c >= 0 ? c : l;
+        r = n.pop(), r !== void 0 && r < i && (i = r, o = l), l = e.indexOf(t, u + 1);
+      u = c < l && c >= 0 ? c : l;
     }
     n.length && o !== void 0 && (a = [i, o]);
   }
   return a;
-}, at = "\0SLASH" + Math.random() + "\0", ct = "\0OPEN" + Math.random() + "\0", V = "\0CLOSE" + Math.random() + "\0", ht = "\0COMMA" + Math.random() + "\0", lt = "\0PERIOD" + Math.random() + "\0", At = new RegExp(at, "g"), Dt = new RegExp(ct, "g"), Nt = new RegExp(V, "g"), $t = new RegExp(ht, "g"), Ct = new RegExp(lt, "g"), Tt = /\\\\/g, Mt = /\\{/g, Ft = /\\}/g, It = /\\,/g, Pt = /\\./g;
-function B(s) {
+}, ht = "\0SLASH" + Math.random() + "\0", ut = "\0OPEN" + Math.random() + "\0", X = "\0CLOSE" + Math.random() + "\0", ft = "\0COMMA" + Math.random() + "\0", pt = "\0PERIOD" + Math.random() + "\0", Ct = new RegExp(ht, "g"), Mt = new RegExp(ut, "g"), Ft = new RegExp(X, "g"), Rt = new RegExp(ft, "g"), Pt = new RegExp(pt, "g"), kt = /\\\\/g, It = /\\{/g, Lt = /\\}/g, zt = /\\,/g, jt = /\\\./g, Wt = 1e5, _t = 4e6;
+function W(s) {
   return isNaN(s) ? s.charCodeAt(0) : parseInt(s, 10);
 }
-function Rt(s) {
-  return s.replace(Tt, at).replace(Mt, ct).replace(Ft, V).replace(It, ht).replace(Pt, lt);
+function Bt(s) {
+  return s.replace(kt, ht).replace(It, ut).replace(Lt, X).replace(zt, ft).replace(jt, pt);
 }
-function kt(s) {
-  return s.replace(At, "\\").replace(Dt, "{").replace(Nt, "}").replace($t, ",").replace(Ct, ".");
+function Ut(s) {
+  return s.replace(Ct, "\\").replace(Mt, "{").replace(Ft, "}").replace(Rt, ",").replace(Pt, ".");
 }
-function ut(s) {
+function dt(s) {
   if (!s)
     return [""];
-  const t = [], e = ot("{", "}", s);
+  const t = [], e = lt("{", "}", s);
   if (!e)
     return s.split(",");
   const { pre: n, body: r, post: i } = e, o = n.split(",");
   o[o.length - 1] += "{" + r + "}";
-  const a = ut(i);
+  const a = dt(i);
   return i.length && (o[o.length - 1] += a.shift(), o.push.apply(o, a)), t.push.apply(t, o), t;
 }
-function Lt(s) {
-  return s ? (s.slice(0, 2) === "{}" && (s = "\\{\\}" + s.slice(2)), F(Rt(s), !0).map(kt)) : [];
+function Ht(s, t = {}) {
+  if (!s)
+    return [];
+  const { max: e = Wt, maxLength: n = _t } = t;
+  return s.slice(0, 2) === "{}" && (s = "\\{\\}" + s.slice(2)), G(Bt(s), e, n, !0).map(Ut);
 }
-function zt(s) {
+function Gt(s) {
   return "{" + s + "}";
 }
-function jt(s) {
+function qt(s) {
   return /^-?0\d/.test(s);
 }
-function Wt(s, t) {
+function Xt(s, t) {
   return s <= t;
 }
-function Ut(s, t) {
+function Vt(s, t) {
   return s >= t;
 }
-function F(s, t) {
-  const e = [], n = ot("{", "}", s);
-  if (!n)
-    return [s];
-  const r = n.pre, i = n.post.length ? F(n.post, !1) : [""];
-  if (/\$$/.test(n.pre))
-    for (let o = 0; o < i.length; o++) {
-      const a = r + "{" + n.body + "}" + i[o];
-      e.push(a);
+function C(s, t, e, n, r, i) {
+  const o = [];
+  let a = 0;
+  for (let c = 0; c < s.length; c++)
+    for (let l = 0; l < e.length; l++) {
+      if (o.length >= n)
+        return o;
+      const u = s[c] + t + e[l];
+      if (!(i && !u)) {
+        if (a + u.length > r)
+          return o;
+        o.push(u), a += u.length;
+      }
     }
-  else {
-    const o = /^-?\d+\.\.-?\d+(?:\.\.-?\d+)?$/.test(n.body), a = /^[a-zA-Z]\.\.[a-zA-Z](?:\.\.-?\d+)?$/.test(n.body), c = o || a, l = n.body.indexOf(",") >= 0;
-    if (!c && !l)
-      return n.post.match(/,(?!,).*\}/) ? (s = n.pre + "{" + n.body + V + n.post, F(s)) : [s];
-    let h;
-    if (c)
-      h = n.body.split(/\.\./);
-    else if (h = ut(n.body), h.length === 1 && h[0] !== void 0 && (h = F(h[0], !1).map(zt), h.length === 1))
-      return i.map((u) => n.pre + h[0] + u);
+  return o;
+}
+function Yt(s, t, e) {
+  const n = s.split(/\.\./), r = [];
+  if (n[0] === void 0 || n[1] === void 0)
+    return r;
+  const i = W(n[0]), o = W(n[1]), a = Math.max(n[0].length, n[1].length);
+  let c = n.length === 3 && n[2] !== void 0 ? Math.max(Math.abs(W(n[2])), 1) : 1, l = Xt;
+  o < i && (c *= -1, l = Vt);
+  const h = n.some(qt);
+  for (let f = i; l(f, o) && r.length < e; f += c) {
     let d;
-    if (c && h[0] !== void 0 && h[1] !== void 0) {
-      const u = B(h[0]), f = B(h[1]), g = Math.max(h[0].length, h[1].length);
-      let p = h.length === 3 && h[2] !== void 0 ? Math.abs(B(h[2])) : 1, S = Wt;
-      f < u && (p *= -1, S = Ut);
-      const C = h.some(jt);
-      d = [];
-      for (let x = u; S(x, f); x += p) {
-        let w;
-        if (a)
-          w = String.fromCharCode(x), w === "\\" && (w = "");
-        else if (w = String(x), C) {
-          const T = g - w.length;
-          if (T > 0) {
-            const P = new Array(T + 1).join("0");
-            x < 0 ? w = "-" + P + w.slice(1) : w = P + w;
-          }
-        }
-        d.push(w);
+    if (t)
+      d = String.fromCharCode(f), d === "\\" && (d = "");
+    else if (d = String(f), h) {
+      const g = a - d.length;
+      if (g > 0) {
+        const p = new Array(g + 1).join("0");
+        f < 0 ? d = "-" + p + d.slice(1) : d = p + d;
       }
-    } else {
-      d = [];
-      for (let u = 0; u < h.length; u++)
-        d.push.apply(d, F(h[u], !1));
     }
-    for (let u = 0; u < d.length; u++)
-      for (let f = 0; f < i.length; f++) {
-        const g = r + d[u] + i[f];
-        (!t || c || g) && e.push(g);
+    r.push(d);
+  }
+  return r;
+}
+function G(s, t, e, n) {
+  let r = [""], i = !1, o = !0;
+  for (; ; ) {
+    const a = lt("{", "}", s);
+    if (!a)
+      return C(r, s, [""], t, e, i);
+    const c = a.pre;
+    if (/\$$/.test(c)) {
+      if (r = C(r, c + "{" + a.body + "}", [""], t, e, i && !a.post.length), o = !1, !a.post.length)
+        break;
+      s = a.post;
+      continue;
+    }
+    const l = /^-?\d+\.\.-?\d+(?:\.\.-?\d+)?$/.test(a.body), u = /^[a-zA-Z]\.\.[a-zA-Z](?:\.\.-?\d+)?$/.test(a.body), h = l || u, f = a.body.indexOf(",") >= 0;
+    if (!h && !f) {
+      if (a.post.match(/,(?!,).*\}/)) {
+        s = a.pre + "{" + a.body + X + a.post, n = !0;
+        continue;
+      }
+      return C(r, c + "{" + a.body + "}" + a.post, [""], t, e, i);
+    }
+    o && (i = n && !h, o = !1);
+    let d;
+    if (h)
+      d = Yt(a.body, u, t);
+    else {
+      let g = dt(a.body);
+      if (g.length === 1 && g[0] !== void 0 && (g = G(g[0], t, e, !1).map(Gt), g.length === 1)) {
+        if (r = C(r, c + g[0], [""], t, e, i && !a.post.length), !a.post.length)
+          break;
+        s = a.post;
+        continue;
       }
+      d = [];
+      for (let p = 0; p < g.length; p++)
+        d.push.apply(d, G(g[p], t, e, !1));
+    }
+    if (r = C(r, c, d, t, e, i && !a.post.length), !a.post.length)
+      break;
+    s = a.post;
   }
-  return e;
+  return r;
 }
-const Bt = 1024 * 64, L = (s) => {
+const Zt = 1024 * 64, k = (s) => {
   if (typeof s != "string")
     throw new TypeError("invalid pattern");
-  if (s.length > Bt)
+  if (s.length > Zt)
     throw new TypeError("pattern is too long");
-}, Ht = {
+}, Jt = {
   "[:alnum:]": ["\\p{L}\\p{Nl}\\p{Nd}", !0],
   "[:alpha:]": ["\\p{L}\\p{Nl}", !0],
   "[:ascii:]": ["\\x00-\\x7f", !1],
@@ -299,12 +332,12 @@ const Bt = 1024 * 64, L = (s) => {
   "[:upper:]": ["\\p{Lu}", !0],
   "[:word:]": ["\\p{L}\\p{Nl}\\p{Nd}\\p{Pc}", !0],
   "[:xdigit:]": ["A-Fa-f0-9", !1]
-}, M = (s) => s.replace(/[[\]\\-]/g, "\\$&"), _t = (s) => s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&"), Q = (s) => s.join(""), qt = (s, t) => {
+}, M = (s) => s.replace(/[[\]\\-]/g, "\\$&"), Qt = (s) => s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&"), tt = (s) => s.join(""), Kt = (s, t) => {
   const e = t;
   if (s.charAt(e) !== "[")
     throw new Error("not in a brace expression");
   const n = [], r = [];
-  let i = e + 1, o = !1, a = !1, c = !1, l = !1, h = e, d = "";
+  let i = e + 1, o = !1, a = !1, c = !1, l = !1, u = e, h = "";
   t: for (; i < s.length; ) {
     const p = s.charAt(i);
     if ((p === "!" || p === "^") && i === e + 1) {
@@ -312,7 +345,7 @@ const Bt = 1024 * 64, L = (s) => {
       continue;
     }
     if (p === "]" && o && !c) {
-      h = i + 1;
+      u = i + 1;
       break;
     }
     if (o = !0, p === "\\" && !c) {
@@ -320,16 +353,16 @@ const Bt = 1024 * 64, L = (s) => {
       continue;
     }
     if (p === "[" && !c) {
-      for (const [S, [A, C, x]] of Object.entries(Ht))
-        if (s.startsWith(S, i)) {
-          if (d)
+      for (const [E, [w, y, O]] of Object.entries(Jt))
+        if (s.startsWith(E, i)) {
+          if (h)
             return ["$.", !1, s.length - e, !0];
-          i += S.length, x ? r.push(A) : n.push(A), a = a || C;
+          i += E.length, O ? r.push(w) : n.push(w), a = a || y;
           continue t;
         }
     }
-    if (c = !1, d) {
-      p > d ? n.push(M(d) + "-" + M(p)) : p === d && n.push(M(p)), d = "", i++;
+    if (c = !1, h) {
+      p > h ? n.push(M(h) + "-" + M(p)) : p === h && n.push(M(p)), h = "", i++;
       continue;
     }
     if (s.startsWith("-]", i + 1)) {
@@ -337,39 +370,100 @@ const Bt = 1024 * 64, L = (s) => {
       continue;
     }
     if (s.startsWith("-", i + 1)) {
-      d = p, i += 2;
+      h = p, i += 2;
       continue;
     }
     n.push(M(p)), i++;
   }
-  if (h < i)
+  if (u < i)
     return ["", !1, 0, !1];
   if (!n.length && !r.length)
     return ["$.", !1, s.length - e, !0];
   if (r.length === 0 && n.length === 1 && /^\\?.$/.test(n[0]) && !l) {
     const p = n[0].length === 2 ? n[0].slice(-1) : n[0];
-    return [_t(p), !1, h - e, !1];
-  }
-  const u = "[" + (l ? "^" : "") + Q(n) + "]", f = "[" + (l ? "" : "^") + Q(r) + "]";
-  return [n.length && r.length ? "(" + u + "|" + f + ")" : n.length ? u : f, a, h - e, !0];
-}, I = (s, { windowsPathsNoEscape: t = !1 } = {}) => t ? s.replace(/\[([^\/\\])\]/g, "$1") : s.replace(/((?!\\).|^)\[([^\/\\])\]/g, "$1$2").replace(/\\([^\/])/g, "$1"), Gt = /* @__PURE__ */ new Set(["!", "?", "+", "*", "@"]), tt = (s) => Gt.has(s), Vt = "(?!(?:^|/)\\.\\.?(?:$|/))", R = "(?!\\.)", Yt = /* @__PURE__ */ new Set(["[", "."]), Zt = /* @__PURE__ */ new Set(["..", "."]), Jt = new Set("().*{}+?[]^$\\!"), Xt = (s) => s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&"), Y = "[^/]", et = Y + "*?", st = Y + "+?";
-class E {
+    return [Qt(p), !1, u - e, !1];
+  }
+  const f = "[" + (l ? "^" : "") + tt(n) + "]", d = "[" + (l ? "" : "^") + tt(r) + "]";
+  return [n.length && r.length ? "(" + f + "|" + d + ")" : n.length ? f : d, a, u - e, !0];
+}, F = (s, { windowsPathsNoEscape: t = !1, magicalBraces: e = !0 } = {}) => e ? t ? s.replace(/\[([^/\\])\]/g, "$1") : s.replace(/((?!\\).|^)\[([^/\\])\]/g, "$1$2").replace(/\\([^/])/g, "$1") : t ? s.replace(/\[([^/\\{}])\]/g, "$1") : s.replace(/((?!\\).|^)\[([^/\\{}])\]/g, "$1$2").replace(/\\([^/{}])/g, "$1");
+var x;
+const te = /* @__PURE__ */ new Set(["!", "?", "+", "*", "@"]), q = (s) => te.has(s), et = (s) => q(s.type), ee = /* @__PURE__ */ new Map([
+  ["!", ["@"]],
+  ["?", ["?", "@"]],
+  ["@", ["@"]],
+  ["*", ["*", "+", "?", "@"]],
+  ["+", ["+", "@"]]
+]), se = /* @__PURE__ */ new Map([
+  ["!", ["?"]],
+  ["@", ["?"]],
+  ["+", ["?", "*"]]
+]), ne = /* @__PURE__ */ new Map([
+  ["!", ["?", "@"]],
+  ["?", ["?", "@"]],
+  ["@", ["?", "@"]],
+  ["*", ["*", "+", "?", "@"]],
+  ["+", ["+", "@", "?", "*"]]
+]), st = /* @__PURE__ */ new Map([
+  ["!", /* @__PURE__ */ new Map([["!", "@"]])],
+  [
+    "?",
+    /* @__PURE__ */ new Map([
+      ["*", "*"],
+      ["+", "*"]
+    ])
+  ],
+  [
+    "@",
+    /* @__PURE__ */ new Map([
+      ["!", "!"],
+      ["?", "?"],
+      ["@", "@"],
+      ["*", "*"],
+      ["+", "+"]
+    ])
+  ],
+  [
+    "+",
+    /* @__PURE__ */ new Map([
+      ["?", "*"],
+      ["*", "*"]
+    ])
+  ]
+]), re = "(?!(?:^|/)\\.\\.?(?:$|/))", R = "(?!\\.)", ie = /* @__PURE__ */ new Set(["[", "."]), oe = /* @__PURE__ */ new Set(["..", "."]), ae = new Set("().*{}+?[]^$\\!"), ce = (s) => s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&"), V = "[^/]", nt = V + "*?", rt = V + "+?";
+let le = 0;
+class Y {
   type;
   #s;
   #n;
-  #i = !1;
+  #r = !1;
   #t = [];
   #e;
+  #a;
+  #l;
+  #c = !1;
+  #i;
   #o;
-  #c;
-  #a = !1;
-  #r;
-  #h;
   // set to true if it's an extglob with no children
   // (which really means one child of '')
-  #u = !1;
+  #h = !1;
+  id = ++le;
+  get depth() {
+    return (this.#e?.depth ?? -1) + 1;
+  }
+  [/* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom")]() {
+    return {
+      "@@type": "AST",
+      id: this.id,
+      type: this.type,
+      root: this.#s.id,
+      parent: this.#e?.id,
+      depth: this.depth,
+      partsLength: this.#t.length,
+      parts: this.#t
+    };
+  }
   constructor(t, e, n = {}) {
-    this.type = t, t && (this.#n = !0), this.#e = e, this.#s = this.#e ? this.#e.#s : this, this.#r = this.#s === this ? n : this.#s.#r, this.#c = this.#s === this ? [] : this.#s.#c, t === "!" && !this.#s.#a && this.#c.push(this), this.#o = this.#e ? this.#e.#t.length : 0;
+    this.type = t, t && (this.#n = !0), this.#e = e, this.#s = this.#e ? this.#e.#s : this, this.#i = this.#s === this ? n : this.#s.#i, this.#l = this.#s === this ? [] : this.#s.#l, t === "!" && !this.#s.#c && this.#l.push(this), this.#a = this.#e ? this.#e.#t.length : 0;
   }
   get hasMagic() {
     if (this.#n !== void 0)
@@ -381,21 +475,21 @@ class E {
   }
   // reconstructs the pattern
   toString() {
-    return this.#h !== void 0 ? this.#h : this.type ? this.#h = this.type + "(" + this.#t.map((t) => String(t)).join("|") + ")" : this.#h = this.#t.map((t) => String(t)).join("");
+    return this.#o !== void 0 ? this.#o : this.type ? this.#o = this.type + "(" + this.#t.map((t) => String(t)).join("|") + ")" : this.#o = this.#t.map((t) => String(t)).join("");
   }
-  #d() {
+  #w() {
     if (this !== this.#s)
       throw new Error("should only call on root");
-    if (this.#a)
+    if (this.#c)
       return this;
-    this.toString(), this.#a = !0;
+    this.toString(), this.#c = !0;
     let t;
-    for (; t = this.#c.pop(); ) {
+    for (; t = this.#l.pop(); ) {
       if (t.type !== "!")
         continue;
       let e = t, n = e.#e;
       for (; n; ) {
-        for (let r = e.#o + 1; !n.type && r < n.#t.length; r++)
+        for (let r = e.#a + 1; !n.type && r < n.#t.length; r++)
           for (const i of t.#t) {
             if (typeof i == "string")
               throw new Error("string part in extglob AST??");
@@ -409,26 +503,26 @@ class E {
   push(...t) {
     for (const e of t)
       if (e !== "") {
-        if (typeof e != "string" && !(e instanceof E && e.#e === this))
+        if (typeof e != "string" && !(e instanceof x && e.#e === this))
           throw new Error("invalid part: " + e);
         this.#t.push(e);
       }
   }
   toJSON() {
     const t = this.type === null ? this.#t.slice().map((e) => typeof e == "string" ? e : e.toJSON()) : [this.type, ...this.#t.map((e) => e.toJSON())];
-    return this.isStart() && !this.type && t.unshift([]), this.isEnd() && (this === this.#s || this.#s.#a && this.#e?.type === "!") && t.push({}), t;
+    return this.isStart() && !this.type && t.unshift([]), this.isEnd() && (this === this.#s || this.#s.#c && this.#e?.type === "!") && t.push({}), t;
   }
   isStart() {
     if (this.#s === this)
       return !0;
     if (!this.#e?.isStart())
       return !1;
-    if (this.#o === 0)
+    if (this.#a === 0)
       return !0;
     const t = this.#e;
-    for (let e = 0; e < this.#o; e++) {
+    for (let e = 0; e < this.#a; e++) {
       const n = t.#t[e];
-      if (!(n instanceof E && n.type === "!"))
+      if (!(n instanceof x && n.type === "!"))
         return !1;
     }
     return !0;
@@ -441,79 +535,123 @@ class E {
     if (!this.type)
       return this.#e?.isEnd();
     const t = this.#e ? this.#e.#t.length : 0;
-    return this.#o === t - 1;
+    return this.#a === t - 1;
   }
   copyIn(t) {
     typeof t == "string" ? this.push(t) : this.push(t.clone(this));
   }
   clone(t) {
-    const e = new E(this.type, t);
+    const e = new x(this.type, t);
     for (const n of this.#t)
       e.copyIn(n);
     return e;
   }
-  static #l(t, e, n, r) {
-    let i = !1, o = !1, a = -1, c = !1;
+  static #u(t, e, n, r, i) {
+    const o = r.maxExtglobRecursion ?? 2;
+    let a = !1, c = !1, l = -1, u = !1;
     if (e.type === null) {
-      let f = n, g = "";
-      for (; f < t.length; ) {
-        const p = t.charAt(f++);
-        if (i || p === "\\") {
-          i = !i, g += p;
+      let p = n, E = "";
+      for (; p < t.length; ) {
+        const w = t.charAt(p++);
+        if (a || w === "\\") {
+          a = !a, E += w;
           continue;
         }
-        if (o) {
-          f === a + 1 ? (p === "^" || p === "!") && (c = !0) : p === "]" && !(f === a + 2 && c) && (o = !1), g += p;
+        if (c) {
+          p === l + 1 ? (w === "^" || w === "!") && (u = !0) : w === "]" && !(p === l + 2 && u) && (c = !1), E += w;
           continue;
-        } else if (p === "[") {
-          o = !0, a = f, c = !1, g += p;
+        } else if (w === "[") {
+          c = !0, l = p, u = !1, E += w;
           continue;
         }
-        if (!r.noext && tt(p) && t.charAt(f) === "(") {
-          e.push(g), g = "";
-          const S = new E(p, e);
-          f = E.#l(t, S, f, r), e.push(S);
+        if (!r.noext && q(w) && t.charAt(p) === "(" && i <= o) {
+          e.push(E), E = "";
+          const O = new x(w, e);
+          p = x.#u(t, O, p, r, i + 1), e.push(O);
           continue;
         }
-        g += p;
+        E += w;
       }
-      return e.push(g), f;
+      return e.push(E), p;
     }
-    let l = n + 1, h = new E(null, e);
+    let h = n + 1, f = new x(null, e);
     const d = [];
-    let u = "";
-    for (; l < t.length; ) {
-      const f = t.charAt(l++);
-      if (i || f === "\\") {
-        i = !i, u += f;
+    let g = "";
+    for (; h < t.length; ) {
+      const p = t.charAt(h++);
+      if (a || p === "\\") {
+        a = !a, g += p;
         continue;
       }
-      if (o) {
-        l === a + 1 ? (f === "^" || f === "!") && (c = !0) : f === "]" && !(l === a + 2 && c) && (o = !1), u += f;
+      if (c) {
+        h === l + 1 ? (p === "^" || p === "!") && (u = !0) : p === "]" && !(h === l + 2 && u) && (c = !1), g += p;
         continue;
-      } else if (f === "[") {
-        o = !0, a = l, c = !1, u += f;
+      } else if (p === "[") {
+        c = !0, l = h, u = !1, g += p;
         continue;
       }
-      if (tt(f) && t.charAt(l) === "(") {
-        h.push(u), u = "";
-        const g = new E(f, h);
-        h.push(g), l = E.#l(t, g, l, r);
+      if (!r.noext && q(p) && t.charAt(h) === "(" && /* c8 ignore start - the maxDepth is sufficient here */
+      (i <= o || e && e.#f(p))) {
+        const w = e && e.#f(p) ? 0 : 1;
+        f.push(g), g = "";
+        const y = new x(p, f);
+        f.push(y), h = x.#u(t, y, h, r, i + w);
         continue;
       }
-      if (f === "|") {
-        h.push(u), u = "", d.push(h), h = new E(null, e);
+      if (p === "|") {
+        f.push(g), g = "", d.push(f), f = new x(null, e);
         continue;
       }
-      if (f === ")")
-        return u === "" && e.#t.length === 0 && (e.#u = !0), h.push(u), u = "", e.push(...d, h), l;
-      u += f;
+      if (p === ")")
+        return g === "" && e.#t.length === 0 && (e.#h = !0), f.push(g), g = "", e.push(...d, f), h;
+      g += p;
     }
-    return e.type = null, e.#n = void 0, e.#t = [t.substring(n - 1)], l;
+    return e.type = null, e.#n = void 0, e.#t = [t.substring(n - 1)], h;
+  }
+  #y(t) {
+    return this.#d(t, se);
+  }
+  #d(t, e = ee) {
+    if (!t || typeof t != "object" || t.type !== null || t.#t.length !== 1 || this.type === null)
+      return !1;
+    const n = t.#t[0];
+    return !n || typeof n != "object" || n.type === null ? !1 : this.#f(n.type, e);
+  }
+  #f(t, e = ne) {
+    return !!e.get(this.type)?.includes(t);
+  }
+  #E(t, e) {
+    const n = t.#t[0], r = new x(null, n, this.options);
+    r.#t.push(""), n.push(r), this.#g(t, e);
+  }
+  #g(t, e) {
+    const n = t.#t[0];
+    this.#t.splice(e, 1, ...n.#t);
+    for (const r of n.#t)
+      typeof r == "object" && (r.#e = this);
+    this.#o = void 0;
+  }
+  #S(t) {
+    return !!st.get(this.type)?.has(t);
+  }
+  #b(t) {
+    if (!t || typeof t != "object" || t.type !== null || t.#t.length !== 1 || this.type === null || this.#t.length !== 1)
+      return !1;
+    const e = t.#t[0];
+    return !e || typeof e != "object" || e.type === null ? !1 : this.#S(e.type);
+  }
+  #x(t) {
+    const e = st.get(this.type), n = t.#t[0], r = e?.get(n.type);
+    if (!r)
+      return !1;
+    this.#t = n.#t;
+    for (const i of this.#t)
+      typeof i == "object" && (i.#e = this);
+    this.type = r, this.#o = void 0, this.#h = !1;
   }
   static fromGlob(t, e = {}) {
-    const n = new E(null, void 0, e);
-    return E.#l(t, n, 0, e), n;
+    const n = new x(null, void 0, e);
+    return x.#u(t, n, 0, e, 0), n;
   }
   // returns the regular expression if there's magic, or the unescaped
   // string if not.
@@ -521,16 +659,16 @@ class E {
     if (this !== this.#s)
       return this.#s.toMMPattern();
     const t = this.toString(), [e, n, r, i] = this.toRegExpSource();
-    if (!(r || this.#n || this.#r.nocase && !this.#r.nocaseMagicOnly && t.toUpperCase() !== t.toLowerCase()))
+    if (!(r || this.#n || this.#i.nocase && !this.#i.nocaseMagicOnly && t.toUpperCase() !== t.toLowerCase()))
       return n;
-    const a = (this.#r.nocase ? "i" : "") + (i ? "u" : "");
+    const a = (this.#i.nocase ? "i" : "") + (i ? "u" : "");
     return Object.assign(new RegExp(`^${e}$`, a), {
       _src: e,
       _glob: t
     });
   }
   get options() {
-    return this.#r;
+    return this.#i;
   }
   // returns the string match, the regexp source, whether there's magic
   // in the regexp (so a regular expression is required) and whether or
@@ -602,168 +740,187 @@ class E {
   // is ^(?!\.), we can just prepend (?!\.) to the pattern (either root
   // or start or whatever) and prepend ^ or / at the Regexp construction.
   toRegExpSource(t) {
-    const e = t ?? !!this.#r.dot;
-    if (this.#s === this && this.#d(), !this.type) {
-      const c = this.isStart() && this.isEnd(), l = this.#t.map((f) => {
-        const [g, p, S, A] = typeof f == "string" ? E.#p(f, this.#n, c) : f.toRegExpSource(t);
-        return this.#n = this.#n || S, this.#i = this.#i || A, g;
+    const e = t ?? !!this.#i.dot;
+    if (this.#s === this && (this.#p(), this.#w()), !et(this)) {
+      const c = this.isStart() && this.isEnd() && !this.#t.some((d) => typeof d != "string"), l = this.#t.map((d) => {
+        const [g, p, E, w] = typeof d == "string" ? x.#A(d, this.#n, c) : d.toRegExpSource(t);
+        return this.#n = this.#n || E, this.#r = this.#r || w, g;
       }).join("");
-      let h = "";
-      if (this.isStart() && typeof this.#t[0] == "string" && !(this.#t.length === 1 && Zt.has(this.#t[0]))) {
-        const g = Yt, p = (
+      let u = "";
+      if (this.isStart() && typeof this.#t[0] == "string" && !(this.#t.length === 1 && oe.has(this.#t[0]))) {
+        const g = ie, p = (
           // dots are allowed, and the pattern starts with [ or .
           e && g.has(l.charAt(0)) || // the pattern starts with \., and then [ or .
           l.startsWith("\\.") && g.has(l.charAt(2)) || // the pattern starts with \.\., and then [ or .
           l.startsWith("\\.\\.") && g.has(l.charAt(4))
-        ), S = !e && !t && g.has(l.charAt(0));
-        h = p ? Vt : S ? R : "";
+        ), E = !e && !t && g.has(l.charAt(0));
+        u = p ? re : E ? R : "";
       }
-      let d = "";
-      return this.isEnd() && this.#s.#a && this.#e?.type === "!" && (d = "(?:$|\\/)"), [
-        h + l + d,
-        I(l),
+      let h = "";
+      return this.isEnd() && this.#s.#c && this.#e?.type === "!" && (h = "(?:$|\\/)"), [
+        u + l + h,
+        F(l),
         this.#n = !!this.#n,
-        this.#i
+        this.#r
       ];
     }
     const n = this.type === "*" || this.type === "+", r = this.type === "!" ? "(?:(?!(?:" : "(?:";
-    let i = this.#f(e);
+    let i = this.#m(e);
     if (this.isStart() && this.isEnd() && !i && this.type !== "!") {
-      const c = this.toString();
-      return this.#t = [c], this.type = null, this.#n = void 0, [c, I(this.toString()), !1, !1];
+      const c = this.toString(), l = this;
+      return l.#t = [c], l.type = null, l.#n = void 0, [c, F(this.toString()), !1, !1];
     }
-    let o = !n || t || e || !R ? "" : this.#f(!0);
+    let o = !n || t || e || !R ? "" : this.#m(!0);
     o === i && (o = ""), o && (i = `(?:${i})(?:${o})*?`);
     let a = "";
-    if (this.type === "!" && this.#u)
-      a = (this.isStart() && !e ? R : "") + st;
+    if (this.type === "!" && this.#h)
+      a = (this.isStart() && !e ? R : "") + rt;
     else {
       const c = this.type === "!" ? (
         // !() must match something,but !(x) can match ''
-        "))" + (this.isStart() && !e && !t ? R : "") + et + ")"
+        "))" + (this.isStart() && !e && !t ? R : "") + nt + ")"
       ) : this.type === "@" ? ")" : this.type === "?" ? ")?" : this.type === "+" && o ? ")" : this.type === "*" && o ? ")?" : `)${this.type}`;
       a = r + i + c;
     }
     return [
       a,
-      I(i),
+      F(i),
       this.#n = !!this.#n,
-      this.#i
+      this.#r
     ];
   }
-  #f(t) {
+  #p() {
+    if (et(this)) {
+      let t = 0, e = !1;
+      do {
+        e = !0;
+        for (let n = 0; n < this.#t.length; n++) {
+          const r = this.#t[n];
+          typeof r == "object" && (r.#p(), this.#d(r) ? (e = !1, this.#g(r, n)) : this.#y(r) ? (e = !1, this.#E(r, n)) : this.#b(r) && (e = !1, this.#x(r)));
+        }
+      } while (!e && ++t < 10);
+    } else
+      for (const t of this.#t)
+        typeof t == "object" && t.#p();
+    this.#o = void 0;
+  }
+  #m(t) {
     return this.#t.map((e) => {
       if (typeof e == "string")
         throw new Error("string type in extglob ast??");
       const [n, r, i, o] = e.toRegExpSource(t);
-      return this.#i = this.#i || o, n;
+      return this.#r = this.#r || o, n;
     }).filter((e) => !(this.isStart() && this.isEnd()) || !!e).join("|");
   }
-  static #p(t, e, n = !1) {
-    let r = !1, i = "", o = !1;
-    for (let a = 0; a < t.length; a++) {
-      const c = t.charAt(a);
+  static #A(t, e, n = !1) {
+    let r = !1, i = "", o = !1, a = !1;
+    for (let c = 0; c < t.length; c++) {
+      const l = t.charAt(c);
       if (r) {
-        r = !1, i += (Jt.has(c) ? "\\" : "") + c;
+        r = !1, i += (ae.has(l) ? "\\" : "") + l;
         continue;
       }
-      if (c === "\\") {
-        a === t.length - 1 ? i += "\\\\" : r = !0;
+      if (l === "*") {
+        if (a)
+          continue;
+        a = !0, i += n && /^[*]+$/.test(t) ? rt : nt, e = !0;
+        continue;
+      } else
+        a = !1;
+      if (l === "\\") {
+        c === t.length - 1 ? i += "\\\\" : r = !0;
         continue;
       }
-      if (c === "[") {
-        const [l, h, d, u] = qt(t, a);
-        if (d) {
-          i += l, o = o || h, a += d - 1, e = e || u;
+      if (l === "[") {
+        const [u, h, f, d] = Kt(t, c);
+        if (f) {
+          i += u, o = o || h, c += f - 1, e = e || d;
           continue;
         }
       }
-      if (c === "*") {
-        n && t === "*" ? i += st : i += et, e = !0;
+      if (l === "?") {
+        i += V, e = !0;
         continue;
       }
-      if (c === "?") {
-        i += Y, e = !0;
-        continue;
-      }
-      i += Xt(c);
+      i += ce(l);
     }
-    return [i, I(t), !!e, o];
+    return [i, F(t), !!e, o];
   }
 }
-const Kt = (s, { windowsPathsNoEscape: t = !1 } = {}) => t ? s.replace(/[?*()[\]]/g, "[$&]") : s.replace(/[?*()[\]\\]/g, "\\$&"), y = (s, t, e = {}) => (L(t), !e.nocomment && t.charAt(0) === "#" ? !1 : new W(t, e).match(s)), Qt = /^\*+([^+@!?\*\[\(]*)$/, te = (s) => (t) => !t.startsWith(".") && t.endsWith(s), ee = (s) => (t) => t.endsWith(s), se = (s) => (s = s.toLowerCase(), (t) => !t.startsWith(".") && t.toLowerCase().endsWith(s)), ne = (s) => (s = s.toLowerCase(), (t) => t.toLowerCase().endsWith(s)), re = /^\*+\.\*+$/, ie = (s) => !s.startsWith(".") && s.includes("."), oe = (s) => s !== "." && s !== ".." && s.includes("."), ae = /^\.\*+$/, ce = (s) => s !== "." && s !== ".." && s.startsWith("."), he = /^\*+$/, le = (s) => s.length !== 0 && !s.startsWith("."), ue = (s) => s.length !== 0 && s !== "." && s !== "..", fe = /^\?+([^+@!?\*\[\(]*)?$/, de = ([s, t = ""]) => {
-  const e = ft([s]);
+x = Y;
+const he = (s, { windowsPathsNoEscape: t = !1, magicalBraces: e = !1 } = {}) => e ? t ? s.replace(/[?*()[\]{}]/g, "[$&]") : s.replace(/[?*()[\]\\{}]/g, "\\$&") : t ? s.replace(/[?*()[\]]/g, "[$&]") : s.replace(/[?*()[\]\\]/g, "\\$&"), S = (s, t, e = {}) => (k(t), !e.nocomment && t.charAt(0) === "#" ? !1 : new L(t, e).match(s)), ue = /^\*+([^+@!?*[(]*)$/, fe = (s) => (t) => !t.startsWith(".") && t.endsWith(s), pe = (s) => (t) => t.endsWith(s), de = (s) => (s = s.toLowerCase(), (t) => !t.startsWith(".") && t.toLowerCase().endsWith(s)), ge = (s) => (s = s.toLowerCase(), (t) => t.toLowerCase().endsWith(s)), me = /^\*+\.\*+$/, we = (s) => !s.startsWith(".") && s.includes("."), ye = (s) => s !== "." && s !== ".." && s.includes("."), Ee = /^\.\*+$/, Se = (s) => s !== "." && s !== ".." && s.startsWith("."), be = /^\*+$/, xe = (s) => s.length !== 0 && !s.startsWith("."), Ae = (s) => s.length !== 0 && s !== "." && s !== "..", ve = /^\?+([^+@!?*[(]*)?$/, Oe = ([s, t = ""]) => {
+  const e = gt([s]);
   return t ? (t = t.toLowerCase(), (n) => e(n) && n.toLowerCase().endsWith(t)) : e;
-}, pe = ([s, t = ""]) => {
-  const e = dt([s]);
+}, $e = ([s, t = ""]) => {
+  const e = mt([s]);
   return t ? (t = t.toLowerCase(), (n) => e(n) && n.toLowerCase().endsWith(t)) : e;
-}, ge = ([s, t = ""]) => {
-  const e = dt([s]);
+}, Ne = ([s, t = ""]) => {
+  const e = mt([s]);
   return t ? (n) => e(n) && n.endsWith(t) : e;
-}, me = ([s, t = ""]) => {
-  const e = ft([s]);
+}, De = ([s, t = ""]) => {
+  const e = gt([s]);
   return t ? (n) => e(n) && n.endsWith(t) : e;
-}, ft = ([s]) => {
+}, gt = ([s]) => {
   const t = s.length;
   return (e) => e.length === t && !e.startsWith(".");
-}, dt = ([s]) => {
+}, mt = ([s]) => {
   const t = s.length;
   return (e) => e.length === t && e !== "." && e !== "..";
-}, pt = typeof process == "object" && process ? typeof process.env == "object" && process.env && process.env.__MINIMATCH_TESTING_PLATFORM__ || process.platform : "posix", nt = {
+}, wt = typeof process == "object" && process ? typeof process.env == "object" && process.env && process.env.__MINIMATCH_TESTING_PLATFORM__ || process.platform : "posix", it = {
   win32: { sep: "\\" },
   posix: { sep: "/" }
-}, we = pt === "win32" ? nt.win32.sep : nt.posix.sep;
-y.sep = we;
-const b = Symbol("globstar **");
-y.GLOBSTAR = b;
-const ye = "[^/]", Ee = ye + "*?", Se = "(?:(?!(?:\\/|^)(?:\\.{1,2})($|\\/)).)*?", xe = "(?:(?!(?:\\/|^)\\.).)*?", ve = (s, t = {}) => (e) => y(e, s, t);
-y.filter = ve;
-const v = (s, t = {}) => Object.assign({}, s, t), be = (s) => {
+}, Te = wt === "win32" ? it.win32.sep : it.posix.sep;
+S.sep = Te;
+const b = /* @__PURE__ */ Symbol("globstar **");
+S.GLOBSTAR = b;
+const Ce = "[^/]", Me = Ce + "*?", Fe = "(?:(?!(?:\\/|^)(?:\\.{1,2})($|\\/)).)*?", Re = "(?:(?!(?:\\/|^)\\.).)*?", Pe = (s, t = {}) => (e) => S(e, s, t);
+S.filter = Pe;
+const A = (s, t = {}) => Object.assign({}, s, t), ke = (s) => {
   if (!s || typeof s != "object" || !Object.keys(s).length)
-    return y;
-  const t = y;
-  return Object.assign((n, r, i = {}) => t(n, r, v(s, i)), {
+    return S;
+  const t = S;
+  return Object.assign((n, r, i = {}) => t(n, r, A(s, i)), {
     Minimatch: class extends t.Minimatch {
       constructor(r, i = {}) {
-        super(r, v(s, i));
+        super(r, A(s, i));
       }
       static defaults(r) {
-        return t.defaults(v(s, r)).Minimatch;
+        return t.defaults(A(s, r)).Minimatch;
       }
     },
     AST: class extends t.AST {
       /* c8 ignore start */
       constructor(r, i, o = {}) {
-        super(r, i, v(s, o));
+        super(r, i, A(s, o));
       }
       /* c8 ignore stop */
       static fromGlob(r, i = {}) {
-        return t.AST.fromGlob(r, v(s, i));
+        return t.AST.fromGlob(r, A(s, i));
       }
     },
-    unescape: (n, r = {}) => t.unescape(n, v(s, r)),
-    escape: (n, r = {}) => t.escape(n, v(s, r)),
-    filter: (n, r = {}) => t.filter(n, v(s, r)),
-    defaults: (n) => t.defaults(v(s, n)),
-    makeRe: (n, r = {}) => t.makeRe(n, v(s, r)),
-    braceExpand: (n, r = {}) => t.braceExpand(n, v(s, r)),
-    match: (n, r, i = {}) => t.match(n, r, v(s, i)),
+    unescape: (n, r = {}) => t.unescape(n, A(s, r)),
+    escape: (n, r = {}) => t.escape(n, A(s, r)),
+    filter: (n, r = {}) => t.filter(n, A(s, r)),
+    defaults: (n) => t.defaults(A(s, n)),
+    makeRe: (n, r = {}) => t.makeRe(n, A(s, r)),
+    braceExpand: (n, r = {}) => t.braceExpand(n, A(s, r)),
+    match: (n, r, i = {}) => t.match(n, r, A(s, i)),
     sep: t.sep,
     GLOBSTAR: b
   });
 };
-y.defaults = be;
-const gt = (s, t = {}) => (L(s), t.nobrace || !/\{(?:(?!\{).)*\}/.test(s) ? [s] : Lt(s));
-y.braceExpand = gt;
-const Oe = (s, t = {}) => new W(s, t).makeRe();
-y.makeRe = Oe;
-const Ae = (s, t, e = {}) => {
-  const n = new W(t, e);
+S.defaults = ke;
+const yt = (s, t = {}) => (k(s), t.nobrace || !/\{(?:(?!\{).)*\}/.test(s) ? [s] : Ht(s, { max: t.braceExpandMax }));
+S.braceExpand = yt;
+const Ie = (s, t = {}) => new L(s, t).makeRe();
+S.makeRe = Ie;
+const Le = (s, t, e = {}) => {
+  const n = new L(t, e);
   return s = s.filter((r) => n.match(r)), n.options.nonull && !s.length && s.push(t), s;
 };
-y.match = Ae;
-const rt = /[?*]|[+@!]\(.*?\)|\[|\]/, De = (s) => s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&");
-class W {
+S.match = Le;
+const ot = /[?*]|[+@!]\(.*?\)|\[|\]/, ze = (s) => s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&");
+class L {
   options;
   set;
   pattern;
@@ -780,9 +937,12 @@ class W {
   isWindows;
   platform;
   windowsNoMagicRoot;
+  maxGlobstarRecursion;
   regexp;
   constructor(t, e = {}) {
-    L(t), e = e || {}, this.options = e, this.pattern = t, this.platform = e.platform || pt, this.isWindows = this.platform === "win32", this.windowsPathsNoEscape = !!e.windowsPathsNoEscape || e.allowWindowsEscape === !1, this.windowsPathsNoEscape && (this.pattern = this.pattern.replace(/\\/g, "/")), this.preserveMultipleSlashes = !!e.preserveMultipleSlashes, this.regexp = null, this.negate = !1, this.nonegate = !!e.nonegate, this.comment = !1, this.empty = !1, this.partial = !!e.partial, this.nocase = !!this.options.nocase, this.windowsNoMagicRoot = e.windowsNoMagicRoot !== void 0 ? e.windowsNoMagicRoot : !!(this.isWindows && this.nocase), this.globSet = [], this.globParts = [], this.set = [], this.make();
+    k(t), e = e || {}, this.options = e, this.maxGlobstarRecursion = e.maxGlobstarRecursion ?? 200, this.pattern = t, this.platform = e.platform || wt, this.isWindows = this.platform === "win32";
+    const n = "allowWindowsEscape";
+    this.windowsPathsNoEscape = !!e.windowsPathsNoEscape || e[n] === !1, this.windowsPathsNoEscape && (this.pattern = this.pattern.replace(/\\/g, "/")), this.preserveMultipleSlashes = !!e.preserveMultipleSlashes, this.regexp = null, this.negate = !1, this.nonegate = !!e.nonegate, this.comment = !1, this.empty = !1, this.partial = !!e.partial, this.nocase = !!this.options.nocase, this.windowsNoMagicRoot = e.windowsNoMagicRoot !== void 0 ? e.windowsNoMagicRoot : !!(this.isWindows && this.nocase), this.globSet = [], this.globParts = [], this.set = [], this.make();
   }
   hasMagic() {
     if (this.options.magicalBraces && this.set.length > 1)
@@ -810,11 +970,14 @@ class W {
     this.globParts = this.preprocess(n), this.debug(this.pattern, this.globParts);
     let r = this.globParts.map((i, o, a) => {
       if (this.isWindows && this.windowsNoMagicRoot) {
-        const c = i[0] === "" && i[1] === "" && (i[2] === "?" || !rt.test(i[2])) && !rt.test(i[3]), l = /^[a-z]:/i.test(i[0]);
+        const c = i[0] === "" && i[1] === "" && (i[2] === "?" || !ot.test(i[2])) && !ot.test(i[3]), l = /^[a-z]:/i.test(i[0]);
         if (c)
-          return [...i.slice(0, 4), ...i.slice(4).map((h) => this.parse(h))];
+          return [
+            ...i.slice(0, 4),
+            ...i.slice(4).map((u) => this.parse(u))
+          ];
         if (l)
-          return [i[0], ...i.slice(1).map((h) => this.parse(h))];
+          return [i[0], ...i.slice(1).map((u) => this.parse(u))];
       }
       return i.map((c) => this.parse(c));
     });
@@ -832,9 +995,9 @@ class W {
   // of patterns that we have to process.
   preprocess(t) {
     if (this.options.noglobstar)
-      for (let n = 0; n < t.length; n++)
-        for (let r = 0; r < t[n].length; r++)
-          t[n][r] === "**" && (t[n][r] = "*");
+      for (const n of t)
+        for (let r = 0; r < n.length; r++)
+          n[r] === "**" && (n[r] = "*");
     const { optimizationLevel: e = 1 } = this.options;
     return e >= 2 ? (t = this.firstPhasePreProcess(t), t = this.secondPhasePreProcess(t)) : e >= 1 ? t = this.levelOneOptimize(t) : t = this.adjascentGlobstarOptimize(t), t;
   }
@@ -872,7 +1035,7 @@ class W {
       let n = 0;
       for (; (n = t.indexOf("..", n + 1)) !== -1; ) {
         const r = t[n - 1];
-        r && r !== "." && r !== ".." && r !== "**" && (e = !0, t.splice(n - 1, 2), n -= 2);
+        r && r !== "." && r !== ".." && r !== "**" && !(this.isWindows && /^[a-z]:$/i.test(r)) && (e = !0, t.splice(n - 1, 2), n -= 2);
       }
     } while (e);
     return t.length === 0 ? [""] : t;
@@ -911,8 +1074,8 @@ class W {
           if (a !== ".." || !c || c === "." || c === ".." || !l || l === "." || l === "..")
             continue;
           e = !0, n.splice(r, 1);
-          const h = n.slice(0);
-          h[r] = "**", t.push(h), r--;
+          const u = n.slice(0);
+          u[r] = "**", t.push(u), r--;
         }
         if (!this.preserveMultipleSlashes) {
           for (let o = 1; o < n.length - 1; o++) {
@@ -988,69 +1151,128 @@ class W {
   // out of pattern, then that's fine, as long as all
   // the parts match.
   matchOne(t, e, n = !1) {
-    const r = this.options;
+    let r = 0, i = 0;
     if (this.isWindows) {
-      const p = typeof t[0] == "string" && /^[a-z]:$/i.test(t[0]), S = !p && t[0] === "" && t[1] === "" && t[2] === "?" && /^[a-z]:$/i.test(t[3]), A = typeof e[0] == "string" && /^[a-z]:$/i.test(e[0]), C = !A && e[0] === "" && e[1] === "" && e[2] === "?" && typeof e[3] == "string" && /^[a-z]:$/i.test(e[3]), x = S ? 3 : p ? 0 : void 0, w = C ? 3 : A ? 0 : void 0;
-      if (typeof x == "number" && typeof w == "number") {
-        const [T, P] = [t[x], e[w]];
-        T.toLowerCase() === P.toLowerCase() && (e[w] = T, w > x ? e = e.slice(w) : x > w && (t = t.slice(x)));
+      const a = typeof t[0] == "string" && /^[a-z]:$/i.test(t[0]), c = !a && t[0] === "" && t[1] === "" && t[2] === "?" && /^[a-z]:$/i.test(t[3]), l = typeof e[0] == "string" && /^[a-z]:$/i.test(e[0]), u = !l && e[0] === "" && e[1] === "" && e[2] === "?" && typeof e[3] == "string" && /^[a-z]:$/i.test(e[3]), h = c ? 3 : a ? 0 : void 0, f = u ? 3 : l ? 0 : void 0;
+      if (typeof h == "number" && typeof f == "number") {
+        const [d, g] = [
+          t[h],
+          e[f]
+        ];
+        d.toLowerCase() === g.toLowerCase() && (e[f] = d, i = f, r = h);
       }
     }
-    const { optimizationLevel: i = 1 } = this.options;
-    i >= 2 && (t = this.levelTwoFileOptimize(t)), this.debug("matchOne", this, { file: t, pattern: e }), this.debug("matchOne", t.length, e.length);
-    for (var o = 0, a = 0, c = t.length, l = e.length; o < c && a < l; o++, a++) {
-      this.debug("matchOne loop");
-      var h = e[a], d = t[o];
-      if (this.debug(e, h, d), h === !1)
+    const { optimizationLevel: o = 1 } = this.options;
+    return o >= 2 && (t = this.levelTwoFileOptimize(t)), e.includes(b) ? this.#s(t, e, n, r, i) : this.#r(t, e, n, r, i);
+  }
+  #s(t, e, n, r, i) {
+    const o = e.indexOf(b, i), a = e.lastIndexOf(b), [c, l, u] = n ? [
+      e.slice(i, o),
+      e.slice(o + 1),
+      []
+    ] : [
+      e.slice(i, o),
+      e.slice(o + 1, a),
+      e.slice(a + 1)
+    ];
+    if (c.length) {
+      const y = t.slice(r, r + c.length);
+      if (!this.#r(y, c, n, 0, 0))
         return !1;
-      if (h === b) {
-        this.debug("GLOBSTAR", [e, h, d]);
-        var u = o, f = a + 1;
-        if (f === l) {
-          for (this.debug("** at the end"); o < c; o++)
-            if (t[o] === "." || t[o] === ".." || !r.dot && t[o].charAt(0) === ".")
-              return !1;
-          return !0;
-        }
-        for (; u < c; ) {
-          var g = t[u];
-          if (this.debug(`
-globstar while`, t, u, e, f, g), this.matchOne(t.slice(u), e.slice(f), n))
-            return this.debug("globstar found match!", u, c, g), !0;
-          if (g === "." || g === ".." || !r.dot && g.charAt(0) === ".") {
-            this.debug("dot detected!", t, u, e, f);
-            break;
-          }
-          this.debug("globstar swallow a segment, and continue"), u++;
-        }
-        return !!(n && (this.debug(`
->>> no match, partial?`, t, u, e, f), u === c));
+      r += c.length, i += c.length;
+    }
+    let h = 0;
+    if (u.length) {
+      if (u.length + r > t.length)
+        return !1;
+      let y = t.length - u.length;
+      if (this.#r(t, u, n, y, 0))
+        h = u.length;
+      else {
+        if (t[t.length - 1] !== "" || r + u.length === t.length || (y--, !this.#r(t, u, n, y, 0)))
+          return !1;
+        h = u.length + 1;
+      }
+    }
+    if (!l.length) {
+      let y = !!h;
+      for (let O = r; O < t.length - h; O++) {
+        const z = String(t[O]);
+        if (y = !0, z === "." || z === ".." || !this.options.dot && z.startsWith("."))
+          return !1;
       }
-      let p;
-      if (typeof h == "string" ? (p = d === h, this.debug("string match", h, d, p)) : (p = h.test(d), this.debug("pattern match", h, d, p)), !p)
+      return n || y;
+    }
+    const f = [[[], 0]];
+    let d = f[0], g = 0;
+    const p = [0];
+    for (const y of l)
+      y === b ? (p.push(g), d = [[], 0], f.push(d)) : (d[0].push(y), g++);
+    let E = f.length - 1;
+    const w = t.length - h;
+    for (const y of f)
+      y[1] = w - (p[E--] + y[0].length);
+    return !!this.#n(t, f, r, 0, n, 0, !!h);
+  }
+  // return false for "nope, not matching"
+  // return null for "not matching, cannot keep trying"
+  #n(t, e, n, r, i, o, a) {
+    const c = e[r];
+    if (!c) {
+      for (let h = n; h < t.length; h++) {
+        a = !0;
+        const f = t[h];
+        if (f === "." || f === ".." || !this.options.dot && f.startsWith("."))
+          return !1;
+      }
+      return a;
+    }
+    const [l, u] = c;
+    for (; n <= u; ) {
+      if (this.#r(t.slice(0, n + l.length), l, i, n, 0) && o < this.maxGlobstarRecursion) {
+        const d = this.#n(t, e, n + l.length, r + 1, i, o + 1, a);
+        if (d !== !1)
+          return d;
+      }
+      const f = t[n];
+      if (f === "." || f === ".." || !this.options.dot && f.startsWith("."))
+        return !1;
+      n++;
+    }
+    return i || null;
+  }
+  #r(t, e, n, r, i) {
+    let o, a, c, l;
+    for (o = r, a = i, l = t.length, c = e.length; o < l && a < c; o++, a++) {
+      this.debug("matchOne loop");
+      let u = e[a], h = t[o];
+      if (this.debug(e, u, h), u === !1 || u === b)
+        return !1;
+      let f;
+      if (typeof u == "string" ? (f = h === u, this.debug("string match", u, h, f)) : (f = u.test(h), this.debug("pattern match", u, h, f)), !f)
         return !1;
     }
-    if (o === c && a === l)
+    if (o === l && a === c)
       return !0;
-    if (o === c)
+    if (o === l)
       return n;
-    if (a === l)
-      return o === c - 1 && t[o] === "";
+    if (a === c)
+      return o === l - 1 && t[o] === "";
     throw new Error("wtf?");
   }
   braceExpand() {
-    return gt(this.pattern, this.options);
+    return yt(this.pattern, this.options);
   }
   parse(t) {
-    L(t);
+    k(t);
     const e = this.options;
     if (t === "**")
       return b;
     if (t === "")
       return "";
     let n, r = null;
-    (n = t.match(he)) ? r = e.dot ? ue : le : (n = t.match(Qt)) ? r = (e.nocase ? e.dot ? ne : se : e.dot ? ee : te)(n[1]) : (n = t.match(fe)) ? r = (e.nocase ? e.dot ? pe : de : e.dot ? ge : me)(n) : (n = t.match(re)) ? r = e.dot ? oe : ie : (n = t.match(ae)) && (r = ce);
-    const i = E.fromGlob(t, this.options).toMMPattern();
+    (n = t.match(be)) ? r = e.dot ? Ae : xe : (n = t.match(ue)) ? r = (e.nocase ? e.dot ? ge : de : e.dot ? pe : fe)(n[1]) : (n = t.match(ve)) ? r = (e.nocase ? e.dot ? $e : Oe : e.dot ? Ne : De)(n) : (n = t.match(me)) ? r = e.dot ? ye : we : (n = t.match(Ee)) && (r = Se);
+    const i = Y.fromGlob(t, this.options).toMMPattern();
     return r && typeof i == "object" && Reflect.defineProperty(i, "test", { value: r }), i;
   }
   makeRe() {
@@ -1059,21 +1281,29 @@ globstar while`, t, u, e, f, g), this.matchOne(t.slice(u), e.slice(f), n))
     const t = this.set;
     if (!t.length)
       return this.regexp = !1, this.regexp;
-    const e = this.options, n = e.noglobstar ? Ee : e.dot ? Se : xe, r = new Set(e.nocase ? ["i"] : []);
+    const e = this.options, n = e.noglobstar ? Me : e.dot ? Fe : Re, r = new Set(e.nocase ? ["i"] : []);
     let i = t.map((c) => {
       const l = c.map((h) => {
         if (h instanceof RegExp)
-          for (const d of h.flags.split(""))
-            r.add(d);
-        return typeof h == "string" ? De(h) : h === b ? b : h._src;
+          for (const f of h.flags.split(""))
+            r.add(f);
+        return typeof h == "string" ? ze(h) : h === b ? b : h._src;
       });
-      return l.forEach((h, d) => {
-        const u = l[d + 1], f = l[d - 1];
-        h !== b || f === b || (f === void 0 ? u !== void 0 && u !== b ? l[d + 1] = "(?:\\/|" + n + "\\/)?" + u : l[d] = n : u === void 0 ? l[d - 1] = f + "(?:\\/|" + n + ")?" : u !== b && (l[d - 1] = f + "(?:\\/|\\/" + n + "\\/)" + u, l[d + 1] = b));
-      }), l.filter((h) => h !== b).join("/");
+      l.forEach((h, f) => {
+        const d = l[f + 1], g = l[f - 1];
+        h !== b || g === b || (g === void 0 ? d !== void 0 && d !== b ? l[f + 1] = "(?:\\/|" + n + "\\/)?" + d : l[f] = n : d === void 0 ? l[f - 1] = g + "(?:\\/|\\/" + n + ")?" : d !== b && (l[f - 1] = g + "(?:\\/|\\/" + n + "\\/)" + d, l[f + 1] = b));
+      });
+      const u = l.filter((h) => h !== b);
+      if (this.partial && u.length >= 1) {
+        const h = [];
+        for (let f = 1; f <= u.length; f++)
+          h.push(u.slice(0, f).join("/"));
+        return "(?:" + h.join("|") + ")";
+      }
+      return u.join("/");
     }).join("|");
     const [o, a] = t.length > 1 ? ["(?:", ")"] : ["", ""];
-    i = "^" + o + i + a + "$", this.negate && (i = "^(?!" + i + ").+$");
+    i = "^" + o + i + a + "$", this.partial && (i = "^(?:\\/|" + o + i.slice(1, -1) + a + ")$"), this.negate && (i = "^(?!" + i + ").+$");
     try {
       this.regexp = new RegExp(i, [...r].join(""));
     } catch {
@@ -1082,7 +1312,7 @@ globstar while`, t, u, e, f, g), this.matchOne(t.slice(u), e.slice(f), n))
     return this.regexp;
   }
   slashSplit(t) {
-    return this.preserveMultipleSlashes ? t.split("/") : this.isWindows && /^\/\/[^\/]+/.test(t) ? ["", ...t.split(/\/+/)] : t.split(/\/+/);
+    return this.preserveMultipleSlashes ? t.split("/") : this.isWindows && /^\/\/[^/]+/.test(t) ? ["", ...t.split(/\/+/)] : t.split(/\/+/);
   }
   match(t, e = this.partial) {
     if (this.debug("match", t, this.pattern), this.comment)
@@ -1101,23 +1331,22 @@ globstar while`, t, u, e, f, g), this.matchOne(t.slice(u), e.slice(f), n))
     if (!o)
       for (let a = r.length - 2; !o && a >= 0; a--)
         o = r[a];
-    for (let a = 0; a < i.length; a++) {
-      const c = i[a];
-      let l = r;
-      if (n.matchBase && c.length === 1 && (l = [o]), this.matchOne(l, c, e))
+    for (const a of i) {
+      let c = r;
+      if (n.matchBase && a.length === 1 && (c = [o]), this.matchOne(c, a, e))
         return n.flipNegate ? !0 : !this.negate;
     }
     return n.flipNegate ? !1 : this.negate;
   }
   static defaults(t) {
-    return y.defaults(t).Minimatch;
+    return S.defaults(t).Minimatch;
   }
 }
-y.AST = E;
-y.Minimatch = W;
-y.escape = Kt;
-y.unescape = I;
-const Ne = [
+S.AST = Y;
+S.Minimatch = L;
+S.escape = he;
+S.unescape = F;
+const je = [
   // Images
   ".jpg",
   ".jpeg",
@@ -1174,14 +1403,14 @@ const Ne = [
   ".fbx",
   ".3ds"
 ];
-function He(s) {
+function ss(s) {
   const t = s.lastIndexOf(".");
   if (t <= 0)
     return !0;
   const e = s.slice(t).toLowerCase();
-  return Ne.includes(e);
+  return je.includes(e);
 }
-function $e(s, t = "utf-8") {
+function We(s, t = "utf-8") {
   switch (t) {
     case "utf8":
     case "utf-8":
@@ -1190,24 +1419,24 @@ function $e(s, t = "utf-8") {
     case "utf-16le":
     case "ucs2":
     case "ucs-2":
-      return Ce(s);
+      return _e(s);
     case "ascii":
-      return Fe(s);
+      return He(s);
     case "latin1":
-      return Me(s);
+      return Ue(s);
     case "binary":
       return Uint8Array.from(s, (e) => e.charCodeAt(0));
     case "base64":
       return Uint8Array.from(atob(s), (e) => e.charCodeAt(0));
     case "hex":
       if (!/^[\da-f]+$/i.test(s) || s.length % 2 !== 0)
-        throw new D("format", "Invalid hex string");
+        throw new $("format", "Invalid hex string");
       return Uint8Array.from(s.match(/.{1,2}/g).map((e) => parseInt(e, 16)));
     default:
       return console.warn("Encoding not supported, falling back to UTF-8"), new TextEncoder().encode(s);
   }
 }
-function _e(s, t = "utf-8") {
+function ns(s, t = "utf-8") {
   switch (t) {
     case "utf8":
     case "utf-8":
@@ -1216,7 +1445,7 @@ function _e(s, t = "utf-8") {
     case "utf-16le":
     case "ucs2":
     case "ucs-2":
-      return Te(s);
+      return Be(s);
     case "latin1":
       return String.fromCharCode(...s);
     case "ascii":
@@ -1229,7 +1458,7 @@ function _e(s, t = "utf-8") {
       return console.warn("Unsupported encoding, falling back to UTF-8"), new TextDecoder().decode(s);
   }
 }
-function Ce(s) {
+function _e(s) {
   const t = new Uint8Array(s.length * 2);
   for (let e = 0; e < s.length; e++) {
     const n = s.charCodeAt(e);
@@ -1237,64 +1466,72 @@ function Ce(s) {
   }
   return t;
 }
-function Te(s) {
+function Be(s) {
   s.length % 2 !== 0 && (console.warn("Invalid UTF-16LE buffer length, truncating last byte"), s = s.slice(0, s.length - 1));
   const t = new Uint16Array(s.buffer, s.byteOffset, s.byteLength / 2);
   return String.fromCharCode(...t);
 }
-function Me(s) {
+function Ue(s) {
   const t = new Uint8Array(s.length);
   for (let e = 0; e < s.length; e++)
     t[e] = s.charCodeAt(e) & 255;
   return t;
 }
-function Fe(s) {
+function He(s) {
   const t = new Uint8Array(s.length);
   for (let e = 0; e < s.length; e++)
     t[e] = s.charCodeAt(e) & 127;
   return t;
 }
-function Ie() {
+function Ge() {
   if (!("storage" in navigator) || !("getDirectory" in navigator.storage))
-    throw new wt();
+    throw new xt();
+}
+function qe(s, t) {
+  const e = T(s || "/"), n = T(St(t));
+  return e === "/" ? n : n === "/" ? e : `${e.replace(/\/$/, "")}${n}`;
 }
-async function Pe(s, t) {
-  return typeof navigator < "u" && navigator.locks?.request ? navigator.locks.request(`opfs:${s.replace(/\/+/g, "/")}`, { mode: "exclusive" }, t) : t();
+async function Et(s, t, e = "/") {
+  if (typeof navigator < "u" && navigator.locks?.request) {
+    const n = qe(e, s).replace(/\/+/g, "/");
+    return navigator.locks.request(`opfs:${n}`, { mode: "exclusive" }, t);
+  }
+  return t();
 }
-function $(s) {
+function D(s) {
   return Array.isArray(s) ? s : (s.startsWith("~/") ? s.slice(2) : s).split("/").filter(Boolean);
 }
 function Z(s) {
   return typeof s == "string" ? s ?? "/" : `/${s.join("/")}`;
 }
-function z(s) {
-  const t = $(s);
+function I(s) {
+  const t = D(s);
   return t[t.length - 1] || "";
 }
-function H(s) {
-  const t = $(s);
+function _(s) {
+  const t = D(s);
   return t.pop(), Z(t);
 }
-function j(s) {
+function T(s) {
   return !s || s === "/" ? "/" : s.startsWith("~/") ? `/${s.slice(2)}` : s.startsWith("/") ? s : `/${s}`;
 }
-function Re(s, t = !1) {
+function Xe(s, t = !1) {
   return s = s.replace(/\/$/, ""), t && !s.includes("*") ? `${s}/**` : s;
 }
-function _(s, t) {
-  return y(s, t, {
+function B(s, t) {
+  return S(s, t, {
     dot: !0,
     matchBase: !0
   });
 }
-function qe(s, t) {
+function rs(s, t) {
   if (!t || Array.isArray(t) && t.length === 0)
     return !1;
-  const e = j(s);
-  return (Array.isArray(t) ? t : [t]).some((r) => y(e, r, { dot: !0 }));
+  const e = T(s);
+  return (Array.isArray(t) ? t : [t]).some((r) => S(e, r, { dot: !0 }));
 }
-function ke(s) {
-  const t = j(s), e = $(t), n = [];
+function St(s) {
+  const t = T(s), e = D(t), n = [];
   for (const r of e)
     if (!(r === "." || r === ""))
       if (r === "..") {
@@ -1305,20 +1542,20 @@ function ke(s) {
         n.push(r);
   return Z(n);
 }
-function Ge(s) {
-  const t = z(s), e = t.lastIndexOf(".");
+function is(s) {
+  const t = I(s), e = t.lastIndexOf(".");
   return e <= 0 || e === t.length - 1 ? "" : t.slice(e);
 }
-function Ve(s, t = "utf-8") {
-  return typeof s == "string" ? $e(s, t) : s instanceof Uint8Array ? s : new Uint8Array(s);
+function os(s, t = "utf-8") {
+  return typeof s == "string" ? We(s, t) : s instanceof Uint8Array ? s : new Uint8Array(s);
 }
-async function Le(s, t = "SHA-1", e = 50 * 1024 * 1024) {
+async function Ve(s, t = "SHA-1", e = 50 * 1024 * 1024) {
   if (s instanceof File && (s = await s.arrayBuffer()), s.byteLength > e)
     throw new Error(`File size ${s.byteLength} bytes exceeds maximum allowed size ${e} bytes`);
   const n = new Uint8Array(s), r = await crypto.subtle.digest(t, n);
   return Array.from(new Uint8Array(r)).map((o) => o.toString(16).padStart(2, "0")).join("");
 }
-function Ye(s, t) {
+function as(s, t) {
   if (s.length !== t.length)
     return !1;
   for (let e = 0; e < s.length; e++)
@@ -1326,13 +1563,13 @@ function Ye(s, t) {
       return !1;
   return !0;
 }
-async function ze(s) {
+async function cs(s) {
   const t = await s.arrayBuffer();
   return new Uint8Array(t);
 }
-async function je(s, t, e = {}) {
-  const n = z(t);
-  return Pe(t, async () => {
+async function Ye(s, t, e = {}) {
+  const n = I(t);
+  return Et(t, async () => {
     const r = e.recursive ?? !1, i = e.force ?? !1;
     try {
       await s.removeEntry(n, { recursive: r });
@@ -1340,45 +1577,45 @@ async function je(s, t, e = {}) {
       if (o.name === "NotFoundError" && i)
         return;
       const a = o.name === "TypeMismatchError" && !r;
-      throw O(o, {
+      throw v(o, {
         path: t,
         operation: "remove",
         isDirectory: a
       });
     }
-  });
+  }, e.root ?? "/");
 }
-function Ze(s, t, e, n) {
+function ls(s, t, e, n) {
   if (!Number.isInteger(t) || !Number.isInteger(e))
-    throw new D("argument", "Invalid offset or length");
+    throw new $("argument", "Invalid offset or length");
   if (t < 0 || e < 0)
-    throw new D("argument", "Negative offset or length not allowed");
+    throw new $("argument", "Negative offset or length not allowed");
   if (t + e > s)
-    throw new D("overflow", "Operation would overflow buffer");
+    throw new $("overflow", "Operation would overflow buffer");
   if (n != null && (!Number.isInteger(n) || n < 0))
-    throw new D("argument", "Invalid position");
+    throw new $("argument", "Invalid position");
 }
-function Je(s, t, e) {
+function hs(s, t, e) {
   try {
     t.flush(), t.close();
   } catch (n) {
     console.warn(`Warning: Failed to properly close file descriptor ${s} (${e}):`, n);
   }
 }
-function Xe(s, t, e) {
+function us(s, t, e) {
   if (s >= e)
     return { isEOF: !0, actualLength: 0 };
   const n = Math.min(t, e - s);
   return n <= 0 ? { isEOF: !0, actualLength: 0 } : { isEOF: !1, actualLength: n };
 }
-async function Ke(s, t) {
+async function fs(s, t) {
   try {
     return await s.createSyncAccessHandle();
   } catch (e) {
-    throw O(e, { path: t, isDirectory: !1 });
+    throw v(e, { path: t, isDirectory: !1 });
   }
 }
-class Qe {
+class ps {
   /** Root directory handle for the file system */
   root;
   /** Map of watched paths and options */
@@ -1407,7 +1644,7 @@ class Qe {
     if (!this.options.broadcastChannel)
       return;
     const e = t.path;
-    if (![...this.watchers.values()].some((i) => _(e, i.pattern) && i.include.some((o) => o && _(e, o)) && !i.exclude.some((o) => o && _(e, o))))
+    if (![...this.watchers.values()].some((i) => B(e, i.pattern) && i.include.some((o) => o && B(e, o)) && !i.exclude.some((o) => o && B(e, o))))
       return;
     let r;
     if (this.options.hashAlgorithm)
@@ -1429,7 +1666,11 @@ class Qe {
     }
   }
   constructor(t) {
-    Ie(), t && this.setOptions(t);
+    Ge(), t && this.setOptions(t);
+  }
+  /** Exclusive path lock keyed by absolute OPFS path (`root` + API path). */
+  async withPathLock(t, e) {
+    return Et(t, e, this.options.root);
   }
   /**
    * Initialize the file system within a given directory.
@@ -1442,7 +1683,7 @@ class Qe {
         const r = await navigator.storage.getDirectory();
         this.root = t === "/" ? r : await this.getDirectoryHandle(t, !0, r), e(!0);
       } catch (r) {
-        n(new bt(t, r));
+        n(new Dt(t, r));
       } finally {
         this.mountingPromise = null;
       }
@@ -1459,7 +1700,7 @@ class Qe {
    * @param options.broadcastChannel - Custom name for the broadcast channel
    */
   async setOptions(t) {
-    t.hashAlgorithm !== void 0 && (this.options.hashAlgorithm = t.hashAlgorithm), t.maxFileSize !== void 0 && (this.options.maxFileSize = t.maxFileSize), t.broadcastChannel !== void 0 && (this.broadcastChannel && this.options.broadcastChannel !== t.broadcastChannel && (this.broadcastChannel.close(), this.broadcastChannel = null), this.options.broadcastChannel = t.broadcastChannel), t.namespace && (this.options.namespace = t.namespace), t.root !== void 0 && (this.options.root = j(t.root), this.options.namespace || (this.options.namespace = `opfs-worker:${this.options.root}`), await this.mount());
+    t.hashAlgorithm !== void 0 && (this.options.hashAlgorithm = t.hashAlgorithm), t.maxFileSize !== void 0 && (this.options.maxFileSize = t.maxFileSize), t.broadcastChannel !== void 0 && (this.broadcastChannel && this.options.broadcastChannel !== t.broadcastChannel && (this.broadcastChannel.close(), this.broadcastChannel = null), this.options.broadcastChannel = t.broadcastChannel), t.namespace && (this.options.namespace = t.namespace), t.root !== void 0 && (this.options.root = T(t.root), this.options.namespace || (this.options.namespace = `opfs-worker:${this.options.root}`), await this.mount());
   }
   /**
    * Get a directory handle from a path
@@ -1480,7 +1721,7 @@ class Qe {
    * ```
    */
   async getDirectoryHandle(t, e = !1, n = this.root) {
-    const r = Array.isArray(t) ? t : $(t);
+    const r = Array.isArray(t) ? t : D(t);
     let i = n;
     for (const o of r)
       i = await i.getDirectoryHandle(o, { create: e });
@@ -1506,9 +1747,9 @@ class Qe {
    * ```
    */
   async getFileHandle(t, e = !1, n = this.root) {
-    const r = $(t);
+    const r = D(t);
     if (r.length === 0)
-      throw new yt("Path must not be empty", Array.isArray(t) ? t.join("/") : t);
+      throw new At("Path must not be empty", Array.isArray(t) ? t.join("/") : t);
     const i = r.pop();
     return (await this.getDirectoryHandle(r, e, n)).getFileHandle(i, { create: e });
   }
@@ -1576,17 +1817,17 @@ class Qe {
    */
   async mkdir(t, e) {
     await this.mount();
-    const n = e?.recursive ?? !1, r = $(t);
+    const n = e?.recursive ?? !1, r = D(t);
     let i = this.root;
     for (let o = 0; o < r.length; o++) {
       const a = r[o];
       try {
         i = await i.getDirectoryHandle(a, { create: n || o === r.length - 1 });
       } catch (c) {
-        throw c.name === "NotFoundError" ? O(c, {
+        throw c.name === "NotFoundError" ? v(c, {
           path: Z(r.slice(0, o + 1)),
           existenceType: "directory"
-        }) : c.name === "TypeMismatchError" ? O(c, { path: a, isDirectory: !1 }) : new U("create directory", a, c);
+        }) : c.name === "TypeMismatchError" ? v(c, { path: a, isDirectory: !1 }) : new j("create directory", a, c);
       }
     }
     await this.notifyChange({ path: t, type: N.Added, isDirectory: !0 });
@@ -1623,10 +1864,10 @@ class Qe {
         isFile: !1,
         isDirectory: !0
       };
-    const e = z(t);
+    const e = I(t);
     let n;
     try {
-      n = await this.getDirectoryHandle(H(t), !1);
+      n = await this.getDirectoryHandle(_(t), !1);
       const r = this.options.hashAlgorithm, o = await (await n.getFileHandle(e, { create: !1 })).getFile(), a = {
         kind: "file",
         size: o.size,
@@ -1639,7 +1880,7 @@ class Qe {
         a.hash = `${o.lastModified.toString(36)}-${o.size.toString(36)}`;
       else if (typeof r == "string")
         try {
-          const c = await Le(o, r, this.options.maxFileSize);
+          const c = await Ve(o, r, this.options.maxFileSize);
           a.hash = c;
         } catch (c) {
           console.warn(`Failed to calculate hash for ${t}:`, c);
@@ -1647,9 +1888,9 @@ class Qe {
       return a;
     } catch (r) {
       if (r.name === "NotFoundError")
-        throw new k("file", t, r);
+        throw new P("file", t, r);
       if (r.name !== "TypeMismatchError")
-        throw new U("stat", t, r);
+        throw new j("stat", t, r);
     }
     try {
       return await n.getDirectoryHandle(e, { create: !1 }), {
@@ -1661,7 +1902,7 @@ class Qe {
         isDirectory: !0
       };
     } catch (r) {
-      throw new U("stat", t, r);
+      throw new j("stat", t, r);
     }
   }
   /**
@@ -1713,10 +1954,10 @@ class Qe {
   async exists(t) {
     if (await this.mount(), t === "/")
       return !0;
-    const e = z(t);
+    const e = I(t);
     let n = null;
     try {
-      n = await this.getDirectoryHandle(H(t), !1);
+      n = await this.getDirectoryHandle(_(t), !1);
     } catch (r) {
       if (n = null, r.name !== "NotFoundError" && r.name !== "TypeMismatchError")
         throw r;
@@ -1766,7 +2007,7 @@ class Qe {
       }
       await this.notifyChange({ path: t, type: N.Changed, isDirectory: !0 });
     } catch (e) {
-      throw e instanceof m ? e : O(e, { path: t, isDirectory: !0 });
+      throw e instanceof m ? e : v(e, { path: t, isDirectory: !0 });
     }
   }
   /**
@@ -1795,9 +2036,9 @@ class Qe {
    */
   async remove(t, e) {
     if (await this.mount(), t === "/")
-      throw new G("EROOT", t);
-    const { recursive: n = !1, force: r = !1 } = e || {}, i = await this.getDirectoryHandle(H(t), !1), o = await this.stat(t);
-    await je(i, t, { recursive: n, force: r }), await this.notifyChange({ path: t, type: N.Removed, isDirectory: o.isDirectory });
+      throw new H("EROOT", t);
+    const { recursive: n = !1, force: r = !1 } = e || {}, i = await this.getDirectoryHandle(_(t), !1), o = await this.stat(t);
+    await Ye(i, t, { recursive: n, force: r, root: this.options.root }), await this.notifyChange({ path: t, type: N.Removed, isDirectory: o.isDirectory });
   }
   /**
    * Resolve a path to an absolute path
@@ -1820,12 +2061,12 @@ class Qe {
   async realpath(t) {
     await this.mount();
     try {
-      const e = ke(t);
+      const e = St(t);
       if (!await this.exists(e))
-        throw new k("file", e);
+        throw new P("file", e);
       return e;
     } catch (e) {
-      throw e instanceof m ? e : O(e, { path: t });
+      throw e instanceof m ? e : v(e, { path: t });
     }
   }
   /**
@@ -1855,10 +2096,10 @@ class Qe {
     try {
       const r = n?.overwrite ?? !1, i = await this.stat(t);
       if (await this.exists(e) && !r)
-        throw new X(e);
+        throw new Q(e);
       await this.copy(t, e, { recursive: !0, overwrite: r }), await this.remove(t, { recursive: !0 }), await this.notifyChange({ path: t, type: N.Removed, isDirectory: i.isDirectory }), await this.notifyChange({ path: e, type: N.Added, isDirectory: i.isDirectory });
     } catch (r) {
-      throw r instanceof m ? r : O(r, { path: t });
+      throw r instanceof m ? r : v(r, { path: t });
     }
   }
   /**
@@ -1891,24 +2132,24 @@ class Qe {
     try {
       const r = n?.recursive ?? !1, i = n?.overwrite ?? !0;
       if (!await this.exists(t))
-        throw new k("source", t);
+        throw new P("source", t);
       if (await this.exists(e) && !i)
-        throw new X(e);
+        throw new Q(e);
       if ((await this.stat(t)).isFile) {
         const l = await this.readFile(t);
         await this.writeFile(e, l);
       } else {
         if (!r)
-          throw new q("directory", t);
+          throw new U("directory", t);
         await this.mkdir(e, { recursive: !0 });
         const l = await this.readDir(t);
-        for (const h of l) {
-          const d = `${t}/${h.name}`, u = `${e}/${h.name}`;
-          await this.copy(d, u, { recursive: !0, overwrite: i });
+        for (const u of l) {
+          const h = `${t}/${u.name}`, f = `${e}/${u.name}`;
+          await this.copy(h, f, { recursive: !0, overwrite: i });
         }
       }
     } catch (r) {
-      throw r instanceof m ? r : O(r, { path: t });
+      throw r instanceof m ? r : v(r, { path: t });
     }
   }
   /**
@@ -1938,9 +2179,9 @@ class Qe {
    */
   async watch(t, e) {
     if (!this.options.broadcastChannel)
-      throw new it("This instance is not configured to send events. Please specify options.broadcastChannel to enable watching.");
+      throw new ct("This instance is not configured to send events. Please specify options.broadcastChannel to enable watching.");
     const n = {
-      pattern: Re(t, e?.recursive ?? !0),
+      pattern: Xe(t, e?.recursive ?? !0),
       include: Array.isArray(e?.include) ? e.include : [e?.include ?? "**"],
       exclude: Array.isArray(e?.exclude) ? e.exclude : [e?.exclude ?? ""]
     };
@@ -1953,32 +2194,90 @@ class Qe {
     this.watchers.delete(t);
   }
   /**
-   * Bulk-create files from `[path, data]` entries (strings, bytes, or Blobs).
+   * Read a file as a `Blob` without copying its bytes into memory.
    *
-   * @param entries - Array of `[path, data]` tuples
+   * OPFS hands back a disk-backed `File`, so the browser can stream it on
+   * demand — pass it to `URL.createObjectURL()` for `<video>` / `<audio>` /
+   * `<img>` and only the played range is actually read. Structured clone keeps
+   * the reference intact when the file system runs in a worker.
+   *
+   * @param path - Path to the file
+   * @returns Lazy `File` handle backed by OPFS storage
+   * @throws {OPFSError} If the path is missing or is a directory
+   *
+   * @example
+   * ```typescript
+   * const blob = await fs.readBlob('/media/clip.mp4');
+   * video.src = URL.createObjectURL(blob);
+   * ```
+   */
+  async readBlob(t) {
+    await this.mount();
+    try {
+      return await (await this.getFileHandle(t, !1)).getFile();
+    } catch (e) {
+      throw e instanceof m ? e : v(e, { path: t, isDirectory: e?.name === "TypeMismatchError" });
+    }
+  }
+  /**
+   * Bulk-import files from `[path, data]` entries (strings, bytes, Blobs, or Files).
+   * Each entry is written via {@link writeStream} so large Blobs/Files are not
+   * fully buffered in memory.
+   *
+   * Accepts an array of tuples, a `Map`, or any iterable of `[path, data]` pairs.
+   *
+   * @param entries - Files to write
+   * @param onProgress - Per-chunk progress with path, index, and byte counts
+   * @returns Written paths, count, and total bytes
    * @throws {OPFSError} If a write fails
    *
    * @example
    * ```typescript
-   * await fs.createIndex([
+   * const result = await fs.importFiles([
    *   ['/config.json', JSON.stringify({ theme: 'dark' })],
    *   ['/data/binary.dat', new Uint8Array([1, 2, 3, 4])],
-   *   ['/upload.txt', new Blob(['file content'], { type: 'text/plain' })],
-   * ]);
+   *   ['/upload.txt', fileFromInput],
+   * ], (p) => console.log(`${p.path}: ${p.bytesWritten}/${p.bytesTotal}`));
+   *
+   * console.log(result.count, result.bytesWritten, result.paths);
    * ```
    */
-  async createIndex(t) {
+  async importFiles(t, e) {
     await this.mount();
+    const n = [...t].map(([c, l]) => [T(c), l]), r = n.length, i = n.map(([c]) => c), o = n.reduce((c, [, l]) => c + Ze(l), 0);
+    let a = 0;
     try {
-      for (const [e, n] of t) {
-        const r = j(e);
-        let i;
-        n instanceof Blob ? i = await ze(n) : typeof n == "string" ? i = new TextEncoder().encode(n) : i = n, await this.writeFile(r, i);
+      for (let c = 0; c < r; c++) {
+        const [l, u] = n[c], { stream: h, size: f } = Je(u), d = a, g = await this.writeStream(
+          l,
+          h,
+          e ? (p) => e({
+            path: l,
+            index: c,
+            count: r,
+            bytesWritten: p,
+            bytesTotal: f,
+            totalBytesWritten: d + p,
+            totalBytes: o
+          }) : void 0
+        );
+        a += g;
       }
-    } catch (e) {
-      throw e instanceof m ? e : O(e);
+      return {
+        paths: i,
+        count: r,
+        bytesWritten: a
+      };
+    } catch (c) {
+      throw c instanceof m ? c : v(c);
     }
   }
+  /**
+   * @deprecated Use {@link importFiles} instead.
+   */
+  async createIndex(t) {
+    Qe(), await this.importFiles(t);
+  }
   /**
    * Dispose of resources and clean up the file system instance
    */
@@ -1986,51 +2285,72 @@ class Qe {
     this.broadcastChannel && (this.broadcastChannel.close(), this.broadcastChannel = null), this.watchers.clear();
   }
 }
+function Ze(s) {
+  return typeof s == "string" ? new TextEncoder().encode(s).byteLength : s instanceof Blob ? s.size : s.byteLength;
+}
+function Je(s) {
+  if (s instanceof Blob)
+    return { stream: s.stream(), size: s.size };
+  const t = typeof s == "string" ? new TextEncoder().encode(s) : s;
+  return {
+    size: t.byteLength,
+    stream: new ReadableStream({
+      start(e) {
+        e.enqueue(t), e.close();
+      }
+    })
+  };
+}
+let at = !1;
+function Qe() {
+  at || (at = !0, console.warn("[opfs-worker] createIndex() is deprecated; use importFiles() instead"));
+}
 export {
-  X as A,
-  Qe as B,
-  Ze as C,
-  G as D,
-  k as E,
-  xt as F,
-  Je as G,
-  Xe as H,
+  Q as A,
+  ps as B,
+  Ye as C,
+  H as D,
+  P as E,
+  $t as F,
+  ls as G,
+  hs as H,
   J as I,
-  Ke as J,
-  Ne as K,
-  He as L,
-  $e as M,
-  _e as N,
+  us as J,
+  fs as K,
+  je as L,
+  ss as M,
+  We as N,
   m as O,
-  yt as P,
-  St as S,
-  D as V,
+  At as P,
+  ns as Q,
+  Ot as S,
+  $ as V,
   N as W,
-  wt as a,
-  Et as b,
-  q as c,
-  vt as d,
-  it as e,
-  bt as f,
-  U as g,
-  We as h,
-  Ie as i,
-  Z as j,
-  z as k,
-  H as l,
-  O as m,
-  j as n,
-  Re as o,
-  _ as p,
-  qe as q,
-  ke as r,
-  $ as s,
-  Ge as t,
-  Ve as u,
-  Le as v,
-  Pe as w,
-  Ye as x,
-  ze as y,
-  je as z
+  xt as a,
+  vt as b,
+  U as c,
+  Nt as d,
+  ct as e,
+  Dt as f,
+  j as g,
+  Ke as h,
+  Ge as i,
+  qe as j,
+  Z as k,
+  I as l,
+  v as m,
+  _ as n,
+  T as o,
+  Xe as p,
+  B as q,
+  rs as r,
+  D as s,
+  St as t,
+  is as u,
+  os as v,
+  Et as w,
+  Ve as x,
+  as as y,
+  cs as z
 };
-//# sourceMappingURL=BaseOPFS-Cylz6ijk.js.map
+//# sourceMappingURL=BaseOPFS-C3NE4BKr.js.map