@opendesign-plus-test/plugins 0.0.1-rc.24 → 0.0.1-rc.25

package/dist/generate-lastmod-changefreq-Wk3kOITw.js

@@ -1,1375 +0,0 @@
-var Ut = Object.defineProperty;
-var yt = (i) => {
-  throw TypeError(i);
-};
-var Zt = (i, t, e) => t in i ? Ut(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e;
-var T = (i, t, e) => Zt(i, typeof t != "symbol" ? t + "" : t, e), ct = (i, t, e) => t.has(i) || yt("Cannot " + e);
-var o = (i, t, e) => (ct(i, t, "read from private field"), e ? e.call(i) : t.get(i)), R = (i, t, e) => t.has(i) ? yt("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(i) : t.set(i, e), S = (i, t, e, s) => (ct(i, t, "write to private field"), s ? s.call(i, e) : t.set(i, e), e), x = (i, t, e) => (ct(i, t, "access private method"), e);
-var lt = (i, t, e, s) => ({
-  set _(n) {
-    S(i, t, n, e);
-  },
-  get _() {
-    return o(i, t, s);
-  }
-});
-import Ht, { resolve as Jt } from "node:path";
-import { exec as Vt } from "node:child_process";
-import { writeFileSync as Xt } from "node:fs";
-import { promisify as Qt } from "node:util";
-const Ot = (i, t, e) => {
-  const s = i instanceof RegExp ? wt(i, e) : i, n = t instanceof RegExp ? wt(t, e) : t, r = s !== null && n != null && Kt(s, n, e);
-  return r && {
-    start: r[0],
-    end: r[1],
-    pre: e.slice(0, r[0]),
-    body: e.slice(r[0] + s.length, r[1]),
-    post: e.slice(r[1] + n.length)
-  };
-}, wt = (i, t) => {
-  const e = t.match(i);
-  return e ? e[0] : null;
-}, Kt = (i, t, e) => {
-  let s, n, r, c, a, p = e.indexOf(i), h = e.indexOf(t, p + 1), f = p;
-  if (p >= 0 && h > 0) {
-    if (i === t)
-      return [p, h];
-    for (s = [], r = e.length; f >= 0 && !a; ) {
-      if (f === p)
-        s.push(f), p = e.indexOf(i, f + 1);
-      else if (s.length === 1) {
-        const l = s.pop();
-        l !== void 0 && (a = [l, h]);
-      } else
-        n = s.pop(), n !== void 0 && n < r && (r = n, c = h), h = e.indexOf(t, f + 1);
-      f = p < h && p >= 0 ? p : h;
-    }
-    s.length && c !== void 0 && (a = [r, c]);
-  }
-  return a;
-}, Tt = "\0SLASH" + Math.random() + "\0", vt = "\0OPEN" + Math.random() + "\0", dt = "\0CLOSE" + Math.random() + "\0", Rt = "\0COMMA" + Math.random() + "\0", Pt = "\0PERIOD" + Math.random() + "\0", Yt = new RegExp(Tt, "g"), te = new RegExp(vt, "g"), ee = new RegExp(dt, "g"), se = new RegExp(Rt, "g"), ne = new RegExp(Pt, "g"), ie = /\\\\/g, re = /\\{/g, oe = /\\}/g, ce = /\\,/g, le = /\\\./g, he = 1e5;
-function ht(i) {
-  return isNaN(i) ? i.charCodeAt(0) : parseInt(i, 10);
-}
-function ae(i) {
-  return i.replace(ie, Tt).replace(re, vt).replace(oe, dt).replace(ce, Rt).replace(le, Pt);
-}
-function fe(i) {
-  return i.replace(Yt, "\\").replace(te, "{").replace(ee, "}").replace(se, ",").replace(ne, ".");
-}
-function jt(i) {
-  if (!i)
-    return [""];
-  const t = [], e = Ot("{", "}", i);
-  if (!e)
-    return i.split(",");
-  const { pre: s, body: n, post: r } = e, c = s.split(",");
-  c[c.length - 1] += "{" + n + "}";
-  const a = jt(r);
-  return r.length && (c[c.length - 1] += a.shift(), c.push.apply(c, a)), t.push.apply(t, c), t;
-}
-function ue(i, t = {}) {
-  if (!i)
-    return [];
-  const { max: e = he } = t;
-  return i.slice(0, 2) === "{}" && (i = "\\{\\}" + i.slice(2)), K(ae(i), e, !0).map(fe);
-}
-function pe(i) {
-  return "{" + i + "}";
-}
-function ge(i) {
-  return /^-?0\d/.test(i);
-}
-function de(i, t) {
-  return i <= t;
-}
-function me(i, t) {
-  return i >= t;
-}
-function K(i, t, e) {
-  const s = [], n = Ot("{", "}", i);
-  if (!n)
-    return [i];
-  const r = n.pre, c = n.post.length ? K(n.post, t, !1) : [""];
-  if (/\$$/.test(n.pre))
-    for (let a = 0; a < c.length && a < t; a++) {
-      const p = r + "{" + n.body + "}" + c[a];
-      s.push(p);
-    }
-  else {
-    const a = /^-?\d+\.\.-?\d+(?:\.\.-?\d+)?$/.test(n.body), p = /^[a-zA-Z]\.\.[a-zA-Z](?:\.\.-?\d+)?$/.test(n.body), h = a || p, f = n.body.indexOf(",") >= 0;
-    if (!h && !f)
-      return n.post.match(/,(?!,).*\}/) ? (i = n.pre + "{" + n.body + dt + n.post, K(i, t, !0)) : [i];
-    let l;
-    if (h)
-      l = n.body.split(/\.\./);
-    else if (l = jt(n.body), l.length === 1 && l[0] !== void 0 && (l = K(l[0], t, !1).map(pe), l.length === 1))
-      return c.map((g) => n.pre + l[0] + g);
-    let u;
-    if (h && l[0] !== void 0 && l[1] !== void 0) {
-      const g = ht(l[0]), y = ht(l[1]), E = Math.max(l[0].length, l[1].length);
-      let w = l.length === 3 && l[2] !== void 0 ? Math.max(Math.abs(ht(l[2])), 1) : 1, b = de;
-      y < g && (w *= -1, b = me);
-      const d = l.some(ge);
-      u = [];
-      for (let $ = g; b($, y); $ += w) {
-        let N;
-        if (p)
-          N = String.fromCharCode($), N === "\\" && (N = "");
-        else if (N = String($), d) {
-          const H = E - N.length;
-          if (H > 0) {
-            const X = new Array(H + 1).join("0");
-            $ < 0 ? N = "-" + X + N.slice(1) : N = X + N;
-          }
-        }
-        u.push(N);
-      }
-    } else {
-      u = [];
-      for (let g = 0; g < l.length; g++)
-        u.push.apply(u, K(l[g], t, !1));
-    }
-    for (let g = 0; g < u.length; g++)
-      for (let y = 0; y < c.length && s.length < t; y++) {
-        const E = r + u[g] + c[y];
-        (!e || h || E) && s.push(E);
-      }
-  }
-  return s;
-}
-const ye = 1024 * 64, it = (i) => {
-  if (typeof i != "string")
-    throw new TypeError("invalid pattern");
-  if (i.length > ye)
-    throw new TypeError("pattern is too long");
-}, we = {
-  "[: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]
-}, Q = (i) => i.replace(/[[\]\\-]/g, "\\$&"), Se = (i) => i.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&"), St = (i) => i.join(""), Ee = (i, t) => {
-  const e = t;
-  if (i.charAt(e) !== "[")
-    throw new Error("not in a brace expression");
-  const s = [], n = [];
-  let r = e + 1, c = !1, a = !1, p = !1, h = !1, f = e, l = "";
-  t: for (; r < i.length; ) {
-    const E = i.charAt(r);
-    if ((E === "!" || E === "^") && r === e + 1) {
-      h = !0, r++;
-      continue;
-    }
-    if (E === "]" && c && !p) {
-      f = r + 1;
-      break;
-    }
-    if (c = !0, E === "\\" && !p) {
-      p = !0, r++;
-      continue;
-    }
-    if (E === "[" && !p) {
-      for (const [w, [b, A, d]] of Object.entries(we))
-        if (i.startsWith(w, r)) {
-          if (l)
-            return ["$.", !1, i.length - e, !0];
-          r += w.length, d ? n.push(b) : s.push(b), a = a || A;
-          continue t;
-        }
-    }
-    if (p = !1, l) {
-      E > l ? s.push(Q(l) + "-" + Q(E)) : E === l && s.push(Q(E)), l = "", r++;
-      continue;
-    }
-    if (i.startsWith("-]", r + 1)) {
-      s.push(Q(E + "-")), r += 2;
-      continue;
-    }
-    if (i.startsWith("-", r + 1)) {
-      l = E, r += 2;
-      continue;
-    }
-    s.push(Q(E)), r++;
-  }
-  if (f < r)
-    return ["", !1, 0, !1];
-  if (!s.length && !n.length)
-    return ["$.", !1, i.length - e, !0];
-  if (n.length === 0 && s.length === 1 && /^\\?.$/.test(s[0]) && !h) {
-    const E = s[0].length === 2 ? s[0].slice(-1) : s[0];
-    return [Se(E), !1, f - e, !1];
-  }
-  const u = "[" + (h ? "^" : "") + St(s) + "]", g = "[" + (h ? "" : "^") + St(n) + "]";
-  return [s.length && n.length ? "(" + u + "|" + g + ")" : s.length ? u : g, a, f - e, !0];
-}, Y = (i, { windowsPathsNoEscape: t = !1, magicalBraces: e = !0 } = {}) => e ? t ? i.replace(/\[([^/\\])\]/g, "$1") : i.replace(/((?!\\).|^)\[([^/\\])\]/g, "$1$2").replace(/\\([^/])/g, "$1") : t ? i.replace(/\[([^/\\{}])\]/g, "$1") : i.replace(/((?!\\).|^)\[([^/\\{}])\]/g, "$1$2").replace(/\\([^/{}])/g, "$1");
-var W;
-const be = /* @__PURE__ */ new Set(["!", "?", "+", "*", "@"]), at = (i) => be.has(i), Et = (i) => at(i.type), xe = /* @__PURE__ */ new Map([
-  ["!", ["@"]],
-  ["?", ["?", "@"]],
-  ["@", ["@"]],
-  ["*", ["*", "+", "?", "@"]],
-  ["+", ["+", "@"]]
-]), Me = /* @__PURE__ */ new Map([
-  ["!", ["?"]],
-  ["@", ["?"]],
-  ["+", ["?", "*"]]
-]), Ne = /* @__PURE__ */ new Map([
-  ["!", ["?", "@"]],
-  ["?", ["?", "@"]],
-  ["@", ["?", "@"]],
-  ["*", ["*", "+", "?", "@"]],
-  ["+", ["+", "@", "?", "*"]]
-]), bt = /* @__PURE__ */ new Map([
-  ["!", /* @__PURE__ */ new Map([["!", "@"]])],
-  [
-    "?",
-    /* @__PURE__ */ new Map([
-      ["*", "*"],
-      ["+", "*"]
-    ])
-  ],
-  [
-    "@",
-    /* @__PURE__ */ new Map([
-      ["!", "!"],
-      ["?", "?"],
-      ["@", "@"],
-      ["*", "*"],
-      ["+", "+"]
-    ])
-  ],
-  [
-    "+",
-    /* @__PURE__ */ new Map([
-      ["?", "*"],
-      ["*", "*"]
-    ])
-  ]
-]), Ae = "(?!(?:^|/)\\.\\.?(?:$|/))", tt = "(?!\\.)", $e = /* @__PURE__ */ new Set(["[", "."]), Oe = /* @__PURE__ */ new Set(["..", "."]), Te = new Set("().*{}+?[]^$\\!"), ve = (i) => i.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&"), mt = "[^/]", xt = mt + "*?", Mt = mt + "+?";
-let Re = 0;
-var v, P, z, m, O, G, U, F, _, q, V, M, Ct, I, et, Wt, ft, st, Dt, ut, Lt, kt, _t, nt, pt, qt;
-class rt {
-  constructor(t, e, s = {}) {
-    R(this, M);
-    T(this, "type");
-    R(this, v);
-    R(this, P);
-    R(this, z, !1);
-    R(this, m, []);
-    R(this, O);
-    R(this, G);
-    R(this, U);
-    R(this, F, !1);
-    R(this, _);
-    R(this, q);
-    // set to true if it's an extglob with no children
-    // (which really means one child of '')
-    R(this, V, !1);
-    T(this, "id", ++Re);
-    this.type = t, t && S(this, P, !0), S(this, O, e), S(this, v, o(this, O) ? o(o(this, O), v) : this), S(this, _, o(this, v) === this ? s : o(o(this, v), _)), S(this, U, o(this, v) === this ? [] : o(o(this, v), U)), t === "!" && !o(o(this, v), F) && o(this, U).push(this), S(this, G, o(this, O) ? o(o(this, O), m).length : 0);
-  }
-  get depth() {
-    var t;
-    return (((t = o(this, O)) == null ? void 0 : t.depth) ?? -1) + 1;
-  }
-  [Symbol.for("nodejs.util.inspect.custom")]() {
-    var t;
-    return {
-      "@@type": "AST",
-      id: this.id,
-      type: this.type,
-      root: o(this, v).id,
-      parent: (t = o(this, O)) == null ? void 0 : t.id,
-      depth: this.depth,
-      partsLength: o(this, m).length,
-      parts: o(this, m)
-    };
-  }
-  get hasMagic() {
-    if (o(this, P) !== void 0)
-      return o(this, P);
-    for (const t of o(this, m))
-      if (typeof t != "string" && (t.type || t.hasMagic))
-        return S(this, P, !0);
-    return o(this, P);
-  }
-  // reconstructs the pattern
-  toString() {
-    return o(this, q) !== void 0 ? o(this, q) : this.type ? S(this, q, this.type + "(" + o(this, m).map((t) => String(t)).join("|") + ")") : S(this, q, o(this, m).map((t) => String(t)).join(""));
-  }
-  push(...t) {
-    for (const e of t)
-      if (e !== "") {
-        if (typeof e != "string" && !(e instanceof W && o(e, O) === this))
-          throw new Error("invalid part: " + e);
-        o(this, m).push(e);
-      }
-  }
-  toJSON() {
-    var e;
-    const t = this.type === null ? o(this, m).slice().map((s) => typeof s == "string" ? s : s.toJSON()) : [this.type, ...o(this, m).map((s) => s.toJSON())];
-    return this.isStart() && !this.type && t.unshift([]), this.isEnd() && (this === o(this, v) || o(o(this, v), F) && ((e = o(this, O)) == null ? void 0 : e.type) === "!") && t.push({}), t;
-  }
-  isStart() {
-    var e;
-    if (o(this, v) === this)
-      return !0;
-    if (!((e = o(this, O)) != null && e.isStart()))
-      return !1;
-    if (o(this, G) === 0)
-      return !0;
-    const t = o(this, O);
-    for (let s = 0; s < o(this, G); s++) {
-      const n = o(t, m)[s];
-      if (!(n instanceof W && n.type === "!"))
-        return !1;
-    }
-    return !0;
-  }
-  isEnd() {
-    var e, s, n;
-    if (o(this, v) === this || ((e = o(this, O)) == null ? void 0 : e.type) === "!")
-      return !0;
-    if (!((s = o(this, O)) != null && s.isEnd()))
-      return !1;
-    if (!this.type)
-      return (n = o(this, O)) == null ? void 0 : n.isEnd();
-    const t = o(this, O) ? o(o(this, O), m).length : 0;
-    return o(this, G) === t - 1;
-  }
-  copyIn(t) {
-    typeof t == "string" ? this.push(t) : this.push(t.clone(this));
-  }
-  clone(t) {
-    const e = new W(this.type, t);
-    for (const s of o(this, m))
-      e.copyIn(s);
-    return e;
-  }
-  static fromGlob(t, e = {}) {
-    var n;
-    const s = new W(null, void 0, e);
-    return x(n = W, I, et).call(n, t, s, 0, e, 0), s;
-  }
-  // returns the regular expression if there's magic, or the unescaped
-  // string if not.
-  toMMPattern() {
-    if (this !== o(this, v))
-      return o(this, v).toMMPattern();
-    const t = this.toString(), [e, s, n, r] = this.toRegExpSource();
-    if (!(n || o(this, P) || o(this, _).nocase && !o(this, _).nocaseMagicOnly && t.toUpperCase() !== t.toLowerCase()))
-      return s;
-    const a = (o(this, _).nocase ? "i" : "") + (r ? "u" : "");
-    return Object.assign(new RegExp(`^${e}$`, a), {
-      _src: e,
-      _glob: t
-    });
-  }
-  get options() {
-    return o(this, _);
-  }
-  // 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) {
-    var p;
-    const e = t ?? !!o(this, _).dot;
-    if (o(this, v) === this && (x(this, M, nt).call(this), x(this, M, Ct).call(this)), !Et(this)) {
-      const h = this.isStart() && this.isEnd() && !o(this, m).some((y) => typeof y != "string"), f = o(this, m).map((y) => {
-        var d;
-        const [E, w, b, A] = typeof y == "string" ? x(d = W, I, qt).call(d, y, o(this, P), h) : y.toRegExpSource(t);
-        return S(this, P, o(this, P) || b), S(this, z, o(this, z) || A), E;
-      }).join("");
-      let l = "";
-      if (this.isStart() && typeof o(this, m)[0] == "string" && !(o(this, m).length === 1 && Oe.has(o(this, m)[0]))) {
-        const E = $e, w = (
-          // dots are allowed, and the pattern starts with [ or .
-          e && E.has(f.charAt(0)) || // the pattern starts with \., and then [ or .
-          f.startsWith("\\.") && E.has(f.charAt(2)) || // the pattern starts with \.\., and then [ or .
-          f.startsWith("\\.\\.") && E.has(f.charAt(4))
-        ), b = !e && !t && E.has(f.charAt(0));
-        l = w ? Ae : b ? tt : "";
-      }
-      let u = "";
-      return this.isEnd() && o(o(this, v), F) && ((p = o(this, O)) == null ? void 0 : p.type) === "!" && (u = "(?:$|\\/)"), [
-        l + f + u,
-        Y(f),
-        S(this, P, !!o(this, P)),
-        o(this, z)
-      ];
-    }
-    const s = this.type === "*" || this.type === "+", n = this.type === "!" ? "(?:(?!(?:" : "(?:";
-    let r = x(this, M, pt).call(this, e);
-    if (this.isStart() && this.isEnd() && !r && this.type !== "!") {
-      const h = this.toString(), f = this;
-      return S(f, m, [h]), f.type = null, S(f, P, void 0), [h, Y(this.toString()), !1, !1];
-    }
-    let c = !s || t || e || !tt ? "" : x(this, M, pt).call(this, !0);
-    c === r && (c = ""), c && (r = `(?:${r})(?:${c})*?`);
-    let a = "";
-    if (this.type === "!" && o(this, V))
-      a = (this.isStart() && !e ? tt : "") + Mt;
-    else {
-      const h = this.type === "!" ? (
-        // !() must match something,but !(x) can match ''
-        "))" + (this.isStart() && !e && !t ? tt : "") + xt + ")"
-      ) : this.type === "@" ? ")" : this.type === "?" ? ")?" : this.type === "+" && c ? ")" : this.type === "*" && c ? ")?" : `)${this.type}`;
-      a = n + r + h;
-    }
-    return [
-      a,
-      Y(r),
-      S(this, P, !!o(this, P)),
-      o(this, z)
-    ];
-  }
-}
-v = new WeakMap(), P = new WeakMap(), z = new WeakMap(), m = new WeakMap(), O = new WeakMap(), G = new WeakMap(), U = new WeakMap(), F = new WeakMap(), _ = new WeakMap(), q = new WeakMap(), V = new WeakMap(), M = new WeakSet(), Ct = function() {
-  if (this !== o(this, v))
-    throw new Error("should only call on root");
-  if (o(this, F))
-    return this;
-  this.toString(), S(this, F, !0);
-  let t;
-  for (; t = o(this, U).pop(); ) {
-    if (t.type !== "!")
-      continue;
-    let e = t, s = o(e, O);
-    for (; s; ) {
-      for (let n = o(e, G) + 1; !s.type && n < o(s, m).length; n++)
-        for (const r of o(t, m)) {
-          if (typeof r == "string")
-            throw new Error("string part in extglob AST??");
-          r.copyIn(o(s, m)[n]);
-        }
-      e = s, s = o(e, O);
-    }
-  }
-  return this;
-}, I = new WeakSet(), et = function(t, e, s, n, r) {
-  var E, w, b, A;
-  const c = n.maxExtglobRecursion ?? 2;
-  let a = !1, p = !1, h = -1, f = !1;
-  if (e.type === null) {
-    let d = s, $ = "";
-    for (; d < t.length; ) {
-      const N = t.charAt(d++);
-      if (a || N === "\\") {
-        a = !a, $ += N;
-        continue;
-      }
-      if (p) {
-        d === h + 1 ? (N === "^" || N === "!") && (f = !0) : N === "]" && !(d === h + 2 && f) && (p = !1), $ += N;
-        continue;
-      } else if (N === "[") {
-        p = !0, h = d, f = !1, $ += N;
-        continue;
-      }
-      if (!n.noext && at(N) && t.charAt(d) === "(" && r <= c) {
-        e.push($), $ = "";
-        const X = new W(N, e);
-        d = x(E = W, I, et).call(E, t, X, d, n, r + 1), e.push(X);
-        continue;
-      }
-      $ += N;
-    }
-    return e.push($), d;
-  }
-  let l = s + 1, u = new W(null, e);
-  const g = [];
-  let y = "";
-  for (; l < t.length; ) {
-    const d = t.charAt(l++);
-    if (a || d === "\\") {
-      a = !a, y += d;
-      continue;
-    }
-    if (p) {
-      l === h + 1 ? (d === "^" || d === "!") && (f = !0) : d === "]" && !(l === h + 2 && f) && (p = !1), y += d;
-      continue;
-    } else if (d === "[") {
-      p = !0, h = l, f = !1, y += d;
-      continue;
-    }
-    if (!n.noext && at(d) && t.charAt(l) === "(" && /* c8 ignore start - the maxDepth is sufficient here */
-    (r <= c || e && x(w = e, M, st).call(w, d))) {
-      const N = e && x(b = e, M, st).call(b, d) ? 0 : 1;
-      u.push(y), y = "";
-      const H = new W(d, u);
-      u.push(H), l = x(A = W, I, et).call(A, t, H, l, n, r + N);
-      continue;
-    }
-    if (d === "|") {
-      u.push(y), y = "", g.push(u), u = new W(null, e);
-      continue;
-    }
-    if (d === ")")
-      return y === "" && o(e, m).length === 0 && S(e, V, !0), u.push(y), y = "", e.push(...g, u), l;
-    y += d;
-  }
-  return e.type = null, S(e, P, void 0), S(e, m, [t.substring(s - 1)]), l;
-}, Wt = function(t) {
-  return x(this, M, ft).call(this, t, Me);
-}, ft = function(t, e = xe) {
-  if (!t || typeof t != "object" || t.type !== null || o(t, m).length !== 1 || this.type === null)
-    return !1;
-  const s = o(t, m)[0];
-  return !s || typeof s != "object" || s.type === null ? !1 : x(this, M, st).call(this, s.type, e);
-}, st = function(t, e = Ne) {
-  var s;
-  return !!((s = e.get(this.type)) != null && s.includes(t));
-}, Dt = function(t, e) {
-  const s = o(t, m)[0], n = new W(null, s, this.options);
-  o(n, m).push(""), s.push(n), x(this, M, ut).call(this, t, e);
-}, ut = function(t, e) {
-  const s = o(t, m)[0];
-  o(this, m).splice(e, 1, ...o(s, m));
-  for (const n of o(s, m))
-    typeof n == "object" && S(n, O, this);
-  S(this, q, void 0);
-}, Lt = function(t) {
-  const e = bt.get(this.type);
-  return !!(e != null && e.has(t));
-}, kt = function(t) {
-  if (!t || typeof t != "object" || t.type !== null || o(t, m).length !== 1 || this.type === null || o(this, m).length !== 1)
-    return !1;
-  const e = o(t, m)[0];
-  return !e || typeof e != "object" || e.type === null ? !1 : x(this, M, Lt).call(this, e.type);
-}, _t = function(t) {
-  const e = bt.get(this.type), s = o(t, m)[0], n = e == null ? void 0 : e.get(s.type);
-  if (!n)
-    return !1;
-  S(this, m, o(s, m));
-  for (const r of o(this, m))
-    typeof r == "object" && S(r, O, this);
-  this.type = n, S(this, q, void 0), S(this, V, !1);
-}, nt = function() {
-  var t, e;
-  if (Et(this)) {
-    let s = 0, n = !1;
-    do {
-      n = !0;
-      for (let r = 0; r < o(this, m).length; r++) {
-        const c = o(this, m)[r];
-        typeof c == "object" && (x(e = c, M, nt).call(e), x(this, M, ft).call(this, c) ? (n = !1, x(this, M, ut).call(this, c, r)) : x(this, M, Wt).call(this, c) ? (n = !1, x(this, M, Dt).call(this, c, r)) : x(this, M, kt).call(this, c) && (n = !1, x(this, M, _t).call(this, c)));
-      }
-    } while (!n && ++s < 10);
-  } else
-    for (const s of o(this, m))
-      typeof s == "object" && x(t = s, M, nt).call(t);
-  S(this, q, void 0);
-}, pt = function(t) {
-  return o(this, m).map((e) => {
-    if (typeof e == "string")
-      throw new Error("string type in extglob ast??");
-    const [s, n, r, c] = e.toRegExpSource(t);
-    return S(this, z, o(this, z) || c), s;
-  }).filter((e) => !(this.isStart() && this.isEnd()) || !!e).join("|");
-}, qt = function(t, e, s = !1) {
-  let n = !1, r = "", c = !1, a = !1;
-  for (let p = 0; p < t.length; p++) {
-    const h = t.charAt(p);
-    if (n) {
-      n = !1, r += (Te.has(h) ? "\\" : "") + h;
-      continue;
-    }
-    if (h === "*") {
-      if (a)
-        continue;
-      a = !0, r += s && /^[*]+$/.test(t) ? Mt : xt, e = !0;
-      continue;
-    } else
-      a = !1;
-    if (h === "\\") {
-      p === t.length - 1 ? r += "\\\\" : n = !0;
-      continue;
-    }
-    if (h === "[") {
-      const [f, l, u, g] = Ee(t, p);
-      if (u) {
-        r += f, c = c || l, p += u - 1, e = e || g;
-        continue;
-      }
-    }
-    if (h === "?") {
-      r += mt, e = !0;
-      continue;
-    }
-    r += ve(h);
-  }
-  return [r, Y(t), !!e, c];
-}, R(rt, I);
-W = rt;
-const Pe = (i, { windowsPathsNoEscape: t = !1, magicalBraces: e = !1 } = {}) => e ? t ? i.replace(/[?*()[\]{}]/g, "[$&]") : i.replace(/[?*()[\]\\{}]/g, "\\$&") : t ? i.replace(/[?*()[\]]/g, "[$&]") : i.replace(/[?*()[\]\\]/g, "\\$&"), j = (i, t, e = {}) => (it(t), !e.nocomment && t.charAt(0) === "#" ? !1 : new ot(t, e).match(i)), je = /^\*+([^+@!?*[(]*)$/, Ce = (i) => (t) => !t.startsWith(".") && t.endsWith(i), We = (i) => (t) => t.endsWith(i), De = (i) => (i = i.toLowerCase(), (t) => !t.startsWith(".") && t.toLowerCase().endsWith(i)), Le = (i) => (i = i.toLowerCase(), (t) => t.toLowerCase().endsWith(i)), ke = /^\*+\.\*+$/, _e = (i) => !i.startsWith(".") && i.includes("."), qe = (i) => i !== "." && i !== ".." && i.includes("."), ze = /^\.\*+$/, Ge = (i) => i !== "." && i !== ".." && i.startsWith("."), Fe = /^\*+$/, Be = (i) => i.length !== 0 && !i.startsWith("."), Ie = (i) => i.length !== 0 && i !== "." && i !== "..", Ue = /^\?+([^+@!?*[(]*)?$/, Ze = ([i, t = ""]) => {
-  const e = zt([i]);
-  return t ? (t = t.toLowerCase(), (s) => e(s) && s.toLowerCase().endsWith(t)) : e;
-}, He = ([i, t = ""]) => {
-  const e = Gt([i]);
-  return t ? (t = t.toLowerCase(), (s) => e(s) && s.toLowerCase().endsWith(t)) : e;
-}, Je = ([i, t = ""]) => {
-  const e = Gt([i]);
-  return t ? (s) => e(s) && s.endsWith(t) : e;
-}, Ve = ([i, t = ""]) => {
-  const e = zt([i]);
-  return t ? (s) => e(s) && s.endsWith(t) : e;
-}, zt = ([i]) => {
-  const t = i.length;
-  return (e) => e.length === t && !e.startsWith(".");
-}, Gt = ([i]) => {
-  const t = i.length;
-  return (e) => e.length === t && e !== "." && e !== "..";
-}, Ft = typeof process == "object" && process ? typeof process.env == "object" && process.env && process.env.__MINIMATCH_TESTING_PLATFORM__ || process.platform : "posix", Nt = {
-  win32: { sep: "\\" },
-  posix: { sep: "/" }
-}, Xe = Ft === "win32" ? Nt.win32.sep : Nt.posix.sep;
-j.sep = Xe;
-const C = Symbol("globstar **");
-j.GLOBSTAR = C;
-const Qe = "[^/]", Ke = Qe + "*?", Ye = "(?:(?!(?:\\/|^)(?:\\.{1,2})($|\\/)).)*?", ts = "(?:(?!(?:\\/|^)\\.).)*?", es = (i, t = {}) => (e) => j(e, i, t);
-j.filter = es;
-const k = (i, t = {}) => Object.assign({}, i, t), ss = (i) => {
-  if (!i || typeof i != "object" || !Object.keys(i).length)
-    return j;
-  const t = j;
-  return Object.assign((s, n, r = {}) => t(s, n, k(i, r)), {
-    Minimatch: class extends t.Minimatch {
-      constructor(n, r = {}) {
-        super(n, k(i, r));
-      }
-      static defaults(n) {
-        return t.defaults(k(i, n)).Minimatch;
-      }
-    },
-    AST: class extends t.AST {
-      /* c8 ignore start */
-      constructor(n, r, c = {}) {
-        super(n, r, k(i, c));
-      }
-      /* c8 ignore stop */
-      static fromGlob(n, r = {}) {
-        return t.AST.fromGlob(n, k(i, r));
-      }
-    },
-    unescape: (s, n = {}) => t.unescape(s, k(i, n)),
-    escape: (s, n = {}) => t.escape(s, k(i, n)),
-    filter: (s, n = {}) => t.filter(s, k(i, n)),
-    defaults: (s) => t.defaults(k(i, s)),
-    makeRe: (s, n = {}) => t.makeRe(s, k(i, n)),
-    braceExpand: (s, n = {}) => t.braceExpand(s, k(i, n)),
-    match: (s, n, r = {}) => t.match(s, n, k(i, r)),
-    sep: t.sep,
-    GLOBSTAR: C
-  });
-};
-j.defaults = ss;
-const Bt = (i, t = {}) => (it(i), t.nobrace || !/\{(?:(?!\{).)*\}/.test(i) ? [i] : ue(i, { max: t.braceExpandMax }));
-j.braceExpand = Bt;
-const ns = (i, t = {}) => new ot(i, t).makeRe();
-j.makeRe = ns;
-const is = (i, t, e = {}) => {
-  const s = new ot(t, e);
-  return i = i.filter((n) => s.match(n)), s.options.nonull && !i.length && i.push(t), i;
-};
-j.match = is;
-const At = /[?*]|[+@!]\(.*?\)|\[|\]/, rs = (i) => i.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&");
-var L, It, gt, J;
-class ot {
-  constructor(t, e = {}) {
-    R(this, L);
-    T(this, "options");
-    T(this, "set");
-    T(this, "pattern");
-    T(this, "windowsPathsNoEscape");
-    T(this, "nonegate");
-    T(this, "negate");
-    T(this, "comment");
-    T(this, "empty");
-    T(this, "preserveMultipleSlashes");
-    T(this, "partial");
-    T(this, "globSet");
-    T(this, "globParts");
-    T(this, "nocase");
-    T(this, "isWindows");
-    T(this, "platform");
-    T(this, "windowsNoMagicRoot");
-    T(this, "maxGlobstarRecursion");
-    T(this, "regexp");
-    it(t), e = e || {}, this.options = e, this.maxGlobstarRecursion = e.maxGlobstarRecursion ?? 200, this.pattern = t, this.platform = e.platform || Ft, 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 = (...r) => console.error(...r)), this.debug(this.pattern, this.globSet);
-    const s = this.globSet.map((r) => this.slashSplit(r));
-    this.globParts = this.preprocess(s), this.debug(this.pattern, this.globParts);
-    let n = this.globParts.map((r, c, a) => {
-      if (this.isWindows && this.windowsNoMagicRoot) {
-        const p = r[0] === "" && r[1] === "" && (r[2] === "?" || !At.test(r[2])) && !At.test(r[3]), h = /^[a-z]:/i.test(r[0]);
-        if (p)
-          return [
-            ...r.slice(0, 4),
-            ...r.slice(4).map((f) => this.parse(f))
-          ];
-        if (h)
-          return [r[0], ...r.slice(1).map((f) => this.parse(f))];
-      }
-      return r.map((p) => this.parse(p));
-    });
-    if (this.debug(this.pattern, n), this.set = n.filter((r) => r.indexOf(!1) === -1), this.isWindows)
-      for (let r = 0; r < this.set.length; r++) {
-        const c = this.set[r];
-        c[0] === "" && c[1] === "" && this.globParts[r][2] === "?" && typeof c[3] == "string" && /^[a-z]:$/i.test(c[3]) && (c[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 n = 0; n < s.length; n++)
-          s[n] === "**" && (s[n] = "*");
-    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 n = s;
-        for (; e[n + 1] === "**"; )
-          n++;
-        n !== s && e.splice(s, n - s);
-      }
-      return e;
-    });
-  }
-  // get rid of adjascent ** and resolve .. portions
-  levelOneOptimize(t) {
-    return t.map((e) => (e = e.reduce((s, n) => {
-      const r = s[s.length - 1];
-      return n === "**" && r === "**" ? s : n === ".." && r && r !== ".." && r !== "." && r !== "**" ? (s.pop(), s) : (s.push(n), 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 n = 1; n < t.length - 1; n++) {
-          const r = t[n];
-          n === 1 && r === "" && t[0] === "" || (r === "." || r === "") && (e = !0, t.splice(n, 1), n--);
-        }
-        t[0] === "." && t.length === 2 && (t[1] === "." || t[1] === "") && (e = !0, t.pop());
-      }
-      let s = 0;
-      for (; (s = t.indexOf("..", s + 1)) !== -1; ) {
-        const n = t[s - 1];
-        n && n !== "." && n !== ".." && n !== "**" && !(this.isWindows && /^[a-z]:$/i.test(n)) && (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 n = -1;
-        for (; (n = s.indexOf("**", n + 1)) !== -1; ) {
-          let c = n;
-          for (; s[c + 1] === "**"; )
-            c++;
-          c > n && s.splice(n + 1, c - n);
-          let a = s[n + 1];
-          const p = s[n + 2], h = s[n + 3];
-          if (a !== ".." || !p || p === "." || p === ".." || !h || h === "." || h === "..")
-            continue;
-          e = !0, s.splice(n, 1);
-          const f = s.slice(0);
-          f[n] = "**", t.push(f), n--;
-        }
-        if (!this.preserveMultipleSlashes) {
-          for (let c = 1; c < s.length - 1; c++) {
-            const a = s[c];
-            c === 1 && a === "" && s[0] === "" || (a === "." || a === "") && (e = !0, s.splice(c, 1), c--);
-          }
-          s[0] === "." && s.length === 2 && (s[1] === "." || s[1] === "") && (e = !0, s.pop());
-        }
-        let r = 0;
-        for (; (r = s.indexOf("..", r + 1)) !== -1; ) {
-          const c = s[r - 1];
-          if (c && c !== "." && c !== ".." && c !== "**") {
-            e = !0;
-            const p = r === 1 && s[r + 1] === "**" ? ["."] : [];
-            s.splice(r - 1, 2, ...p), s.length === 0 && s.push(""), r -= 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 n = this.partsMatch(t[e], t[s], !this.preserveMultipleSlashes);
-        if (n) {
-          t[e] = [], t[s] = n;
-          break;
-        }
-      }
-    return t.filter((e) => e.length);
-  }
-  partsMatch(t, e, s = !1) {
-    let n = 0, r = 0, c = [], a = "";
-    for (; n < t.length && r < e.length; )
-      if (t[n] === e[r])
-        c.push(a === "b" ? e[r] : t[n]), n++, r++;
-      else if (s && t[n] === "**" && e[r] === t[n + 1])
-        c.push(t[n]), n++;
-      else if (s && e[r] === "**" && t[n] === e[r + 1])
-        c.push(e[r]), r++;
-      else if (t[n] === "*" && e[r] && (this.options.dot || !e[r].startsWith(".")) && e[r] !== "**") {
-        if (a === "b")
-          return !1;
-        a = "a", c.push(t[n]), n++, r++;
-      } else if (e[r] === "*" && t[n] && (this.options.dot || !t[n].startsWith(".")) && t[n] !== "**") {
-        if (a === "a")
-          return !1;
-        a = "b", c.push(e[r]), n++, r++;
-      } else
-        return !1;
-    return t.length === e.length && c;
-  }
-  parseNegate() {
-    if (this.nonegate)
-      return;
-    const t = this.pattern;
-    let e = !1, s = 0;
-    for (let n = 0; n < t.length && t.charAt(n) === "!"; n++)
-      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 n = 0, r = 0;
-    if (this.isWindows) {
-      const a = typeof t[0] == "string" && /^[a-z]:$/i.test(t[0]), p = !a && t[0] === "" && t[1] === "" && t[2] === "?" && /^[a-z]:$/i.test(t[3]), h = typeof e[0] == "string" && /^[a-z]:$/i.test(e[0]), f = !h && e[0] === "" && e[1] === "" && e[2] === "?" && typeof e[3] == "string" && /^[a-z]:$/i.test(e[3]), l = p ? 3 : a ? 0 : void 0, u = f ? 3 : h ? 0 : void 0;
-      if (typeof l == "number" && typeof u == "number") {
-        const [g, y] = [
-          t[l],
-          e[u]
-        ];
-        g.toLowerCase() === y.toLowerCase() && (e[u] = g, r = u, n = l);
-      }
-    }
-    const { optimizationLevel: c = 1 } = this.options;
-    return c >= 2 && (t = this.levelTwoFileOptimize(t)), e.includes(C) ? x(this, L, It).call(this, t, e, s, n, r) : x(this, L, J).call(this, t, e, s, n, r);
-  }
-  braceExpand() {
-    return Bt(this.pattern, this.options);
-  }
-  parse(t) {
-    it(t);
-    const e = this.options;
-    if (t === "**")
-      return C;
-    if (t === "")
-      return "";
-    let s, n = null;
-    (s = t.match(Fe)) ? n = e.dot ? Ie : Be : (s = t.match(je)) ? n = (e.nocase ? e.dot ? Le : De : e.dot ? We : Ce)(s[1]) : (s = t.match(Ue)) ? n = (e.nocase ? e.dot ? He : Ze : e.dot ? Je : Ve)(s) : (s = t.match(ke)) ? n = e.dot ? qe : _e : (s = t.match(ze)) && (n = Ge);
-    const r = rt.fromGlob(t, this.options).toMMPattern();
-    return n && typeof r == "object" && Reflect.defineProperty(r, "test", { value: n }), r;
-  }
-  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 ? Ke : e.dot ? Ye : ts, n = new Set(e.nocase ? ["i"] : []);
-    let r = t.map((p) => {
-      const h = p.map((l) => {
-        if (l instanceof RegExp)
-          for (const u of l.flags.split(""))
-            n.add(u);
-        return typeof l == "string" ? rs(l) : l === C ? C : l._src;
-      });
-      h.forEach((l, u) => {
-        const g = h[u + 1], y = h[u - 1];
-        l !== C || y === C || (y === void 0 ? g !== void 0 && g !== C ? h[u + 1] = "(?:\\/|" + s + "\\/)?" + g : h[u] = s : g === void 0 ? h[u - 1] = y + "(?:\\/|\\/" + s + ")?" : g !== C && (h[u - 1] = y + "(?:\\/|\\/" + s + "\\/)" + g, h[u + 1] = C));
-      });
-      const f = h.filter((l) => l !== C);
-      if (this.partial && f.length >= 1) {
-        const l = [];
-        for (let u = 1; u <= f.length; u++)
-          l.push(f.slice(0, u).join("/"));
-        return "(?:" + l.join("|") + ")";
-      }
-      return f.join("/");
-    }).join("|");
-    const [c, a] = t.length > 1 ? ["(?:", ")"] : ["", ""];
-    r = "^" + c + r + a + "$", this.partial && (r = "^(?:\\/|" + c + r.slice(1, -1) + a + ")$"), this.negate && (r = "^(?!" + r + ").+$");
-    try {
-      this.regexp = new RegExp(r, [...n].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 n = this.slashSplit(t);
-    this.debug(this.pattern, "split", n);
-    const r = this.set;
-    this.debug(this.pattern, "set", r);
-    let c = n[n.length - 1];
-    if (!c)
-      for (let a = n.length - 2; !c && a >= 0; a--)
-        c = n[a];
-    for (const a of r) {
-      let p = n;
-      if (s.matchBase && a.length === 1 && (p = [c]), this.matchOne(p, a, e))
-        return s.flipNegate ? !0 : !this.negate;
-    }
-    return s.flipNegate ? !1 : this.negate;
-  }
-  static defaults(t) {
-    return j.defaults(t).Minimatch;
-  }
-}
-L = new WeakSet(), It = function(t, e, s, n, r) {
-  const c = e.indexOf(C, r), a = e.lastIndexOf(C), [p, h, f] = s ? [
-    e.slice(r, c),
-    e.slice(c + 1),
-    []
-  ] : [
-    e.slice(r, c),
-    e.slice(c + 1, a),
-    e.slice(a + 1)
-  ];
-  if (p.length) {
-    const A = t.slice(n, n + p.length);
-    if (!x(this, L, J).call(this, A, p, s, 0, 0))
-      return !1;
-    n += p.length, r += p.length;
-  }
-  let l = 0;
-  if (f.length) {
-    if (f.length + n > t.length)
-      return !1;
-    let A = t.length - f.length;
-    if (x(this, L, J).call(this, t, f, s, A, 0))
-      l = f.length;
-    else {
-      if (t[t.length - 1] !== "" || n + f.length === t.length || (A--, !x(this, L, J).call(this, t, f, s, A, 0)))
-        return !1;
-      l = f.length + 1;
-    }
-  }
-  if (!h.length) {
-    let A = !!l;
-    for (let d = n; d < t.length - l; d++) {
-      const $ = String(t[d]);
-      if (A = !0, $ === "." || $ === ".." || !this.options.dot && $.startsWith("."))
-        return !1;
-    }
-    return s || A;
-  }
-  const u = [[[], 0]];
-  let g = u[0], y = 0;
-  const E = [0];
-  for (const A of h)
-    A === C ? (E.push(y), g = [[], 0], u.push(g)) : (g[0].push(A), y++);
-  let w = u.length - 1;
-  const b = t.length - l;
-  for (const A of u)
-    A[1] = b - (E[w--] + A[0].length);
-  return !!x(this, L, gt).call(this, t, u, n, 0, s, 0, !!l);
-}, // return false for "nope, not matching"
-// return null for "not matching, cannot keep trying"
-gt = function(t, e, s, n, r, c, a) {
-  const p = e[n];
-  if (!p) {
-    for (let l = s; l < t.length; l++) {
-      a = !0;
-      const u = t[l];
-      if (u === "." || u === ".." || !this.options.dot && u.startsWith("."))
-        return !1;
-    }
-    return a;
-  }
-  const [h, f] = p;
-  for (; s <= f; ) {
-    if (x(this, L, J).call(this, t.slice(0, s + h.length), h, r, s, 0) && c < this.maxGlobstarRecursion) {
-      const g = x(this, L, gt).call(this, t, e, s + h.length, n + 1, r, c + 1, a);
-      if (g !== !1)
-        return g;
-    }
-    const u = t[s];
-    if (u === "." || u === ".." || !this.options.dot && u.startsWith("."))
-      return !1;
-    s++;
-  }
-  return r || null;
-}, J = function(t, e, s, n, r) {
-  let c, a, p, h;
-  for (c = n, a = r, h = t.length, p = e.length; c < h && a < p; c++, a++) {
-    this.debug("matchOne loop");
-    let f = e[a], l = t[c];
-    if (this.debug(e, f, l), f === !1 || f === C)
-      return !1;
-    let u;
-    if (typeof f == "string" ? (u = l === f, this.debug("string match", f, l, u)) : (u = f.test(l), this.debug("pattern match", f, l, u)), !u)
-      return !1;
-  }
-  if (c === h && a === p)
-    return !0;
-  if (c === h)
-    return s;
-  if (a === p)
-    return c === h - 1 && t[c] === "";
-  throw new Error("wtf?");
-};
-j.AST = rt;
-j.Minimatch = ot;
-j.escape = Pe;
-j.unescape = Y;
-class os {
-  constructor(t) {
-    T(this, "value");
-    T(this, "next");
-    this.value = t;
-  }
-}
-var D, B, Z;
-class cs {
-  constructor() {
-    R(this, D);
-    R(this, B);
-    R(this, Z);
-    this.clear();
-  }
-  enqueue(t) {
-    const e = new os(t);
-    o(this, D) ? (o(this, B).next = e, S(this, B, e)) : (S(this, D, e), S(this, B, e)), lt(this, Z)._++;
-  }
-  dequeue() {
-    const t = o(this, D);
-    if (t)
-      return S(this, D, o(this, D).next), lt(this, Z)._--, o(this, D) || S(this, B, void 0), t.value;
-  }
-  peek() {
-    if (o(this, D))
-      return o(this, D).value;
-  }
-  clear() {
-    S(this, D, void 0), S(this, B, void 0), S(this, Z, 0);
-  }
-  get size() {
-    return o(this, Z);
-  }
-  *[Symbol.iterator]() {
-    let t = o(this, D);
-    for (; t; )
-      yield t.value, t = t.next;
-  }
-  *drain() {
-    for (; o(this, D); )
-      yield this.dequeue();
-  }
-}
-D = new WeakMap(), B = new WeakMap(), Z = new WeakMap();
-function ls(i) {
-  let t = !1;
-  if (typeof i == "object" && ({ concurrency: i, rejectOnClear: t = !1 } = i), $t(i), typeof t != "boolean")
-    throw new TypeError("Expected `rejectOnClear` to be a boolean");
-  const e = new cs();
-  let s = 0;
-  const n = () => {
-    s < i && e.size > 0 && (s++, e.dequeue().run());
-  }, r = () => {
-    s--, n();
-  }, c = async (h, f, l) => {
-    const u = (async () => h(...l))();
-    f(u);
-    try {
-      await u;
-    } catch {
-    }
-    r();
-  }, a = (h, f, l, u) => {
-    const g = { reject: l };
-    new Promise((y) => {
-      g.run = y, e.enqueue(g);
-    }).then(c.bind(void 0, h, f, u)), s < i && n();
-  }, p = (h, ...f) => new Promise((l, u) => {
-    a(h, l, u, f);
-  });
-  return Object.defineProperties(p, {
-    activeCount: {
-      get: () => s
-    },
-    pendingCount: {
-      get: () => e.size
-    },
-    clearQueue: {
-      value() {
-        if (!t) {
-          e.clear();
-          return;
-        }
-        const h = AbortSignal.abort().reason;
-        for (; e.size > 0; )
-          e.dequeue().reject(h);
-      }
-    },
-    concurrency: {
-      get: () => i,
-      set(h) {
-        $t(h), i = h, queueMicrotask(() => {
-          for (; s < i && e.size > 0; )
-            n();
-        });
-      }
-    },
-    map: {
-      async value(h, f) {
-        const l = Array.from(h, (u, g) => this(f, u, g));
-        return Promise.all(l);
-      }
-    }
-  }), p;
-}
-function $t(i) {
-  if (!((Number.isInteger(i) || i === Number.POSITIVE_INFINITY) && i > 0))
-    throw new TypeError("Expected `concurrency` to be a number from 1 and up");
-}
-const hs = Qt(Vt);
-function as(i) {
-  if (i.length < 2) return "never";
-  const t = [...i].sort((n, r) => n - r);
-  let e = 0;
-  for (let n = 1; n < t.length; n++)
-    e += t[n] - t[n - 1];
-  const s = e / (t.length - 1) / 864e5;
-  return s <= 1 ? "daily" : s <= 7 ? "weekly" : s <= 30 ? "monthly" : s <= 365 ? "yearly" : "never";
-}
-function ws(i) {
-  const t = i.pageEntryPattern;
-  let e = i.rootDir ?? "", s = i.outputFile ?? "";
-  const n = i.concurrency ?? 20, r = i.commitCount ?? 10, c = i.ignoreDeps ? Array.isArray(i.ignoreDeps) ? i.ignoreDeps : [i.ignoreDeps] : [], a = {};
-  let p;
-  return {
-    name: "vite-last-modified",
-    async configResolved(h) {
-      p = h.build.ssr, e || (e = h.root), s || (s = Jt(e, "last-modified.json"));
-    },
-    async buildEnd() {
-      if (p || process.env.NODE_ENV !== "production")
-        return;
-      const h = /* @__PURE__ */ new Map(), f = ls(n), l = (w) => {
-        if (h.has(w))
-          return h.get(w);
-        const b = f(async () => {
-          try {
-            const A = w.includes("?") ? w.slice(0, w.indexOf("?")) : w, d = Ht.relative(e, A).replace(/\\/g, "/"), { stdout: $ } = await hs(`git log --follow -n ${r} --format=%at -- "${d}"`, { cwd: e });
-            return $.trim() ? $.trim().split(`
-`).map((N) => parseInt(N, 10) * 1e3) : [];
-          } catch {
-            return [];
-          }
-        });
-        return h.set(w, b), b;
-      }, u = (w, b) => {
-        if (b.has(w)) return;
-        b.add(w);
-        const A = this.getModuleInfo(w);
-        if (A)
-          for (const d of A.importedIds) {
-            if (d.includes("node_modules") || !d.startsWith(e))
-              continue;
-            const $ = d.slice(e.length).replace(/^\/?/, "").split("?")[0];
-            c.some((N) => j($, N, { dot: !0 })) || u(d, b);
-          }
-      }, g = [...this.getModuleIds()].filter((w) => {
-        if (!w.startsWith(e))
-          return !1;
-        const b = w.slice(e.length).replace(/^\//, "");
-        return typeof t == "string" ? j(b, t, { dot: !0 }) : t.test(b);
-      });
-      if (g.length === 0) {
-        console.warn("[lastModifiedPlugin] No MD files found in module graph");
-        return;
-      }
-      console.log("[lastModifiedPlugin] start collect entry files deps");
-      let y = /* @__PURE__ */ new Map();
-      for (const w of g) {
-        const b = /* @__PURE__ */ new Set();
-        u(w, b), y.set(w, b);
-      }
-      if (console.log(`[lastModifiedPlugin] Analyzed ${g.length} entry files`), typeof i.modifyDepMap == "function") {
-        const w = await i.modifyDepMap(y);
-        w && w instanceof Map && (y = w);
-      }
-      const E = /* @__PURE__ */ new Set();
-      for (const w of y.values())
-        for (const b of w)
-          E.add(b);
-      await Promise.all([...E].map(l));
-      for (const [w, b] of y) {
-        const A = w.slice(e.length).replace(/^\//, ""), d = (await Promise.all([...b].map(l))).flat(), $ = d.length > 0 ? Math.max(...d) : 0, N = as(d);
-        a[A] = { lastmod: $, changefreq: N };
-      }
-    },
-    closeBundle() {
-      if (p || process.env.NODE_ENV !== "production")
-        return;
-      const h = Object.fromEntries(Object.entries(a).sort(([f], [l]) => f.localeCompare(l)));
-      Xt(s, JSON.stringify(h, null, 2), "utf8"), console.log(`[lastModifiedPlugin] Written ${s}`);
-    }
-  };
-}
-export {
-  ws as g,
-  j as m
-};