@weavelogic/knowledge-graph-agent 0.3.0 → 0.6.0

package/dist/node_modules/semver/ranges/subset.js

@@ -0,0 +1,170 @@
+import { __require as requireRange } from "../classes/range.js";
+import { __require as requireComparator } from "../classes/comparator.js";
+import { __require as requireSatisfies } from "../functions/satisfies.js";
+import { __require as requireCompare } from "../functions/compare.js";
+var subset_1;
+var hasRequiredSubset;
+function requireSubset() {
+  if (hasRequiredSubset) return subset_1;
+  hasRequiredSubset = 1;
+  const Range = requireRange();
+  const Comparator = requireComparator();
+  const { ANY } = Comparator;
+  const satisfies = requireSatisfies();
+  const compare = requireCompare();
+  const subset = (sub, dom, options = {}) => {
+    if (sub === dom) {
+      return true;
+    }
+    sub = new Range(sub, options);
+    dom = new Range(dom, options);
+    let sawNonNull = false;
+    OUTER: for (const simpleSub of sub.set) {
+      for (const simpleDom of dom.set) {
+        const isSub = simpleSubset(simpleSub, simpleDom, options);
+        sawNonNull = sawNonNull || isSub !== null;
+        if (isSub) {
+          continue OUTER;
+        }
+      }
+      if (sawNonNull) {
+        return false;
+      }
+    }
+    return true;
+  };
+  const minimumVersionWithPreRelease = [new Comparator(">=0.0.0-0")];
+  const minimumVersion = [new Comparator(">=0.0.0")];
+  const simpleSubset = (sub, dom, options) => {
+    if (sub === dom) {
+      return true;
+    }
+    if (sub.length === 1 && sub[0].semver === ANY) {
+      if (dom.length === 1 && dom[0].semver === ANY) {
+        return true;
+      } else if (options.includePrerelease) {
+        sub = minimumVersionWithPreRelease;
+      } else {
+        sub = minimumVersion;
+      }
+    }
+    if (dom.length === 1 && dom[0].semver === ANY) {
+      if (options.includePrerelease) {
+        return true;
+      } else {
+        dom = minimumVersion;
+      }
+    }
+    const eqSet = /* @__PURE__ */ new Set();
+    let gt, lt;
+    for (const c of sub) {
+      if (c.operator === ">" || c.operator === ">=") {
+        gt = higherGT(gt, c, options);
+      } else if (c.operator === "<" || c.operator === "<=") {
+        lt = lowerLT(lt, c, options);
+      } else {
+        eqSet.add(c.semver);
+      }
+    }
+    if (eqSet.size > 1) {
+      return null;
+    }
+    let gtltComp;
+    if (gt && lt) {
+      gtltComp = compare(gt.semver, lt.semver, options);
+      if (gtltComp > 0) {
+        return null;
+      } else if (gtltComp === 0 && (gt.operator !== ">=" || lt.operator !== "<=")) {
+        return null;
+      }
+    }
+    for (const eq of eqSet) {
+      if (gt && !satisfies(eq, String(gt), options)) {
+        return null;
+      }
+      if (lt && !satisfies(eq, String(lt), options)) {
+        return null;
+      }
+      for (const c of dom) {
+        if (!satisfies(eq, String(c), options)) {
+          return false;
+        }
+      }
+      return true;
+    }
+    let higher, lower;
+    let hasDomLT, hasDomGT;
+    let needDomLTPre = lt && !options.includePrerelease && lt.semver.prerelease.length ? lt.semver : false;
+    let needDomGTPre = gt && !options.includePrerelease && gt.semver.prerelease.length ? gt.semver : false;
+    if (needDomLTPre && needDomLTPre.prerelease.length === 1 && lt.operator === "<" && needDomLTPre.prerelease[0] === 0) {
+      needDomLTPre = false;
+    }
+    for (const c of dom) {
+      hasDomGT = hasDomGT || c.operator === ">" || c.operator === ">=";
+      hasDomLT = hasDomLT || c.operator === "<" || c.operator === "<=";
+      if (gt) {
+        if (needDomGTPre) {
+          if (c.semver.prerelease && c.semver.prerelease.length && c.semver.major === needDomGTPre.major && c.semver.minor === needDomGTPre.minor && c.semver.patch === needDomGTPre.patch) {
+            needDomGTPre = false;
+          }
+        }
+        if (c.operator === ">" || c.operator === ">=") {
+          higher = higherGT(gt, c, options);
+          if (higher === c && higher !== gt) {
+            return false;
+          }
+        } else if (gt.operator === ">=" && !satisfies(gt.semver, String(c), options)) {
+          return false;
+        }
+      }
+      if (lt) {
+        if (needDomLTPre) {
+          if (c.semver.prerelease && c.semver.prerelease.length && c.semver.major === needDomLTPre.major && c.semver.minor === needDomLTPre.minor && c.semver.patch === needDomLTPre.patch) {
+            needDomLTPre = false;
+          }
+        }
+        if (c.operator === "<" || c.operator === "<=") {
+          lower = lowerLT(lt, c, options);
+          if (lower === c && lower !== lt) {
+            return false;
+          }
+        } else if (lt.operator === "<=" && !satisfies(lt.semver, String(c), options)) {
+          return false;
+        }
+      }
+      if (!c.operator && (lt || gt) && gtltComp !== 0) {
+        return false;
+      }
+    }
+    if (gt && hasDomLT && !lt && gtltComp !== 0) {
+      return false;
+    }
+    if (lt && hasDomGT && !gt && gtltComp !== 0) {
+      return false;
+    }
+    if (needDomGTPre || needDomLTPre) {
+      return false;
+    }
+    return true;
+  };
+  const higherGT = (a, b, options) => {
+    if (!a) {
+      return b;
+    }
+    const comp = compare(a.semver, b.semver, options);
+    return comp > 0 ? a : comp < 0 ? b : b.operator === ">" && a.operator === ">=" ? b : a;
+  };
+  const lowerLT = (a, b, options) => {
+    if (!a) {
+      return b;
+    }
+    const comp = compare(a.semver, b.semver, options);
+    return comp < 0 ? a : comp > 0 ? b : b.operator === "<" && a.operator === "<=" ? b : a;
+  };
+  subset_1 = subset;
+  return subset_1;
+}
+export {
+  requireSubset as __require
+};
+//# sourceMappingURL=subset.js.map

