langgraph-ui-components 0.0.4 → 0.0.6

package/dist/index.es273.js

@@ -1,170 +1,56 @@
-import { __require as requireRange } from "./index.es261.js";
-import { __require as requireComparator } from "./index.es260.js";
-import { __require as requireSatisfies } from "./index.es262.js";
-import { __require as requireCompare } from "./index.es246.js";
-var subset_1;
-var hasRequiredSubset;
-function requireSubset() {
-  if (hasRequiredSubset) return subset_1;
-  hasRequiredSubset = 1;
-  const Range = requireRange();
-  const Comparator = requireComparator();
-  const { ANY } = Comparator;
+import { __require as requireSatisfies } from "./index.es263.js";
+import { __require as requireCompare } from "./index.es247.js";
+var simplify;
+var hasRequiredSimplify;
+function requireSimplify() {
+  if (hasRequiredSimplify) return simplify;
+  hasRequiredSimplify = 1;
   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;
+  simplify = (versions, range, options) => {
+    const set = [];
+    let first = null;
+    let prev = null;
+    const v = versions.sort((a, b) => compare(a, b, options));
+    for (const version of v) {
+      const included = satisfies(version, range, options);
+      if (included) {
+        prev = version;
+        if (!first) {
+          first = version;
         }
-      }
-      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 (prev) {
+          set.push([first, prev]);
         }
+        prev = null;
+        first = null;
+      }
+    }
+    if (first) {
+      set.push([first, null]);
+    }
+    const ranges = [];
+    for (const [min, max] of set) {
+      if (min === max) {
+        ranges.push(min);
+      } else if (!max && min === v[0]) {
+        ranges.push("*");
+      } else if (!max) {
+        ranges.push(`>=${min}`);
+      } else if (min === v[0]) {
+        ranges.push(`<=${max}`);
+      } else {
+        ranges.push(`${min} - ${max}`);
       }
-      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;
+    const simplified = ranges.join(" || ");
+    const original = typeof range.raw === "string" ? range.raw : String(range);
+    return simplified.length < original.length ? simplified : range;
   };
-  subset_1 = subset;
-  return subset_1;
+  return simplify;
 }
 export {
-  requireSubset as __require
+  requireSimplify as __require
 };
 //# sourceMappingURL=index.es273.js.map

package/dist/index.es273.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es273.js","sources":["../node_modules/.pnpm/semver@7.7.3/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]}
+{"version":3,"file":"index.es273.js","sources":["../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/simplify.js"],"sourcesContent":["'use strict'\n\n// given a set of versions and a range, create a \"simplified\" range\n// that includes the same versions that the original range does\n// If the original range is shorter than the simplified one, return that.\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\nmodule.exports = (versions, range, options) => {\n  const set = []\n  let first = null\n  let prev = null\n  const v = versions.sort((a, b) => compare(a, b, options))\n  for (const version of v) {\n    const included = satisfies(version, range, options)\n    if (included) {\n      prev = version\n      if (!first) {\n        first = version\n      }\n    } else {\n      if (prev) {\n        set.push([first, prev])\n      }\n      prev = null\n      first = null\n    }\n  }\n  if (first) {\n    set.push([first, null])\n  }\n\n  const ranges = []\n  for (const [min, max] of set) {\n    if (min === max) {\n      ranges.push(min)\n    } else if (!max && min === v[0]) {\n      ranges.push('*')\n    } else if (!max) {\n      ranges.push(`>=${min}`)\n    } else if (min === v[0]) {\n      ranges.push(`<=${max}`)\n    } else {\n      ranges.push(`${min} - ${max}`)\n    }\n  }\n  const simplified = ranges.join(' || ')\n  const original = typeof range.raw === 'string' ? range.raw : String(range)\n  return simplified.length < original.length ? simplified : range\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;AAKA,QAAM,YAAYA,iBAAA;AAClB,QAAM,UAAUC,eAAA;AAChB,aAAiB,CAAC,UAAU,OAAO,YAAY;AAC7C,UAAM,MAAM,CAAA;AACZ,QAAI,QAAQ;AACZ,QAAI,OAAO;AACX,UAAM,IAAI,SAAS,KAAK,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,OAAO,CAAC;AACxD,eAAW,WAAW,GAAG;AACvB,YAAM,WAAW,UAAU,SAAS,OAAO,OAAO;AAClD,UAAI,UAAU;AACZ,eAAO;AACP,YAAI,CAAC,OAAO;AACV,kBAAQ;AAAA,QAChB;AAAA,MACA,OAAW;AACL,YAAI,MAAM;AACR,cAAI,KAAK,CAAC,OAAO,IAAI,CAAC;AAAA,QAC9B;AACM,eAAO;AACP,gBAAQ;AAAA,MACd;AAAA,IACA;AACE,QAAI,OAAO;AACT,UAAI,KAAK,CAAC,OAAO,IAAI,CAAC;AAAA,IAC1B;AAEE,UAAM,SAAS,CAAA;AACf,eAAW,CAAC,KAAK,GAAG,KAAK,KAAK;AAC5B,UAAI,QAAQ,KAAK;AACf,eAAO,KAAK,GAAG;AAAA,MACrB,WAAe,CAAC,OAAO,QAAQ,EAAE,CAAC,GAAG;AAC/B,eAAO,KAAK,GAAG;AAAA,MACrB,WAAe,CAAC,KAAK;AACf,eAAO,KAAK,KAAK,GAAG,EAAE;AAAA,MAC5B,WAAe,QAAQ,EAAE,CAAC,GAAG;AACvB,eAAO,KAAK,KAAK,GAAG,EAAE;AAAA,MAC5B,OAAW;AACL,eAAO,KAAK,GAAG,GAAG,MAAM,GAAG,EAAE;AAAA,MACnC;AAAA,IACA;AACE,UAAM,aAAa,OAAO,KAAK,MAAM;AACrC,UAAM,WAAW,OAAO,MAAM,QAAQ,WAAW,MAAM,MAAM,OAAO,KAAK;AACzE,WAAO,WAAW,SAAS,SAAS,SAAS,aAAa;AAAA,EAC5D;;;","x_google_ignoreList":[0]}

package/dist/index.es274.js

@@ -1,5 +1,170 @@
-var re = { exports: {} };
+import { __require as requireRange } from "./index.es262.js";
+import { __require as requireComparator } from "./index.es261.js";
+import { __require as requireSatisfies } from "./index.es263.js";
+import { __require as requireCompare } from "./index.es247.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 {
-  re as __module
+  requireSubset as __require
 };
 //# sourceMappingURL=index.es274.js.map

