opfs-worker 2.1.0 → 2.1.2

package/dist/createOPFSDedicated-EmIwluQo.cjs

@@ -0,0 +1,2597 @@
+"use strict";const b=require("./OPFSFacade-BJv2yuWU.cjs"),v=require("comlink"),g=require("./BaseOPFS-Bu7FZtCb.cjs"),y=`const Ot = /* @__PURE__ */ Symbol("Comlink.proxy"), Bt = /* @__PURE__ */ Symbol("Comlink.endpoint"), Gt = /* @__PURE__ */ Symbol("Comlink.releaseProxy"), X = /* @__PURE__ */ Symbol("Comlink.finalizer"), H = /* @__PURE__ */ Symbol("Comlink.thrown"), Dt = (n) => typeof n == "object" && n !== null || typeof n == "function", Ut = {
+  canHandle: (n) => Dt(n) && n[Ot],
+  serialize(n) {
+    const { port1: t, port2: e } = new MessageChannel();
+    return U(n, t), [e, [e]];
+  },
+  deserialize(n) {
+    return n.start(), Yt(n);
+  }
+}, qt = {
+  canHandle: (n) => Dt(n) && H in n,
+  serialize({ value: n }) {
+    let t;
+    return n instanceof Error ? t = {
+      isError: !0,
+      value: {
+        message: n.message,
+        name: n.name,
+        stack: n.stack
+      }
+    } : t = { isError: !1, value: n }, [t, []];
+  },
+  deserialize(n) {
+    throw n.isError ? Object.assign(new Error(n.value.message), n.value) : n.value;
+  }
+}, Mt = /* @__PURE__ */ new Map([
+  ["proxy", Ut],
+  ["throw", qt]
+]);
+function Vt(n, t) {
+  for (const e of n)
+    if (t === e || e === "*" || e instanceof RegExp && e.test(t))
+      return !0;
+  return !1;
+}
+function U(n, t = globalThis, e = ["*"]) {
+  t.addEventListener("message", function s(r) {
+    if (!r || !r.data)
+      return;
+    if (!Vt(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(T);
+    let l;
+    try {
+      const h = a.slice(0, -1).reduce((f, p) => f[p], n), u = a.reduce((f, p) => f[p], n);
+      switch (o) {
+        case "GET":
+          l = u;
+          break;
+        case "SET":
+          h[a.slice(-1)[0]] = T(r.data.value), l = !0;
+          break;
+        case "APPLY":
+          l = u.apply(h, c);
+          break;
+        case "CONSTRUCT":
+          {
+            const f = new u(...c);
+            l = Kt(f);
+          }
+          break;
+        case "ENDPOINT":
+          {
+            const { port1: f, port2: p } = new MessageChannel();
+            U(n, p), l = z(f, [f]);
+          }
+          break;
+        case "RELEASE":
+          l = void 0;
+          break;
+        default:
+          return;
+      }
+    } catch (h) {
+      l = { value: h, [H]: 0 };
+    }
+    Promise.resolve(l).catch((h) => ({ value: h, [H]: 0 })).then((h) => {
+      const [u, f] = B(h);
+      t.postMessage(Object.assign(Object.assign({}, u), { id: i }), f), o === "RELEASE" && (t.removeEventListener("message", s), $t(t), X in n && typeof n[X] == "function" && n[X]());
+    }).catch((h) => {
+      const [u, f] = B({
+        value: new TypeError("Unserializable return value"),
+        [H]: 0
+      });
+      t.postMessage(Object.assign(Object.assign({}, u), { id: i }), f);
+    });
+  }), t.start && t.start();
+}
+function Xt(n) {
+  return n.constructor.name === "MessagePort";
+}
+function $t(n) {
+  Xt(n) && n.close();
+}
+function Yt(n, t) {
+  const e = /* @__PURE__ */ new Map();
+  return n.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);
+      }
+  }), K(n, e, [], t);
+}
+function k(n) {
+  if (n)
+    throw new Error("Proxy has been released and is not useable");
+}
+function Tt(n) {
+  return N(n, /* @__PURE__ */ new Map(), {
+    type: "RELEASE"
+  }).then(() => {
+    $t(n);
+  });
+}
+const W = /* @__PURE__ */ new WeakMap(), j = "FinalizationRegistry" in globalThis && new FinalizationRegistry((n) => {
+  const t = (W.get(n) || 0) - 1;
+  W.set(n, t), t === 0 && Tt(n);
+});
+function Zt(n, t) {
+  const e = (W.get(t) || 0) + 1;
+  W.set(t, e), j && j.register(n, t, n);
+}
+function Jt(n) {
+  j && j.unregister(n);
+}
+function K(n, t, e = [], s = function() {
+}) {
+  let r = !1;
+  const i = new Proxy(s, {
+    get(o, a) {
+      if (k(r), a === Gt)
+        return () => {
+          Jt(i), Tt(n), t.clear(), r = !0;
+        };
+      if (a === "then") {
+        if (e.length === 0)
+          return { then: () => i };
+        const c = N(n, t, {
+          type: "GET",
+          path: e.map((l) => l.toString())
+        }).then(T);
+        return c.then.bind(c);
+      }
+      return K(n, t, [...e, a]);
+    },
+    set(o, a, c) {
+      k(r);
+      const [l, h] = B(c);
+      return N(n, t, {
+        type: "SET",
+        path: [...e, a].map((u) => u.toString()),
+        value: l
+      }, h).then(T);
+    },
+    apply(o, a, c) {
+      k(r);
+      const l = e[e.length - 1];
+      if (l === Bt)
+        return N(n, t, {
+          type: "ENDPOINT"
+        }).then(T);
+      if (l === "bind")
+        return K(n, t, e.slice(0, -1));
+      const [h, u] = ut(c);
+      return N(n, t, {
+        type: "APPLY",
+        path: e.map((f) => f.toString()),
+        argumentList: h
+      }, u).then(T);
+    },
+    construct(o, a) {
+      k(r);
+      const [c, l] = ut(a);
+      return N(n, t, {
+        type: "CONSTRUCT",
+        path: e.map((h) => h.toString()),
+        argumentList: c
+      }, l).then(T);
+    }
+  });
+  return Zt(i, n), i;
+}
+function Qt(n) {
+  return Array.prototype.concat.apply([], n);
+}
+function ut(n) {
+  const t = n.map(B);
+  return [t.map((e) => e[0]), Qt(t.map((e) => e[1]))];
+}
+const Nt = /* @__PURE__ */ new WeakMap();
+function z(n, t) {
+  return Nt.set(n, t), n;
+}
+function Kt(n) {
+  return Object.assign(n, { [Ot]: !0 });
+}
+function B(n) {
+  for (const [t, e] of Mt)
+    if (e.canHandle(n)) {
+      const [s, r] = e.serialize(n);
+      return [
+        {
+          type: "HANDLER",
+          name: t,
+          value: s
+        },
+        r
+      ];
+    }
+  return [
+    {
+      type: "RAW",
+      value: n
+    },
+    Nt.get(n) || []
+  ];
+}
+function T(n) {
+  switch (n.type) {
+    case "HANDLER":
+      return Mt.get(n.name).deserialize(n.value);
+    case "RAW":
+      return n.value;
+  }
+}
+function N(n, t, e, s) {
+  return new Promise((r) => {
+    const i = te();
+    t.set(i, r), n.start && n.start(), n.postMessage(Object.assign({ id: i }, e), s);
+  });
+}
+function te() {
+  return new Array(4).fill(0).map(() => Math.floor(Math.random() * Number.MAX_SAFE_INTEGER).toString(16)).join("-");
+}
+var O = /* @__PURE__ */ ((n) => (n.Added = "added", n.Changed = "changed", n.Removed = "removed", n))(O || {});
+const ee = {
+  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 y extends Error {
+  errno;
+  syscall;
+  path;
+  constructor(t, e, s, r, i) {
+    super(t, { cause: i }), this.name = e, this.errno = ee[e] || -1, this.path = s, this.syscall = r;
+  }
+}
+class se extends y {
+  constructor(t) {
+    super("OPFS is not supported in this browser", "ENOTSUP", void 0, void 0, t);
+  }
+}
+class ne extends y {
+  constructor(t, e, s) {
+    super(t, "INVALID_PATH", e, "access", s);
+  }
+}
+class _ extends y {
+  constructor(t, e, s) {
+    const r = {
+      file: \`File not found: \${e}\`,
+      directory: \`Directory not found: \${e}\`,
+      source: \`Source does not exist: \${e}\`
+    };
+    super(r[t], "ENOENT", e, "access", s);
+  }
+}
+class re extends y {
+  constructor(t, e, s) {
+    super(\`Permission denied for \${e} on: \${t}\`, "EACCES", t, e, s);
+  }
+}
+class ie extends y {
+  constructor(t, e, s) {
+    super(t, "ENOSPC", e, "write", s);
+  }
+}
+class oe extends y {
+  constructor(t, e) {
+    super(\`File is busy: \${t}\`, "EBUSY", t, "open", e);
+  }
+}
+class tt extends y {
+  constructor(t, e, s) {
+    const r = t === "directory" ? \`Is a directory: \${e}\` : \`Not a directory: \${e}\`, i = t === "directory" ? "EISDIR" : "ENOTDIR";
+    super(r, i, e, "access", s);
+  }
+}
+class $ extends y {
+  constructor(t, e, s, r) {
+    const i = {
+      argument: "EINVAL",
+      format: "INVALID_FORMAT",
+      descriptor: "EBADF",
+      overflow: "ERANGE"
+    };
+    super(e, i[t], s, "validate", r);
+  }
+}
+class ae extends y {
+  constructor(t, e) {
+    super(\`Operation aborted: \${t}\`, "EINTR", t, "interrupt", e);
+  }
+}
+class ft extends y {
+  constructor(t, e, s) {
+    super(t, "EIO", e, "io", s);
+  }
+}
+class Ct extends y {
+  constructor(t, e) {
+    super(\`Operation not supported: \${t}\`, "ENOTSUP", t, "operation", e);
+  }
+}
+class et extends y {
+  constructor(t, e, s) {
+    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", s);
+  }
+}
+class ce extends y {
+  constructor(t, e) {
+    super("Failed to initialize OPFS", "INIT_FAILED", t, "init", e);
+  }
+}
+class Y extends y {
+  constructor(t, e, s) {
+    super(\`Failed to \${t}: \${e}\`, \`\${t.toUpperCase()}_FAILED\`, e, t, s);
+  }
+}
+class st extends y {
+  constructor(t, e) {
+    super(\`Destination already exists: \${t}\`, "EEXIST", t, "open", e);
+  }
+}
+function I(n, t, e, s) {
+  const r = \`\${n.toUpperCase()}_FAILED\`;
+  return new y(\`Failed to \${n} file descriptor: \${t}\`, r, e, n, s);
+}
+function A(n, t) {
+  const e = t?.path, s = t?.isDirectory, r = t?.existenceType ?? "file", i = t?.operation;
+  switch (n.name) {
+    case "InvalidStateError":
+      return new oe(e || "unknown", n);
+    case "QuotaExceededError":
+      return new ie(\`No space left on device: \${e || "unknown"}\`, e, n);
+    case "NotFoundError":
+      return new _(r, e, n);
+    case "TypeMismatchError":
+      return s !== void 0 ? s ? new tt("directory", e || "unknown", n) : new tt("file", e || "unknown", n) : new $("argument", \`Type mismatch: \${e || "unknown"}\`, e, n);
+    case "NotAllowedError":
+    case "SecurityError":
+      return new re(e, "unknown", n);
+    case "InvalidModificationError":
+      return i === "remove" ? new et("ENOTEMPTY", e, n) : new $("argument", \`Invalid modification: \${e || "unknown"}\`, e, n);
+    case "AbortError":
+      return new ae(e || "unknown", n);
+    case "OperationError":
+      return new ft(\`Operation failed: \${e || "unknown"}\`, e, n);
+    case "TypeError":
+      return new Ct(e || "unknown", n);
+    default:
+      return i === "remove" ? new et("RM_FAILED", e, n) : new ft(\`I/O error: \${e || "unknown"}\`, e, n);
+  }
+}
+const vt = (n, t, e) => {
+  const s = n instanceof RegExp ? pt(n, e) : n, r = t instanceof RegExp ? pt(t, e) : t, i = s !== null && r != null && le(s, r, e);
+  return i && {
+    start: i[0],
+    end: i[1],
+    pre: e.slice(0, i[0]),
+    body: e.slice(i[0] + s.length, i[1]),
+    post: e.slice(i[1] + r.length)
+  };
+}, pt = (n, t) => {
+  const e = t.match(n);
+  return e ? e[0] : null;
+}, le = (n, t, e) => {
+  let s, r, i, o, a, c = e.indexOf(n), l = e.indexOf(t, c + 1), h = c;
+  if (c >= 0 && l > 0) {
+    if (n === t)
+      return [c, l];
+    for (s = [], i = e.length; h >= 0 && !a; ) {
+      if (h === c)
+        s.push(h), c = e.indexOf(n, h + 1);
+      else if (s.length === 1) {
+        const u = s.pop();
+        u !== void 0 && (a = [u, l]);
+      } else
+        r = s.pop(), r !== void 0 && r < i && (i = r, o = l), l = e.indexOf(t, h + 1);
+      h = c < l && c >= 0 ? c : l;
+    }
+    s.length && o !== void 0 && (a = [i, o]);
+  }
+  return a;
+}, Ft = "\\0SLASH" + Math.random() + "\\0", Pt = "\\0OPEN" + Math.random() + "\\0", ot = "\\0CLOSE" + Math.random() + "\\0", Rt = "\\0COMMA" + Math.random() + "\\0", kt = "\\0PERIOD" + Math.random() + "\\0", he = new RegExp(Ft, "g"), ue = new RegExp(Pt, "g"), fe = new RegExp(ot, "g"), pe = new RegExp(Rt, "g"), de = new RegExp(kt, "g"), ge = /\\\\\\\\/g, ye = /\\\\{/g, we = /\\\\}/g, me = /\\\\,/g, Ee = /\\\\\\./g, Se = 1e5, be = 4e6;
+function Z(n) {
+  return isNaN(n) ? n.charCodeAt(0) : parseInt(n, 10);
+}
+function xe(n) {
+  return n.replace(ge, Ft).replace(ye, Pt).replace(we, ot).replace(me, Rt).replace(Ee, kt);
+}
+function Ae(n) {
+  return n.replace(he, "\\\\").replace(ue, "{").replace(fe, "}").replace(pe, ",").replace(de, ".");
+}
+function It(n) {
+  if (!n)
+    return [""];
+  const t = [], e = vt("{", "}", n);
+  if (!e)
+    return n.split(",");
+  const { pre: s, body: r, post: i } = e, o = s.split(",");
+  o[o.length - 1] += "{" + r + "}";
+  const a = It(i);
+  return i.length && (o[o.length - 1] += a.shift(), o.push.apply(o, a)), t.push.apply(t, o), t;
+}
+function Oe(n, t = {}) {
+  if (!n)
+    return [];
+  const { max: e = Se, maxLength: s = be } = t;
+  return n.slice(0, 2) === "{}" && (n = "\\\\{\\\\}" + n.slice(2)), nt(xe(n), e, s, !0).map(Ae);
+}
+function De(n) {
+  return "{" + n + "}";
+}
+function Me(n) {
+  return /^-?0\\d/.test(n);
+}
+function $e(n, t) {
+  return n <= t;
+}
+function Te(n, t) {
+  return n >= t;
+}
+function F(n, t, e, s, r, i) {
+  const o = [];
+  let a = 0;
+  for (let c = 0; c < n.length; c++)
+    for (let l = 0; l < e.length; l++) {
+      if (o.length >= s)
+        return o;
+      const h = n[c] + t + e[l];
+      if (!(i && !h)) {
+        if (a + h.length > r)
+          return o;
+        o.push(h), a += h.length;
+      }
+    }
+  return o;
+}
+function Ne(n, t, e) {
+  const s = n.split(/\\.\\./), r = [];
+  if (s[0] === void 0 || s[1] === void 0)
+    return r;
+  const i = Z(s[0]), o = Z(s[1]), a = Math.max(s[0].length, s[1].length);
+  let c = s.length === 3 && s[2] !== void 0 ? Math.max(Math.abs(Z(s[2])), 1) : 1, l = $e;
+  o < i && (c *= -1, l = Te);
+  const u = s.some(Me);
+  for (let f = i; l(f, o) && r.length < e; f += c) {
+    let p;
+    if (t)
+      p = String.fromCharCode(f), p === "\\\\" && (p = "");
+    else if (p = String(f), u) {
+      const g = a - p.length;
+      if (g > 0) {
+        const d = new Array(g + 1).join("0");
+        f < 0 ? p = "-" + d + p.slice(1) : p = d + p;
+      }
+    }
+    r.push(p);
+  }
+  return r;
+}
+function nt(n, t, e, s) {
+  let r = [""], i = !1, o = !0;
+  for (; ; ) {
+    const a = vt("{", "}", n);
+    if (!a)
+      return F(r, n, [""], t, e, i);
+    const c = a.pre;
+    if (/\\$$/.test(c)) {
+      if (r = F(r, c + "{" + a.body + "}", [""], t, e, i && !a.post.length), o = !1, !a.post.length)
+        break;
+      n = a.post;
+      continue;
+    }
+    const l = /^-?\\d+\\.\\.-?\\d+(?:\\.\\.-?\\d+)?$/.test(a.body), h = /^[a-zA-Z]\\.\\.[a-zA-Z](?:\\.\\.-?\\d+)?$/.test(a.body), u = l || h, f = a.body.indexOf(",") >= 0;
+    if (!u && !f) {
+      if (a.post.match(/,(?!,).*\\}/)) {
+        n = a.pre + "{" + a.body + ot + a.post, s = !0;
+        continue;
+      }
+      return F(r, c + "{" + a.body + "}" + a.post, [""], t, e, i);
+    }
+    o && (i = s && !u, o = !1);
+    let p;
+    if (u)
+      p = Ne(a.body, h, t);
+    else {
+      let g = It(a.body);
+      if (g.length === 1 && g[0] !== void 0 && (g = nt(g[0], t, e, !1).map(De), g.length === 1)) {
+        if (r = F(r, c + g[0], [""], t, e, i && !a.post.length), !a.post.length)
+          break;
+        n = a.post;
+        continue;
+      }
+      p = [];
+      for (let d = 0; d < g.length; d++)
+        p.push.apply(p, nt(g[d], t, e, !1));
+    }
+    if (r = F(r, c, p, t, e, i && !a.post.length), !a.post.length)
+      break;
+    n = a.post;
+  }
+  return r;
+}
+const Ce = 1024 * 64, G = (n) => {
+  if (typeof n != "string")
+    throw new TypeError("invalid pattern");
+  if (n.length > Ce)
+    throw new TypeError("pattern is too long");
+}, ve = {
+  "[: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]
+}, P = (n) => n.replace(/[[\\]\\\\-]/g, "\\\\$&"), Fe = (n) => n.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, "\\\\$&"), dt = (n) => n.join(""), Pe = (n, t) => {
+  const e = t;
+  if (n.charAt(e) !== "[")
+    throw new Error("not in a brace expression");
+  const s = [], r = [];
+  let i = e + 1, o = !1, a = !1, c = !1, l = !1, h = e, u = "";
+  t: for (; i < n.length; ) {
+    const d = n.charAt(i);
+    if ((d === "!" || d === "^") && i === e + 1) {
+      l = !0, i++;
+      continue;
+    }
+    if (d === "]" && o && !c) {
+      h = i + 1;
+      break;
+    }
+    if (o = !0, d === "\\\\" && !c) {
+      c = !0, i++;
+      continue;
+    }
+    if (d === "[" && !c) {
+      for (const [E, [w, m, M]] of Object.entries(ve))
+        if (n.startsWith(E, i)) {
+          if (u)
+            return ["$.", !1, n.length - e, !0];
+          i += E.length, M ? r.push(w) : s.push(w), a = a || m;
+          continue t;
+        }
+    }
+    if (c = !1, u) {
+      d > u ? s.push(P(u) + "-" + P(d)) : d === u && s.push(P(d)), u = "", i++;
+      continue;
+    }
+    if (n.startsWith("-]", i + 1)) {
+      s.push(P(d + "-")), i += 2;
+      continue;
+    }
+    if (n.startsWith("-", i + 1)) {
+      u = d, i += 2;
+      continue;
+    }
+    s.push(P(d)), i++;
+  }
+  if (h < i)
+    return ["", !1, 0, !1];
+  if (!s.length && !r.length)
+    return ["$.", !1, n.length - e, !0];
+  if (r.length === 0 && s.length === 1 && /^\\\\?.$/.test(s[0]) && !l) {
+    const d = s[0].length === 2 ? s[0].slice(-1) : s[0];
+    return [Fe(d), !1, h - e, !1];
+  }
+  const f = "[" + (l ? "^" : "") + dt(s) + "]", p = "[" + (l ? "" : "^") + dt(r) + "]";
+  return [s.length && r.length ? "(" + f + "|" + p + ")" : s.length ? f : p, a, h - e, !0];
+}, R = (n, { windowsPathsNoEscape: t = !1, magicalBraces: e = !0 } = {}) => e ? t ? n.replace(/\\[([^/\\\\])\\]/g, "$1") : n.replace(/((?!\\\\).|^)\\[([^/\\\\])\\]/g, "$1$2").replace(/\\\\([^/])/g, "$1") : t ? n.replace(/\\[([^/\\\\{}])\\]/g, "$1") : n.replace(/((?!\\\\).|^)\\[([^/\\\\{}])\\]/g, "$1$2").replace(/\\\\([^/{}])/g, "$1");
+var x;
+const Re = /* @__PURE__ */ new Set(["!", "?", "+", "*", "@"]), rt = (n) => Re.has(n), gt = (n) => rt(n.type), ke = /* @__PURE__ */ new Map([
+  ["!", ["@"]],
+  ["?", ["?", "@"]],
+  ["@", ["@"]],
+  ["*", ["*", "+", "?", "@"]],
+  ["+", ["+", "@"]]
+]), Ie = /* @__PURE__ */ new Map([
+  ["!", ["?"]],
+  ["@", ["?"]],
+  ["+", ["?", "*"]]
+]), Le = /* @__PURE__ */ new Map([
+  ["!", ["?", "@"]],
+  ["?", ["?", "@"]],
+  ["@", ["?", "@"]],
+  ["*", ["*", "+", "?", "@"]],
+  ["+", ["+", "@", "?", "*"]]
+]), yt = /* @__PURE__ */ new Map([
+  ["!", /* @__PURE__ */ new Map([["!", "@"]])],
+  [
+    "?",
+    /* @__PURE__ */ new Map([
+      ["*", "*"],
+      ["+", "*"]
+    ])
+  ],
+  [
+    "@",
+    /* @__PURE__ */ new Map([
+      ["!", "!"],
+      ["?", "?"],
+      ["@", "@"],
+      ["*", "*"],
+      ["+", "+"]
+    ])
+  ],
+  [
+    "+",
+    /* @__PURE__ */ new Map([
+      ["?", "*"],
+      ["*", "*"]
+    ])
+  ]
+]), He = "(?!(?:^|/)\\\\.\\\\.?(?:$|/))", L = "(?!\\\\.)", ze = /* @__PURE__ */ new Set(["[", "."]), _e = /* @__PURE__ */ new Set(["..", "."]), We = new Set("().*{}+?[]^$\\\\!"), je = (n) => n.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, "\\\\$&"), at = "[^/]", wt = at + "*?", mt = at + "+?";
+let Be = 0;
+class ct {
+  type;
+  #s;
+  #n;
+  #r = !1;
+  #t = [];
+  #e;
+  #a;
+  #l;
+  #c = !1;
+  #i;
+  #o;
+  // set to true if it's an extglob with no children
+  // (which really means one child of '')
+  #h = !1;
+  id = ++Be;
+  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, s = {}) {
+    this.type = t, t && (this.#n = !0), this.#e = e, this.#s = this.#e ? this.#e.#s : this, this.#i = this.#s === this ? s : 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)
+      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.#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("");
+  }
+  #w() {
+    if (this !== this.#s)
+      throw new Error("should only call on root");
+    if (this.#c)
+      return this;
+    this.toString(), this.#c = !0;
+    let t;
+    for (; t = this.#l.pop(); ) {
+      if (t.type !== "!")
+        continue;
+      let e = t, s = e.#e;
+      for (; s; ) {
+        for (let r = e.#a + 1; !s.type && r < s.#t.length; r++)
+          for (const i of t.#t) {
+            if (typeof i == "string")
+              throw new Error("string part in extglob AST??");
+            i.copyIn(s.#t[r]);
+          }
+        e = s, s = e.#e;
+      }
+    }
+    return this;
+  }
+  push(...t) {
+    for (const e of t)
+      if (e !== "") {
+        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.#c && this.#e?.type === "!") && t.push({}), t;
+  }
+  isStart() {
+    if (this.#s === this)
+      return !0;
+    if (!this.#e?.isStart())
+      return !1;
+    if (this.#a === 0)
+      return !0;
+    const t = this.#e;
+    for (let e = 0; e < this.#a; e++) {
+      const s = t.#t[e];
+      if (!(s instanceof x && s.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.#a === t - 1;
+  }
+  copyIn(t) {
+    typeof t == "string" ? this.push(t) : this.push(t.clone(this));
+  }
+  clone(t) {
+    const e = new x(this.type, t);
+    for (const s of this.#t)
+      e.copyIn(s);
+    return e;
+  }
+  static #u(t, e, s, r, i) {
+    const o = r.maxExtglobRecursion ?? 2;
+    let a = !1, c = !1, l = -1, h = !1;
+    if (e.type === null) {
+      let d = s, E = "";
+      for (; d < t.length; ) {
+        const w = t.charAt(d++);
+        if (a || w === "\\\\") {
+          a = !a, E += w;
+          continue;
+        }
+        if (c) {
+          d === l + 1 ? (w === "^" || w === "!") && (h = !0) : w === "]" && !(d === l + 2 && h) && (c = !1), E += w;
+          continue;
+        } else if (w === "[") {
+          c = !0, l = d, h = !1, E += w;
+          continue;
+        }
+        if (!r.noext && rt(w) && t.charAt(d) === "(" && i <= o) {
+          e.push(E), E = "";
+          const M = new x(w, e);
+          d = x.#u(t, M, d, r, i + 1), e.push(M);
+          continue;
+        }
+        E += w;
+      }
+      return e.push(E), d;
+    }
+    let u = s + 1, f = new x(null, e);
+    const p = [];
+    let g = "";
+    for (; u < t.length; ) {
+      const d = t.charAt(u++);
+      if (a || d === "\\\\") {
+        a = !a, g += d;
+        continue;
+      }
+      if (c) {
+        u === l + 1 ? (d === "^" || d === "!") && (h = !0) : d === "]" && !(u === l + 2 && h) && (c = !1), g += d;
+        continue;
+      } else if (d === "[") {
+        c = !0, l = u, h = !1, g += d;
+        continue;
+      }
+      if (!r.noext && rt(d) && t.charAt(u) === "(" && /* c8 ignore start - the maxDepth is sufficient here */
+      (i <= o || e && e.#f(d))) {
+        const w = e && e.#f(d) ? 0 : 1;
+        f.push(g), g = "";
+        const m = new x(d, f);
+        f.push(m), u = x.#u(t, m, u, r, i + w);
+        continue;
+      }
+      if (d === "|") {
+        f.push(g), g = "", p.push(f), f = new x(null, e);
+        continue;
+      }
+      if (d === ")")
+        return g === "" && e.#t.length === 0 && (e.#h = !0), f.push(g), g = "", e.push(...p, f), u;
+      g += d;
+    }
+    return e.type = null, e.#n = void 0, e.#t = [t.substring(s - 1)], u;
+  }
+  #m(t) {
+    return this.#d(t, Ie);
+  }
+  #d(t, e = ke) {
+    if (!t || typeof t != "object" || t.type !== null || t.#t.length !== 1 || this.type === null)
+      return !1;
+    const s = t.#t[0];
+    return !s || typeof s != "object" || s.type === null ? !1 : this.#f(s.type, e);
+  }
+  #f(t, e = Le) {
+    return !!e.get(this.type)?.includes(t);
+  }
+  #E(t, e) {
+    const s = t.#t[0], r = new x(null, s, this.options);
+    r.#t.push(""), s.push(r), this.#g(t, e);
+  }
+  #g(t, e) {
+    const s = t.#t[0];
+    this.#t.splice(e, 1, ...s.#t);
+    for (const r of s.#t)
+      typeof r == "object" && (r.#e = this);
+    this.#o = void 0;
+  }
+  #S(t) {
+    return !!yt.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 = yt.get(this.type), s = t.#t[0], r = e?.get(s.type);
+    if (!r)
+      return !1;
+    this.#t = s.#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 s = new x(null, void 0, e);
+    return x.#u(t, s, 0, e, 0), s;
+  }
+  // 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, s, r, i] = this.toRegExpSource();
+    if (!(r || this.#n || this.#i.nocase && !this.#i.nocaseMagicOnly && t.toUpperCase() !== t.toLowerCase()))
+      return s;
+    const a = (this.#i.nocase ? "i" : "") + (i ? "u" : "");
+    return Object.assign(new RegExp(\`^\${e}$\`, a), {
+      _src: e,
+      _glob: t
+    });
+  }
+  get options() {
+    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
+  // 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.#i.dot;
+    if (this.#s === this && (this.#p(), this.#w()), !gt(this)) {
+      const c = this.isStart() && this.isEnd() && !this.#t.some((p) => typeof p != "string"), l = this.#t.map((p) => {
+        const [g, d, E, w] = typeof p == "string" ? x.#A(p, this.#n, c) : p.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 && _e.has(this.#t[0]))) {
+        const g = ze, d = (
+          // 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))
+        ), E = !e && !t && g.has(l.charAt(0));
+        h = d ? He : E ? L : "";
+      }
+      let u = "";
+      return this.isEnd() && this.#s.#c && this.#e?.type === "!" && (u = "(?:$|\\\\/)"), [
+        h + l + u,
+        R(l),
+        this.#n = !!this.#n,
+        this.#r
+      ];
+    }
+    const s = this.type === "*" || this.type === "+", r = this.type === "!" ? "(?:(?!(?:" : "(?:";
+    let i = this.#y(e);
+    if (this.isStart() && this.isEnd() && !i && this.type !== "!") {
+      const c = this.toString(), l = this;
+      return l.#t = [c], l.type = null, l.#n = void 0, [c, R(this.toString()), !1, !1];
+    }
+    let o = !s || t || e || !L ? "" : this.#y(!0);
+    o === i && (o = ""), o && (i = \`(?:\${i})(?:\${o})*?\`);
+    let a = "";
+    if (this.type === "!" && this.#h)
+      a = (this.isStart() && !e ? L : "") + mt;
+    else {
+      const c = this.type === "!" ? (
+        // !() must match something,but !(x) can match ''
+        "))" + (this.isStart() && !e && !t ? L : "") + wt + ")"
+      ) : this.type === "@" ? ")" : this.type === "?" ? ")?" : this.type === "+" && o ? ")" : this.type === "*" && o ? ")?" : \`)\${this.type}\`;
+      a = r + i + c;
+    }
+    return [
+      a,
+      R(i),
+      this.#n = !!this.#n,
+      this.#r
+    ];
+  }
+  #p() {
+    if (gt(this)) {
+      let t = 0, e = !1;
+      do {
+        e = !0;
+        for (let s = 0; s < this.#t.length; s++) {
+          const r = this.#t[s];
+          typeof r == "object" && (r.#p(), this.#d(r) ? (e = !1, this.#g(r, s)) : this.#m(r) ? (e = !1, this.#E(r, s)) : 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;
+  }
+  #y(t) {
+    return this.#t.map((e) => {
+      if (typeof e == "string")
+        throw new Error("string type in extglob ast??");
+      const [s, r, i, o] = e.toRegExpSource(t);
+      return this.#r = this.#r || o, s;
+    }).filter((e) => !(this.isStart() && this.isEnd()) || !!e).join("|");
+  }
+  static #A(t, e, s = !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 += (We.has(l) ? "\\\\" : "") + l;
+        continue;
+      }
+      if (l === "*") {
+        if (a)
+          continue;
+        a = !0, i += s && /^[*]+$/.test(t) ? mt : wt, e = !0;
+        continue;
+      } else
+        a = !1;
+      if (l === "\\\\") {
+        c === t.length - 1 ? i += "\\\\\\\\" : r = !0;
+        continue;
+      }
+      if (l === "[") {
+        const [h, u, f, p] = Pe(t, c);
+        if (f) {
+          i += h, o = o || u, c += f - 1, e = e || p;
+          continue;
+        }
+      }
+      if (l === "?") {
+        i += at, e = !0;
+        continue;
+      }
+      i += je(l);
+    }
+    return [i, R(t), !!e, o];
+  }
+}
+x = ct;
+const Ge = (n, { windowsPathsNoEscape: t = !1, magicalBraces: e = !1 } = {}) => e ? t ? n.replace(/[?*()[\\]{}]/g, "[$&]") : n.replace(/[?*()[\\]\\\\{}]/g, "\\\\$&") : t ? n.replace(/[?*()[\\]]/g, "[$&]") : n.replace(/[?*()[\\]\\\\]/g, "\\\\$&"), b = (n, t, e = {}) => (G(t), !e.nocomment && t.charAt(0) === "#" ? !1 : new q(t, e).match(n)), Ue = /^\\*+([^+@!?*[(]*)$/, qe = (n) => (t) => !t.startsWith(".") && t.endsWith(n), Ve = (n) => (t) => t.endsWith(n), Xe = (n) => (n = n.toLowerCase(), (t) => !t.startsWith(".") && t.toLowerCase().endsWith(n)), Ye = (n) => (n = n.toLowerCase(), (t) => t.toLowerCase().endsWith(n)), Ze = /^\\*+\\.\\*+$/, Je = (n) => !n.startsWith(".") && n.includes("."), Qe = (n) => n !== "." && n !== ".." && n.includes("."), Ke = /^\\.\\*+$/, ts = (n) => n !== "." && n !== ".." && n.startsWith("."), es = /^\\*+$/, ss = (n) => n.length !== 0 && !n.startsWith("."), ns = (n) => n.length !== 0 && n !== "." && n !== "..", rs = /^\\?+([^+@!?*[(]*)?$/, is = ([n, t = ""]) => {
+  const e = Lt([n]);
+  return t ? (t = t.toLowerCase(), (s) => e(s) && s.toLowerCase().endsWith(t)) : e;
+}, os = ([n, t = ""]) => {
+  const e = Ht([n]);
+  return t ? (t = t.toLowerCase(), (s) => e(s) && s.toLowerCase().endsWith(t)) : e;
+}, as = ([n, t = ""]) => {
+  const e = Ht([n]);
+  return t ? (s) => e(s) && s.endsWith(t) : e;
+}, cs = ([n, t = ""]) => {
+  const e = Lt([n]);
+  return t ? (s) => e(s) && s.endsWith(t) : e;
+}, Lt = ([n]) => {
+  const t = n.length;
+  return (e) => e.length === t && !e.startsWith(".");
+}, Ht = ([n]) => {
+  const t = n.length;
+  return (e) => e.length === t && e !== "." && e !== "..";
+}, zt = typeof process == "object" && process ? typeof process.env == "object" && process.env && process.env.__MINIMATCH_TESTING_PLATFORM__ || process.platform : "posix", Et = {
+  win32: { sep: "\\\\" },
+  posix: { sep: "/" }
+}, ls = zt === "win32" ? Et.win32.sep : Et.posix.sep;
+b.sep = ls;
+const S = /* @__PURE__ */ Symbol("globstar **");
+b.GLOBSTAR = S;
+const hs = "[^/]", us = hs + "*?", fs = "(?:(?!(?:\\\\/|^)(?:\\\\.{1,2})($|\\\\/)).)*?", ps = "(?:(?!(?:\\\\/|^)\\\\.).)*?", ds = (n, t = {}) => (e) => b(e, n, t);
+b.filter = ds;
+const D = (n, t = {}) => Object.assign({}, n, t), gs = (n) => {
+  if (!n || typeof n != "object" || !Object.keys(n).length)
+    return b;
+  const t = b;
+  return Object.assign((s, r, i = {}) => t(s, r, D(n, i)), {
+    Minimatch: class extends t.Minimatch {
+      constructor(r, i = {}) {
+        super(r, D(n, i));
+      }
+      static defaults(r) {
+        return t.defaults(D(n, r)).Minimatch;
+      }
+    },
+    AST: class extends t.AST {
+      /* c8 ignore start */
+      constructor(r, i, o = {}) {
+        super(r, i, D(n, o));
+      }
+      /* c8 ignore stop */
+      static fromGlob(r, i = {}) {
+        return t.AST.fromGlob(r, D(n, i));
+      }
+    },
+    unescape: (s, r = {}) => t.unescape(s, D(n, r)),
+    escape: (s, r = {}) => t.escape(s, D(n, r)),
+    filter: (s, r = {}) => t.filter(s, D(n, r)),
+    defaults: (s) => t.defaults(D(n, s)),
+    makeRe: (s, r = {}) => t.makeRe(s, D(n, r)),
+    braceExpand: (s, r = {}) => t.braceExpand(s, D(n, r)),
+    match: (s, r, i = {}) => t.match(s, r, D(n, i)),
+    sep: t.sep,
+    GLOBSTAR: S
+  });
+};
+b.defaults = gs;
+const _t = (n, t = {}) => (G(n), t.nobrace || !/\\{(?:(?!\\{).)*\\}/.test(n) ? [n] : Oe(n, { max: t.braceExpandMax }));
+b.braceExpand = _t;
+const ys = (n, t = {}) => new q(n, t).makeRe();
+b.makeRe = ys;
+const ws = (n, t, e = {}) => {
+  const s = new q(t, e);
+  return n = n.filter((r) => s.match(r)), s.options.nonull && !n.length && n.push(t), n;
+};
+b.match = ws;
+const St = /[?*]|[+@!]\\(.*?\\)|\\[|\\]/, ms = (n) => n.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, "\\\\$&");
+class q {
+  options;
+  set;
+  pattern;
+  windowsPathsNoEscape;
+  nonegate;
+  negate;
+  comment;
+  empty;
+  preserveMultipleSlashes;
+  partial;
+  globSet;
+  globParts;
+  nocase;
+  isWindows;
+  platform;
+  windowsNoMagicRoot;
+  maxGlobstarRecursion;
+  regexp;
+  constructor(t, e = {}) {
+    G(t), e = e || {}, this.options = e, this.maxGlobstarRecursion = e.maxGlobstarRecursion ?? 200, this.pattern = t, this.platform = e.platform || zt, this.isWindows = this.platform === "win32";
+    const s = "allowWindowsEscape";
+    this.windowsPathsNoEscape = !!e.windowsPathsNoEscape || e[s] === !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 s = this.globSet.map((i) => this.slashSplit(i));
+    this.globParts = this.preprocess(s), 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] === "?" || !St.test(i[2])) && !St.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))
+          ];
+        if (l)
+          return [i[0], ...i.slice(1).map((h) => this.parse(h))];
+      }
+      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 (const s of t)
+        for (let r = 0; r < s.length; r++)
+          s[r] === "**" && (s[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 s = -1;
+      for (; (s = e.indexOf("**", s + 1)) !== -1; ) {
+        let r = s;
+        for (; e[r + 1] === "**"; )
+          r++;
+        r !== s && e.splice(s, r - s);
+      }
+      return e;
+    });
+  }
+  // get rid of adjascent ** and resolve .. portions
+  levelOneOptimize(t) {
+    return t.map((e) => (e = e.reduce((s, r) => {
+      const i = s[s.length - 1];
+      return r === "**" && i === "**" ? s : r === ".." && i && i !== ".." && i !== "." && i !== "**" ? (s.pop(), s) : (s.push(r), s);
+    }, []), 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 s = 0;
+      for (; (s = t.indexOf("..", s + 1)) !== -1; ) {
+        const r = t[s - 1];
+        r && r !== "." && r !== ".." && r !== "**" && !(this.isWindows && /^[a-z]:$/i.test(r)) && (e = !0, t.splice(s - 1, 2), s -= 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 s of t) {
+        let r = -1;
+        for (; (r = s.indexOf("**", r + 1)) !== -1; ) {
+          let o = r;
+          for (; s[o + 1] === "**"; )
+            o++;
+          o > r && s.splice(r + 1, o - r);
+          let a = s[r + 1];
+          const c = s[r + 2], l = s[r + 3];
+          if (a !== ".." || !c || c === "." || c === ".." || !l || l === "." || l === "..")
+            continue;
+          e = !0, s.splice(r, 1);
+          const h = s.slice(0);
+          h[r] = "**", t.push(h), r--;
+        }
+        if (!this.preserveMultipleSlashes) {
+          for (let o = 1; o < s.length - 1; o++) {
+            const a = s[o];
+            o === 1 && a === "" && s[0] === "" || (a === "." || a === "") && (e = !0, s.splice(o, 1), o--);
+          }
+          s[0] === "." && s.length === 2 && (s[1] === "." || s[1] === "") && (e = !0, s.pop());
+        }
+        let i = 0;
+        for (; (i = s.indexOf("..", i + 1)) !== -1; ) {
+          const o = s[i - 1];
+          if (o && o !== "." && o !== ".." && o !== "**") {
+            e = !0;
+            const c = i === 1 && s[i + 1] === "**" ? ["."] : [];
+            s.splice(i - 1, 2, ...c), s.length === 0 && s.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 s = e + 1; s < t.length; s++) {
+        const r = this.partsMatch(t[e], t[s], !this.preserveMultipleSlashes);
+        if (r) {
+          t[e] = [], t[s] = r;
+          break;
+        }
+      }
+    return t.filter((e) => e.length);
+  }
+  partsMatch(t, e, s = !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 (s && t[r] === "**" && e[i] === t[r + 1])
+        o.push(t[r]), r++;
+      else if (s && 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, s = 0;
+    for (let r = 0; r < t.length && t.charAt(r) === "!"; r++)
+      e = !e, s++;
+    s && (this.pattern = t.slice(s)), 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, s = !1) {
+    let r = 0, i = 0;
+    if (this.isWindows) {
+      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]), h = !l && e[0] === "" && e[1] === "" && e[2] === "?" && typeof e[3] == "string" && /^[a-z]:$/i.test(e[3]), u = c ? 3 : a ? 0 : void 0, f = h ? 3 : l ? 0 : void 0;
+      if (typeof u == "number" && typeof f == "number") {
+        const [p, g] = [
+          t[u],
+          e[f]
+        ];
+        p.toLowerCase() === g.toLowerCase() && (e[f] = p, i = f, r = u);
+      }
+    }
+    const { optimizationLevel: o = 1 } = this.options;
+    return o >= 2 && (t = this.levelTwoFileOptimize(t)), e.includes(S) ? this.#s(t, e, s, r, i) : this.#r(t, e, s, r, i);
+  }
+  #s(t, e, s, r, i) {
+    const o = e.indexOf(S, i), a = e.lastIndexOf(S), [c, l, h] = s ? [
+      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 m = t.slice(r, r + c.length);
+      if (!this.#r(m, c, s, 0, 0))
+        return !1;
+      r += c.length, i += c.length;
+    }
+    let u = 0;
+    if (h.length) {
+      if (h.length + r > t.length)
+        return !1;
+      let m = t.length - h.length;
+      if (this.#r(t, h, s, m, 0))
+        u = h.length;
+      else {
+        if (t[t.length - 1] !== "" || r + h.length === t.length || (m--, !this.#r(t, h, s, m, 0)))
+          return !1;
+        u = h.length + 1;
+      }
+    }
+    if (!l.length) {
+      let m = !!u;
+      for (let M = r; M < t.length - u; M++) {
+        const V = String(t[M]);
+        if (m = !0, V === "." || V === ".." || !this.options.dot && V.startsWith("."))
+          return !1;
+      }
+      return s || m;
+    }
+    const f = [[[], 0]];
+    let p = f[0], g = 0;
+    const d = [0];
+    for (const m of l)
+      m === S ? (d.push(g), p = [[], 0], f.push(p)) : (p[0].push(m), g++);
+    let E = f.length - 1;
+    const w = t.length - u;
+    for (const m of f)
+      m[1] = w - (d[E--] + m[0].length);
+    return !!this.#n(t, f, r, 0, s, 0, !!u);
+  }
+  // return false for "nope, not matching"
+  // return null for "not matching, cannot keep trying"
+  #n(t, e, s, r, i, o, a) {
+    const c = e[r];
+    if (!c) {
+      for (let u = s; u < t.length; u++) {
+        a = !0;
+        const f = t[u];
+        if (f === "." || f === ".." || !this.options.dot && f.startsWith("."))
+          return !1;
+      }
+      return a;
+    }
+    const [l, h] = c;
+    for (; s <= h; ) {
+      if (this.#r(t.slice(0, s + l.length), l, i, s, 0) && o < this.maxGlobstarRecursion) {
+        const p = this.#n(t, e, s + l.length, r + 1, i, o + 1, a);
+        if (p !== !1)
+          return p;
+      }
+      const f = t[s];
+      if (f === "." || f === ".." || !this.options.dot && f.startsWith("."))
+        return !1;
+      s++;
+    }
+    return i || null;
+  }
+  #r(t, e, s, 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 h = e[a], u = t[o];
+      if (this.debug(e, h, u), h === !1 || h === S)
+        return !1;
+      let f;
+      if (typeof h == "string" ? (f = u === h, this.debug("string match", h, u, f)) : (f = h.test(u), this.debug("pattern match", h, u, f)), !f)
+        return !1;
+    }
+    if (o === l && a === c)
+      return !0;
+    if (o === l)
+      return s;
+    if (a === c)
+      return o === l - 1 && t[o] === "";
+    throw new Error("wtf?");
+  }
+  braceExpand() {
+    return _t(this.pattern, this.options);
+  }
+  parse(t) {
+    G(t);
+    const e = this.options;
+    if (t === "**")
+      return S;
+    if (t === "")
+      return "";
+    let s, r = null;
+    (s = t.match(es)) ? r = e.dot ? ns : ss : (s = t.match(Ue)) ? r = (e.nocase ? e.dot ? Ye : Xe : e.dot ? Ve : qe)(s[1]) : (s = t.match(rs)) ? r = (e.nocase ? e.dot ? os : is : e.dot ? as : cs)(s) : (s = t.match(Ze)) ? r = e.dot ? Qe : Je : (s = t.match(Ke)) && (r = ts);
+    const i = ct.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, s = e.noglobstar ? us : e.dot ? fs : ps, r = new Set(e.nocase ? ["i"] : []);
+    let i = t.map((c) => {
+      const l = c.map((u) => {
+        if (u instanceof RegExp)
+          for (const f of u.flags.split(""))
+            r.add(f);
+        return typeof u == "string" ? ms(u) : u === S ? S : u._src;
+      });
+      l.forEach((u, f) => {
+        const p = l[f + 1], g = l[f - 1];
+        u !== S || g === S || (g === void 0 ? p !== void 0 && p !== S ? l[f + 1] = "(?:\\\\/|" + s + "\\\\/)?" + p : l[f] = s : p === void 0 ? l[f - 1] = g + "(?:\\\\/|\\\\/" + s + ")?" : p !== S && (l[f - 1] = g + "(?:\\\\/|\\\\/" + s + "\\\\/)" + p, l[f + 1] = S));
+      });
+      const h = l.filter((u) => u !== S);
+      if (this.partial && h.length >= 1) {
+        const u = [];
+        for (let f = 1; f <= h.length; f++)
+          u.push(h.slice(0, f).join("/"));
+        return "(?:" + u.join("|") + ")";
+      }
+      return h.join("/");
+    }).join("|");
+    const [o, a] = t.length > 1 ? ["(?:", ")"] : ["", ""];
+    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 {
+      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 s = 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 (const a of i) {
+      let c = r;
+      if (s.matchBase && a.length === 1 && (c = [o]), this.matchOne(c, a, e))
+        return s.flipNegate ? !0 : !this.negate;
+    }
+    return s.flipNegate ? !1 : this.negate;
+  }
+  static defaults(t) {
+    return b.defaults(t).Minimatch;
+  }
+}
+b.AST = ct;
+b.Minimatch = q;
+b.escape = Ge;
+b.unescape = R;
+function Es() {
+  if (!("storage" in navigator) || !("getDirectory" in navigator.storage))
+    throw new se();
+}
+function Ss(n, t) {
+  const e = v(n || "/"), s = v(ht(t));
+  return e === "/" ? s : s === "/" ? e : \`\${e.replace(/\\/$/, "")}\${s}\`;
+}
+async function Wt(n, t, e = "/") {
+  if (typeof navigator < "u" && navigator.locks?.request) {
+    const s = Ss(e, n).replace(/\\/+/g, "/");
+    return navigator.locks.request(\`opfs:\${s}\`, { mode: "exclusive" }, t);
+  }
+  return t();
+}
+function C(n) {
+  return Array.isArray(n) ? n : (n.startsWith("~/") ? n.slice(2) : n).split("/").filter(Boolean);
+}
+function lt(n) {
+  return typeof n == "string" ? n ?? "/" : \`/\${n.join("/")}\`;
+}
+function it(n) {
+  const t = C(n);
+  return t[t.length - 1] || "";
+}
+function J(n) {
+  const t = C(n);
+  return t.pop(), lt(t);
+}
+function v(n) {
+  return !n || n === "/" ? "/" : n.startsWith("~/") ? \`/\${n.slice(2)}\` : n.startsWith("/") ? n : \`/\${n}\`;
+}
+function bs(n, t = !1) {
+  return n = n.replace(/\\/$/, ""), t && !n.includes("*") ? \`\${n}/**\` : n;
+}
+function Q(n, t) {
+  return b(n, t, {
+    dot: !0,
+    matchBase: !0
+  });
+}
+function ht(n) {
+  const t = v(n), e = C(t), s = [];
+  for (const r of e)
+    if (!(r === "." || r === ""))
+      if (r === "..") {
+        if (s.length === 0)
+          continue;
+        s.pop();
+      } else
+        s.push(r);
+  return lt(s);
+}
+async function xs(n, t = "SHA-1", e = 50 * 1024 * 1024) {
+  if (n instanceof File && (n = await n.arrayBuffer()), n.byteLength > e)
+    throw new Error(\`File size \${n.byteLength} bytes exceeds maximum allowed size \${e} bytes\`);
+  const s = new Uint8Array(n), r = await crypto.subtle.digest(t, s);
+  return Array.from(new Uint8Array(r)).map((o) => o.toString(16).padStart(2, "0")).join("");
+}
+async function As(n, t, e = {}) {
+  const s = it(t);
+  return Wt(t, async () => {
+    const r = e.recursive ?? !1, i = e.force ?? !1;
+    try {
+      await n.removeEntry(s, { 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
+      });
+    }
+  }, e.root ?? "/");
+}
+function bt(n, t, e, s) {
+  if (!Number.isInteger(t) || !Number.isInteger(e))
+    throw new $("argument", "Invalid offset or length");
+  if (t < 0 || e < 0)
+    throw new $("argument", "Negative offset or length not allowed");
+  if (t + e > n)
+    throw new $("overflow", "Operation would overflow buffer");
+  if (s != null && (!Number.isInteger(s) || s < 0))
+    throw new $("argument", "Invalid position");
+}
+function xt(n, t, e) {
+  try {
+    t.flush(), t.close();
+  } catch (s) {
+    console.warn(\`Warning: Failed to properly close file descriptor \${n} (\${e}):\`, s);
+  }
+}
+function Os(n, t, e) {
+  if (n >= e)
+    return { isEOF: !0, actualLength: 0 };
+  const s = Math.min(t, e - n);
+  return s <= 0 ? { isEOF: !0, actualLength: 0 } : { isEOF: !1, actualLength: s };
+}
+async function Ds(n, t) {
+  try {
+    return await n.createSyncAccessHandle();
+  } catch (e) {
+    throw A(e, { path: t, isDirectory: !1 });
+  }
+}
+class Ms {
+  /** 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) => Q(e, i.pattern) && i.include.some((o) => o && Q(e, o)) && !i.exclude.some((o) => o && Q(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) {
+    Es(), t && this.setOptions(t);
+  }
+  /** Exclusive path lock keyed by absolute OPFS path (\`root\` + API path). */
+  async withPathLock(t, e) {
+    return Wt(t, e, this.options.root);
+  }
+  /**
+   * 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, s) => {
+      try {
+        const r = await navigator.storage.getDirectory();
+        this.root = t === "/" ? r : await this.getDirectoryHandle(t, !0, r), e(!0);
+      } catch (r) {
+        s(new ce(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 = v(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, s = this.root) {
+    const r = Array.isArray(t) ? t : C(t);
+    let i = s;
+    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, s = this.root) {
+    const r = C(t);
+    if (r.length === 0)
+      throw new ne("Path must not be empty", Array.isArray(t) ? t.join("/") : t);
+    const i = r.pop();
+    return (await this.getDirectoryHandle(r, e, s)).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 (s) => {
+      const r = await this.readDir(s);
+      for (const i of r) {
+        const o = \`\${s === "/" ? "" : s}/\${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 s = e?.recursive ?? !1, r = C(t);
+    let i = this.root;
+    for (let o = 0; o < r.length; o++) {
+      const a = r[o];
+      try {
+        i = await i.getDirectoryHandle(a, { create: s || 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 Y("create directory", a, c);
+      }
+    }
+    await this.notifyChange({ path: t, type: O.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 s;
+    try {
+      s = await this.getDirectoryHandle(J(t), !1);
+      const r = this.options.hashAlgorithm, o = await (await s.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 xs(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 _("file", t, r);
+      if (r.name !== "TypeMismatchError")
+        throw new Y("stat", t, r);
+    }
+    try {
+      return await s.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 Y("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), s = [];
+    for await (const [r, i] of e.entries()) {
+      const o = i.kind === "file";
+      s.push({
+        name: r,
+        kind: i.kind,
+        isFile: o,
+        isDirectory: !o
+      });
+    }
+    return s;
+  }
+  /**
+   * 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 s = null;
+    try {
+      s = await this.getDirectoryHandle(J(t), !1);
+    } catch (r) {
+      if (s = null, r.name !== "NotFoundError" && r.name !== "TypeMismatchError")
+        throw r;
+    }
+    if (!s || !e)
+      return !1;
+    try {
+      return await s.getFileHandle(e, { create: !1 }), !0;
+    } catch (r) {
+      if (r.name !== "NotFoundError" && r.name !== "TypeMismatchError")
+        throw r;
+      try {
+        return await s.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 s of e) {
+        const r = \`\${t === "/" ? "" : t}/\${s.name}\`;
+        await this.remove(r, { recursive: !0 });
+      }
+      await this.notifyChange({ path: t, type: O.Changed, isDirectory: !0 });
+    } catch (e) {
+      throw e instanceof y ? 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 et("EROOT", t);
+    const { recursive: s = !1, force: r = !1 } = e || {}, i = await this.getDirectoryHandle(J(t), !1), o = await this.stat(t);
+    await As(i, t, { recursive: s, force: r, root: this.options.root }), await this.notifyChange({ path: t, type: O.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 = ht(t);
+      if (!await this.exists(e))
+        throw new _("file", e);
+      return e;
+    } catch (e) {
+      throw e instanceof y ? 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, s) {
+    await this.mount();
+    try {
+      const r = s?.overwrite ?? !1, i = await this.stat(t);
+      if (await this.exists(e) && !r)
+        throw new st(e);
+      await this.copy(t, e, { recursive: !0, overwrite: r }), await this.remove(t, { recursive: !0 }), await this.notifyChange({ path: t, type: O.Removed, isDirectory: i.isDirectory }), await this.notifyChange({ path: e, type: O.Added, isDirectory: i.isDirectory });
+    } catch (r) {
+      throw r instanceof y ? 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, s) {
+    await this.mount();
+    try {
+      const r = s?.recursive ?? !1, i = s?.overwrite ?? !0;
+      if (!await this.exists(t))
+        throw new _("source", t);
+      if (await this.exists(e) && !i)
+        throw new st(e);
+      if ((await this.stat(t)).isFile) {
+        const l = await this.readFile(t);
+        await this.writeFile(e, l);
+      } else {
+        if (!r)
+          throw new tt("directory", t);
+        await this.mkdir(e, { recursive: !0 });
+        const l = await this.readDir(t);
+        for (const h of l) {
+          const u = \`\${t}/\${h.name}\`, f = \`\${e}/\${h.name}\`;
+          await this.copy(u, f, { recursive: !0, overwrite: i });
+        }
+      }
+    } catch (r) {
+      throw r instanceof y ? 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 s = {
+      pattern: bs(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, s);
+  }
+  /**
+   * Stop watching a previously watched path
+   */
+  unwatch(t) {
+    this.watchers.delete(t);
+  }
+  /**
+   * Read a file as a \`Blob\` without copying its bytes into memory.
+   *
+   * 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 y ? e : A(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
+   * const result = await fs.importFiles([
+   *   ['/config.json', JSON.stringify({ theme: 'dark' })],
+   *   ['/data/binary.dat', new Uint8Array([1, 2, 3, 4])],
+   *   ['/upload.txt', fileFromInput],
+   * ], (p) => console.log(\`\${p.path}: \${p.bytesWritten}/\${p.bytesTotal}\`));
+   *
+   * console.log(result.count, result.bytesWritten, result.paths);
+   * \`\`\`
+   */
+  async importFiles(t, e) {
+    await this.mount();
+    const s = [...t].map(([c, l]) => [v(c), l]), r = s.length, i = s.map(([c]) => c), o = s.reduce((c, [, l]) => c + $s(l), 0);
+    let a = 0;
+    try {
+      for (let c = 0; c < r; c++) {
+        const [l, h] = s[c], { stream: u, size: f } = Ts(h), p = a, g = await this.writeStream(
+          l,
+          u,
+          e ? (d) => e({
+            path: l,
+            index: c,
+            count: r,
+            bytesWritten: d,
+            bytesTotal: f,
+            totalBytesWritten: p + d,
+            totalBytes: o
+          }) : void 0
+        );
+        a += g;
+      }
+      return {
+        paths: i,
+        count: r,
+        bytesWritten: a
+      };
+    } catch (c) {
+      throw c instanceof y ? c : A(c);
+    }
+  }
+  /**
+   * @deprecated Use {@link importFiles} instead.
+   */
+  async createIndex(t) {
+    Ns(), await this.importFiles(t);
+  }
+  /**
+   * Dispose of resources and clean up the file system instance
+   */
+  dispose() {
+    this.broadcastChannel && (this.broadcastChannel.close(), this.broadcastChannel = null), this.watchers.clear();
+  }
+}
+function $s(n) {
+  return typeof n == "string" ? new TextEncoder().encode(n).byteLength : n instanceof Blob ? n.size : n.byteLength;
+}
+function Ts(n) {
+  if (n instanceof Blob)
+    return { stream: n.stream(), size: n.size };
+  const t = typeof n == "string" ? new TextEncoder().encode(n) : n;
+  return {
+    size: t.byteLength,
+    stream: new ReadableStream({
+      start(e) {
+        e.enqueue(t), e.close();
+      }
+    })
+  };
+}
+let At = !1;
+function Ns() {
+  At || (At = !0, console.warn("[opfs-worker] createIndex() is deprecated; use importFiles() instead"));
+}
+class Cs extends Ms {
+  /** 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 $("descriptor", \`Invalid file descriptor: \${t}\`);
+    return e;
+  }
+  async readFile(t) {
+    await this.mount();
+    try {
+      return await this.withPathLock(t, async () => {
+        const e = await this.open(t);
+        try {
+          const { size: s } = await this.fstat(e), r = new Uint8Array(s);
+          return s > 0 && await this.read(e, r, 0, s, 0), z(r, [r.buffer]);
+        } finally {
+          await this.close(e);
+        }
+      });
+    } catch (e) {
+      throw e instanceof y ? e : A(e, { path: t, isDirectory: !1 });
+    }
+  }
+  async writeFile(t, e) {
+    await this.mount();
+    const s = e instanceof Uint8Array ? e : new Uint8Array(e);
+    await this.withPathLock(t, async () => {
+      const r = await this.exists(t), i = await this.open(t, { create: !0, truncate: !0 });
+      try {
+        await this.write(i, s, 0, s.length, null, !1), await this.fsync(i);
+      } finally {
+        await this.close(i);
+      }
+      await this.notifyChange({ path: t, type: r ? O.Changed : O.Added, isDirectory: !1 });
+    });
+  }
+  async appendFile(t, e) {
+    await this.mount();
+    const s = e instanceof Uint8Array ? e : new Uint8Array(e);
+    await this.withPathLock(t, async () => {
+      const r = await this.open(t, { create: !0 });
+      try {
+        const { size: i } = await this.fstat(r);
+        await this.write(r, s, 0, s.length, i, !1), await this.fsync(r);
+      } finally {
+        await this.close(r);
+      }
+      await this.notifyChange({ path: t, type: O.Changed, isDirectory: !1 });
+    });
+  }
+  async writeStream(t, e, s) {
+    return await this.mount(), this.withPathLock(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: l } = await o.read();
+          if (c)
+            break;
+          let h = 0;
+          for (; h < l.byteLength; )
+            h += await this.write(
+              i,
+              l,
+              h,
+              l.byteLength - h,
+              null,
+              !1
+            );
+          a += l.byteLength, await s?.(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 ? O.Changed : O.Added,
+        isDirectory: !1
+      }), a;
+    });
+  }
+  async open(t, e) {
+    await this.mount();
+    const { create: s = !1, exclusive: r = !1, truncate: i = !1 } = e || {}, o = v(ht(t));
+    try {
+      return s && r ? await this.withPathLock(o, async () => {
+        if (await this.exists(o))
+          throw new st(o);
+        return this._openFile(o, s, i);
+      }) : await this._openFile(o, s, i);
+    } catch (a) {
+      if (a instanceof y)
+        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, s) {
+    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 Ds(o, t);
+      r = { fileHandle: o, syncHandle: a, refCount: 0 }, this.openHandles.set(t, r);
+    }
+    r.refCount++, s && (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 s = this.openHandles.get(e.path);
+    s && (s.refCount--, s.refCount <= 0 && (xt(t, s.syncHandle, e.path), this.openHandles.delete(e.path)));
+  }
+  async read(t, e, s, r, i) {
+    const o = this._getFileDescriptor(t);
+    bt(e.length, s, r, i);
+    try {
+      const a = i ?? o.position, c = o.syncHandle.getSize(), { isEOF: l, actualLength: h } = Os(a, r, c);
+      if (l)
+        return z({ bytesRead: 0, buffer: e }, [e.buffer]);
+      const u = e.subarray(s, s + h), f = o.syncHandle.read(u, { at: a });
+      return i == null && (o.position = a + f), z({ bytesRead: f, buffer: e }, [e.buffer]);
+    } catch (a) {
+      throw I("read", t, o.path, a);
+    }
+  }
+  async write(t, e, s = 0, r, i, o = !0) {
+    const a = this._getFileDescriptor(t), c = r ?? e.length - s;
+    bt(e.length, s, c, i);
+    try {
+      const l = i ?? a.position, h = e.subarray(s, s + c), u = a.syncHandle.write(h, { at: l });
+      return (i == null || i === a.position) && (a.position = l + u), o && await this.notifyChange({ path: a.path, type: O.Changed, isDirectory: !1 }), u;
+    } catch (l) {
+      throw I("write", t, a.path, l);
+    }
+  }
+  async fstat(t) {
+    const e = this._getFileDescriptor(t);
+    return this.stat(e.path);
+  }
+  async ftruncate(t, e = 0) {
+    const s = this._getFileDescriptor(t);
+    if (e < 0 || !Number.isInteger(e))
+      throw new $("argument", "Invalid size");
+    try {
+      s.syncHandle.truncate(e), s.syncHandle.flush(), s.position > e && (s.position = e), await this.notifyChange({ path: s.path, type: O.Changed, isDirectory: !1 });
+    } catch (r) {
+      throw I("truncate", t, s.path, r);
+    }
+  }
+  async fsync(t) {
+    const e = this._getFileDescriptor(t);
+    try {
+      e.syncHandle.flush();
+    } catch (s) {
+      throw I("sync", t, e.path, s);
+    }
+  }
+  dispose() {
+    for (const [t, e] of this.openHandles)
+      xt(-1, e.syncHandle, t);
+    this.openHandles.clear(), this.openFiles.clear(), this.nextFd = 1, super.dispose();
+  }
+}
+const jt = new Cs();
+U(jt);
+addEventListener("message", (n) => {
+  n.data?.type === "opfs-connect" && n.data.port instanceof MessagePort && U(jt, n.data.port);
+});
+//# sourceMappingURL=dedicated.worker-Bqqr9UBA.js.map
+`,f=typeof self<"u"&&self.Blob&&new Blob(["URL.revokeObjectURL(import.meta.url);",y],{type:"text/javascript;charset=utf-8"});function E(t){let n;try{if(n=f&&(self.URL||self.webkitURL).createObjectURL(f),!n)throw"";const e=new Worker(n,{type:"module",name:t?.name});return e.addEventListener("error",()=>{(self.URL||self.webkitURL).revokeObjectURL(n)}),e}catch{return new Worker("data:text/javascript;charset=utf-8,"+encodeURIComponent(y),{type:"module",name:t?.name})}}const x=E,c=new Map;function S(t,n){return`${g.normalizePath(t)}\0${n?.toString()??"inline"}`}function u(t,n){n&&(n.broadcastChannel instanceof BroadcastChannel&&(n.broadcastChannel=n.broadcastChannel.name),t.setOptions(n))}function d(t){const{port1:n,port2:e}=new MessageChannel;return t.postMessage({type:"opfs-connect",port:e},[e]),{fs:v.wrap(n),port:n}}function _(t={}){const{url:n,worker:e,...r}=t,w=g.normalizePath(r.root??"/");if(e){const{fs:s,port:l}=d(e);return u(s,r),{fs:s,worker:e,dispose(){l.close()}}}const a=S(w,n);let i=c.get(a);i||(i={worker:n?new Worker(n,{type:"module"}):new x,refs:0},c.set(a,i)),i.refs+=1;const{worker:o}=i,{fs:h,port:m}=d(o);u(h,r);let p=!1;return{fs:h,worker:o,dispose(){p||(p=!0,(async()=>{const s=c.get(a),l=!!s&&s.worker===o&&s.refs<=1;try{l&&await h.dispose()}finally{m.close()}!s||s.worker!==o||(s.refs-=1,s.refs<=0&&(c.delete(a),o.terminate()))})())}}}function P(t){const{fs:n,worker:e,dispose:r}=_(t);return new b.OPFSFacade({fs:n,worker:e,dispose:r})}exports.createOPFSDedicated=P;
+//# sourceMappingURL=createOPFSDedicated-EmIwluQo.cjs.map