package/dist/node_modules/semver/ranges/subset.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subset.js","sources":["../../../../node_modules/semver/ranges/subset.js"],"sourcesContent":["'use strict'\n\nconst Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n//   some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n//   - If C is only the ANY comparator, return true\n//   - Else if in prerelease mode, return false\n//   - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n//   - if in prerelease mode, return true\n//   - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n//   - If GT, and EQ does not satisfy GT, return true (null set)\n//   - If LT, and EQ does not satisfy LT, return true (null set)\n//   - If EQ satisfies every C, return true\n//   - Else return false\n// - If GT\n//   - If GT.semver is lower than any > or >= comp in C, return false\n//   - If GT is >=, and GT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n//   - If LT.semver is greater than any < or <= comp in C, return false\n//   - If LT is <=, and LT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n  if (sub === dom) {\n    return true\n  }\n\n  sub = new Range(sub, options)\n  dom = new Range(dom, options)\n  let sawNonNull = false\n\n  OUTER: for (const simpleSub of sub.set) {\n    for (const simpleDom of dom.set) {\n      const isSub = simpleSubset(simpleSub, simpleDom, options)\n      sawNonNull = sawNonNull || isSub !== null\n      if (isSub) {\n        continue OUTER\n      }\n    }\n    // the null set is a subset of everything, but null simple ranges in\n    // a complex range should be ignored.  so if we saw a non-null range,\n    // then we know this isn't a subset, but if EVERY simple range was null,\n    // then it is a subset.\n    if (sawNonNull) {\n      return false\n    }\n  }\n  return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n  if (sub === dom) {\n    return true\n  }\n\n  if (sub.length === 1 && sub[0].semver === ANY) {\n    if (dom.length === 1 && dom[0].semver === ANY) {\n      return true\n    } else if (options.includePrerelease) {\n      sub = minimumVersionWithPreRelease\n    } else {\n      sub = minimumVersion\n    }\n  }\n\n  if (dom.length === 1 && dom[0].semver === ANY) {\n    if (options.includePrerelease) {\n      return true\n    } else {\n      dom = minimumVersion\n    }\n  }\n\n  const eqSet = new Set()\n  let gt, lt\n  for (const c of sub) {\n    if (c.operator === '>' || c.operator === '>=') {\n      gt = higherGT(gt, c, options)\n    } else if (c.operator === '<' || c.operator === '<=') {\n      lt = lowerLT(lt, c, options)\n    } else {\n      eqSet.add(c.semver)\n    }\n  }\n\n  if (eqSet.size > 1) {\n    return null\n  }\n\n  let gtltComp\n  if (gt && lt) {\n    gtltComp = compare(gt.semver, lt.semver, options)\n    if (gtltComp > 0) {\n      return null\n    } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n      return null\n    }\n  }\n\n  // will iterate one or zero times\n  for (const eq of eqSet) {\n    if (gt && !satisfies(eq, String(gt), options)) {\n      return null\n    }\n\n    if (lt && !satisfies(eq, String(lt), options)) {\n      return null\n    }\n\n    for (const c of dom) {\n      if (!satisfies(eq, String(c), options)) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  let higher, lower\n  let hasDomLT, hasDomGT\n  // if the subset has a prerelease, we need a comparator in the superset\n  // with the same tuple and a prerelease, or it's not a subset\n  let needDomLTPre = lt &&\n    !options.includePrerelease &&\n    lt.semver.prerelease.length ? lt.semver : false\n  let needDomGTPre = gt &&\n    !options.includePrerelease &&\n    gt.semver.prerelease.length ? gt.semver : false\n  // exception: <1.2.3-0 is the same as <1.2.3\n  if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n      lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n    needDomLTPre = false\n  }\n\n  for (const c of dom) {\n    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n    if (gt) {\n      if (needDomGTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomGTPre.major &&\n            c.semver.minor === needDomGTPre.minor &&\n            c.semver.patch === needDomGTPre.patch) {\n          needDomGTPre = false\n        }\n      }\n      if (c.operator === '>' || c.operator === '>=') {\n        higher = higherGT(gt, c, options)\n        if (higher === c && higher !== gt) {\n          return false\n        }\n      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (lt) {\n      if (needDomLTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomLTPre.major &&\n            c.semver.minor === needDomLTPre.minor &&\n            c.semver.patch === needDomLTPre.patch) {\n          needDomLTPre = false\n        }\n      }\n      if (c.operator === '<' || c.operator === '<=') {\n        lower = lowerLT(lt, c, options)\n        if (lower === c && lower !== lt) {\n          return false\n        }\n      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (!c.operator && (lt || gt) && gtltComp !== 0) {\n      return false\n    }\n  }\n\n  // if there was a < or >, and nothing in the dom, then must be false\n  // UNLESS it was limited by another range in the other direction.\n  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n  if (gt && hasDomLT && !lt && gtltComp !== 0) {\n    return false\n  }\n\n  if (lt && hasDomGT && !gt && gtltComp !== 0) {\n    return false\n  }\n\n  // we needed a prerelease range in a specific tuple, but didn't get one\n  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,\n  // because it includes prereleases in the 1.2.3 tuple\n  if (needDomGTPre || needDomLTPre) {\n    return false\n  }\n\n  return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp > 0 ? a\n    : comp < 0 ? b\n    : b.operator === '>' && a.operator === '>=' ? b\n    : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp < 0 ? a\n    : comp > 0 ? b\n    : b.operator === '<' && a.operator === '<=' ? b\n    : a\n}\n\nmodule.exports = subset\n"],"names":["require$$0","require$$1","require$$2","require$$3"],"mappings":";;;;;;;;;AAEA,QAAM,QAAQA,aAAA;AACd,QAAM,aAAaC,kBAAA;AACnB,QAAM,EAAE,IAAG,IAAK;AAChB,QAAM,YAAYC,iBAAA;AAClB,QAAM,UAAUC,eAAA;AAsChB,QAAM,SAAS,CAAC,KAAK,KAAK,UAAU,CAAA,MAAO;AACzC,QAAI,QAAQ,KAAK;AACf,aAAO;AAAA,IACX;AAEE,UAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,UAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,QAAI,aAAa;AAEjB,UAAO,YAAW,aAAa,IAAI,KAAK;AACtC,iBAAW,aAAa,IAAI,KAAK;AAC/B,cAAM,QAAQ,aAAa,WAAW,WAAW,OAAO;AACxD,qBAAa,cAAc,UAAU;AACrC,YAAI,OAAO;AACT,mBAAS;AAAA,QACjB;AAAA,MACA;AAKI,UAAI,YAAY;AACd,eAAO;AAAA,MACb;AAAA,IACA;AACE,WAAO;AAAA,EACT;AAEA,QAAM,+BAA+B,CAAC,IAAI,WAAW,WAAW,CAAC;AACjE,QAAM,iBAAiB,CAAC,IAAI,WAAW,SAAS,CAAC;AAEjD,QAAM,eAAe,CAAC,KAAK,KAAK,YAAY;AAC1C,QAAI,QAAQ,KAAK;AACf,aAAO;AAAA,IACX;AAEE,QAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,UAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,eAAO;AAAA,MACb,WAAe,QAAQ,mBAAmB;AACpC,cAAM;AAAA,MACZ,OAAW;AACL,cAAM;AAAA,MACZ;AAAA,IACA;AAEE,QAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,UAAI,QAAQ,mBAAmB;AAC7B,eAAO;AAAA,MACb,OAAW;AACL,cAAM;AAAA,MACZ;AAAA,IACA;AAEE,UAAM,QAAQ,oBAAI,IAAG;AACrB,QAAI,IAAI;AACR,eAAW,KAAK,KAAK;AACnB,UAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,aAAK,SAAS,IAAI,GAAG,OAAO;AAAA,MAClC,WAAe,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AACpD,aAAK,QAAQ,IAAI,GAAG,OAAO;AAAA,MACjC,OAAW;AACL,cAAM,IAAI,EAAE,MAAM;AAAA,MACxB;AAAA,IACA;AAEE,QAAI,MAAM,OAAO,GAAG;AAClB,aAAO;AAAA,IACX;AAEE,QAAI;AACJ,QAAI,MAAM,IAAI;AACZ,iBAAW,QAAQ,GAAG,QAAQ,GAAG,QAAQ,OAAO;AAChD,UAAI,WAAW,GAAG;AAChB,eAAO;AAAA,MACb,WAAe,aAAa,MAAM,GAAG,aAAa,QAAQ,GAAG,aAAa,OAAO;AAC3E,eAAO;AAAA,MACb;AAAA,IACA;AAGE,eAAW,MAAM,OAAO;AACtB,UAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,eAAO;AAAA,MACb;AAEI,UAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,eAAO;AAAA,MACb;AAEI,iBAAW,KAAK,KAAK;AACnB,YAAI,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,OAAO,GAAG;AACtC,iBAAO;AAAA,QACf;AAAA,MACA;AAEI,aAAO;AAAA,IACX;AAEE,QAAI,QAAQ;AACZ,QAAI,UAAU;AAGd,QAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAC5C,QAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAE5C,QAAI,gBAAgB,aAAa,WAAW,WAAW,KACnD,GAAG,aAAa,OAAO,aAAa,WAAW,CAAC,MAAM,GAAG;AAC3D,qBAAe;AAAA,IACnB;AAEE,eAAW,KAAK,KAAK;AACnB,iBAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,iBAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,UAAI,IAAI;AACN,YAAI,cAAc;AAChB,cAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,2BAAe;AAAA,UACzB;AAAA,QACA;AACM,YAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,mBAAS,SAAS,IAAI,GAAG,OAAO;AAChC,cAAI,WAAW,KAAK,WAAW,IAAI;AACjC,mBAAO;AAAA,UACjB;AAAA,QACA,WAAiB,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,iBAAO;AAAA,QACf;AAAA,MACA;AACI,UAAI,IAAI;AACN,YAAI,cAAc;AAChB,cAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,2BAAe;AAAA,UACzB;AAAA,QACA;AACM,YAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,kBAAQ,QAAQ,IAAI,GAAG,OAAO;AAC9B,cAAI,UAAU,KAAK,UAAU,IAAI;AAC/B,mBAAO;AAAA,UACjB;AAAA,QACA,WAAiB,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,iBAAO;AAAA,QACf;AAAA,MACA;AACI,UAAI,CAAC,EAAE,aAAa,MAAM,OAAO,aAAa,GAAG;AAC/C,eAAO;AAAA,MACb;AAAA,IACA;AAKE,QAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,aAAO;AAAA,IACX;AAEE,QAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,aAAO;AAAA,IACX;AAKE,QAAI,gBAAgB,cAAc;AAChC,aAAO;AAAA,IACX;AAEE,WAAO;AAAA,EACT;AAGA,QAAM,WAAW,CAAC,GAAG,GAAG,YAAY;AAClC,QAAI,CAAC,GAAG;AACN,aAAO;AAAA,IACX;AACE,UAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,WAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AAAA,EACN;AAGA,QAAM,UAAU,CAAC,GAAG,GAAG,YAAY;AACjC,QAAI,CAAC,GAAG;AACN,aAAO;AAAA,IACX;AACE,UAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,WAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AAAA,EACN;AAEA,aAAiB;;;","x_google_ignoreList":[0]}

package/dist/node_modules/semver/ranges/to-comparators.js

@@ -0,0 +1,15 @@
+import { __require as requireRange } from "../classes/range.js";
+var toComparators_1;
+var hasRequiredToComparators;
+function requireToComparators() {
+  if (hasRequiredToComparators) return toComparators_1;
+  hasRequiredToComparators = 1;
+  const Range = requireRange();
+  const toComparators = (range, options) => new Range(range, options).set.map((comp) => comp.map((c) => c.value).join(" ").trim().split(" "));
+  toComparators_1 = toComparators;
+  return toComparators_1;
+}
+export {
+  requireToComparators as __require
+};
+//# sourceMappingURL=to-comparators.js.map

package/dist/node_modules/semver/ranges/to-comparators.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"to-comparators.js","sources":["../../../../node_modules/semver/ranges/to-comparators.js"],"sourcesContent":["'use strict'\n\nconst Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n  new Range(range, options).set\n    .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n"],"names":["require$$0"],"mappings":";;;;;;AAEA,QAAM,QAAQA,aAAA;AAGd,QAAM,gBAAgB,CAAC,OAAO,YAC5B,IAAI,MAAM,OAAO,OAAO,EAAE,IACvB,IAAI,UAAQ,KAAK,IAAI,OAAK,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,KAAI,EAAG,MAAM,GAAG,CAAC;AAEnE,oBAAiB;;;","x_google_ignoreList":[0]}

package/dist/node_modules/semver/ranges/valid.js

@@ -0,0 +1,21 @@
+import { __require as requireRange } from "../classes/range.js";
+var valid;
+var hasRequiredValid;
+function requireValid() {
+  if (hasRequiredValid) return valid;
+  hasRequiredValid = 1;
+  const Range = requireRange();
+  const validRange = (range, options) => {
+    try {
+      return new Range(range, options).range || "*";
+    } catch (er) {
+      return null;
+    }
+  };
+  valid = validRange;
+  return valid;
+}
+export {
+  requireValid as __require
+};
+//# sourceMappingURL=valid.js.map