package/dist/index.es274.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es274.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"index.es274.js","sources":["../node_modules/.pnpm/semver@7.7.3/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/index.es275.js

@@ -1,14 +1,41 @@
-var debug_1;
-var hasRequiredDebug;
-function requireDebug() {
-  if (hasRequiredDebug) return debug_1;
-  hasRequiredDebug = 1;
-  const debug = typeof process === "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...args) => console.error("SEMVER", ...args) : () => {
-  };
-  debug_1 = debug;
-  return debug_1;
+const objectToString = Object.prototype.toString;
+const isError = (value) => objectToString.call(value) === "[object Error]";
+const errorMessages = /* @__PURE__ */ new Set([
+  "network error",
+  // Chrome
+  "Failed to fetch",
+  // Chrome
+  "NetworkError when attempting to fetch resource.",
+  // Firefox
+  "The Internet connection appears to be offline.",
+  // Safari 16
+  "Network request failed",
+  // `cross-fetch`
+  "fetch failed",
+  // Undici (Node.js)
+  "terminated",
+  // Undici (Node.js)
+  " A network error occurred.",
+  // Bun (WebKit)
+  "Network connection lost"
+  // Cloudflare Workers (fetch)
+]);
+function isNetworkError(error) {
+  const isValid = error && isError(error) && error.name === "TypeError" && typeof error.message === "string";
+  if (!isValid) {
+    return false;
+  }
+  const { message, stack } = error;
+  if (message === "Load failed") {
+    return stack === void 0 || // Sentry adds its own stack trace to the fetch error, so also check for that
+    "__sentry_captured__" in error;
+  }
+  if (message.startsWith("error sending request for url")) {
+    return true;
+  }
+  return errorMessages.has(message);
 }
 export {
-  requireDebug as __require
+  isNetworkError as default
 };
 //# sourceMappingURL=index.es275.js.map

package/dist/index.es275.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es275.js","sources":["../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/debug.js"],"sourcesContent":["'use strict'\n\nconst debug = (\n  typeof process === 'object' &&\n  process.env &&\n  process.env.NODE_DEBUG &&\n  /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n  : () => {}\n\nmodule.exports = debug\n"],"names":[],"mappings":";;;;;AAEA,QAAM,QACJ,OAAO,YAAY,YACnB,QAAQ,OACR,QAAQ,IAAI,cACZ,cAAc,KAAK,QAAQ,IAAI,UAAU,IACvC,IAAI,SAAS,QAAQ,MAAM,UAAU,GAAG,IAAI,IAC5C,MAAM;AAAA,EAAA;AAEV,YAAiB;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es275.js","sources":["../node_modules/.pnpm/langsmith@0.4.6_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/is-network-error/index.js"],"sourcesContent":["/* eslint-disable */\n// @ts-nocheck\n// is-network-error vendored to avoid import issues\n// Source: https://github.com/sindresorhus/is-network-error\nconst objectToString = Object.prototype.toString;\nconst isError = (value) => objectToString.call(value) === \"[object Error]\";\nconst errorMessages = new Set([\n    \"network error\", // Chrome\n    \"Failed to fetch\", // Chrome\n    \"NetworkError when attempting to fetch resource.\", // Firefox\n    \"The Internet connection appears to be offline.\", // Safari 16\n    \"Network request failed\", // `cross-fetch`\n    \"fetch failed\", // Undici (Node.js)\n    \"terminated\", // Undici (Node.js)\n    \" A network error occurred.\", // Bun (WebKit)\n    \"Network connection lost\", // Cloudflare Workers (fetch)\n]);\nexport default function isNetworkError(error) {\n    const isValid = error &&\n        isError(error) &&\n        error.name === \"TypeError\" &&\n        typeof error.message === \"string\";\n    if (!isValid) {\n        return false;\n    }\n    const { message, stack } = error;\n    // Safari 17+ has generic message but no stack for network errors\n    if (message === \"Load failed\") {\n        return (stack === undefined ||\n            // Sentry adds its own stack trace to the fetch error, so also check for that\n            \"__sentry_captured__\" in error);\n    }\n    // Deno network errors start with specific text\n    if (message.startsWith(\"error sending request for url\")) {\n        return true;\n    }\n    // Standard network error messages\n    return errorMessages.has(message);\n}\n"],"names":[],"mappings":"AAIA,MAAM,iBAAiB,OAAO,UAAU;AACxC,MAAM,UAAU,CAAC,UAAU,eAAe,KAAK,KAAK,MAAM;AAC1D,MAAM,gBAAgB,oBAAI,IAAI;AAAA,EAC1B;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AACJ,CAAC;AACc,SAAS,eAAe,OAAO;AAC1C,QAAM,UAAU,SACZ,QAAQ,KAAK,KACb,MAAM,SAAS,eACf,OAAO,MAAM,YAAY;AAC7B,MAAI,CAAC,SAAS;AACV,WAAO;AAAA,EACX;AACA,QAAM,EAAE,SAAS,MAAK,IAAK;AAE3B,MAAI,YAAY,eAAe;AAC3B,WAAQ,UAAU;AAAA,IAEd,yBAAyB;AAAA,EACjC;AAEA,MAAI,QAAQ,WAAW,+BAA+B,GAAG;AACrD,WAAO;AAAA,EACX;AAEA,SAAO,cAAc,IAAI,OAAO;AACpC;","x_google_ignoreList":[0]}

package/dist/index.es276.js

@@ -1,23 +1,5 @@
-var parseOptions_1;
-var hasRequiredParseOptions;
-function requireParseOptions() {
-  if (hasRequiredParseOptions) return parseOptions_1;
-  hasRequiredParseOptions = 1;
-  const looseOption = Object.freeze({ loose: true });
-  const emptyOpts = Object.freeze({});
-  const parseOptions = (options) => {
-    if (!options) {
-      return emptyOpts;
-    }
-    if (typeof options !== "object") {
-      return looseOption;
-    }
-    return options;
-  };
-  parseOptions_1 = parseOptions;
-  return parseOptions_1;
-}
+var re = { exports: {} };
 export {
-  requireParseOptions as __require
+  re as __module
 };
 //# sourceMappingURL=index.es276.js.map

package/dist/index.es276.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es276.js","sources":["../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/parse-options.js"],"sourcesContent":["'use strict'\n\n// parse out just the options we care about\nconst looseOption = Object.freeze({ loose: true })\nconst emptyOpts = Object.freeze({ })\nconst parseOptions = options => {\n  if (!options) {\n    return emptyOpts\n  }\n\n  if (typeof options !== 'object') {\n    return looseOption\n  }\n\n  return options\n}\nmodule.exports = parseOptions\n"],"names":[],"mappings":";;;;;AAGA,QAAM,cAAc,OAAO,OAAO,EAAE,OAAO,KAAI,CAAE;AACjD,QAAM,YAAY,OAAO,OAAO,CAAA,CAAG;AACnC,QAAM,eAAe,aAAW;AAC9B,QAAI,CAAC,SAAS;AACZ,aAAO;AAAA,IACX;AAEE,QAAI,OAAO,YAAY,UAAU;AAC/B,aAAO;AAAA,IACX;AAEE,WAAO;AAAA,EACT;AACA,mBAAiB;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es276.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es277.js

@@ -1,42 +1,14 @@
-var lrucache;
-var hasRequiredLrucache;
-function requireLrucache() {
-  if (hasRequiredLrucache) return lrucache;
-  hasRequiredLrucache = 1;
-  class LRUCache {
-    constructor() {
-      this.max = 1e3;
-      this.map = /* @__PURE__ */ new Map();
-    }
-    get(key) {
-      const value = this.map.get(key);
-      if (value === void 0) {
-        return void 0;
-      } else {
-        this.map.delete(key);
-        this.map.set(key, value);
-        return value;
-      }
-    }
-    delete(key) {
-      return this.map.delete(key);
-    }
-    set(key, value) {
-      const deleted = this.delete(key);
-      if (!deleted && value !== void 0) {
-        if (this.map.size >= this.max) {
-          const firstKey = this.map.keys().next().value;
-          this.delete(firstKey);
-        }
-        this.map.set(key, value);
-      }
-      return this;
-    }
-  }
-  lrucache = LRUCache;
-  return lrucache;
+var debug_1;
+var hasRequiredDebug;
+function requireDebug() {
+  if (hasRequiredDebug) return debug_1;
+  hasRequiredDebug = 1;
+  const debug = typeof process === "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...args) => console.error("SEMVER", ...args) : () => {
+  };
+  debug_1 = debug;
+  return debug_1;
 }
 export {
-  requireLrucache as __require
+  requireDebug as __require
 };
 //# sourceMappingURL=index.es277.js.map

package/dist/index.es277.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es277.js","sources":["../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/lrucache.js"],"sourcesContent":["'use strict'\n\nclass LRUCache {\n  constructor () {\n    this.max = 1000\n    this.map = new Map()\n  }\n\n  get (key) {\n    const value = this.map.get(key)\n    if (value === undefined) {\n      return undefined\n    } else {\n      // Remove the key from the map and add it to the end\n      this.map.delete(key)\n      this.map.set(key, value)\n      return value\n    }\n  }\n\n  delete (key) {\n    return this.map.delete(key)\n  }\n\n  set (key, value) {\n    const deleted = this.delete(key)\n\n    if (!deleted && value !== undefined) {\n      // If cache is full, delete the least recently used item\n      if (this.map.size >= this.max) {\n        const firstKey = this.map.keys().next().value\n        this.delete(firstKey)\n      }\n\n      this.map.set(key, value)\n    }\n\n    return this\n  }\n}\n\nmodule.exports = LRUCache\n"],"names":[],"mappings":";;;;;EAEA,MAAM,SAAS;AAAA,IACb,cAAe;AACb,WAAK,MAAM;AACX,WAAK,MAAM,oBAAI,IAAG;AAAA,IACtB;AAAA,IAEE,IAAK,KAAK;AACR,YAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;AAC9B,UAAI,UAAU,QAAW;AACvB,eAAO;AAAA,MACb,OAAW;AAEL,aAAK,IAAI,OAAO,GAAG;AACnB,aAAK,IAAI,IAAI,KAAK,KAAK;AACvB,eAAO;AAAA,MACb;AAAA,IACA;AAAA,IAEE,OAAQ,KAAK;AACX,aAAO,KAAK,IAAI,OAAO,GAAG;AAAA,IAC9B;AAAA,IAEE,IAAK,KAAK,OAAO;AACf,YAAM,UAAU,KAAK,OAAO,GAAG;AAE/B,UAAI,CAAC,WAAW,UAAU,QAAW;AAEnC,YAAI,KAAK,IAAI,QAAQ,KAAK,KAAK;AAC7B,gBAAM,WAAW,KAAK,IAAI,KAAI,EAAG,KAAI,EAAG;AACxC,eAAK,OAAO,QAAQ;AAAA,QAC5B;AAEM,aAAK,IAAI,IAAI,KAAK,KAAK;AAAA,MAC7B;AAEI,aAAO;AAAA,IACX;AAAA,EACA;AAEA,aAAiB;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es277.js","sources":["../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/debug.js"],"sourcesContent":["'use strict'\n\nconst debug = (\n  typeof process === 'object' &&\n  process.env &&\n  process.env.NODE_DEBUG &&\n  /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n  : () => {}\n\nmodule.exports = debug\n"],"names":[],"mappings":";;;;;AAEA,QAAM,QACJ,OAAO,YAAY,YACnB,QAAQ,OACR,QAAQ,IAAI,cACZ,cAAc,KAAK,QAAQ,IAAI,UAAU,IACvC,IAAI,SAAS,QAAQ,MAAM,UAAU,GAAG,IAAI,IAC5C,MAAM;AAAA,EAAA;AAEV,YAAiB;;;","x_google_ignoreList":[0]}

package/dist/index.es278.js

@@ -0,0 +1,23 @@
+var parseOptions_1;
+var hasRequiredParseOptions;
+function requireParseOptions() {
+  if (hasRequiredParseOptions) return parseOptions_1;
+  hasRequiredParseOptions = 1;
+  const looseOption = Object.freeze({ loose: true });
+  const emptyOpts = Object.freeze({});
+  const parseOptions = (options) => {
+    if (!options) {
+      return emptyOpts;
+    }
+    if (typeof options !== "object") {
+      return looseOption;
+    }
+    return options;
+  };
+  parseOptions_1 = parseOptions;
+  return parseOptions_1;
+}
+export {
+  requireParseOptions as __require
+};
+//# sourceMappingURL=index.es278.js.map

package/dist/index.es278.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es278.js","sources":["../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/parse-options.js"],"sourcesContent":["'use strict'\n\n// parse out just the options we care about\nconst looseOption = Object.freeze({ loose: true })\nconst emptyOpts = Object.freeze({ })\nconst parseOptions = options => {\n  if (!options) {\n    return emptyOpts\n  }\n\n  if (typeof options !== 'object') {\n    return looseOption\n  }\n\n  return options\n}\nmodule.exports = parseOptions\n"],"names":[],"mappings":";;;;;AAGA,QAAM,cAAc,OAAO,OAAO,EAAE,OAAO,KAAI,CAAE;AACjD,QAAM,YAAY,OAAO,OAAO,CAAA,CAAG;AACnC,QAAM,eAAe,aAAW;AAC9B,QAAI,CAAC,SAAS;AACZ,aAAO;AAAA,IACX;AAEE,QAAI,OAAO,YAAY,UAAU;AAC/B,aAAO;AAAA,IACX;AAEE,WAAO;AAAA,EACT;AACA,mBAAiB;;;","x_google_ignoreList":[0]}