opfs-worker 1.3.2 → 2.1.0

package/dist/dedicated.worker.js

@@ -0,0 +1,2281 @@
+/**
+ * @license
+ * Copyright 2019 Google LLC
+ * SPDX-License-Identifier: Apache-2.0
+ */
+const xt = Symbol("Comlink.proxy"), zt = Symbol("Comlink.endpoint"), Wt = Symbol("Comlink.releaseProxy"), X = Symbol("Comlink.finalizer"), j = Symbol("Comlink.thrown"), bt = (s) => typeof s == "object" && s !== null || typeof s == "function", jt = {
+  canHandle: (s) => bt(s) && s[xt],
+  serialize(s) {
+    const { port1: t, port2: e } = new MessageChannel();
+    return ot(s, t), [e, [e]];
+  },
+  deserialize(s) {
+    return s.start(), Gt(s);
+  }
+}, _t = {
+  canHandle: (s) => bt(s) && j in s,
+  serialize({ value: s }) {
+    let t;
+    return s instanceof Error ? t = {
+      isError: !0,
+      value: {
+        message: s.message,
+        name: s.name,
+        stack: s.stack
+      }
+    } : t = { isError: !1, value: s }, [t, []];
+  },
+  deserialize(s) {
+    throw s.isError ? Object.assign(new Error(s.value.message), s.value) : s.value;
+  }
+}, Ot = /* @__PURE__ */ new Map([
+  ["proxy", jt],
+  ["throw", _t]
+]);
+function Bt(s, t) {
+  for (const e of s)
+    if (t === e || e === "*" || e instanceof RegExp && e.test(t))
+      return !0;
+  return !1;
+}
+function ot(s, t = globalThis, e = ["*"]) {
+  t.addEventListener("message", function n(r) {
+    if (!r || !r.data)
+      return;
+    if (!Bt(e, r.origin)) {
+      console.warn(`Invalid origin '${r.origin}' for comlink proxy`);
+      return;
+    }
+    const { id: i, type: o, path: a } = Object.assign({ path: [] }, r.data), c = (r.data.argumentList || []).map(N);
+    let h;
+    try {
+      const l = a.slice(0, -1).reduce((u, d) => u[d], s), f = a.reduce((u, d) => u[d], s);
+      switch (o) {
+        case "GET":
+          h = f;
+          break;
+        case "SET":
+          l[a.slice(-1)[0]] = N(r.data.value), h = !0;
+          break;
+        case "APPLY":
+          h = f.apply(l, c);
+          break;
+        case "CONSTRUCT":
+          {
+            const u = new f(...c);
+            h = Zt(u);
+          }
+          break;
+        case "ENDPOINT":
+          {
+            const { port1: u, port2: d } = new MessageChannel();
+            ot(s, d), h = _(u, [u]);
+          }
+          break;
+        case "RELEASE":
+          h = void 0;
+          break;
+        default:
+          return;
+      }
+    } catch (l) {
+      h = { value: l, [j]: 0 };
+    }
+    Promise.resolve(h).catch((l) => ({ value: l, [j]: 0 })).then((l) => {
+      const [f, u] = q(l);
+      t.postMessage(Object.assign(Object.assign({}, f), { id: i }), u), o === "RELEASE" && (t.removeEventListener("message", n), Dt(t), X in s && typeof s[X] == "function" && s[X]());
+    }).catch((l) => {
+      const [f, u] = q({
+        value: new TypeError("Unserializable return value"),
+        [j]: 0
+      });
+      t.postMessage(Object.assign(Object.assign({}, f), { id: i }), u);
+    });
+  }), t.start && t.start();
+}
+function Ut(s) {
+  return s.constructor.name === "MessagePort";
+}
+function Dt(s) {
+  Ut(s) && s.close();
+}
+function Gt(s, t) {
+  const e = /* @__PURE__ */ new Map();
+  return s.addEventListener("message", function(r) {
+    const { data: i } = r;
+    if (!i || !i.id)
+      return;
+    const o = e.get(i.id);
+    if (o)
+      try {
+        o(i);
+      } finally {
+        e.delete(i.id);
+      }
+  }), et(s, e, [], t);
+}
+function L(s) {
+  if (s)
+    throw new Error("Proxy has been released and is not useable");
+}
+function At(s) {
+  return F(s, /* @__PURE__ */ new Map(), {
+    type: "RELEASE"
+  }).then(() => {
+    Dt(s);
+  });
+}
+const U = /* @__PURE__ */ new WeakMap(), G = "FinalizationRegistry" in globalThis && new FinalizationRegistry((s) => {
+  const t = (U.get(s) || 0) - 1;
+  U.set(s, t), t === 0 && At(s);
+});
+function qt(s, t) {
+  const e = (U.get(t) || 0) + 1;
+  U.set(t, e), G && G.register(s, t, s);
+}
+function Vt(s) {
+  G && G.unregister(s);
+}
+function et(s, t, e = [], n = function() {
+}) {
+  let r = !1;
+  const i = new Proxy(n, {
+    get(o, a) {
+      if (L(r), a === Wt)
+        return () => {
+          Vt(i), At(s), t.clear(), r = !0;
+        };
+      if (a === "then") {
+        if (e.length === 0)
+          return { then: () => i };
+        const c = F(s, t, {
+          type: "GET",
+          path: e.map((h) => h.toString())
+        }).then(N);
+        return c.then.bind(c);
+      }
+      return et(s, t, [...e, a]);
+    },
+    set(o, a, c) {
+      L(r);
+      const [h, l] = q(c);
+      return F(s, t, {
+        type: "SET",
+        path: [...e, a].map((f) => f.toString()),
+        value: h
+      }, l).then(N);
+    },
+    apply(o, a, c) {
+      L(r);
+      const h = e[e.length - 1];
+      if (h === zt)
+        return F(s, t, {
+          type: "ENDPOINT"
+        }).then(N);
+      if (h === "bind")
+        return et(s, t, e.slice(0, -1));
+      const [l, f] = ht(c);
+      return F(s, t, {
+        type: "APPLY",
+        path: e.map((u) => u.toString()),
+        argumentList: l
+      }, f).then(N);
+    },
+    construct(o, a) {
+      L(r);
+      const [c, h] = ht(a);
+      return F(s, t, {
+        type: "CONSTRUCT",
+        path: e.map((l) => l.toString()),
+        argumentList: c
+      }, h).then(N);
+    }
+  });
+  return qt(i, s), i;
+}
+function Yt(s) {
+  return Array.prototype.concat.apply([], s);
+}
+function ht(s) {
+  const t = s.map(q);
+  return [t.map((e) => e[0]), Yt(t.map((e) => e[1]))];
+}
+const vt = /* @__PURE__ */ new WeakMap();
+function _(s, t) {
+  return vt.set(s, t), s;
+}
+function Zt(s) {
+  return Object.assign(s, { [xt]: !0 });
+}
+function q(s) {
+  for (const [t, e] of Ot)
+    if (e.canHandle(s)) {
+      const [n, r] = e.serialize(s);
+      return [
+        {
+          type: "HANDLER",
+          name: t,
+          value: n
+        },
+        r
+      ];
+    }
+  return [
+    {
+      type: "RAW",
+      value: s
+    },
+    vt.get(s) || []
+  ];
+}
+function N(s) {
+  switch (s.type) {
+    case "HANDLER":
+      return Ot.get(s.name).deserialize(s.value);
+    case "RAW":
+      return s.value;
+  }
+}
+function F(s, t, e, n) {
+  return new Promise((r) => {
+    const i = Xt();
+    t.set(i, r), s.start && s.start(), s.postMessage(Object.assign({ id: i }, e), n);
+  });
+}
+function Xt() {
+  return new Array(4).fill(0).map(() => Math.floor(Math.random() * Number.MAX_SAFE_INTEGER).toString(16)).join("-");
+}
+var b = /* @__PURE__ */ ((s) => (s.Added = "added", s.Changed = "changed", s.Removed = "removed", s))(b || {});
+const Jt = {
+  ENOENT: -2,
+  // No such file or directory
+  EISDIR: -21,
+  // Is a directory
+  ENOTDIR: -20,
+  // Not a directory
+  EACCES: -13,
+  // Permission denied
+  EEXIST: -17,
+  // File exists
+  ENOTEMPTY: -39,
+  // Directory not empty
+  EINVAL: -22,
+  // Invalid argument
+  EIO: -5,
+  // I/O error
+  ENOSPC: -28,
+  // No space left on device
+  EBUSY: -16,
+  // Device or resource busy
+  EINTR: -4,
+  // Interrupted system call
+  ENOTSUP: -95,
+  // Operation not supported
+  ERANGE: -34,
+  // Result too large
+  EBADF: -9,
+  // Bad file descriptor
+  EROOT: -1
+  // Custom: Cannot remove root directory
+};
+class w extends Error {
+  errno;
+  syscall;
+  path;
+  constructor(t, e, n, r, i) {
+    super(t, { cause: i }), this.name = e, this.errno = Jt[e] || -1, this.path = n, this.syscall = r;
+  }
+}
+class Qt extends w {
+  constructor(t) {
+    super("OPFS is not supported in this browser", "ENOTSUP", void 0, void 0, t);
+  }
+}
+class Kt extends w {
+  constructor(t, e, n) {
+    super(t, "INVALID_PATH", e, "access", n);
+  }
+}
+class B extends w {
+  constructor(t, e, n) {
+    const r = {
+      file: `File not found: ${e}`,
+      directory: `Directory not found: ${e}`,
+      source: `Source does not exist: ${e}`
+    };
+    super(r[t], "ENOENT", e, "access", n);
+  }
+}
+class te extends w {
+  constructor(t, e, n) {
+    super(`Permission denied for ${e} on: ${t}`, "EACCES", t, e, n);
+  }
+}
+class ee extends w {
+  constructor(t, e, n) {
+    super(t, "ENOSPC", e, "write", n);
+  }
+}
+class se extends w {
+  constructor(t, e) {
+    super(`File is busy: ${t}`, "EBUSY", t, "open", e);
+  }
+}
+class st extends w {
+  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 C extends w {
+  constructor(t, e, n, r) {
+    const i = {
+      argument: "EINVAL",
+      format: "INVALID_FORMAT",
+      descriptor: "EBADF",
+      overflow: "ERANGE"
+    };
+    super(e, i[t], n, "validate", r);
+  }
+}
+class ne extends w {
+  constructor(t, e) {
+    super(`Operation aborted: ${t}`, "EINTR", t, "interrupt", e);
+  }
+}
+class ut extends w {
+  constructor(t, e, n) {
+    super(t, "EIO", e, "io", n);
+  }
+}
+class Ct extends w {
+  constructor(t, e) {
+    super(`Operation not supported: ${t}`, "ENOTSUP", t, "operation", e);
+  }
+}
+class nt extends w {
+  constructor(t, e, n) {
+    const r = {
+      RM_FAILED: `Failed to remove entry: ${e}`,
+      ENOTEMPTY: `Directory not empty: ${e}. Use recursive option to force removal.`,
+      EROOT: "Cannot remove root directory"
+    };
+    super(r[t] || `Directory operation failed: ${e}`, t, e, "unlink", n);
+  }
+}
+class re extends w {
+  constructor(t, e) {
+    super("Failed to initialize OPFS", "INIT_FAILED", t, "init", e);
+  }
+}
+class J extends w {
+  constructor(t, e, n) {
+    super(`Failed to ${t}: ${e}`, `${t.toUpperCase()}_FAILED`, e, t, n);
+  }
+}
+class rt extends w {
+  constructor(t, e) {
+    super(`Destination already exists: ${t}`, "EEXIST", t, "open", e);
+  }
+}
+function z(s, t, e, n) {
+  const r = `${s.toUpperCase()}_FAILED`;
+  return new w(`Failed to ${s} file descriptor: ${t}`, r, e, s, n);
+}
+function A(s, t) {
+  const e = t?.path, n = t?.isDirectory, r = t?.existenceType ?? "file", i = t?.operation;
+  switch (s.name) {
+    case "InvalidStateError":
+      return new se(e || "unknown", s);
+    case "QuotaExceededError":
+      return new ee(`No space left on device: ${e || "unknown"}`, e, s);
+    case "NotFoundError":
+      return new B(r, e, s);
+    case "TypeMismatchError":
+      return n !== void 0 ? n ? new st("directory", e || "unknown", s) : new st("file", e || "unknown", s) : new C("argument", `Type mismatch: ${e || "unknown"}`, e, s);
+    case "NotAllowedError":
+    case "SecurityError":
+      return new te(e, "unknown", s);
+    case "InvalidModificationError":
+      return i === "remove" ? new nt("ENOTEMPTY", e, s) : new C("argument", `Invalid modification: ${e || "unknown"}`, e, s);
+    case "AbortError":
+      return new ne(e || "unknown", s);
+    case "OperationError":
+      return new ut(`Operation failed: ${e || "unknown"}`, e, s);
+    case "TypeError":
+      return new Ct(e || "unknown", s);
+    default:
+      return i === "remove" ? new nt("RM_FAILED", e, s) : new ut(`I/O error: ${e || "unknown"}`, e, s);
+  }
+}
+const Nt = (s, t, e) => {
+  const n = s instanceof RegExp ? ft(s, e) : s, r = t instanceof RegExp ? ft(t, e) : t, i = n !== null && r != null && ie(n, r, e);
+  return i && {
+    start: i[0],
+    end: i[1],
+    pre: e.slice(0, i[0]),
+    body: e.slice(i[0] + n.length, i[1]),
+    post: e.slice(i[1] + r.length)
+  };
+}, ft = (s, t) => {
+  const e = t.match(s);
+  return e ? e[0] : null;
+}, ie = (s, t, e) => {
+  let n, r, i, o, a, c = e.indexOf(s), h = e.indexOf(t, c + 1), l = c;
+  if (c >= 0 && h > 0) {
+    if (s === t)
+      return [c, h];
+    for (n = [], i = e.length; l >= 0 && !a; ) {
+      if (l === c)
+        n.push(l), c = e.indexOf(s, l + 1);
+      else if (n.length === 1) {
+        const f = n.pop();
+        f !== void 0 && (a = [f, h]);
+      } else
+        r = n.pop(), r !== void 0 && r < i && (i = r, o = h), h = e.indexOf(t, l + 1);
+      l = c < h && c >= 0 ? c : h;
+    }
+    n.length && o !== void 0 && (a = [i, o]);
+  }
+  return a;
+}, Ft = "\0SLASH" + Math.random() + "\0", $t = "\0OPEN" + Math.random() + "\0", at = "\0CLOSE" + Math.random() + "\0", Mt = "\0COMMA" + Math.random() + "\0", Tt = "\0PERIOD" + Math.random() + "\0", oe = new RegExp(Ft, "g"), ae = new RegExp($t, "g"), ce = new RegExp(at, "g"), le = new RegExp(Mt, "g"), he = new RegExp(Tt, "g"), ue = /\\\\/g, fe = /\\{/g, de = /\\}/g, pe = /\\,/g, ge = /\\./g;
+function Q(s) {
+  return isNaN(s) ? s.charCodeAt(0) : parseInt(s, 10);
+}
+function we(s) {
+  return s.replace(ue, Ft).replace(fe, $t).replace(de, at).replace(pe, Mt).replace(ge, Tt);
+}
+function ye(s) {
+  return s.replace(oe, "\\").replace(ae, "{").replace(ce, "}").replace(le, ",").replace(he, ".");
+}
+function Pt(s) {
+  if (!s)
+    return [""];
+  const t = [], e = Nt("{", "}", s);
+  if (!e)
+    return s.split(",");
+  const { pre: n, body: r, post: i } = e, o = n.split(",");
+  o[o.length - 1] += "{" + r + "}";
+  const a = Pt(i);
+  return i.length && (o[o.length - 1] += a.shift(), o.push.apply(o, a)), t.push.apply(t, o), t;
+}
+function me(s) {
+  return s ? (s.slice(0, 2) === "{}" && (s = "\\{\\}" + s.slice(2)), k(we(s), !0).map(ye)) : [];
+}
+function Ee(s) {
+  return "{" + s + "}";
+}
+function Se(s) {
+  return /^-?0\d/.test(s);
+}
+function xe(s, t) {
+  return s <= t;
+}
+function be(s, t) {
+  return s >= t;
+}
+function k(s, t) {
+  const e = [], n = Nt("{", "}", s);
+  if (!n)
+    return [s];
+  const r = n.pre, i = n.post.length ? k(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);
+    }
+  else {
+    const o = /^-?\d+\.\.-?\d+(?:\.\.-?\d+)?$/.test(n.body), a = /^[a-zA-Z]\.\.[a-zA-Z](?:\.\.-?\d+)?$/.test(n.body), c = o || a, h = n.body.indexOf(",") >= 0;
+    if (!c && !h)
+      return n.post.match(/,(?!,).*\}/) ? (s = n.pre + "{" + n.body + at + n.post, k(s)) : [s];
+    let l;
+    if (c)
+      l = n.body.split(/\.\./);
+    else if (l = Pt(n.body), l.length === 1 && l[0] !== void 0 && (l = k(l[0], !1).map(Ee), l.length === 1))
+      return i.map((u) => n.pre + l[0] + u);
+    let f;
+    if (c && l[0] !== void 0 && l[1] !== void 0) {
+      const u = Q(l[0]), d = Q(l[1]), g = Math.max(l[0].length, l[1].length);
+      let p = l.length === 3 && l[2] !== void 0 ? Math.abs(Q(l[2])) : 1, S = xe;
+      d < u && (p *= -1, S = be);
+      const T = l.some(Se);
+      f = [];
+      for (let x = u; S(x, d); x += p) {
+        let y;
+        if (a)
+          y = String.fromCharCode(x), y === "\\" && (y = "");
+        else if (y = String(x), T) {
+          const P = g - y.length;
+          if (P > 0) {
+            const H = new Array(P + 1).join("0");
+            x < 0 ? y = "-" + H + y.slice(1) : y = H + y;
+          }
+        }
+        f.push(y);
+      }
+    } else {
+      f = [];
+      for (let u = 0; u < l.length; u++)
+        f.push.apply(f, k(l[u], !1));
+    }
+    for (let u = 0; u < f.length; u++)
+      for (let d = 0; d < i.length; d++) {
+        const g = r + f[u] + i[d];
+        (!t || c || g) && e.push(g);
+      }
+  }
+  return e;
+}
+const Oe = 1024 * 64, V = (s) => {
+  if (typeof s != "string")
+    throw new TypeError("invalid pattern");
+  if (s.length > Oe)
+    throw new TypeError("pattern is too long");
+}, De = {
+  "[:alnum:]": ["\\p{L}\\p{Nl}\\p{Nd}", !0],
+  "[:alpha:]": ["\\p{L}\\p{Nl}", !0],
+  "[:ascii:]": ["\\x00-\\x7f", !1],
+  "[:blank:]": ["\\p{Zs}\\t", !0],
+  "[:cntrl:]": ["\\p{Cc}", !0],
+  "[:digit:]": ["\\p{Nd}", !0],
+  "[:graph:]": ["\\p{Z}\\p{C}", !0, !0],
+  "[:lower:]": ["\\p{Ll}", !0],
+  "[:print:]": ["\\p{C}", !0],
+  "[:punct:]": ["\\p{P}", !0],
+  "[:space:]": ["\\p{Z}\\t\\r\\n\\v\\f", !0],
+  "[:upper:]": ["\\p{Lu}", !0],
+  "[:word:]": ["\\p{L}\\p{Nl}\\p{Nd}\\p{Pc}", !0],
+  "[:xdigit:]": ["A-Fa-f0-9", !1]
+}, R = (s) => s.replace(/[[\]\\-]/g, "\\$&"), Ae = (s) => s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&"), dt = (s) => s.join(""), ve = (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, h = !1, l = e, f = "";
+  t: for (; i < s.length; ) {
+    const p = s.charAt(i);
+    if ((p === "!" || p === "^") && i === e + 1) {
+      h = !0, i++;
+      continue;
+    }
+    if (p === "]" && o && !c) {
+      l = i + 1;
+      break;
+    }
+    if (o = !0, p === "\\" && !c) {
+      c = !0, i++;
+      continue;
+    }
+    if (p === "[" && !c) {
+      for (const [S, [v, T, x]] of Object.entries(De))
+        if (s.startsWith(S, i)) {
+          if (f)
+            return ["$.", !1, s.length - e, !0];
+          i += S.length, x ? r.push(v) : n.push(v), a = a || T;
+          continue t;
+        }
+    }
+    if (c = !1, f) {
+      p > f ? n.push(R(f) + "-" + R(p)) : p === f && n.push(R(p)), f = "", i++;
+      continue;
+    }
+    if (s.startsWith("-]", i + 1)) {
+      n.push(R(p + "-")), i += 2;
+      continue;
+    }
+    if (s.startsWith("-", i + 1)) {
+      f = p, i += 2;
+      continue;
+    }
+    n.push(R(p)), i++;
+  }
+  if (l < 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]) && !h) {
+    const p = n[0].length === 2 ? n[0].slice(-1) : n[0];
+    return [Ae(p), !1, l - e, !1];
+  }
+  const u = "[" + (h ? "^" : "") + dt(n) + "]", d = "[" + (h ? "" : "^") + dt(r) + "]";
+  return [n.length && r.length ? "(" + u + "|" + d + ")" : n.length ? u : d, a, l - e, !0];
+}, I = (s, { windowsPathsNoEscape: t = !1 } = {}) => t ? s.replace(/\[([^\/\\])\]/g, "$1") : s.replace(/((?!\\).|^)\[([^\/\\])\]/g, "$1$2").replace(/\\([^\/])/g, "$1"), Ce = /* @__PURE__ */ new Set(["!", "?", "+", "*", "@"]), pt = (s) => Ce.has(s), Ne = "(?!(?:^|/)\\.\\.?(?:$|/))", W = "(?!\\.)", Fe = /* @__PURE__ */ new Set(["[", "."]), $e = /* @__PURE__ */ new Set(["..", "."]), Me = new Set("().*{}+?[]^$\\!"), Te = (s) => s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&"), ct = "[^/]", gt = ct + "*?", wt = ct + "+?";
+class E {
+  type;
+  #s;
+  #n;
+  #i = !1;
+  #t = [];
+  #e;
+  #o;
+  #c;
+  #a = !1;
+  #r;
+  #l;
+  // set to true if it's an extglob with no children
+  // (which really means one child of '')
+  #u = !1;
+  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;
+  }
+  get hasMagic() {
+    if (this.#n !== void 0)
+      return this.#n;
+    for (const t of this.#t)
+      if (typeof t != "string" && (t.type || t.hasMagic))
+        return this.#n = !0;
+    return this.#n;
+  }
+  // reconstructs the pattern
+  toString() {
+    return this.#l !== void 0 ? this.#l : this.type ? this.#l = this.type + "(" + this.#t.map((t) => String(t)).join("|") + ")" : this.#l = this.#t.map((t) => String(t)).join("");
+  }
+  #d() {
+    if (this !== this.#s)
+      throw new Error("should only call on root");
+    if (this.#a)
+      return this;
+    this.toString(), this.#a = !0;
+    let t;
+    for (; t = this.#c.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 (const i of t.#t) {
+            if (typeof i == "string")
+              throw new Error("string part in extglob AST??");
+            i.copyIn(n.#t[r]);
+          }
+        e = n, n = e.#e;
+      }
+    }
+    return this;
+  }
+  push(...t) {
+    for (const e of t)
+      if (e !== "") {
+        if (typeof e != "string" && !(e instanceof E && 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;
+  }
+  isStart() {
+    if (this.#s === this)
+      return !0;
+    if (!this.#e?.isStart())
+      return !1;
+    if (this.#o === 0)
+      return !0;
+    const t = this.#e;
+    for (let e = 0; e < this.#o; e++) {
+      const n = t.#t[e];
+      if (!(n instanceof E && n.type === "!"))
+        return !1;
+    }
+    return !0;
+  }
+  isEnd() {
+    if (this.#s === this || this.#e?.type === "!")
+      return !0;
+    if (!this.#e?.isEnd())
+      return !1;
+    if (!this.type)
+      return this.#e?.isEnd();
+    const t = this.#e ? this.#e.#t.length : 0;
+    return this.#o === t - 1;
+  }
+  copyIn(t) {
+    typeof t == "string" ? this.push(t) : this.push(t.clone(this));
+  }
+  clone(t) {
+    const e = new E(this.type, t);
+    for (const n of this.#t)
+      e.copyIn(n);
+    return e;
+  }
+  static #h(t, e, n, r) {
+    let i = !1, o = !1, a = -1, c = !1;
+    if (e.type === null) {
+      let d = n, g = "";
+      for (; d < t.length; ) {
+        const p = t.charAt(d++);
+        if (i || p === "\\") {
+          i = !i, g += p;
+          continue;
+        }
+        if (o) {
+          d === a + 1 ? (p === "^" || p === "!") && (c = !0) : p === "]" && !(d === a + 2 && c) && (o = !1), g += p;
+          continue;
+        } else if (p === "[") {
+          o = !0, a = d, c = !1, g += p;
+          continue;
+        }
+        if (!r.noext && pt(p) && t.charAt(d) === "(") {
+          e.push(g), g = "";
+          const S = new E(p, e);
+          d = E.#h(t, S, d, r), e.push(S);
+          continue;
+        }
+        g += p;
+      }
+      return e.push(g), d;
+    }
+    let h = n + 1, l = new E(null, e);
+    const f = [];
+    let u = "";
+    for (; h < t.length; ) {
+      const d = t.charAt(h++);
+      if (i || d === "\\") {
+        i = !i, u += d;
+        continue;
+      }
+      if (o) {
+        h === a + 1 ? (d === "^" || d === "!") && (c = !0) : d === "]" && !(h === a + 2 && c) && (o = !1), u += d;
+        continue;
+      } else if (d === "[") {
+        o = !0, a = h, c = !1, u += d;
+        continue;
+      }
+      if (pt(d) && t.charAt(h) === "(") {
+        l.push(u), u = "";
+        const g = new E(d, l);
+        l.push(g), h = E.#h(t, g, h, r);
+        continue;
+      }
+      if (d === "|") {
+        l.push(u), u = "", f.push(l), l = new E(null, e);
+        continue;
+      }
+      if (d === ")")
+        return u === "" && e.#t.length === 0 && (e.#u = !0), l.push(u), u = "", e.push(...f, l), h;
+      u += d;
+    }
+    return e.type = null, e.#n = void 0, e.#t = [t.substring(n - 1)], h;
+  }
+  static fromGlob(t, e = {}) {
+    const n = new E(null, void 0, e);
+    return E.#h(t, n, 0, e), n;
+  }
+  // returns the regular expression if there's magic, or the unescaped
+  // string if not.
+  toMMPattern() {
+    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()))
+      return n;
+    const a = (this.#r.nocase ? "i" : "") + (i ? "u" : "");
+    return Object.assign(new RegExp(`^${e}$`, a), {
+      _src: e,
+      _glob: t
+    });
+  }
+  get options() {
+    return this.#r;
+  }
+  // returns the string match, the regexp source, whether there's magic
+  // in the regexp (so a regular expression is required) and whether or
+  // not the uflag is needed for the regular expression (for posix classes)
+  // TODO: instead of injecting the start/end at this point, just return
+  // the BODY of the regexp, along with the start/end portions suitable
+  // for binding the start/end in either a joined full-path makeRe context
+  // (where we bind to (^|/), or a standalone matchPart context (where
+  // we bind to ^, and not /).  Otherwise slashes get duped!
+  //
+  // In part-matching mode, the start is:
+  // - if not isStart: nothing
+  // - if traversal possible, but not allowed: ^(?!\.\.?$)
+  // - if dots allowed or not possible: ^
+  // - if dots possible and not allowed: ^(?!\.)
+  // end is:
+  // - if not isEnd(): nothing
+  // - else: $
+  //
+  // In full-path matching mode, we put the slash at the START of the
+  // pattern, so start is:
+  // - if first pattern: same as part-matching mode
+  // - if not isStart(): nothing
+  // - if traversal possible, but not allowed: /(?!\.\.?(?:$|/))
+  // - if dots allowed or not possible: /
+  // - if dots possible and not allowed: /(?!\.)
+  // end is:
+  // - if last pattern, same as part-matching mode
+  // - else nothing
+  //
+  // Always put the (?:$|/) on negated tails, though, because that has to be
+  // there to bind the end of the negated pattern portion, and it's easier to
+  // just stick it in now rather than try to inject it later in the middle of
+  // the pattern.
+  //
+  // We can just always return the same end, and leave it up to the caller
+  // to know whether it's going to be used joined or in parts.
+  // And, if the start is adjusted slightly, can do the same there:
+  // - if not isStart: nothing
+  // - if traversal possible, but not allowed: (?:/|^)(?!\.\.?$)
+  // - if dots allowed or not possible: (?:/|^)
+  // - if dots possible and not allowed: (?:/|^)(?!\.)
+  //
+  // But it's better to have a simpler binding without a conditional, for
+  // performance, so probably better to return both start options.
+  //
+  // Then the caller just ignores the end if it's not the first pattern,
+  // and the start always gets applied.
+  //
+  // But that's always going to be $ if it's the ending pattern, or nothing,
+  // so the caller can just attach $ at the end of the pattern when building.
+  //
+  // So the todo is:
+  // - better detect what kind of start is needed
+  // - return both flavors of starting pattern
+  // - attach $ at the end of the pattern when creating the actual RegExp
+  //
+  // Ah, but wait, no, that all only applies to the root when the first pattern
+  // is not an extglob. If the first pattern IS an extglob, then we need all
+  // that dot prevention biz to live in the extglob portions, because eg
+  // +(*|.x*) can match .xy but not .yx.
+  //
+  // So, return the two flavors if it's #root and the first child is not an
+  // AST, otherwise leave it to the child AST to handle it, and there,
+  // use the (?:^|/) style of start binding.
+  //
+  // Even simplified further:
+  // - Since the start for a join is eg /(?!\.) and the start for a part
+  // 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(), h = this.#t.map((d) => {
+        const [g, p, S, v] = typeof d == "string" ? E.#p(d, this.#n, c) : d.toRegExpSource(t);
+        return this.#n = this.#n || S, this.#i = this.#i || v, g;
+      }).join("");
+      let l = "";
+      if (this.isStart() && typeof this.#t[0] == "string" && !(this.#t.length === 1 && $e.has(this.#t[0]))) {
+        const g = Fe, p = (
+          // dots are allowed, and the pattern starts with [ or .
+          e && g.has(h.charAt(0)) || // the pattern starts with \., and then [ or .
+          h.startsWith("\\.") && g.has(h.charAt(2)) || // the pattern starts with \.\., and then [ or .
+          h.startsWith("\\.\\.") && g.has(h.charAt(4))
+        ), S = !e && !t && g.has(h.charAt(0));
+        l = p ? Ne : S ? W : "";
+      }
+      let f = "";
+      return this.isEnd() && this.#s.#a && this.#e?.type === "!" && (f = "(?:$|\\/)"), [
+        l + h + f,
+        I(h),
+        this.#n = !!this.#n,
+        this.#i
+      ];
+    }
+    const n = this.type === "*" || this.type === "+", r = this.type === "!" ? "(?:(?!(?:" : "(?:";
+    let i = this.#f(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];
+    }
+    let o = !n || t || e || !W ? "" : this.#f(!0);
+    o === i && (o = ""), o && (i = `(?:${i})(?:${o})*?`);
+    let a = "";
+    if (this.type === "!" && this.#u)
+      a = (this.isStart() && !e ? W : "") + wt;
+    else {
+      const c = this.type === "!" ? (
+        // !() must match something,but !(x) can match ''
+        "))" + (this.isStart() && !e && !t ? W : "") + gt + ")"
+      ) : this.type === "@" ? ")" : this.type === "?" ? ")?" : this.type === "+" && o ? ")" : this.type === "*" && o ? ")?" : `)${this.type}`;
+      a = r + i + c;
+    }
+    return [
+      a,
+      I(i),
+      this.#n = !!this.#n,
+      this.#i
+    ];
+  }
+  #f(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;
+    }).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);
+      if (r) {
+        r = !1, i += (Me.has(c) ? "\\" : "") + c;
+        continue;
+      }
+      if (c === "\\") {
+        a === t.length - 1 ? i += "\\\\" : r = !0;
+        continue;
+      }
+      if (c === "[") {
+        const [h, l, f, u] = ve(t, a);
+        if (f) {
+          i += h, o = o || l, a += f - 1, e = e || u;
+          continue;
+        }
+      }
+      if (c === "*") {
+        n && t === "*" ? i += wt : i += gt, e = !0;
+        continue;
+      }
+      if (c === "?") {
+        i += ct, e = !0;
+        continue;
+      }
+      i += Te(c);
+    }
+    return [i, I(t), !!e, o];
+  }
+}
+const Pe = (s, { windowsPathsNoEscape: t = !1 } = {}) => t ? s.replace(/[?*()[\]]/g, "[$&]") : s.replace(/[?*()[\]\\]/g, "\\$&"), m = (s, t, e = {}) => (V(t), !e.nocomment && t.charAt(0) === "#" ? !1 : new Z(t, e).match(s)), Re = /^\*+([^+@!?\*\[\(]*)$/, ke = (s) => (t) => !t.startsWith(".") && t.endsWith(s), Ie = (s) => (t) => t.endsWith(s), He = (s) => (s = s.toLowerCase(), (t) => !t.startsWith(".") && t.toLowerCase().endsWith(s)), Le = (s) => (s = s.toLowerCase(), (t) => t.toLowerCase().endsWith(s)), ze = /^\*+\.\*+$/, We = (s) => !s.startsWith(".") && s.includes("."), je = (s) => s !== "." && s !== ".." && s.includes("."), _e = /^\.\*+$/, Be = (s) => s !== "." && s !== ".." && s.startsWith("."), Ue = /^\*+$/, Ge = (s) => s.length !== 0 && !s.startsWith("."), qe = (s) => s.length !== 0 && s !== "." && s !== "..", Ve = /^\?+([^+@!?\*\[\(]*)?$/, Ye = ([s, t = ""]) => {
+  const e = Rt([s]);
+  return t ? (t = t.toLowerCase(), (n) => e(n) && n.toLowerCase().endsWith(t)) : e;
+}, Ze = ([s, t = ""]) => {
+  const e = kt([s]);
+  return t ? (t = t.toLowerCase(), (n) => e(n) && n.toLowerCase().endsWith(t)) : e;
+}, Xe = ([s, t = ""]) => {
+  const e = kt([s]);
+  return t ? (n) => e(n) && n.endsWith(t) : e;
+}, Je = ([s, t = ""]) => {
+  const e = Rt([s]);
+  return t ? (n) => e(n) && n.endsWith(t) : e;
+}, Rt = ([s]) => {
+  const t = s.length;
+  return (e) => e.length === t && !e.startsWith(".");
+}, kt = ([s]) => {
+  const t = s.length;
+  return (e) => e.length === t && e !== "." && e !== "..";
+}, It = typeof process == "object" && process ? typeof process.env == "object" && process.env && process.env.__MINIMATCH_TESTING_PLATFORM__ || process.platform : "posix", yt = {
+  win32: { sep: "\\" },
+  posix: { sep: "/" }
+}, Qe = It === "win32" ? yt.win32.sep : yt.posix.sep;
+m.sep = Qe;
+const D = Symbol("globstar **");
+m.GLOBSTAR = D;
+const Ke = "[^/]", ts = Ke + "*?", es = "(?:(?!(?:\\/|^)(?:\\.{1,2})($|\\/)).)*?", ss = "(?:(?!(?:\\/|^)\\.).)*?", ns = (s, t = {}) => (e) => m(e, s, t);
+m.filter = ns;
+const O = (s, t = {}) => Object.assign({}, s, t), rs = (s) => {
+  if (!s || typeof s != "object" || !Object.keys(s).length)
+    return m;
+  const t = m;
+  return Object.assign((n, r, i = {}) => t(n, r, O(s, i)), {
+    Minimatch: class extends t.Minimatch {
+      constructor(r, i = {}) {
+        super(r, O(s, i));
+      }
+      static defaults(r) {
+        return t.defaults(O(s, r)).Minimatch;
+      }
+    },
+    AST: class extends t.AST {
+      /* c8 ignore start */
+      constructor(r, i, o = {}) {
+        super(r, i, O(s, o));
+      }
+      /* c8 ignore stop */
+      static fromGlob(r, i = {}) {
+        return t.AST.fromGlob(r, O(s, i));
+      }
+    },
+    unescape: (n, r = {}) => t.unescape(n, O(s, r)),
+    escape: (n, r = {}) => t.escape(n, O(s, r)),
+    filter: (n, r = {}) => t.filter(n, O(s, r)),
+    defaults: (n) => t.defaults(O(s, n)),
+    makeRe: (n, r = {}) => t.makeRe(n, O(s, r)),
+    braceExpand: (n, r = {}) => t.braceExpand(n, O(s, r)),
+    match: (n, r, i = {}) => t.match(n, r, O(s, i)),
+    sep: t.sep,
+    GLOBSTAR: D
+  });
+};
+m.defaults = rs;
+const Ht = (s, t = {}) => (V(s), t.nobrace || !/\{(?:(?!\{).)*\}/.test(s) ? [s] : me(s));
+m.braceExpand = Ht;
+const is = (s, t = {}) => new Z(s, t).makeRe();
+m.makeRe = is;
+const os = (s, t, e = {}) => {
+  const n = new Z(t, e);
+  return s = s.filter((r) => n.match(r)), n.options.nonull && !s.length && s.push(t), s;
+};
+m.match = os;
+const mt = /[?*]|[+@!]\(.*?\)|\[|\]/, as = (s) => s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&");
+class Z {
+  options;
+  set;
+  pattern;
+  windowsPathsNoEscape;
+  nonegate;
+  negate;
+  comment;
+  empty;
+  preserveMultipleSlashes;
+  partial;
+  globSet;
+  globParts;
+  nocase;
+  isWindows;
+  platform;
+  windowsNoMagicRoot;
+  regexp;
+  constructor(t, e = {}) {
+    V(t), e = e || {}, this.options = e, this.pattern = t, this.platform = e.platform || It, 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();
+  }
+  hasMagic() {
+    if (this.options.magicalBraces && this.set.length > 1)
+      return !0;
+    for (const t of this.set)
+      for (const e of t)
+        if (typeof e != "string")
+          return !0;
+    return !1;
+  }
+  debug(...t) {
+  }
+  make() {
+    const t = this.pattern, e = this.options;
+    if (!e.nocomment && t.charAt(0) === "#") {
+      this.comment = !0;
+      return;
+    }
+    if (!t) {
+      this.empty = !0;
+      return;
+    }
+    this.parseNegate(), this.globSet = [...new Set(this.braceExpand())], e.debug && (this.debug = (...i) => console.error(...i)), this.debug(this.pattern, this.globSet);
+    const n = this.globSet.map((i) => this.slashSplit(i));
+    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] === "?" || !mt.test(i[2])) && !mt.test(i[3]), h = /^[a-z]:/i.test(i[0]);
+        if (c)
+          return [...i.slice(0, 4), ...i.slice(4).map((l) => this.parse(l))];
+        if (h)
+          return [i[0], ...i.slice(1).map((l) => this.parse(l))];
+      }
+      return i.map((c) => this.parse(c));
+    });
+    if (this.debug(this.pattern, r), this.set = r.filter((i) => i.indexOf(!1) === -1), this.isWindows)
+      for (let i = 0; i < this.set.length; i++) {
+        const o = this.set[i];
+        o[0] === "" && o[1] === "" && this.globParts[i][2] === "?" && typeof o[3] == "string" && /^[a-z]:$/i.test(o[3]) && (o[2] = "?");
+      }
+    this.debug(this.pattern, this.set);
+  }
+  // various transforms to equivalent pattern sets that are
+  // faster to process in a filesystem walk.  The goal is to
+  // eliminate what we can, and push all ** patterns as far
+  // to the right as possible, even if it increases the number
+  // 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] = "*");
+    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;
+  }
+  // just get rid of adjascent ** portions
+  adjascentGlobstarOptimize(t) {
+    return t.map((e) => {
+      let n = -1;
+      for (; (n = e.indexOf("**", n + 1)) !== -1; ) {
+        let r = n;
+        for (; e[r + 1] === "**"; )
+          r++;
+        r !== n && e.splice(n, r - n);
+      }
+      return e;
+    });
+  }
+  // get rid of adjascent ** and resolve .. portions
+  levelOneOptimize(t) {
+    return t.map((e) => (e = e.reduce((n, r) => {
+      const i = n[n.length - 1];
+      return r === "**" && i === "**" ? n : r === ".." && i && i !== ".." && i !== "." && i !== "**" ? (n.pop(), n) : (n.push(r), n);
+    }, []), e.length === 0 ? [""] : e));
+  }
+  levelTwoFileOptimize(t) {
+    Array.isArray(t) || (t = this.slashSplit(t));
+    let e = !1;
+    do {
+      if (e = !1, !this.preserveMultipleSlashes) {
+        for (let r = 1; r < t.length - 1; r++) {
+          const i = t[r];
+          r === 1 && i === "" && t[0] === "" || (i === "." || i === "") && (e = !0, t.splice(r, 1), r--);
+        }
+        t[0] === "." && t.length === 2 && (t[1] === "." || t[1] === "") && (e = !0, t.pop());
+      }
+      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);
+      }
+    } while (e);
+    return t.length === 0 ? [""] : t;
+  }
+  // First phase: single-pattern processing
+  // <pre> is 1 or more portions
+  // <rest> is 1 or more portions
+  // <p> is any portion other than ., .., '', or **
+  // <e> is . or ''
+  //
+  // **/.. is *brutal* for filesystem walking performance, because
+  // it effectively resets the recursive walk each time it occurs,
+  // and ** cannot be reduced out by a .. pattern part like a regexp
+  // or most strings (other than .., ., and '') can be.
+  //
+  // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}
+  // <pre>/<e>/<rest> -> <pre>/<rest>
+  // <pre>/<p>/../<rest> -> <pre>/<rest>
+  // **/**/<rest> -> **/<rest>
+  //
+  // **/*/<rest> -> */**/<rest> <== not valid because ** doesn't follow
+  // this WOULD be allowed if ** did follow symlinks, or * didn't
+  firstPhasePreProcess(t) {
+    let e = !1;
+    do {
+      e = !1;
+      for (let n of t) {
+        let r = -1;
+        for (; (r = n.indexOf("**", r + 1)) !== -1; ) {
+          let o = r;
+          for (; n[o + 1] === "**"; )
+            o++;
+          o > r && n.splice(r + 1, o - r);
+          let a = n[r + 1];
+          const c = n[r + 2], h = n[r + 3];
+          if (a !== ".." || !c || c === "." || c === ".." || !h || h === "." || h === "..")
+            continue;
+          e = !0, n.splice(r, 1);
+          const l = n.slice(0);
+          l[r] = "**", t.push(l), r--;
+        }
+        if (!this.preserveMultipleSlashes) {
+          for (let o = 1; o < n.length - 1; o++) {
+            const a = n[o];
+            o === 1 && a === "" && n[0] === "" || (a === "." || a === "") && (e = !0, n.splice(o, 1), o--);
+          }
+          n[0] === "." && n.length === 2 && (n[1] === "." || n[1] === "") && (e = !0, n.pop());
+        }
+        let i = 0;
+        for (; (i = n.indexOf("..", i + 1)) !== -1; ) {
+          const o = n[i - 1];
+          if (o && o !== "." && o !== ".." && o !== "**") {
+            e = !0;
+            const c = i === 1 && n[i + 1] === "**" ? ["."] : [];
+            n.splice(i - 1, 2, ...c), n.length === 0 && n.push(""), i -= 2;
+          }
+        }
+      }
+    } while (e);
+    return t;
+  }
+  // second phase: multi-pattern dedupes
+  // {<pre>/*/<rest>,<pre>/<p>/<rest>} -> <pre>/*/<rest>
+  // {<pre>/<rest>,<pre>/<rest>} -> <pre>/<rest>
+  // {<pre>/**/<rest>,<pre>/<rest>} -> <pre>/**/<rest>
+  //
+  // {<pre>/**/<rest>,<pre>/**/<p>/<rest>} -> <pre>/**/<rest>
+  // ^-- not valid because ** doens't follow symlinks
+  secondPhasePreProcess(t) {
+    for (let e = 0; e < t.length - 1; e++)
+      for (let n = e + 1; n < t.length; n++) {
+        const r = this.partsMatch(t[e], t[n], !this.preserveMultipleSlashes);
+        if (r) {
+          t[e] = [], t[n] = r;
+          break;
+        }
+      }
+    return t.filter((e) => e.length);
+  }
+  partsMatch(t, e, n = !1) {
+    let r = 0, i = 0, o = [], a = "";
+    for (; r < t.length && i < e.length; )
+      if (t[r] === e[i])
+        o.push(a === "b" ? e[i] : t[r]), r++, i++;
+      else if (n && t[r] === "**" && e[i] === t[r + 1])
+        o.push(t[r]), r++;
+      else if (n && e[i] === "**" && t[r] === e[i + 1])
+        o.push(e[i]), i++;
+      else if (t[r] === "*" && e[i] && (this.options.dot || !e[i].startsWith(".")) && e[i] !== "**") {
+        if (a === "b")
+          return !1;
+        a = "a", o.push(t[r]), r++, i++;
+      } else if (e[i] === "*" && t[r] && (this.options.dot || !t[r].startsWith(".")) && t[r] !== "**") {
+        if (a === "a")
+          return !1;
+        a = "b", o.push(e[i]), r++, i++;
+      } else
+        return !1;
+    return t.length === e.length && o;
+  }
+  parseNegate() {
+    if (this.nonegate)
+      return;
+    const t = this.pattern;
+    let e = !1, n = 0;
+    for (let r = 0; r < t.length && t.charAt(r) === "!"; r++)
+      e = !e, n++;
+    n && (this.pattern = t.slice(n)), this.negate = e;
+  }
+  // set partial to true to test if, for example,
+  // "/a/b" matches the start of "/*/b/*/d"
+  // Partial means, if you run out of file before you run
+  // out of pattern, then that's fine, as long as all
+  // the parts match.
+  matchOne(t, e, n = !1) {
+    const r = this.options;
+    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]), v = typeof e[0] == "string" && /^[a-z]:$/i.test(e[0]), T = !v && e[0] === "" && e[1] === "" && e[2] === "?" && typeof e[3] == "string" && /^[a-z]:$/i.test(e[3]), x = S ? 3 : p ? 0 : void 0, y = T ? 3 : v ? 0 : void 0;
+      if (typeof x == "number" && typeof y == "number") {
+        const [P, H] = [t[x], e[y]];
+        P.toLowerCase() === H.toLowerCase() && (e[y] = P, y > x ? e = e.slice(y) : x > y && (t = t.slice(x)));
+      }
+    }
+    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, h = e.length; o < c && a < h; o++, a++) {
+      this.debug("matchOne loop");
+      var l = e[a], f = t[o];
+      if (this.debug(e, l, f), l === !1)
+        return !1;
+      if (l === D) {
+        this.debug("GLOBSTAR", [e, l, f]);
+        var u = o, d = a + 1;
+        if (d === h) {
+          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, d, g), this.matchOne(t.slice(u), e.slice(d), 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, d);
+            break;
+          }
+          this.debug("globstar swallow a segment, and continue"), u++;
+        }
+        return !!(n && (this.debug(`
+>>> no match, partial?`, t, u, e, d), u === c));
+      }
+      let p;
+      if (typeof l == "string" ? (p = f === l, this.debug("string match", l, f, p)) : (p = l.test(f), this.debug("pattern match", l, f, p)), !p)
+        return !1;
+    }
+    if (o === c && a === h)
+      return !0;
+    if (o === c)
+      return n;
+    if (a === h)
+      return o === c - 1 && t[o] === "";
+    throw new Error("wtf?");
+  }
+  braceExpand() {
+    return Ht(this.pattern, this.options);
+  }
+  parse(t) {
+    V(t);
+    const e = this.options;
+    if (t === "**")
+      return D;
+    if (t === "")
+      return "";
+    let n, r = null;
+    (n = t.match(Ue)) ? r = e.dot ? qe : Ge : (n = t.match(Re)) ? r = (e.nocase ? e.dot ? Le : He : e.dot ? Ie : ke)(n[1]) : (n = t.match(Ve)) ? r = (e.nocase ? e.dot ? Ze : Ye : e.dot ? Xe : Je)(n) : (n = t.match(ze)) ? r = e.dot ? je : We : (n = t.match(_e)) && (r = Be);
+    const i = E.fromGlob(t, this.options).toMMPattern();
+    return r && typeof i == "object" && Reflect.defineProperty(i, "test", { value: r }), i;
+  }
+  makeRe() {
+    if (this.regexp || this.regexp === !1)
+      return this.regexp;
+    const t = this.set;
+    if (!t.length)
+      return this.regexp = !1, this.regexp;
+    const e = this.options, n = e.noglobstar ? ts : e.dot ? es : ss, r = new Set(e.nocase ? ["i"] : []);
+    let i = t.map((c) => {
+      const h = c.map((l) => {
+        if (l instanceof RegExp)
+          for (const f of l.flags.split(""))
+            r.add(f);
+        return typeof l == "string" ? as(l) : l === D ? D : l._src;
+      });
+      return h.forEach((l, f) => {
+        const u = h[f + 1], d = h[f - 1];
+        l !== D || d === D || (d === void 0 ? u !== void 0 && u !== D ? h[f + 1] = "(?:\\/|" + n + "\\/)?" + u : h[f] = n : u === void 0 ? h[f - 1] = d + "(?:\\/|" + n + ")?" : u !== D && (h[f - 1] = d + "(?:\\/|\\/" + n + "\\/)" + u, h[f + 1] = D));
+      }), h.filter((l) => l !== D).join("/");
+    }).join("|");
+    const [o, a] = t.length > 1 ? ["(?:", ")"] : ["", ""];
+    i = "^" + o + i + a + "$", this.negate && (i = "^(?!" + i + ").+$");
+    try {
+      this.regexp = new RegExp(i, [...r].join(""));
+    } catch {
+      this.regexp = !1;
+    }
+    return this.regexp;
+  }
+  slashSplit(t) {
+    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)
+      return !1;
+    if (this.empty)
+      return t === "";
+    if (t === "/" && e)
+      return !0;
+    const n = this.options;
+    this.isWindows && (t = t.split("\\").join("/"));
+    const r = this.slashSplit(t);
+    this.debug(this.pattern, "split", r);
+    const i = this.set;
+    this.debug(this.pattern, "set", i);
+    let o = r[r.length - 1];
+    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 h = r;
+      if (n.matchBase && c.length === 1 && (h = [o]), this.matchOne(h, c, e))
+        return n.flipNegate ? !0 : !this.negate;
+    }
+    return n.flipNegate ? !1 : this.negate;
+  }
+  static defaults(t) {
+    return m.defaults(t).Minimatch;
+  }
+}
+m.AST = E;
+m.Minimatch = Z;
+m.escape = Pe;
+m.unescape = I;
+function cs() {
+  if (!("storage" in navigator) || !("getDirectory" in navigator.storage))
+    throw new Qt();
+}
+async function $(s, t) {
+  return typeof navigator < "u" && navigator.locks?.request ? navigator.locks.request(`opfs:${s.replace(/\/+/g, "/")}`, { mode: "exclusive" }, t) : t();
+}
+function M(s) {
+  return Array.isArray(s) ? s : (s.startsWith("~/") ? s.slice(2) : s).split("/").filter(Boolean);
+}
+function lt(s) {
+  return typeof s == "string" ? s ?? "/" : `/${s.join("/")}`;
+}
+function it(s) {
+  const t = M(s);
+  return t[t.length - 1] || "";
+}
+function K(s) {
+  const t = M(s);
+  return t.pop(), lt(t);
+}
+function Y(s) {
+  return !s || s === "/" ? "/" : s.startsWith("~/") ? `/${s.slice(2)}` : s.startsWith("/") ? s : `/${s}`;
+}
+function ls(s, t = !1) {
+  return s = s.replace(/\/$/, ""), t && !s.includes("*") ? `${s}/**` : s;
+}
+function tt(s, t) {
+  return m(s, t, {
+    dot: !0,
+    matchBase: !0
+  });
+}
+function Lt(s) {
+  const t = Y(s), e = M(t), n = [];
+  for (const r of e)
+    if (!(r === "." || r === ""))
+      if (r === "..") {
+        if (n.length === 0)
+          continue;
+        n.pop();
+      } else
+        n.push(r);
+  return lt(n);
+}
+async function hs(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("");
+}
+async function us(s) {
+  const t = await s.arrayBuffer();
+  return new Uint8Array(t);
+}
+async function fs(s, t, e = {}) {
+  const n = it(t);
+  return $(t, async () => {
+    const r = e.recursive ?? !1, i = e.force ?? !1;
+    try {
+      await s.removeEntry(n, { recursive: r });
+    } catch (o) {
+      if (o.name === "NotFoundError" && i)
+        return;
+      const a = o.name === "TypeMismatchError" && !r;
+      throw A(o, {
+        path: t,
+        operation: "remove",
+        isDirectory: a
+      });
+    }
+  });
+}
+function Et(s, t, e, n) {
+  if (!Number.isInteger(t) || !Number.isInteger(e))
+    throw new C("argument", "Invalid offset or length");
+  if (t < 0 || e < 0)
+    throw new C("argument", "Negative offset or length not allowed");
+  if (t + e > s)
+    throw new C("overflow", "Operation would overflow buffer");
+  if (n != null && (!Number.isInteger(n) || n < 0))
+    throw new C("argument", "Invalid position");
+}
+function St(s, t, e) {
+  try {
+    t.flush(), t.close();
+  } catch (n) {
+    console.warn(`Warning: Failed to properly close file descriptor ${s} (${e}):`, n);
+  }
+}
+function ds(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 ps(s, t) {
+  try {
+    return await s.createSyncAccessHandle();
+  } catch (e) {
+    throw A(e, { path: t, isDirectory: !1 });
+  }
+}
+class gs {
+  /** Root directory handle for the file system */
+  root;
+  /** Map of watched paths and options */
+  watchers = /* @__PURE__ */ new Map();
+  /** Promise to prevent concurrent mount operations */
+  mountingPromise = null;
+  /** BroadcastChannel instance for sending events */
+  broadcastChannel = null;
+  /** Configuration options */
+  options = {
+    root: "/",
+    namespace: "",
+    maxFileSize: 50 * 1024 * 1024,
+    hashAlgorithm: "etag",
+    broadcastChannel: "opfs-worker"
+  };
+  /**
+   * Notify about internal changes to the file system
+   * 
+   * This method is called by internal operations to notify clients about
+   * changes, even when no specific paths are being watched.
+   * 
+   * @param event - The event describing the change
+   */
+  async notifyChange(t) {
+    if (!this.options.broadcastChannel)
+      return;
+    const e = t.path;
+    if (![...this.watchers.values()].some((i) => tt(e, i.pattern) && i.include.some((o) => o && tt(e, o)) && !i.exclude.some((o) => o && tt(e, o))))
+      return;
+    let r;
+    if (this.options.hashAlgorithm)
+      try {
+        r = (await this.stat(e)).hash;
+      } catch {
+      }
+    try {
+      this.broadcastChannel || (this.broadcastChannel = new BroadcastChannel(this.options.broadcastChannel));
+      const i = {
+        namespace: this.options.namespace,
+        timestamp: (/* @__PURE__ */ new Date()).toISOString(),
+        ...t,
+        ...r && { hash: r }
+      };
+      this.broadcastChannel.postMessage(i);
+    } catch (i) {
+      console.warn("Failed to send event via BroadcastChannel:", i);
+    }
+  }
+  constructor(t) {
+    cs(), t && this.setOptions(t);
+  }
+  /**
+   * Initialize the file system within a given directory.
+   * If no root is specified, uses the OPFS root directory.
+   */
+  async mount() {
+    const t = this.options.root;
+    return this.mountingPromise && await this.mountingPromise, this.mountingPromise = new Promise(async (e, n) => {
+      try {
+        const r = await navigator.storage.getDirectory();
+        this.root = t === "/" ? r : await this.getDirectoryHandle(t, !0, r), e(!0);
+      } catch (r) {
+        n(new re(t, r));
+      } finally {
+        this.mountingPromise = null;
+      }
+    }), this.mountingPromise;
+  }
+  /**
+   * Update configuration options
+   * 
+   * @param options - Configuration options to update
+   * @param options.root - Root path for the file system
+   * @param options.watchInterval - Polling interval in milliseconds for file watching
+   * @param options.hashAlgorithm - Hash algorithm for file hashing
+   * @param options.maxFileSize - Maximum file size for hashing in bytes
+   * @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 = Y(t.root), this.options.namespace || (this.options.namespace = `opfs-worker:${this.options.root}`), await this.mount());
+  }
+  /**
+   * Get a directory handle from a path
+   * 
+   * Navigates through the directory structure to find or create a directory
+   * at the specified path.
+   * 
+   * @param path - The path to the directory (string or array of segments)
+   * @param create - Whether to create the directory if it doesn't exist (default: false)
+   * @param from - The directory to start from (default: root directory)
+   * @returns Promise that resolves to the directory handle
+   * @throws {OPFSError} If the directory cannot be accessed or created
+   * 
+   * @example
+   * ```typescript
+   * const docsDir = await fs.getDirectoryHandle('/users/john/documents', true);
+   * const docsDir2 = await fs.getDirectoryHandle(['users', 'john', 'documents'], true);
+   * ```
+   */
+  async getDirectoryHandle(t, e = !1, n = this.root) {
+    const r = Array.isArray(t) ? t : M(t);
+    let i = n;
+    for (const o of r)
+      i = await i.getDirectoryHandle(o, { create: e });
+    return i;
+  }
+  /**
+   * Get a file handle from a path
+   * 
+   * Navigates to the parent directory and retrieves or creates a file handle
+   * for the specified file path.
+   * 
+   * @param path - The path to the file (string or array of segments)
+   * @param create - Whether to create the file if it doesn't exist (default: false)
+   * @param _from - The directory to start from (default: root directory)
+   * @returns Promise that resolves to the file handle
+   * @throws {PathError} If the path is empty
+   * @throws {OPFSError} If the file cannot be accessed or created
+   * 
+   * @example
+   * ```typescript
+   * const fileHandle = await fs.getFileHandle('/config/settings.json', true);
+   * const fileHandle2 = await fs.getFileHandle(['config', 'settings.json'], true);
+   * ```
+   */
+  async getFileHandle(t, e = !1, n = this.root) {
+    const r = M(t);
+    if (r.length === 0)
+      throw new Kt("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 });
+  }
+  /**
+   * Get a complete index of all files and directories in the file system
+   * 
+   * This method recursively traverses the entire file system and returns
+   * a Map containing FileStat objects for every file and directory.
+   * 
+   * @returns Promise that resolves to a Map of paths to FileStat objects
+   * @throws {OPFSError} If the file system is not mounted
+   * 
+   * @example
+   * ```typescript
+   * const index = await fs.index();
+   * const fileStats = index.get('/data/config.json');
+   * if (fileStats) {
+   *   console.log(`File size: ${fileStats.size} bytes`);
+   *   if (fileStats.hash) console.log(`Hash: ${fileStats.hash}`);
+   * }
+   * ```
+   */
+  async index() {
+    const t = /* @__PURE__ */ new Map(), e = async (n) => {
+      const r = await this.readDir(n);
+      for (const i of r) {
+        const o = `${n === "/" ? "" : n}/${i.name}`;
+        try {
+          const a = await this.stat(o);
+          t.set(o, a), a.isDirectory && await e(o);
+        } catch (a) {
+          console.warn(`Skipping broken entry: ${o}`, a);
+        }
+      }
+    };
+    return t.set("/", {
+      kind: "directory",
+      size: 0,
+      mtime: (/* @__PURE__ */ new Date(0)).toISOString(),
+      ctime: (/* @__PURE__ */ new Date(0)).toISOString(),
+      isFile: !1,
+      isDirectory: !0
+    }), await e("/"), t;
+  }
+  /**
+   * Create a directory
+   * 
+   * Creates a new directory at the specified path. If the recursive option
+   * is enabled, parent directories will be created as needed.
+   * 
+   * @param path - The path where the directory should be created
+   * @param options - Options for directory creation
+   * @param options.recursive - Whether to create parent directories if they don't exist (default: false)
+   * @returns Promise that resolves when the directory is created
+   * @throws {OPFSError} If the directory cannot be created
+   * 
+   * @example
+   * ```typescript
+   * // Create a single directory
+   * await fs.mkdir('/users/john');
+   * 
+   * // Create nested directories
+   * await fs.mkdir('/users/john/documents/projects', { recursive: true });
+   * ```
+   */
+  async mkdir(t, e) {
+    await this.mount();
+    const n = e?.recursive ?? !1, r = M(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" ? A(c, {
+          path: lt(r.slice(0, o + 1)),
+          existenceType: "directory"
+        }) : c.name === "TypeMismatchError" ? A(c, { path: a, isDirectory: !1 }) : new J("create directory", a, c);
+      }
+    }
+    await this.notifyChange({ path: t, type: b.Added, isDirectory: !0 });
+  }
+  /**
+   * Get file or directory statistics
+   * 
+   * Returns detailed information about a file or directory, including
+   * size, modification time, and optionally a hash of the file content.
+   * 
+   * @param path - The path to the file or directory
+   * @returns Promise that resolves to FileStat object
+   * @throws {OPFSError} If the path does not exist or cannot be accessed
+   * 
+   * @example
+   * ```typescript
+   * const stats = await fs.stat('/data/config.json');
+   * console.log(`File size: ${stats.size} bytes`);
+   * console.log(`Last modified: ${stats.mtime}`);
+   * 
+   * // If hashing is enabled, hash will be included
+   * if (stats.hash) {
+   *   console.log(`Hash: ${stats.hash}`);
+   * }
+   * ```
+   */
+  async stat(t) {
+    if (await this.mount(), t === "/")
+      return {
+        kind: "directory",
+        size: 0,
+        mtime: (/* @__PURE__ */ new Date(0)).toISOString(),
+        ctime: (/* @__PURE__ */ new Date(0)).toISOString(),
+        isFile: !1,
+        isDirectory: !0
+      };
+    const e = it(t);
+    let n;
+    try {
+      n = await this.getDirectoryHandle(K(t), !1);
+      const r = this.options.hashAlgorithm, o = await (await n.getFileHandle(e, { create: !1 })).getFile(), a = {
+        kind: "file",
+        size: o.size,
+        mtime: new Date(o.lastModified).toISOString(),
+        ctime: new Date(o.lastModified).toISOString(),
+        isFile: !0,
+        isDirectory: !1
+      };
+      if (r === "etag")
+        a.hash = `${o.lastModified.toString(36)}-${o.size.toString(36)}`;
+      else if (typeof r == "string")
+        try {
+          const c = await hs(o, r, this.options.maxFileSize);
+          a.hash = c;
+        } catch (c) {
+          console.warn(`Failed to calculate hash for ${t}:`, c);
+        }
+      return a;
+    } catch (r) {
+      if (r.name === "NotFoundError")
+        throw new B("file", t, r);
+      if (r.name !== "TypeMismatchError")
+        throw new J("stat", t, r);
+    }
+    try {
+      return await n.getDirectoryHandle(e, { create: !1 }), {
+        kind: "directory",
+        size: 0,
+        mtime: (/* @__PURE__ */ new Date(0)).toISOString(),
+        ctime: (/* @__PURE__ */ new Date(0)).toISOString(),
+        isFile: !1,
+        isDirectory: !0
+      };
+    } catch (r) {
+      throw new J("stat", t, r);
+    }
+  }
+  /**
+   * Read a directory's contents
+   * 
+   * Lists all files and subdirectories within the specified directory.
+   * 
+   * @param path - The path to the directory to read
+   * @returns Promise that resolves to an array of detailed file/directory information
+   * @throws {OPFSError} If the directory does not exist or cannot be accessed
+   * 
+   * @example
+   * ```typescript
+   * // Get detailed information about files and directories
+   * const detailed = await fs.readDir('/users/john/documents');
+   * detailed.forEach(item => {
+   *   console.log(`${item.name} - ${item.isFile ? 'file' : 'directory'}`);
+   * });
+   * ```
+   */
+  async readDir(t) {
+    await this.mount();
+    const e = await this.getDirectoryHandle(t, !1), n = [];
+    for await (const [r, i] of e.entries()) {
+      const o = i.kind === "file";
+      n.push({
+        name: r,
+        kind: i.kind,
+        isFile: o,
+        isDirectory: !o
+      });
+    }
+    return n;
+  }
+  /**
+   * Check if a file or directory exists
+   * 
+   * Verifies if a file or directory exists at the specified path.
+   * 
+   * @param path - The path to check
+   * @returns Promise that resolves to true if the file or directory exists, false otherwise  
+   * 
+   * @example
+   * ```typescript
+   * const exists = await fs.exists('/config/settings.json');
+   * console.log(`File exists: ${exists}`);
+   * ```
+   */
+  async exists(t) {
+    if (await this.mount(), t === "/")
+      return !0;
+    const e = it(t);
+    let n = null;
+    try {
+      n = await this.getDirectoryHandle(K(t), !1);
+    } catch (r) {
+      if (n = null, r.name !== "NotFoundError" && r.name !== "TypeMismatchError")
+        throw r;
+    }
+    if (!n || !e)
+      return !1;
+    try {
+      return await n.getFileHandle(e, { create: !1 }), !0;
+    } catch (r) {
+      if (r.name !== "NotFoundError" && r.name !== "TypeMismatchError")
+        throw r;
+      try {
+        return await n.getDirectoryHandle(e, { create: !1 }), !0;
+      } catch (i) {
+        if (i.name !== "NotFoundError" && i.name !== "TypeMismatchError")
+          throw i;
+        return !1;
+      }
+    }
+  }
+  /**
+   * Clear all contents of a directory without removing the directory itself
+   * 
+   * Removes all files and subdirectories within the specified directory,
+   * but keeps the directory itself.
+   * 
+   * @param path - The path to the directory to clear (default: '/')
+   * @returns Promise that resolves when all contents are removed
+   * @throws {OPFSError} If the operation fails
+   * 
+   * @example
+   * ```typescript
+   * // Clear root directory contents
+   * await fs.clear('/');
+   * 
+   * // Clear specific directory contents
+   * await fs.clear('/data');
+   * ```
+   */
+  async clear(t = "/") {
+    await this.mount();
+    try {
+      const e = await this.readDir(t);
+      for (const n of e) {
+        const r = `${t === "/" ? "" : t}/${n.name}`;
+        await this.remove(r, { recursive: !0 });
+      }
+      await this.notifyChange({ path: t, type: b.Changed, isDirectory: !0 });
+    } catch (e) {
+      throw e instanceof w ? e : A(e, { path: t, isDirectory: !0 });
+    }
+  }
+  /**
+   * Remove files and directories
+   * 
+   * Removes files and directories. Similar to Node.js fs.rm().
+   * 
+   * @param path - The path to remove
+   * @param options - Options for removal
+   * @param options.recursive - Whether to remove directories and their contents recursively (default: false)
+   * @param options.force - Whether to ignore errors if the path doesn't exist (default: false)
+   * @returns Promise that resolves when the removal is complete
+   * @throws {OPFSError} If the removal fails
+   * 
+   * @example
+   * ```typescript
+   * // Remove a file
+   * await fs.rm('/path/to/file.txt');
+   * 
+   * // Remove a directory and all its contents
+   * await fs.rm('/path/to/directory', { recursive: true });
+   * 
+   * // Remove with force (ignore if doesn't exist)
+   * await fs.rm('/maybe/exists', { force: true });
+   * ```
+   */
+  async remove(t, e) {
+    if (await this.mount(), t === "/")
+      throw new nt("EROOT", t);
+    const { recursive: n = !1, force: r = !1 } = e || {}, i = await this.getDirectoryHandle(K(t), !1), o = await this.stat(t);
+    await fs(i, t, { recursive: n, force: r }), await this.notifyChange({ path: t, type: b.Removed, isDirectory: o.isDirectory });
+  }
+  /**
+   * Resolve a path to an absolute path
+   * 
+   * Resolves relative paths and normalizes path segments (like '..' and '.').
+   * Similar to Node.js fs.realpath() but without symlink resolution since OPFS doesn't support symlinks.
+   * 
+   * @param path - The path to resolve
+   * @returns Promise that resolves to the absolute normalized path
+   * @throws {FileNotFoundError} If the path does not exist
+   * @throws {OPFSError} If path resolution fails
+   * 
+   * @example
+   * ```typescript
+   * // Resolve relative path
+   * const absolute = await fs.realpath('./config/../data/file.txt');
+   * console.log(absolute); // '/data/file.txt'
+   * ```
+   */
+  async realpath(t) {
+    await this.mount();
+    try {
+      const e = Lt(t);
+      if (!await this.exists(e))
+        throw new B("file", e);
+      return e;
+    } catch (e) {
+      throw e instanceof w ? e : A(e, { path: t });
+    }
+  }
+  /**
+   * Rename a file or directory
+   * 
+   * Changes the name of a file or directory. If the target path already exists,
+   * it will be replaced only if overwrite option is enabled.
+   * 
+   * @param oldPath - The current path of the file or directory
+   * @param newPath - The new path for the file or directory
+   * @param options - Options for renaming
+   * @param options.overwrite - Whether to overwrite existing files (default: false)
+   * @returns Promise that resolves when the rename operation is complete
+   * @throws {OPFSError} If the rename operation fails
+   * 
+   * @example
+   * ```typescript
+   * // Basic rename (fails if target exists)
+   * await fs.rename('/old/path/file.txt', '/new/path/renamed.txt');
+   * 
+   * // Rename with overwrite
+   * await fs.rename('/old/path/file.txt', '/new/path/renamed.txt', { overwrite: true });
+   * ```
+   */
+  async rename(t, e, n) {
+    await this.mount();
+    try {
+      const r = n?.overwrite ?? !1, i = await this.stat(t);
+      if (await this.exists(e) && !r)
+        throw new rt(e);
+      await this.copy(t, e, { recursive: !0, overwrite: r }), await this.remove(t, { recursive: !0 }), await this.notifyChange({ path: t, type: b.Removed, isDirectory: i.isDirectory }), await this.notifyChange({ path: e, type: b.Added, isDirectory: i.isDirectory });
+    } catch (r) {
+      throw r instanceof w ? r : A(r, { path: t });
+    }
+  }
+  /**
+   * Copy files and directories
+   * 
+   * Copies files and directories. Similar to Node.js fs.cp().
+   * 
+   * @param source - The source path to copy from
+   * @param destination - The destination path to copy to
+   * @param options - Options for copying
+   * @param options.recursive - Whether to copy directories recursively (default: false)
+   * @param options.overwrite - Whether to overwrite existing files (default: true)
+   * @returns Promise that resolves when the copy operation is complete
+   * @throws {OPFSError} If the copy operation fails
+   * 
+   * @example
+   * ```typescript
+   * // Copy a file
+   * await fs.copy('/source/file.txt', '/dest/file.txt');
+   * 
+   * // Copy a directory and all its contents
+   * await fs.copy('/source/dir', '/dest/dir', { recursive: true });
+   * 
+   * // Copy without overwriting existing files
+   * await fs.copy('/source', '/dest', { recursive: true, overwrite: false });
+   * ```
+   */
+  async copy(t, e, n) {
+    await this.mount();
+    try {
+      const r = n?.recursive ?? !1, i = n?.overwrite ?? !0;
+      if (!await this.exists(t))
+        throw new B("source", t);
+      if (await this.exists(e) && !i)
+        throw new rt(e);
+      if ((await this.stat(t)).isFile) {
+        const h = await this.readFile(t);
+        await this.writeFile(e, h);
+      } else {
+        if (!r)
+          throw new st("directory", t);
+        await this.mkdir(e, { recursive: !0 });
+        const h = await this.readDir(t);
+        for (const l of h) {
+          const f = `${t}/${l.name}`, u = `${e}/${l.name}`;
+          await this.copy(f, u, { recursive: !0, overwrite: i });
+        }
+      }
+    } catch (r) {
+      throw r instanceof w ? r : A(r, { path: t });
+    }
+  }
+  /**
+   * Start watching a file or directory for changes
+   * 
+   * @param path - The path to watch (minimatch syntax allowed)
+   * @param options - Watch options
+   * @param options.recursive - Whether to watch recursively (default: true)
+   * @param options.exclude - Glob pattern(s) to exclude (minimatch).
+   * @returns Promise that resolves when watching starts
+   * 
+   * @example
+   * ```typescript
+   * // Watch entire directory tree recursively (default)
+   * await fs.watch('/data');
+   * 
+   * // Watch only immediate children (shallow)
+   * await fs.watch('/data', { recursive: false });
+   * 
+   * // Watch a single file
+   * await fs.watch('/config.json', { recursive: false });
+   * 
+   * // Watch all json files but not in dist directory
+   * await fs.watch('/**\/*.json', { recursive: false, exclude: ['dist/**'] });
+   *
+   * ```
+   */
+  async watch(t, e) {
+    if (!this.options.broadcastChannel)
+      throw new Ct("This instance is not configured to send events. Please specify options.broadcastChannel to enable watching.");
+    const n = {
+      pattern: ls(t, e?.recursive ?? !0),
+      include: Array.isArray(e?.include) ? e.include : [e?.include ?? "**"],
+      exclude: Array.isArray(e?.exclude) ? e.exclude : [e?.exclude ?? ""]
+    };
+    this.watchers.set(t, n);
+  }
+  /**
+   * Stop watching a previously watched path
+   */
+  unwatch(t) {
+    this.watchers.delete(t);
+  }
+  /**
+   * Bulk-create files from `[path, data]` entries (strings, bytes, or Blobs).
+   *
+   * @param entries - Array of `[path, data]` tuples
+   * @throws {OPFSError} If a write fails
+   *
+   * @example
+   * ```typescript
+   * await fs.createIndex([
+   *   ['/config.json', JSON.stringify({ theme: 'dark' })],
+   *   ['/data/binary.dat', new Uint8Array([1, 2, 3, 4])],
+   *   ['/upload.txt', new Blob(['file content'], { type: 'text/plain' })],
+   * ]);
+   * ```
+   */
+  async createIndex(t) {
+    await this.mount();
+    try {
+      for (const [e, n] of t) {
+        const r = Y(e);
+        let i;
+        n instanceof Blob ? i = await us(n) : typeof n == "string" ? i = new TextEncoder().encode(n) : i = n, await this.writeFile(r, i);
+      }
+    } catch (e) {
+      throw e instanceof w ? e : A(e);
+    }
+  }
+  /**
+   * Dispose of resources and clean up the file system instance
+   */
+  dispose() {
+    this.broadcastChannel && (this.broadcastChannel.close(), this.broadcastChannel = null), this.watchers.clear();
+  }
+}
+class ws extends gs {
+  /** Shared sync handles per path (OPFS allows only one handle per file) */
+  openHandles = /* @__PURE__ */ new Map();
+  /** Map of open file descriptors to their metadata */
+  openFiles = /* @__PURE__ */ new Map();
+  /** Next available file descriptor number */
+  nextFd = 1;
+  constructor(t) {
+    super(t);
+  }
+  /**
+   * Get file info by descriptor with validation
+   * @private
+   */
+  _getFileDescriptor(t) {
+    const e = this.openFiles.get(t);
+    if (!e)
+      throw new C("descriptor", `Invalid file descriptor: ${t}`);
+    return e;
+  }
+  async readFile(t) {
+    await this.mount();
+    try {
+      return await $(t, async () => {
+        const e = await this.open(t);
+        try {
+          const { size: n } = await this.fstat(e), r = new Uint8Array(n);
+          return n > 0 && await this.read(e, r, 0, n, 0), _(r, [r.buffer]);
+        } finally {
+          await this.close(e);
+        }
+      });
+    } catch (e) {
+      throw e instanceof w ? e : A(e, { path: t, isDirectory: !1 });
+    }
+  }
+  async writeFile(t, e) {
+    await this.mount();
+    const n = e instanceof Uint8Array ? e : new Uint8Array(e);
+    await $(t, async () => {
+      const r = await this.exists(t), i = await this.open(t, { create: !0, truncate: !0 });
+      try {
+        await this.write(i, n, 0, n.length, null, !1), await this.fsync(i);
+      } finally {
+        await this.close(i);
+      }
+      await this.notifyChange({ path: t, type: r ? b.Changed : b.Added, isDirectory: !1 });
+    });
+  }
+  async appendFile(t, e) {
+    await this.mount();
+    const n = e instanceof Uint8Array ? e : new Uint8Array(e);
+    await $(t, async () => {
+      const r = await this.open(t, { create: !0 });
+      try {
+        const { size: i } = await this.fstat(r);
+        await this.write(r, n, 0, n.length, i, !1), await this.fsync(r);
+      } finally {
+        await this.close(r);
+      }
+      await this.notifyChange({ path: t, type: b.Changed, isDirectory: !1 });
+    });
+  }
+  async writeStream(t, e, n) {
+    return await this.mount(), $(t, async () => {
+      const r = await this.exists(t), i = await this.open(t, { create: !0, truncate: !0 }), o = e.getReader();
+      let a = 0;
+      try {
+        for (; ; ) {
+          const { done: c, value: h } = await o.read();
+          if (c)
+            break;
+          let l = 0;
+          for (; l < h.byteLength; )
+            l += await this.write(
+              i,
+              h,
+              l,
+              h.byteLength - l,
+              null,
+              !1
+            );
+          a += h.byteLength, await n?.(a);
+        }
+        await this.fsync(i);
+      } catch (c) {
+        throw await o.cancel(c).catch(() => {
+        }), c;
+      } finally {
+        o.releaseLock(), await this.close(i);
+      }
+      return await this.notifyChange({
+        path: t,
+        type: r ? b.Changed : b.Added,
+        isDirectory: !1
+      }), a;
+    });
+  }
+  async open(t, e) {
+    await this.mount();
+    const { create: n = !1, exclusive: r = !1, truncate: i = !1 } = e || {}, o = Y(Lt(t));
+    try {
+      return n && r ? await $(o, async () => {
+        if (await this.exists(o))
+          throw new rt(o);
+        return this._openFile(o, n, i);
+      }) : await this._openFile(o, n, i);
+    } catch (a) {
+      if (a instanceof w)
+        throw a;
+      const c = a && a.name === "TypeMismatchError";
+      throw A(a, {
+        path: o,
+        isDirectory: !!c
+      });
+    }
+  }
+  /**
+   * Internal method to open a file (without locking)
+   *
+   * Multiple FDs for the same path share one sync access handle (OPFS limit),
+   * with independent per-FD positions — similar to Node.js.
+   * @private
+   */
+  async _openFile(t, e, n) {
+    let r = this.openHandles.get(t);
+    if (!r) {
+      const o = await this.getFileHandle(t, e);
+      try {
+        await o.getFile();
+      } catch (c) {
+        throw A(c, { path: t, isDirectory: !0 });
+      }
+      const a = await ps(o, t);
+      r = { fileHandle: o, syncHandle: a, refCount: 0 }, this.openHandles.set(t, r);
+    }
+    r.refCount++, n && (r.syncHandle.truncate(0), r.syncHandle.flush());
+    const i = this.nextFd++;
+    return this.openFiles.set(i, {
+      path: t,
+      fileHandle: r.fileHandle,
+      syncHandle: r.syncHandle,
+      position: 0
+    }), i;
+  }
+  async close(t) {
+    const e = this._getFileDescriptor(t);
+    this.openFiles.delete(t);
+    const n = this.openHandles.get(e.path);
+    n && (n.refCount--, n.refCount <= 0 && (St(t, n.syncHandle, e.path), this.openHandles.delete(e.path)));
+  }
+  async read(t, e, n, r, i) {
+    const o = this._getFileDescriptor(t);
+    Et(e.length, n, r, i);
+    try {
+      const a = i ?? o.position, c = o.syncHandle.getSize(), { isEOF: h, actualLength: l } = ds(a, r, c);
+      if (h)
+        return _({ bytesRead: 0, buffer: e }, [e.buffer]);
+      const f = e.subarray(n, n + l), u = o.syncHandle.read(f, { at: a });
+      return i == null && (o.position = a + u), _({ bytesRead: u, buffer: e }, [e.buffer]);
+    } catch (a) {
+      throw z("read", t, o.path, a);
+    }
+  }
+  async write(t, e, n = 0, r, i, o = !0) {
+    const a = this._getFileDescriptor(t), c = r ?? e.length - n;
+    Et(e.length, n, c, i);
+    try {
+      const h = i ?? a.position, l = e.subarray(n, n + c), f = a.syncHandle.write(l, { at: h });
+      return (i == null || i === a.position) && (a.position = h + f), o && await this.notifyChange({ path: a.path, type: b.Changed, isDirectory: !1 }), f;
+    } catch (h) {
+      throw z("write", t, a.path, h);
+    }
+  }
+  async fstat(t) {
+    const e = this._getFileDescriptor(t);
+    return this.stat(e.path);
+  }
+  async ftruncate(t, e = 0) {
+    const n = this._getFileDescriptor(t);
+    if (e < 0 || !Number.isInteger(e))
+      throw new C("argument", "Invalid size");
+    try {
+      n.syncHandle.truncate(e), n.syncHandle.flush(), n.position > e && (n.position = e), await this.notifyChange({ path: n.path, type: b.Changed, isDirectory: !1 });
+    } catch (r) {
+      throw z("truncate", t, n.path, r);
+    }
+  }
+  async fsync(t) {
+    const e = this._getFileDescriptor(t);
+    try {
+      e.syncHandle.flush();
+    } catch (n) {
+      throw z("sync", t, e.path, n);
+    }
+  }
+  dispose() {
+    for (const [t, e] of this.openHandles)
+      St(-1, e.syncHandle, t);
+    this.openHandles.clear(), this.openFiles.clear(), this.nextFd = 1, super.dispose();
+  }
+}
+ot(new ws());
+//# sourceMappingURL=dedicated.worker.js.map