package/dist/node_modules/semver/ranges/valid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"valid.js","sources":["../../../../node_modules/semver/ranges/valid.js"],"sourcesContent":["'use strict'\n\nconst Range = require('../classes/range')\nconst validRange = (range, options) => {\n  try {\n    // Return '*' instead of '' so that truthiness works.\n    // This will throw if it's invalid anyway\n    return new Range(range, options).range || '*'\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = validRange\n"],"names":["require$$0"],"mappings":";;;;;;AAEA,QAAM,QAAQA,aAAA;AACd,QAAM,aAAa,CAAC,OAAO,YAAY;AACrC,QAAI;AAGF,aAAO,IAAI,MAAM,OAAO,OAAO,EAAE,SAAS;AAAA,IAC9C,SAAW,IAAI;AACX,aAAO;AAAA,IACX;AAAA,EACA;AACA,UAAiB;;;","x_google_ignoreList":[0]}

package/dist/node_modules/tinyglobby/dist/index.js

@@ -0,0 +1,332 @@
+import { __exports as dist } from "../../../_virtual/index7.js";
+import require$$1 from "fs";
+import path__default from "path";
+import require$$2 from "url";
+import { __require as requireDist$1 } from "../../fdir/dist/index.js";
+import { __require as requirePicomatch } from "../../picomatch/index.js";
+var hasRequiredDist;
+function requireDist() {
+  if (hasRequiredDist) return dist;
+  hasRequiredDist = 1;
+  var __create = Object.create;
+  var __defProp = Object.defineProperty;
+  var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+  var __getOwnPropNames = Object.getOwnPropertyNames;
+  var __getProtoOf = Object.getPrototypeOf;
+  var __hasOwnProp = Object.prototype.hasOwnProperty;
+  var __copyProps = (to, from, except, desc) => {
+    if (from && typeof from === "object" || typeof from === "function") for (var keys = __getOwnPropNames(from), i = 0, n = keys.length, key; i < n; i++) {
+      key = keys[i];
+      if (!__hasOwnProp.call(to, key) && key !== except) __defProp(to, key, {
+        get: ((k) => from[k]).bind(null, key),
+        enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable
+      });
+    }
+    return to;
+  };
+  var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(!mod || !mod.__esModule ? __defProp(target, "default", {
+    value: mod,
+    enumerable: true
+  }) : target, mod));
+  let fs = require$$1;
+  fs = __toESM(fs);
+  let path = path__default;
+  path = __toESM(path);
+  let url = require$$2;
+  url = __toESM(url);
+  let fdir = requireDist$1();
+  fdir = __toESM(fdir);
+  let picomatch = /* @__PURE__ */ requirePicomatch();
+  picomatch = __toESM(picomatch);
+  const isReadonlyArray = Array.isArray;
+  const isWin = process.platform === "win32";
+  const ONLY_PARENT_DIRECTORIES = /^(\/?\.\.)+$/;
+  function getPartialMatcher(patterns, options = {}) {
+    const patternsCount = patterns.length;
+    const patternsParts = Array(patternsCount);
+    const matchers = Array(patternsCount);
+    const globstarEnabled = !options.noglobstar;
+    for (let i = 0; i < patternsCount; i++) {
+      const parts = splitPattern(patterns[i]);
+      patternsParts[i] = parts;
+      const partsCount = parts.length;
+      const partMatchers = Array(partsCount);
+      for (let j = 0; j < partsCount; j++) partMatchers[j] = (0, picomatch.default)(parts[j], options);
+      matchers[i] = partMatchers;
+    }
+    return (input) => {
+      const inputParts = input.split("/");
+      if (inputParts[0] === ".." && ONLY_PARENT_DIRECTORIES.test(input)) return true;
+      for (let i = 0; i < patterns.length; i++) {
+        const patternParts = patternsParts[i];
+        const matcher = matchers[i];
+        const inputPatternCount = inputParts.length;
+        const minParts = Math.min(inputPatternCount, patternParts.length);
+        let j = 0;
+        while (j < minParts) {
+          const part = patternParts[j];
+          if (part.includes("/")) return true;
+          const match = matcher[j](inputParts[j]);
+          if (!match) break;
+          if (globstarEnabled && part === "**") return true;
+          j++;
+        }
+        if (j === inputPatternCount) return true;
+      }
+      return false;
+    };
+  }
+  const WIN32_ROOT_DIR = /^[A-Z]:\/$/i;
+  const isRoot = isWin ? (p) => WIN32_ROOT_DIR.test(p) : (p) => p === "/";
+  function buildFormat(cwd, root, absolute) {
+    if (cwd === root || root.startsWith(`${cwd}/`)) {
+      if (absolute) {
+        const start = isRoot(cwd) ? cwd.length : cwd.length + 1;
+        return (p, isDir) => p.slice(start, isDir ? -1 : void 0) || ".";
+      }
+      const prefix = root.slice(cwd.length + 1);
+      if (prefix) return (p, isDir) => {
+        if (p === ".") return prefix;
+        const result = `${prefix}/${p}`;
+        return isDir ? result.slice(0, -1) : result;
+      };
+      return (p, isDir) => isDir && p !== "." ? p.slice(0, -1) : p;
+    }
+    if (absolute) return (p) => path.posix.relative(cwd, p) || ".";
+    return (p) => path.posix.relative(cwd, `${root}/${p}`) || ".";
+  }
+  function buildRelative(cwd, root) {
+    if (root.startsWith(`${cwd}/`)) {
+      const prefix = root.slice(cwd.length + 1);
+      return (p) => `${prefix}/${p}`;
+    }
+    return (p) => {
+      const result = path.posix.relative(cwd, `${root}/${p}`);
+      if (p.endsWith("/") && result !== "") return `${result}/`;
+      return result || ".";
+    };
+  }
+  const splitPatternOptions = { parts: true };
+  function splitPattern(path$2) {
+    var _result$parts;
+    const result = picomatch.default.scan(path$2, splitPatternOptions);
+    return ((_result$parts = result.parts) === null || _result$parts === void 0 ? void 0 : _result$parts.length) ? result.parts : [path$2];
+  }
+  const ESCAPED_WIN32_BACKSLASHES = /\\(?![()[\]{}!+@])/g;
+  function convertPosixPathToPattern(path$2) {
+    return escapePosixPath(path$2);
+  }
+  function convertWin32PathToPattern(path$2) {
+    return escapeWin32Path(path$2).replace(ESCAPED_WIN32_BACKSLASHES, "/");
+  }
+  const convertPathToPattern = isWin ? convertWin32PathToPattern : convertPosixPathToPattern;
+  const POSIX_UNESCAPED_GLOB_SYMBOLS = /(?<!\\)([()[\]{}*?|]|^!|[!+@](?=\()|\\(?![()[\]{}!*+?@|]))/g;
+  const WIN32_UNESCAPED_GLOB_SYMBOLS = /(?<!\\)([()[\]{}]|^!|[!+@](?=\())/g;
+  const escapePosixPath = (path$2) => path$2.replace(POSIX_UNESCAPED_GLOB_SYMBOLS, "\\$&");
+  const escapeWin32Path = (path$2) => path$2.replace(WIN32_UNESCAPED_GLOB_SYMBOLS, "\\$&");
+  const escapePath = isWin ? escapeWin32Path : escapePosixPath;
+  function isDynamicPattern(pattern, options) {
+    if ((options === null || options === void 0 ? void 0 : options.caseSensitiveMatch) === false) return true;
+    const scan = picomatch.default.scan(pattern);
+    return scan.isGlob || scan.negated;
+  }
+  function log(...tasks) {
+    console.log(`[tinyglobby ${(/* @__PURE__ */ new Date()).toLocaleTimeString("es")}]`, ...tasks);
+  }
+  const PARENT_DIRECTORY = /^(\/?\.\.)+/;
+  const ESCAPING_BACKSLASHES = /\\(?=[()[\]{}!*+?@|])/g;
+  const BACKSLASHES = /\\/g;
+  function normalizePattern(pattern, expandDirectories, cwd, props, isIgnore) {
+    let result = pattern;
+    if (pattern.endsWith("/")) result = pattern.slice(0, -1);
+    if (!result.endsWith("*") && expandDirectories) result += "/**";
+    const escapedCwd = escapePath(cwd);
+    if (path.default.isAbsolute(result.replace(ESCAPING_BACKSLASHES, ""))) result = path.posix.relative(escapedCwd, result);
+    else result = path.posix.normalize(result);
+    const parentDirectoryMatch = PARENT_DIRECTORY.exec(result);
+    const parts = splitPattern(result);
+    if (parentDirectoryMatch === null || parentDirectoryMatch === void 0 ? void 0 : parentDirectoryMatch[0]) {
+      const n = (parentDirectoryMatch[0].length + 1) / 3;
+      let i = 0;
+      const cwdParts = escapedCwd.split("/");
+      while (i < n && parts[i + n] === cwdParts[cwdParts.length + i - n]) {
+        result = result.slice(0, (n - i - 1) * 3) + result.slice((n - i) * 3 + parts[i + n].length + 1) || ".";
+        i++;
+      }
+      const potentialRoot = path.posix.join(cwd, parentDirectoryMatch[0].slice(i * 3));
+      if (!potentialRoot.startsWith(".") && props.root.length > potentialRoot.length) {
+        props.root = potentialRoot;
+        props.depthOffset = -n + i;
+      }
+    }
+    if (!isIgnore && props.depthOffset >= 0) {
+      var _props$commonPath;
+      (_props$commonPath = props.commonPath) !== null && _props$commonPath !== void 0 || (props.commonPath = parts);
+      const newCommonPath = [];
+      const length = Math.min(props.commonPath.length, parts.length);
+      for (let i = 0; i < length; i++) {
+        const part = parts[i];
+        if (part === "**" && !parts[i + 1]) {
+          newCommonPath.pop();
+          break;
+        }
+        if (part !== props.commonPath[i] || isDynamicPattern(part) || i === parts.length - 1) break;
+        newCommonPath.push(part);
+      }
+      props.depthOffset = newCommonPath.length;
+      props.commonPath = newCommonPath;
+      props.root = newCommonPath.length > 0 ? path.posix.join(cwd, ...newCommonPath) : cwd;
+    }
+    return result;
+  }
+  function processPatterns({ patterns = ["**/*"], ignore = [], expandDirectories = true }, cwd, props) {
+    if (typeof patterns === "string") patterns = [patterns];
+    if (typeof ignore === "string") ignore = [ignore];
+    const matchPatterns = [];
+    const ignorePatterns = [];
+    for (const pattern of ignore) {
+      if (!pattern) continue;
+      if (pattern[0] !== "!" || pattern[1] === "(") ignorePatterns.push(normalizePattern(pattern, expandDirectories, cwd, props, true));
+    }
+    for (const pattern of patterns) {
+      if (!pattern) continue;
+      if (pattern[0] !== "!" || pattern[1] === "(") matchPatterns.push(normalizePattern(pattern, expandDirectories, cwd, props, false));
+      else if (pattern[1] !== "!" || pattern[2] === "(") ignorePatterns.push(normalizePattern(pattern.slice(1), expandDirectories, cwd, props, true));
+    }
+    return {
+      match: matchPatterns,
+      ignore: ignorePatterns
+    };
+  }
+  function formatPaths(paths, relative) {
+    for (let i = paths.length - 1; i >= 0; i--) {
+      const path$2 = paths[i];
+      paths[i] = relative(path$2);
+    }
+    return paths;
+  }
+  function normalizeCwd(cwd) {
+    if (!cwd) return process.cwd().replace(BACKSLASHES, "/");
+    if (cwd instanceof URL) return (0, url.fileURLToPath)(cwd).replace(BACKSLASHES, "/");
+    return path.default.resolve(cwd).replace(BACKSLASHES, "/");
+  }
+  function getCrawler(patterns, inputOptions = {}) {
+    const options = process.env.TINYGLOBBY_DEBUG ? {
+      ...inputOptions,
+      debug: true
+    } : inputOptions;
+    const cwd = normalizeCwd(options.cwd);
+    if (options.debug) log("globbing with:", {
+      patterns,
+      options,
+      cwd
+    });
+    if (Array.isArray(patterns) && patterns.length === 0) return [{
+      sync: () => [],
+      withPromise: async () => []
+    }, false];
+    const props = {
+      root: cwd,
+      commonPath: null,
+      depthOffset: 0
+    };
+    const processed = processPatterns({
+      ...options,
+      patterns
+    }, cwd, props);
+    if (options.debug) log("internal processing patterns:", processed);
+    const matchOptions = {
+      dot: options.dot,
+      nobrace: options.braceExpansion === false,
+      nocase: options.caseSensitiveMatch === false,
+      noextglob: options.extglob === false,
+      noglobstar: options.globstar === false,
+      posix: true
+    };
+    const matcher = (0, picomatch.default)(processed.match, {
+      ...matchOptions,
+      ignore: processed.ignore
+    });
+    const ignore = (0, picomatch.default)(processed.ignore, matchOptions);
+    const partialMatcher = getPartialMatcher(processed.match, matchOptions);
+    const format = buildFormat(cwd, props.root, options.absolute);
+    const formatExclude = options.absolute ? format : buildFormat(cwd, props.root, true);
+    const fdirOptions = {
+      filters: [options.debug ? (p, isDirectory) => {
+        const path$2 = format(p, isDirectory);
+        const matches = matcher(path$2);
+        if (matches) log(`matched ${path$2}`);
+        return matches;
+      } : (p, isDirectory) => matcher(format(p, isDirectory))],
+      exclude: options.debug ? (_, p) => {
+        const relativePath = formatExclude(p, true);
+        const skipped = relativePath !== "." && !partialMatcher(relativePath) || ignore(relativePath);
+        if (skipped) log(`skipped ${p}`);
+        else log(`crawling ${p}`);
+        return skipped;
+      } : (_, p) => {
+        const relativePath = formatExclude(p, true);
+        return relativePath !== "." && !partialMatcher(relativePath) || ignore(relativePath);
+      },
+      fs: options.fs ? {
+        readdir: options.fs.readdir || fs.default.readdir,
+        readdirSync: options.fs.readdirSync || fs.default.readdirSync,
+        realpath: options.fs.realpath || fs.default.realpath,
+        realpathSync: options.fs.realpathSync || fs.default.realpathSync,
+        stat: options.fs.stat || fs.default.stat,
+        statSync: options.fs.statSync || fs.default.statSync
+      } : void 0,
+      pathSeparator: "/",
+      relativePaths: true,
+      resolveSymlinks: true,
+      signal: options.signal
+    };
+    if (options.deep !== void 0) fdirOptions.maxDepth = Math.round(options.deep - props.depthOffset);
+    if (options.absolute) {
+      fdirOptions.relativePaths = false;
+      fdirOptions.resolvePaths = true;
+      fdirOptions.includeBasePath = true;
+    }
+    if (options.followSymbolicLinks === false) {
+      fdirOptions.resolveSymlinks = false;
+      fdirOptions.excludeSymlinks = true;
+    }
+    if (options.onlyDirectories) {
+      fdirOptions.excludeFiles = true;
+      fdirOptions.includeDirs = true;
+    } else if (options.onlyFiles === false) fdirOptions.includeDirs = true;
+    props.root = props.root.replace(BACKSLASHES, "");
+    const root = props.root;
+    if (options.debug) log("internal properties:", props);
+    const relative = cwd !== root && !options.absolute && buildRelative(cwd, props.root);
+    return [new fdir.fdir(fdirOptions).crawl(root), relative];
+  }
+  async function glob(patternsOrOptions, options) {
+    if (patternsOrOptions && (options === null || options === void 0 ? void 0 : options.patterns)) throw new Error("Cannot pass patterns as both an argument and an option");
+    const isModern = isReadonlyArray(patternsOrOptions) || typeof patternsOrOptions === "string";
+    const opts = isModern ? options : patternsOrOptions;
+    const patterns = isModern ? patternsOrOptions : patternsOrOptions.patterns;
+    const [crawler, relative] = getCrawler(patterns, opts);
+    if (!relative) return crawler.withPromise();
+    return formatPaths(await crawler.withPromise(), relative);
+  }
+  function globSync(patternsOrOptions, options) {
+    if (patternsOrOptions && (options === null || options === void 0 ? void 0 : options.patterns)) throw new Error("Cannot pass patterns as both an argument and an option");
+    const isModern = isReadonlyArray(patternsOrOptions) || typeof patternsOrOptions === "string";
+    const opts = isModern ? options : patternsOrOptions;
+    const patterns = isModern ? patternsOrOptions : patternsOrOptions.patterns;
+    const [crawler, relative] = getCrawler(patterns, opts);
+    if (!relative) return crawler.sync();
+    return formatPaths(crawler.sync(), relative);
+  }
+  dist.convertPathToPattern = convertPathToPattern;
+  dist.escapePath = escapePath;
+  dist.glob = glob;
+  dist.globSync = globSync;
+  dist.isDynamicPattern = isDynamicPattern;
+  return dist;
+}
+export {
+  requireDist as __require
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/tinyglobby/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../node_modules/tinyglobby/dist/index.cjs"],"sourcesContent":["//#region rolldown:runtime\nvar __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __copyProps = (to, from, except, desc) => {\n\tif (from && typeof from === \"object\" || typeof from === \"function\") for (var keys = __getOwnPropNames(from), i = 0, n = keys.length, key; i < n; i++) {\n\t\tkey = keys[i];\n\t\tif (!__hasOwnProp.call(to, key) && key !== except) __defProp(to, key, {\n\t\t\tget: ((k) => from[k]).bind(null, key),\n\t\t\tenumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable\n\t\t});\n\t}\n\treturn to;\n};\nvar __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(isNodeMode || !mod || !mod.__esModule ? __defProp(target, \"default\", {\n\tvalue: mod,\n\tenumerable: true\n}) : target, mod));\n\n//#endregion\nlet fs = require(\"fs\");\nfs = __toESM(fs);\nlet path = require(\"path\");\npath = __toESM(path);\nlet url = require(\"url\");\nurl = __toESM(url);\nlet fdir = require(\"fdir\");\nfdir = __toESM(fdir);\nlet picomatch = require(\"picomatch\");\npicomatch = __toESM(picomatch);\n\n//#region src/utils.ts\nconst isReadonlyArray = Array.isArray;\nconst isWin = process.platform === \"win32\";\nconst ONLY_PARENT_DIRECTORIES = /^(\\/?\\.\\.)+$/;\nfunction getPartialMatcher(patterns, options = {}) {\n\tconst patternsCount = patterns.length;\n\tconst patternsParts = Array(patternsCount);\n\tconst matchers = Array(patternsCount);\n\tconst globstarEnabled = !options.noglobstar;\n\tfor (let i = 0; i < patternsCount; i++) {\n\t\tconst parts = splitPattern(patterns[i]);\n\t\tpatternsParts[i] = parts;\n\t\tconst partsCount = parts.length;\n\t\tconst partMatchers = Array(partsCount);\n\t\tfor (let j = 0; j < partsCount; j++) partMatchers[j] = (0, picomatch.default)(parts[j], options);\n\t\tmatchers[i] = partMatchers;\n\t}\n\treturn (input) => {\n\t\tconst inputParts = input.split(\"/\");\n\t\tif (inputParts[0] === \"..\" && ONLY_PARENT_DIRECTORIES.test(input)) return true;\n\t\tfor (let i = 0; i < patterns.length; i++) {\n\t\t\tconst patternParts = patternsParts[i];\n\t\t\tconst matcher = matchers[i];\n\t\t\tconst inputPatternCount = inputParts.length;\n\t\t\tconst minParts = Math.min(inputPatternCount, patternParts.length);\n\t\t\tlet j = 0;\n\t\t\twhile (j < minParts) {\n\t\t\t\tconst part = patternParts[j];\n\t\t\t\tif (part.includes(\"/\")) return true;\n\t\t\t\tconst match = matcher[j](inputParts[j]);\n\t\t\t\tif (!match) break;\n\t\t\t\tif (globstarEnabled && part === \"**\") return true;\n\t\t\t\tj++;\n\t\t\t}\n\t\t\tif (j === inputPatternCount) return true;\n\t\t}\n\t\treturn false;\n\t};\n}\n/* node:coverage ignore next 2 */\nconst WIN32_ROOT_DIR = /^[A-Z]:\\/$/i;\nconst isRoot = isWin ? (p) => WIN32_ROOT_DIR.test(p) : (p) => p === \"/\";\nfunction buildFormat(cwd, root, absolute) {\n\tif (cwd === root || root.startsWith(`${cwd}/`)) {\n\t\tif (absolute) {\n\t\t\tconst start = isRoot(cwd) ? cwd.length : cwd.length + 1;\n\t\t\treturn (p, isDir) => p.slice(start, isDir ? -1 : void 0) || \".\";\n\t\t}\n\t\tconst prefix = root.slice(cwd.length + 1);\n\t\tif (prefix) return (p, isDir) => {\n\t\t\tif (p === \".\") return prefix;\n\t\t\tconst result = `${prefix}/${p}`;\n\t\t\treturn isDir ? result.slice(0, -1) : result;\n\t\t};\n\t\treturn (p, isDir) => isDir && p !== \".\" ? p.slice(0, -1) : p;\n\t}\n\tif (absolute) return (p) => path.posix.relative(cwd, p) || \".\";\n\treturn (p) => path.posix.relative(cwd, `${root}/${p}`) || \".\";\n}\nfunction buildRelative(cwd, root) {\n\tif (root.startsWith(`${cwd}/`)) {\n\t\tconst prefix = root.slice(cwd.length + 1);\n\t\treturn (p) => `${prefix}/${p}`;\n\t}\n\treturn (p) => {\n\t\tconst result = path.posix.relative(cwd, `${root}/${p}`);\n\t\tif (p.endsWith(\"/\") && result !== \"\") return `${result}/`;\n\t\treturn result || \".\";\n\t};\n}\nconst splitPatternOptions = { parts: true };\nfunction splitPattern(path$2) {\n\tvar _result$parts;\n\tconst result = picomatch.default.scan(path$2, splitPatternOptions);\n\treturn ((_result$parts = result.parts) === null || _result$parts === void 0 ? void 0 : _result$parts.length) ? result.parts : [path$2];\n}\nconst ESCAPED_WIN32_BACKSLASHES = /\\\\(?![()[\\]{}!+@])/g;\nfunction convertPosixPathToPattern(path$2) {\n\treturn escapePosixPath(path$2);\n}\nfunction convertWin32PathToPattern(path$2) {\n\treturn escapeWin32Path(path$2).replace(ESCAPED_WIN32_BACKSLASHES, \"/\");\n}\n/**\n* Converts a path to a pattern depending on the platform.\n* Identical to {@link escapePath} on POSIX systems.\n* @see {@link https://superchupu.dev/tinyglobby/documentation#convertPathToPattern}\n*/\n/* node:coverage ignore next 3 */\nconst convertPathToPattern = isWin ? convertWin32PathToPattern : convertPosixPathToPattern;\nconst POSIX_UNESCAPED_GLOB_SYMBOLS = /(?<!\\\\)([()[\\]{}*?|]|^!|[!+@](?=\\()|\\\\(?![()[\\]{}!*+?@|]))/g;\nconst WIN32_UNESCAPED_GLOB_SYMBOLS = /(?<!\\\\)([()[\\]{}]|^!|[!+@](?=\\())/g;\nconst escapePosixPath = (path$2) => path$2.replace(POSIX_UNESCAPED_GLOB_SYMBOLS, \"\\\\$&\");\nconst escapeWin32Path = (path$2) => path$2.replace(WIN32_UNESCAPED_GLOB_SYMBOLS, \"\\\\$&\");\n/**\n* Escapes a path's special characters depending on the platform.\n* @see {@link https://superchupu.dev/tinyglobby/documentation#escapePath}\n*/\n/* node:coverage ignore next */\nconst escapePath = isWin ? escapeWin32Path : escapePosixPath;\n/**\n* Checks if a pattern has dynamic parts.\n*\n* Has a few minor differences with [`fast-glob`](https://github.com/mrmlnc/fast-glob) for better accuracy:\n*\n* - Doesn't necessarily return `false` on patterns that include `\\`.\n* - Returns `true` if the pattern includes parentheses, regardless of them representing one single pattern or not.\n* - Returns `true` for unfinished glob extensions i.e. `(h`, `+(h`.\n* - Returns `true` for unfinished brace expansions as long as they include `,` or `..`.\n*\n* @see {@link https://superchupu.dev/tinyglobby/documentation#isDynamicPattern}\n*/\nfunction isDynamicPattern(pattern, options) {\n\tif ((options === null || options === void 0 ? void 0 : options.caseSensitiveMatch) === false) return true;\n\tconst scan = picomatch.default.scan(pattern);\n\treturn scan.isGlob || scan.negated;\n}\nfunction log(...tasks) {\n\tconsole.log(`[tinyglobby ${(/* @__PURE__ */ new Date()).toLocaleTimeString(\"es\")}]`, ...tasks);\n}\n\n//#endregion\n//#region src/index.ts\nconst PARENT_DIRECTORY = /^(\\/?\\.\\.)+/;\nconst ESCAPING_BACKSLASHES = /\\\\(?=[()[\\]{}!*+?@|])/g;\nconst BACKSLASHES = /\\\\/g;\nfunction normalizePattern(pattern, expandDirectories, cwd, props, isIgnore) {\n\tlet result = pattern;\n\tif (pattern.endsWith(\"/\")) result = pattern.slice(0, -1);\n\tif (!result.endsWith(\"*\") && expandDirectories) result += \"/**\";\n\tconst escapedCwd = escapePath(cwd);\n\tif (path.default.isAbsolute(result.replace(ESCAPING_BACKSLASHES, \"\"))) result = path.posix.relative(escapedCwd, result);\n\telse result = path.posix.normalize(result);\n\tconst parentDirectoryMatch = PARENT_DIRECTORY.exec(result);\n\tconst parts = splitPattern(result);\n\tif (parentDirectoryMatch === null || parentDirectoryMatch === void 0 ? void 0 : parentDirectoryMatch[0]) {\n\t\tconst n = (parentDirectoryMatch[0].length + 1) / 3;\n\t\tlet i = 0;\n\t\tconst cwdParts = escapedCwd.split(\"/\");\n\t\twhile (i < n && parts[i + n] === cwdParts[cwdParts.length + i - n]) {\n\t\t\tresult = result.slice(0, (n - i - 1) * 3) + result.slice((n - i) * 3 + parts[i + n].length + 1) || \".\";\n\t\t\ti++;\n\t\t}\n\t\tconst potentialRoot = path.posix.join(cwd, parentDirectoryMatch[0].slice(i * 3));\n\t\tif (!potentialRoot.startsWith(\".\") && props.root.length > potentialRoot.length) {\n\t\t\tprops.root = potentialRoot;\n\t\t\tprops.depthOffset = -n + i;\n\t\t}\n\t}\n\tif (!isIgnore && props.depthOffset >= 0) {\n\t\tvar _props$commonPath;\n\t\t(_props$commonPath = props.commonPath) !== null && _props$commonPath !== void 0 || (props.commonPath = parts);\n\t\tconst newCommonPath = [];\n\t\tconst length = Math.min(props.commonPath.length, parts.length);\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tconst part = parts[i];\n\t\t\tif (part === \"**\" && !parts[i + 1]) {\n\t\t\t\tnewCommonPath.pop();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (part !== props.commonPath[i] || isDynamicPattern(part) || i === parts.length - 1) break;\n\t\t\tnewCommonPath.push(part);\n\t\t}\n\t\tprops.depthOffset = newCommonPath.length;\n\t\tprops.commonPath = newCommonPath;\n\t\tprops.root = newCommonPath.length > 0 ? path.posix.join(cwd, ...newCommonPath) : cwd;\n\t}\n\treturn result;\n}\nfunction processPatterns({ patterns = [\"**/*\"], ignore = [], expandDirectories = true }, cwd, props) {\n\tif (typeof patterns === \"string\") patterns = [patterns];\n\tif (typeof ignore === \"string\") ignore = [ignore];\n\tconst matchPatterns = [];\n\tconst ignorePatterns = [];\n\tfor (const pattern of ignore) {\n\t\tif (!pattern) continue;\n\t\tif (pattern[0] !== \"!\" || pattern[1] === \"(\") ignorePatterns.push(normalizePattern(pattern, expandDirectories, cwd, props, true));\n\t}\n\tfor (const pattern of patterns) {\n\t\tif (!pattern) continue;\n\t\tif (pattern[0] !== \"!\" || pattern[1] === \"(\") matchPatterns.push(normalizePattern(pattern, expandDirectories, cwd, props, false));\n\t\telse if (pattern[1] !== \"!\" || pattern[2] === \"(\") ignorePatterns.push(normalizePattern(pattern.slice(1), expandDirectories, cwd, props, true));\n\t}\n\treturn {\n\t\tmatch: matchPatterns,\n\t\tignore: ignorePatterns\n\t};\n}\nfunction formatPaths(paths, relative) {\n\tfor (let i = paths.length - 1; i >= 0; i--) {\n\t\tconst path$2 = paths[i];\n\t\tpaths[i] = relative(path$2);\n\t}\n\treturn paths;\n}\nfunction normalizeCwd(cwd) {\n\tif (!cwd) return process.cwd().replace(BACKSLASHES, \"/\");\n\tif (cwd instanceof URL) return (0, url.fileURLToPath)(cwd).replace(BACKSLASHES, \"/\");\n\treturn path.default.resolve(cwd).replace(BACKSLASHES, \"/\");\n}\nfunction getCrawler(patterns, inputOptions = {}) {\n\tconst options = process.env.TINYGLOBBY_DEBUG ? {\n\t\t...inputOptions,\n\t\tdebug: true\n\t} : inputOptions;\n\tconst cwd = normalizeCwd(options.cwd);\n\tif (options.debug) log(\"globbing with:\", {\n\t\tpatterns,\n\t\toptions,\n\t\tcwd\n\t});\n\tif (Array.isArray(patterns) && patterns.length === 0) return [{\n\t\tsync: () => [],\n\t\twithPromise: async () => []\n\t}, false];\n\tconst props = {\n\t\troot: cwd,\n\t\tcommonPath: null,\n\t\tdepthOffset: 0\n\t};\n\tconst processed = processPatterns({\n\t\t...options,\n\t\tpatterns\n\t}, cwd, props);\n\tif (options.debug) log(\"internal processing patterns:\", processed);\n\tconst matchOptions = {\n\t\tdot: options.dot,\n\t\tnobrace: options.braceExpansion === false,\n\t\tnocase: options.caseSensitiveMatch === false,\n\t\tnoextglob: options.extglob === false,\n\t\tnoglobstar: options.globstar === false,\n\t\tposix: true\n\t};\n\tconst matcher = (0, picomatch.default)(processed.match, {\n\t\t...matchOptions,\n\t\tignore: processed.ignore\n\t});\n\tconst ignore = (0, picomatch.default)(processed.ignore, matchOptions);\n\tconst partialMatcher = getPartialMatcher(processed.match, matchOptions);\n\tconst format = buildFormat(cwd, props.root, options.absolute);\n\tconst formatExclude = options.absolute ? format : buildFormat(cwd, props.root, true);\n\tconst fdirOptions = {\n\t\tfilters: [options.debug ? (p, isDirectory) => {\n\t\t\tconst path$2 = format(p, isDirectory);\n\t\t\tconst matches = matcher(path$2);\n\t\t\tif (matches) log(`matched ${path$2}`);\n\t\t\treturn matches;\n\t\t} : (p, isDirectory) => matcher(format(p, isDirectory))],\n\t\texclude: options.debug ? (_, p) => {\n\t\t\tconst relativePath = formatExclude(p, true);\n\t\t\tconst skipped = relativePath !== \".\" && !partialMatcher(relativePath) || ignore(relativePath);\n\t\t\tif (skipped) log(`skipped ${p}`);\n\t\t\telse log(`crawling ${p}`);\n\t\t\treturn skipped;\n\t\t} : (_, p) => {\n\t\t\tconst relativePath = formatExclude(p, true);\n\t\t\treturn relativePath !== \".\" && !partialMatcher(relativePath) || ignore(relativePath);\n\t\t},\n\t\tfs: options.fs ? {\n\t\t\treaddir: options.fs.readdir || fs.default.readdir,\n\t\t\treaddirSync: options.fs.readdirSync || fs.default.readdirSync,\n\t\t\trealpath: options.fs.realpath || fs.default.realpath,\n\t\t\trealpathSync: options.fs.realpathSync || fs.default.realpathSync,\n\t\t\tstat: options.fs.stat || fs.default.stat,\n\t\t\tstatSync: options.fs.statSync || fs.default.statSync\n\t\t} : void 0,\n\t\tpathSeparator: \"/\",\n\t\trelativePaths: true,\n\t\tresolveSymlinks: true,\n\t\tsignal: options.signal\n\t};\n\tif (options.deep !== void 0) fdirOptions.maxDepth = Math.round(options.deep - props.depthOffset);\n\tif (options.absolute) {\n\t\tfdirOptions.relativePaths = false;\n\t\tfdirOptions.resolvePaths = true;\n\t\tfdirOptions.includeBasePath = true;\n\t}\n\tif (options.followSymbolicLinks === false) {\n\t\tfdirOptions.resolveSymlinks = false;\n\t\tfdirOptions.excludeSymlinks = true;\n\t}\n\tif (options.onlyDirectories) {\n\t\tfdirOptions.excludeFiles = true;\n\t\tfdirOptions.includeDirs = true;\n\t} else if (options.onlyFiles === false) fdirOptions.includeDirs = true;\n\tprops.root = props.root.replace(BACKSLASHES, \"\");\n\tconst root = props.root;\n\tif (options.debug) log(\"internal properties:\", props);\n\tconst relative = cwd !== root && !options.absolute && buildRelative(cwd, props.root);\n\treturn [new fdir.fdir(fdirOptions).crawl(root), relative];\n}\nasync function glob(patternsOrOptions, options) {\n\tif (patternsOrOptions && (options === null || options === void 0 ? void 0 : options.patterns)) throw new Error(\"Cannot pass patterns as both an argument and an option\");\n\tconst isModern = isReadonlyArray(patternsOrOptions) || typeof patternsOrOptions === \"string\";\n\tconst opts = isModern ? options : patternsOrOptions;\n\tconst patterns = isModern ? patternsOrOptions : patternsOrOptions.patterns;\n\tconst [crawler, relative] = getCrawler(patterns, opts);\n\tif (!relative) return crawler.withPromise();\n\treturn formatPaths(await crawler.withPromise(), relative);\n}\nfunction globSync(patternsOrOptions, options) {\n\tif (patternsOrOptions && (options === null || options === void 0 ? void 0 : options.patterns)) throw new Error(\"Cannot pass patterns as both an argument and an option\");\n\tconst isModern = isReadonlyArray(patternsOrOptions) || typeof patternsOrOptions === \"string\";\n\tconst opts = isModern ? options : patternsOrOptions;\n\tconst patterns = isModern ? patternsOrOptions : patternsOrOptions.patterns;\n\tconst [crawler, relative] = getCrawler(patterns, opts);\n\tif (!relative) return crawler.sync();\n\treturn formatPaths(crawler.sync(), relative);\n}\n\n//#endregion\nexports.convertPathToPattern = convertPathToPattern;\nexports.escapePath = escapePath;\nexports.glob = glob;\nexports.globSync = globSync;\nexports.isDynamicPattern = isDynamicPattern;"],"names":["require$$0","require$$1","require$$3","require$$4"],"mappings":";;;;;;;;;;AACA,MAAI,WAAW,OAAO;AACtB,MAAI,YAAY,OAAO;AACvB,MAAI,mBAAmB,OAAO;AAC9B,MAAI,oBAAoB,OAAO;AAC/B,MAAI,eAAe,OAAO;AAC1B,MAAI,eAAe,OAAO,UAAU;AACpC,MAAI,cAAc,CAAC,IAAI,MAAM,QAAQ,SAAS;AAC7C,QAAI,QAAQ,OAAO,SAAS,YAAY,OAAO,SAAS,WAAY,UAAS,OAAO,kBAAkB,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,IAAI,GAAG,KAAK;AACrJ,YAAM,KAAK,CAAC;AACZ,UAAI,CAAC,aAAa,KAAK,IAAI,GAAG,KAAK,QAAQ,OAAQ,WAAU,IAAI,KAAK;AAAA,QACrE,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,KAAK,MAAM,GAAG;AAAA,QACpC,YAAY,EAAE,OAAO,iBAAiB,MAAM,GAAG,MAAM,KAAK;AAAA,MAC7D,CAAG;AAAA,IACH;AACC,WAAO;AAAA,EACR;AACA,MAAI,UAAU,CAAC,KAAK,YAAY,YAAY,SAAS,OAAO,OAAO,SAAS,aAAa,GAAG,CAAC,IAAI,CAAA,GAAI,YAA0B,CAAC,OAAO,CAAC,IAAI,aAAa,UAAU,QAAQ,WAAW;AAAA,IACrL,OAAO;AAAA,IACP,YAAY;AAAA,EACb,CAAC,IAAI,QAAQ,GAAG;AAGhB,MAAI,KAAKA;AACT,OAAK,QAAQ,EAAE;AACf,MAAI,OAAOC;AACX,SAAO,QAAQ,IAAI;AACnB,MAAI,MAAM;AACV,QAAM,QAAQ,GAAG;AACjB,MAAI,OAAOC,cAAA;AACX,SAAO,QAAQ,IAAI;AACnB,MAAI,YAAYC,iCAAA;AAChB,cAAY,QAAQ,SAAS;AAG7B,QAAM,kBAAkB,MAAM;AAC9B,QAAM,QAAQ,QAAQ,aAAa;AACnC,QAAM,0BAA0B;AAChC,WAAS,kBAAkB,UAAU,UAAU,IAAI;AAClD,UAAM,gBAAgB,SAAS;AAC/B,UAAM,gBAAgB,MAAM,aAAa;AACzC,UAAM,WAAW,MAAM,aAAa;AACpC,UAAM,kBAAkB,CAAC,QAAQ;AACjC,aAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACvC,YAAM,QAAQ,aAAa,SAAS,CAAC,CAAC;AACtC,oBAAc,CAAC,IAAI;AACnB,YAAM,aAAa,MAAM;AACzB,YAAM,eAAe,MAAM,UAAU;AACrC,eAAS,IAAI,GAAG,IAAI,YAAY,IAAK,cAAa,CAAC,KAAI,GAAI,UAAU,SAAS,MAAM,CAAC,GAAG,OAAO;AAC/F,eAAS,CAAC,IAAI;AAAA,IAChB;AACC,WAAO,CAAC,UAAU;AACjB,YAAM,aAAa,MAAM,MAAM,GAAG;AAClC,UAAI,WAAW,CAAC,MAAM,QAAQ,wBAAwB,KAAK,KAAK,EAAG,QAAO;AAC1E,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACzC,cAAM,eAAe,cAAc,CAAC;AACpC,cAAM,UAAU,SAAS,CAAC;AAC1B,cAAM,oBAAoB,WAAW;AACrC,cAAM,WAAW,KAAK,IAAI,mBAAmB,aAAa,MAAM;AAChE,YAAI,IAAI;AACR,eAAO,IAAI,UAAU;AACpB,gBAAM,OAAO,aAAa,CAAC;AAC3B,cAAI,KAAK,SAAS,GAAG,EAAG,QAAO;AAC/B,gBAAM,QAAQ,QAAQ,CAAC,EAAE,WAAW,CAAC,CAAC;AACtC,cAAI,CAAC,MAAO;AACZ,cAAI,mBAAmB,SAAS,KAAM,QAAO;AAC7C;AAAA,QACJ;AACG,YAAI,MAAM,kBAAmB,QAAO;AAAA,MACvC;AACE,aAAO;AAAA,IACT;AAAA,EACA;AAEA,QAAM,iBAAiB;AACvB,QAAM,SAAS,QAAQ,CAAC,MAAM,eAAe,KAAK,CAAC,IAAI,CAAC,MAAM,MAAM;AACpE,WAAS,YAAY,KAAK,MAAM,UAAU;AACzC,QAAI,QAAQ,QAAQ,KAAK,WAAW,GAAG,GAAG,GAAG,GAAG;AAC/C,UAAI,UAAU;AACb,cAAM,QAAQ,OAAO,GAAG,IAAI,IAAI,SAAS,IAAI,SAAS;AACtD,eAAO,CAAC,GAAG,UAAU,EAAE,MAAM,OAAO,QAAQ,KAAK,MAAM,KAAK;AAAA,MAC/D;AACE,YAAM,SAAS,KAAK,MAAM,IAAI,SAAS,CAAC;AACxC,UAAI,OAAQ,QAAO,CAAC,GAAG,UAAU;AAChC,YAAI,MAAM,IAAK,QAAO;AACtB,cAAM,SAAS,GAAG,MAAM,IAAI,CAAC;AAC7B,eAAO,QAAQ,OAAO,MAAM,GAAG,EAAE,IAAI;AAAA,MACxC;AACE,aAAO,CAAC,GAAG,UAAU,SAAS,MAAM,MAAM,EAAE,MAAM,GAAG,EAAE,IAAI;AAAA,IAC7D;AACC,QAAI,SAAU,QAAO,CAAC,MAAM,KAAK,MAAM,SAAS,KAAK,CAAC,KAAK;AAC3D,WAAO,CAAC,MAAM,KAAK,MAAM,SAAS,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK;AAAA,EAC3D;AACA,WAAS,cAAc,KAAK,MAAM;AACjC,QAAI,KAAK,WAAW,GAAG,GAAG,GAAG,GAAG;AAC/B,YAAM,SAAS,KAAK,MAAM,IAAI,SAAS,CAAC;AACxC,aAAO,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;AAAA,IAC9B;AACC,WAAO,CAAC,MAAM;AACb,YAAM,SAAS,KAAK,MAAM,SAAS,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE;AACtD,UAAI,EAAE,SAAS,GAAG,KAAK,WAAW,GAAI,QAAO,GAAG,MAAM;AACtD,aAAO,UAAU;AAAA,IACnB;AAAA,EACA;AACA,QAAM,sBAAsB,EAAE,OAAO,KAAI;AACzC,WAAS,aAAa,QAAQ;AAC7B,QAAI;AACJ,UAAM,SAAS,UAAU,QAAQ,KAAK,QAAQ,mBAAmB;AACjE,aAAS,gBAAgB,OAAO,WAAW,QAAQ,kBAAkB,SAAS,SAAS,cAAc,UAAU,OAAO,QAAQ,CAAC,MAAM;AAAA,EACtI;AACA,QAAM,4BAA4B;AAClC,WAAS,0BAA0B,QAAQ;AAC1C,WAAO,gBAAgB,MAAM;AAAA,EAC9B;AACA,WAAS,0BAA0B,QAAQ;AAC1C,WAAO,gBAAgB,MAAM,EAAE,QAAQ,2BAA2B,GAAG;AAAA,EACtE;AAOA,QAAM,uBAAuB,QAAQ,4BAA4B;AACjE,QAAM,+BAA+B;AACrC,QAAM,+BAA+B;AACrC,QAAM,kBAAkB,CAAC,WAAW,OAAO,QAAQ,8BAA8B,MAAM;AACvF,QAAM,kBAAkB,CAAC,WAAW,OAAO,QAAQ,8BAA8B,MAAM;AAMvF,QAAM,aAAa,QAAQ,kBAAkB;AAa7C,WAAS,iBAAiB,SAAS,SAAS;AAC3C,SAAK,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,wBAAwB,MAAO,QAAO;AACrG,UAAM,OAAO,UAAU,QAAQ,KAAK,OAAO;AAC3C,WAAO,KAAK,UAAU,KAAK;AAAA,EAC5B;AACA,WAAS,OAAO,OAAO;AACtB,YAAQ,IAAI,gBAAgC,oBAAI,KAAI,GAAI,mBAAmB,IAAI,CAAC,KAAK,GAAG,KAAK;AAAA,EAC9F;AAIA,QAAM,mBAAmB;AACzB,QAAM,uBAAuB;AAC7B,QAAM,cAAc;AACpB,WAAS,iBAAiB,SAAS,mBAAmB,KAAK,OAAO,UAAU;AAC3E,QAAI,SAAS;AACb,QAAI,QAAQ,SAAS,GAAG,EAAG,UAAS,QAAQ,MAAM,GAAG,EAAE;AACvD,QAAI,CAAC,OAAO,SAAS,GAAG,KAAK,kBAAmB,WAAU;AAC1D,UAAM,aAAa,WAAW,GAAG;AACjC,QAAI,KAAK,QAAQ,WAAW,OAAO,QAAQ,sBAAsB,EAAE,CAAC,EAAG,UAAS,KAAK,MAAM,SAAS,YAAY,MAAM;AAAA,QACjH,UAAS,KAAK,MAAM,UAAU,MAAM;AACzC,UAAM,uBAAuB,iBAAiB,KAAK,MAAM;AACzD,UAAM,QAAQ,aAAa,MAAM;AACjC,QAAI,yBAAyB,QAAQ,yBAAyB,SAAS,SAAS,qBAAqB,CAAC,GAAG;AACxG,YAAM,KAAK,qBAAqB,CAAC,EAAE,SAAS,KAAK;AACjD,UAAI,IAAI;AACR,YAAM,WAAW,WAAW,MAAM,GAAG;AACrC,aAAO,IAAI,KAAK,MAAM,IAAI,CAAC,MAAM,SAAS,SAAS,SAAS,IAAI,CAAC,GAAG;AACnE,iBAAS,OAAO,MAAM,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,OAAO,OAAO,IAAI,KAAK,IAAI,MAAM,IAAI,CAAC,EAAE,SAAS,CAAC,KAAK;AACnG;AAAA,MACH;AACE,YAAM,gBAAgB,KAAK,MAAM,KAAK,KAAK,qBAAqB,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;AAC/E,UAAI,CAAC,cAAc,WAAW,GAAG,KAAK,MAAM,KAAK,SAAS,cAAc,QAAQ;AAC/E,cAAM,OAAO;AACb,cAAM,cAAc,CAAC,IAAI;AAAA,MAC5B;AAAA,IACA;AACC,QAAI,CAAC,YAAY,MAAM,eAAe,GAAG;AACxC,UAAI;AACJ,OAAC,oBAAoB,MAAM,gBAAgB,QAAQ,sBAAsB,WAAW,MAAM,aAAa;AACvG,YAAM,gBAAgB,CAAA;AACtB,YAAM,SAAS,KAAK,IAAI,MAAM,WAAW,QAAQ,MAAM,MAAM;AAC7D,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAChC,cAAM,OAAO,MAAM,CAAC;AACpB,YAAI,SAAS,QAAQ,CAAC,MAAM,IAAI,CAAC,GAAG;AACnC,wBAAc,IAAG;AACjB;AAAA,QACJ;AACG,YAAI,SAAS,MAAM,WAAW,CAAC,KAAK,iBAAiB,IAAI,KAAK,MAAM,MAAM,SAAS,EAAG;AACtF,sBAAc,KAAK,IAAI;AAAA,MAC1B;AACE,YAAM,cAAc,cAAc;AAClC,YAAM,aAAa;AACnB,YAAM,OAAO,cAAc,SAAS,IAAI,KAAK,MAAM,KAAK,KAAK,GAAG,aAAa,IAAI;AAAA,IACnF;AACC,WAAO;AAAA,EACR;AACA,WAAS,gBAAgB,EAAE,WAAW,CAAC,MAAM,GAAG,SAAS,CAAA,GAAI,oBAAoB,QAAQ,KAAK,OAAO;AACpG,QAAI,OAAO,aAAa,SAAU,YAAW,CAAC,QAAQ;AACtD,QAAI,OAAO,WAAW,SAAU,UAAS,CAAC,MAAM;AAChD,UAAM,gBAAgB,CAAA;AACtB,UAAM,iBAAiB,CAAA;AACvB,eAAW,WAAW,QAAQ;AAC7B,UAAI,CAAC,QAAS;AACd,UAAI,QAAQ,CAAC,MAAM,OAAO,QAAQ,CAAC,MAAM,IAAK,gBAAe,KAAK,iBAAiB,SAAS,mBAAmB,KAAK,OAAO,IAAI,CAAC;AAAA,IAClI;AACC,eAAW,WAAW,UAAU;AAC/B,UAAI,CAAC,QAAS;AACd,UAAI,QAAQ,CAAC,MAAM,OAAO,QAAQ,CAAC,MAAM,IAAK,eAAc,KAAK,iBAAiB,SAAS,mBAAmB,KAAK,OAAO,KAAK,CAAC;AAAA,eACvH,QAAQ,CAAC,MAAM,OAAO,QAAQ,CAAC,MAAM,IAAK,gBAAe,KAAK,iBAAiB,QAAQ,MAAM,CAAC,GAAG,mBAAmB,KAAK,OAAO,IAAI,CAAC;AAAA,IAChJ;AACC,WAAO;AAAA,MACN,OAAO;AAAA,MACP,QAAQ;AAAA;EAEV;AACA,WAAS,YAAY,OAAO,UAAU;AACrC,aAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AAC3C,YAAM,SAAS,MAAM,CAAC;AACtB,YAAM,CAAC,IAAI,SAAS,MAAM;AAAA,IAC5B;AACC,WAAO;AAAA,EACR;AACA,WAAS,aAAa,KAAK;AAC1B,QAAI,CAAC,IAAK,QAAO,QAAQ,IAAG,EAAG,QAAQ,aAAa,GAAG;AACvD,QAAI,eAAe,IAAK,YAAW,IAAI,eAAe,GAAG,EAAE,QAAQ,aAAa,GAAG;AACnF,WAAO,KAAK,QAAQ,QAAQ,GAAG,EAAE,QAAQ,aAAa,GAAG;AAAA,EAC1D;AACA,WAAS,WAAW,UAAU,eAAe,IAAI;AAChD,UAAM,UAAU,QAAQ,IAAI,mBAAmB;AAAA,MAC9C,GAAG;AAAA,MACH,OAAO;AAAA,IACT,IAAK;AACJ,UAAM,MAAM,aAAa,QAAQ,GAAG;AACpC,QAAI,QAAQ,MAAO,KAAI,kBAAkB;AAAA,MACxC;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAE;AACD,QAAI,MAAM,QAAQ,QAAQ,KAAK,SAAS,WAAW,EAAG,QAAO,CAAC;AAAA,MAC7D,MAAM,MAAM,CAAA;AAAA,MACZ,aAAa,YAAY,CAAA;AAAA,OACvB,KAAK;AACR,UAAM,QAAQ;AAAA,MACb,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,aAAa;AAAA;AAEd,UAAM,YAAY,gBAAgB;AAAA,MACjC,GAAG;AAAA,MACH;AAAA,IACF,GAAI,KAAK,KAAK;AACb,QAAI,QAAQ,MAAO,KAAI,iCAAiC,SAAS;AACjE,UAAM,eAAe;AAAA,MACpB,KAAK,QAAQ;AAAA,MACb,SAAS,QAAQ,mBAAmB;AAAA,MACpC,QAAQ,QAAQ,uBAAuB;AAAA,MACvC,WAAW,QAAQ,YAAY;AAAA,MAC/B,YAAY,QAAQ,aAAa;AAAA,MACjC,OAAO;AAAA;AAER,UAAM,WAAU,GAAI,UAAU,SAAS,UAAU,OAAO;AAAA,MACvD,GAAG;AAAA,MACH,QAAQ,UAAU;AAAA,IACpB,CAAE;AACD,UAAM,UAAS,GAAI,UAAU,SAAS,UAAU,QAAQ,YAAY;AACpE,UAAM,iBAAiB,kBAAkB,UAAU,OAAO,YAAY;AACtE,UAAM,SAAS,YAAY,KAAK,MAAM,MAAM,QAAQ,QAAQ;AAC5D,UAAM,gBAAgB,QAAQ,WAAW,SAAS,YAAY,KAAK,MAAM,MAAM,IAAI;AACnF,UAAM,cAAc;AAAA,MACnB,SAAS,CAAC,QAAQ,QAAQ,CAAC,GAAG,gBAAgB;AAC7C,cAAM,SAAS,OAAO,GAAG,WAAW;AACpC,cAAM,UAAU,QAAQ,MAAM;AAC9B,YAAI,QAAS,KAAI,WAAW,MAAM,EAAE;AACpC,eAAO;AAAA,MACV,IAAM,CAAC,GAAG,gBAAgB,QAAQ,OAAO,GAAG,WAAW,CAAC,CAAC;AAAA,MACvD,SAAS,QAAQ,QAAQ,CAAC,GAAG,MAAM;AAClC,cAAM,eAAe,cAAc,GAAG,IAAI;AAC1C,cAAM,UAAU,iBAAiB,OAAO,CAAC,eAAe,YAAY,KAAK,OAAO,YAAY;AAC5F,YAAI,QAAS,KAAI,WAAW,CAAC,EAAE;AAAA,YAC1B,KAAI,YAAY,CAAC,EAAE;AACxB,eAAO;AAAA,MACV,IAAM,CAAC,GAAG,MAAM;AACb,cAAM,eAAe,cAAc,GAAG,IAAI;AAC1C,eAAO,iBAAiB,OAAO,CAAC,eAAe,YAAY,KAAK,OAAO,YAAY;AAAA,MACtF;AAAA,MACE,IAAI,QAAQ,KAAK;AAAA,QAChB,SAAS,QAAQ,GAAG,WAAW,GAAG,QAAQ;AAAA,QAC1C,aAAa,QAAQ,GAAG,eAAe,GAAG,QAAQ;AAAA,QAClD,UAAU,QAAQ,GAAG,YAAY,GAAG,QAAQ;AAAA,QAC5C,cAAc,QAAQ,GAAG,gBAAgB,GAAG,QAAQ;AAAA,QACpD,MAAM,QAAQ,GAAG,QAAQ,GAAG,QAAQ;AAAA,QACpC,UAAU,QAAQ,GAAG,YAAY,GAAG,QAAQ;AAAA,UACzC;AAAA,MACJ,eAAe;AAAA,MACf,eAAe;AAAA,MACf,iBAAiB;AAAA,MACjB,QAAQ,QAAQ;AAAA;AAEjB,QAAI,QAAQ,SAAS,OAAQ,aAAY,WAAW,KAAK,MAAM,QAAQ,OAAO,MAAM,WAAW;AAC/F,QAAI,QAAQ,UAAU;AACrB,kBAAY,gBAAgB;AAC5B,kBAAY,eAAe;AAC3B,kBAAY,kBAAkB;AAAA,IAChC;AACC,QAAI,QAAQ,wBAAwB,OAAO;AAC1C,kBAAY,kBAAkB;AAC9B,kBAAY,kBAAkB;AAAA,IAChC;AACC,QAAI,QAAQ,iBAAiB;AAC5B,kBAAY,eAAe;AAC3B,kBAAY,cAAc;AAAA,IAC5B,WAAY,QAAQ,cAAc,MAAO,aAAY,cAAc;AAClE,UAAM,OAAO,MAAM,KAAK,QAAQ,aAAa,EAAE;AAC/C,UAAM,OAAO,MAAM;AACnB,QAAI,QAAQ,MAAO,KAAI,wBAAwB,KAAK;AACpD,UAAM,WAAW,QAAQ,QAAQ,CAAC,QAAQ,YAAY,cAAc,KAAK,MAAM,IAAI;AACnF,WAAO,CAAC,IAAI,KAAK,KAAK,WAAW,EAAE,MAAM,IAAI,GAAG,QAAQ;AAAA,EACzD;AACA,iBAAe,KAAK,mBAAmB,SAAS;AAC/C,QAAI,sBAAsB,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,UAAW,OAAM,IAAI,MAAM,wDAAwD;AACvK,UAAM,WAAW,gBAAgB,iBAAiB,KAAK,OAAO,sBAAsB;AACpF,UAAM,OAAO,WAAW,UAAU;AAClC,UAAM,WAAW,WAAW,oBAAoB,kBAAkB;AAClE,UAAM,CAAC,SAAS,QAAQ,IAAI,WAAW,UAAU,IAAI;AACrD,QAAI,CAAC,SAAU,QAAO,QAAQ,YAAW;AACzC,WAAO,YAAY,MAAM,QAAQ,YAAW,GAAI,QAAQ;AAAA,EACzD;AACA,WAAS,SAAS,mBAAmB,SAAS;AAC7C,QAAI,sBAAsB,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,UAAW,OAAM,IAAI,MAAM,wDAAwD;AACvK,UAAM,WAAW,gBAAgB,iBAAiB,KAAK,OAAO,sBAAsB;AACpF,UAAM,OAAO,WAAW,UAAU;AAClC,UAAM,WAAW,WAAW,oBAAoB,kBAAkB;AAClE,UAAM,CAAC,SAAS,QAAQ,IAAI,WAAW,UAAU,IAAI;AACrD,QAAI,CAAC,SAAU,QAAO,QAAQ,KAAI;AAClC,WAAO,YAAY,QAAQ,KAAI,GAAI,QAAQ;AAAA,EAC5C;AAGA,OAAA,uBAA+B;AAC/B,OAAA,aAAqB;AACrB,OAAA,OAAe;AACf,OAAA,WAAmB;AACnB,OAAA,mBAA2B;;;","x_google_ignoreList":[0]}