@platforma-sdk/ui-vue 1.54.1 → 1.54.7

package/dist/components/PlTableFilters/filters_logic.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"filters_logic.js","sources":["../../../src/components/PlTableFilters/filters_logic.ts"],"sourcesContent":["import type {\n  PlTableFilterNumberEquals,\n  PlTableFilterNumberNotEquals,\n  PlTableFilterStringEquals,\n  PlTableFilterStringNotEquals,\n} from \"@platforma-sdk/model\";\nimport {\n  type SingleValuePredicateV2,\n  type PlTableFilterType,\n  type PlTableFilterNumberType,\n  type PlTableFilterStringType,\n  type PlTableFilter,\n  type PTableColumnSpec,\n  getRawPlatformaInstance,\n  readDomain,\n  Annotation,\n  Domain,\n  readAnnotation,\n  parseJson,\n  readAnnotationJson,\n} from \"@platforma-sdk/model\";\nimport * as semver from \"semver\";\nimport type { ListOption } from \"@milaboratories/uikit\";\n\nexport function isFilterValid(\n  filter: PlTableFilter,\n  options: ListOption<number | string>[],\n  discreteOptions: ListOption<number | string>[],\n): boolean {\n  const validOption = options.some((o) => o.value === filter.type);\n  if (!validOption) return false;\n\n  if (isFilterDiscreteType(filter.type) && discreteOptions.length > 0) {\n    const reference = getFilterReference(filter);\n    return discreteOptions.some((option) => option.value === reference);\n  }\n\n  return true;\n}\n\nexport function getFilterLabel(type: PlTableFilterType): string {\n  switch (type) {\n    case \"isNotNA\":\n      return \"Is not NA\";\n    case \"isNA\":\n      return \"Is NA\";\n    case \"number_equals\":\n    case \"string_equals\":\n      return \"Equals\";\n    case \"number_notEquals\":\n    case \"string_notEquals\":\n      return \"Not equals\";\n    case \"number_greaterThan\":\n      return \"Greater than\";\n    case \"number_greaterThanOrEqualTo\":\n      return \"Greater than or equal to\";\n    case \"number_lessThan\":\n      return \"Less than\";\n    case \"number_lessThanOrEqualTo\":\n      return \"Less than or equal to\";\n    case \"number_between\":\n      return \"Between\";\n    case \"string_contains\":\n      return \"Contains\";\n    case \"string_doesNotContain\":\n      return \"Does not contain\";\n    case \"string_matches\":\n      return \"Matches\";\n    case \"string_doesNotMatch\":\n      return \"Does not match\";\n    case \"string_containsFuzzyMatch\":\n      return \"Contains fuzzy match\";\n    default:\n      throw Error(`unsupported filter type: ${type satisfies never}`);\n  }\n}\n\nexport const filterTypesNumber: PlTableFilterNumberType[] = [\n  \"isNotNA\",\n  \"isNA\",\n  \"number_equals\",\n  \"number_notEquals\",\n  \"number_greaterThan\",\n  \"number_greaterThanOrEqualTo\",\n  \"number_lessThan\",\n  \"number_lessThanOrEqualTo\",\n  \"number_between\",\n] as const;\n\nexport const filterTypesString: PlTableFilterStringType[] = [\n  \"isNotNA\",\n  \"isNA\",\n  \"string_equals\",\n  \"string_notEquals\",\n  \"string_contains\",\n  \"string_doesNotContain\",\n  \"string_matches\",\n  \"string_doesNotMatch\",\n  \"string_containsFuzzyMatch\",\n] as const;\n\nexport function getFilterOptions(column: PTableColumnSpec): ListOption<PlTableFilterType>[] {\n  const valueType = column.type === \"column\" ? column.spec.valueType : column.spec.type;\n  const types: PlTableFilterType[] = valueType === \"String\" ? filterTypesString : filterTypesNumber;\n  return types\n    .filter((type) => (column.type === \"axis\" ? type !== \"isNotNA\" && type !== \"isNA\" : true))\n    .map((type) => ({ value: type, text: getFilterLabel(type) }));\n}\n\nexport type PlTableFilterDiscrete =\n  | PlTableFilterNumberEquals\n  | PlTableFilterNumberNotEquals\n  | PlTableFilterStringEquals\n  | PlTableFilterStringNotEquals;\n\nexport type PlTableFilterDiscreteType = PlTableFilterDiscrete[\"type\"];\n\nexport const filterTypesDiscrete: PlTableFilterDiscreteType[] = [\n  \"number_equals\",\n  \"number_notEquals\",\n  \"string_equals\",\n  \"string_notEquals\",\n] as const;\n\nexport const isFilterDiscreteType = (\n  filter: PlTableFilterType,\n): filter is PlTableFilterDiscreteType => {\n  return (filterTypesDiscrete as PlTableFilterType[]).includes(filter);\n};\n\nexport const isFilterDiscrete = (filter: PlTableFilter): filter is PlTableFilterDiscrete => {\n  return isFilterDiscreteType(filter.type);\n};\n\nexport function getColumnName(column: PTableColumnSpec, index: string | number) {\n  return (\n    readAnnotation(column.spec, Annotation.Label)?.trim() ??\n    \"Unlabeled \" + column.type + \" \" + index.toString()\n  );\n}\n\nexport function getFilterReference(filter: PlTableFilter): undefined | number | string {\n  const type = filter.type;\n  switch (type) {\n    case \"isNotNA\":\n    case \"isNA\":\n      return undefined;\n    case \"number_equals\":\n    case \"number_notEquals\":\n    case \"number_greaterThan\":\n    case \"number_greaterThanOrEqualTo\":\n    case \"number_lessThan\":\n    case \"number_lessThanOrEqualTo\":\n      return filter.reference;\n    case \"number_between\":\n      return filter.lowerBound;\n    case \"string_equals\":\n    case \"string_notEquals\":\n    case \"string_contains\":\n    case \"string_doesNotContain\":\n    case \"string_matches\":\n    case \"string_doesNotMatch\":\n    case \"string_containsFuzzyMatch\":\n      return filter.reference;\n    default:\n      throw Error(`unsupported filter type: ${type satisfies never}`);\n  }\n}\n\nexport function getFilterDefault(\n  type: PlTableFilterType,\n  reference?: undefined | number | string,\n): PlTableFilter {\n  switch (type) {\n    case \"isNotNA\":\n    case \"isNA\":\n      return { type };\n    case \"number_equals\":\n    case \"number_notEquals\":\n    case \"number_greaterThan\":\n    case \"number_greaterThanOrEqualTo\":\n    case \"number_lessThan\":\n    case \"number_lessThanOrEqualTo\":\n      return { type, reference: typeof reference === \"number\" ? reference : 0 };\n    case \"number_between\":\n      return {\n        type,\n        lowerBound: typeof reference === \"number\" ? reference : 0,\n        includeLowerBound: true,\n        upperBound: 100,\n        includeUpperBound: false,\n      };\n    case \"string_equals\":\n    case \"string_notEquals\":\n    case \"string_contains\":\n    case \"string_doesNotContain\":\n    case \"string_matches\":\n    case \"string_doesNotMatch\":\n      return { type, reference: typeof reference === \"string\" ? reference : \"\" };\n    case \"string_containsFuzzyMatch\":\n      return {\n        type,\n        reference: typeof reference === \"string\" ? reference : \"\",\n        maxEdits: 2,\n        substitutionsOnly: false,\n        wildcard: undefined,\n      };\n    default:\n      throw Error(`unsupported filter type: ${type satisfies never}`);\n  }\n}\n\nexport function changeFilter(\n  filter: PlTableFilter,\n  type: PlTableFilterType,\n  discreteOptions: ListOption<number | string>[],\n): PlTableFilter {\n  let reference = getFilterReference(filter);\n  if (\n    isFilterDiscreteType(type) &&\n    discreteOptions !== undefined &&\n    discreteOptions.length > 0 &&\n    !discreteOptions.some((option) => option.value === reference)\n  ) {\n    reference = discreteOptions[0].value;\n  }\n  return getFilterDefault(type, reference);\n}\n\nexport function parseNumber(column: PTableColumnSpec, value: string): number {\n  const parsed = Number(value);\n  if (!Number.isFinite(parsed)) throw Error(\"Model value is not a number.\");\n\n  const type = column.type === \"column\" ? column.spec.valueType : column.spec.type;\n  if ((type === \"Int\" || type === \"Long\") && !Number.isInteger(parsed))\n    throw Error(\"Model value is not an integer.\");\n\n  const min = readAnnotationJson(column.spec, Annotation.Min);\n  if (min !== undefined) {\n    if (Number.isFinite(min) && parsed < min) {\n      throw Error(\"Model value is too low.\");\n    }\n  }\n\n  const max = readAnnotationJson(column.spec, Annotation.Max);\n  if (max !== undefined) {\n    if (Number.isFinite(max) && parsed > max) {\n      throw Error(\"Model value is too high.\");\n    }\n  }\n\n  return parsed;\n}\n\nexport function parseString(column: PTableColumnSpec, value: string): string {\n  const alphabet =\n    readDomain(column.spec, Domain.Alphabet) ?? readAnnotation(column.spec, Annotation.Alphabet);\n  if (alphabet === \"nucleotide\" && !/^[AaTtGgCcNn]+$/.test(value))\n    throw Error(\"Model value is not a nucleotide.\");\n  if (alphabet === \"aminoacid\" && !/^[AaCcDdEeFfGgHhIiKkLlMmNnPpQqRrSsTtVvWwYyXx*_]+$/.test(value))\n    throw Error(\"Model value is not an aminoacid.\");\n  return value;\n}\n\nexport function parseRegex(value: string): string {\n  try {\n    new RegExp(value);\n    return value;\n  } catch (err: unknown) {\n    if (err instanceof SyntaxError) throw Error(\"Model value is not a regexp.\");\n    throw err;\n  }\n}\n\nexport function makeWildcardOptions(\n  column: PTableColumnSpec,\n  reference: string,\n): ListOption<string>[] {\n  const alphabet =\n    readDomain(column.spec, Domain.Alphabet) ?? readAnnotation(column.spec, Annotation.Alphabet);\n  if (alphabet === \"nucleotide\") {\n    return [\n      {\n        label: \"N\",\n        value: \"N\",\n      },\n    ];\n  }\n  if (alphabet === \"aminoacid\") {\n    return [\n      {\n        label: \"X\",\n        value: \"X\",\n      },\n    ];\n  }\n\n  const chars = [...new Set<string>(reference).keys()];\n  return chars.sort().map((char) => ({\n    label: char,\n    value: char,\n  }));\n}\n\nexport function makeDiscreteOptions(column: PTableColumnSpec): ListOption<number | string>[] {\n  const discreteValuesAnnotation = readAnnotation(column.spec, Annotation.DiscreteValues);\n  if (!discreteValuesAnnotation) return [];\n\n  try {\n    const discreteValues = parseJson<number[] | string[]>(discreteValuesAnnotation);\n    return discreteValues.map((v) => ({\n      label: `${v}`,\n      value: v,\n    }));\n  } catch (err: unknown) {\n    console.error(\n      `Column ${column.id} has invalid '${Annotation.DiscreteValues}' annotation: '${discreteValuesAnnotation}'`,\n      err,\n    );\n    return [];\n  }\n}\n\nexport function isAlphabetic(column: PTableColumnSpec): boolean {\n  return (\n    semver.gt(getRawPlatformaInstance().sdkInfo.sdkVersion, \"1.14.0\") &&\n    (column.type === \"column\" ? column.spec.valueType : column.spec.type) === \"String\" &&\n    (readDomain(column.spec, Domain.Alphabet) ??\n      readAnnotation(column.spec, Annotation.Alphabet)) !== undefined\n  );\n}\n\nexport function makePredicate(alphabetic: boolean, filter: PlTableFilter): SingleValuePredicateV2 {\n  const type = filter.type;\n  switch (type) {\n    case \"isNotNA\":\n      return {\n        operator: \"Not\",\n        operand: {\n          operator: \"IsNA\",\n        },\n      };\n    case \"isNA\":\n      return {\n        operator: \"IsNA\",\n      };\n    case \"number_equals\":\n      return {\n        operator: \"Equal\",\n        reference: filter.reference,\n      };\n    case \"string_equals\":\n      return {\n        operator: alphabetic ? \"IEqual\" : \"Equal\",\n        reference: filter.reference as string,\n      };\n    case \"number_notEquals\":\n      return {\n        operator: \"Not\",\n        operand: {\n          operator: \"Equal\",\n          reference: filter.reference,\n        },\n      };\n    case \"string_notEquals\":\n      return {\n        operator: \"Not\",\n        operand: {\n          operator: alphabetic ? \"IEqual\" : \"Equal\",\n          reference: filter.reference,\n        },\n      };\n    case \"number_greaterThan\":\n      return {\n        operator: \"Greater\",\n        reference: filter.reference,\n      };\n    case \"number_greaterThanOrEqualTo\":\n      return {\n        operator: \"GreaterOrEqual\",\n        reference: filter.reference,\n      };\n    case \"number_lessThan\":\n      return {\n        operator: \"Less\",\n        reference: filter.reference,\n      };\n    case \"number_lessThanOrEqualTo\":\n      return {\n        operator: \"LessOrEqual\",\n        reference: filter.reference,\n      };\n    case \"number_between\":\n      return {\n        operator: \"And\",\n        operands: [\n          {\n            operator: filter.includeLowerBound ? \"GreaterOrEqual\" : \"Greater\",\n            reference: filter.lowerBound,\n          },\n          {\n            operator: filter.includeUpperBound ? \"LessOrEqual\" : \"Less\",\n            reference: filter.upperBound,\n          },\n        ],\n      };\n    case \"string_contains\":\n      return {\n        operator: alphabetic ? \"StringIContains\" : \"StringContains\",\n        substring: filter.reference,\n      };\n    case \"string_doesNotContain\":\n      return {\n        operator: \"Not\",\n        operand: {\n          operator: alphabetic ? \"StringIContains\" : \"StringContains\",\n          substring: filter.reference,\n        },\n      };\n    case \"string_matches\":\n      return {\n        operator: \"Matches\",\n        regex: filter.reference,\n      };\n    case \"string_doesNotMatch\":\n      return {\n        operator: \"Not\",\n        operand: {\n          operator: \"Matches\",\n          regex: filter.reference,\n        },\n      };\n    case \"string_containsFuzzyMatch\":\n      return {\n        operator: alphabetic ? \"StringIContainsFuzzy\" : \"StringContainsFuzzy\",\n        reference: filter.reference,\n        maxEdits: filter.maxEdits,\n        substitutionsOnly: filter.substitutionsOnly,\n        wildcard: filter.wildcard,\n      };\n    default:\n      throw Error(`unsupported filter type: ${type satisfies never}`);\n  }\n}\n"],"names":["isFilterValid","filter","options","discreteOptions","o","isFilterDiscreteType","reference","getFilterReference","option","getFilterLabel","type","filterTypesNumber","filterTypesString","getFilterOptions","column","filterTypesDiscrete","isFilterDiscrete","getColumnName","index","_a","readAnnotation","Annotation","getFilterDefault","changeFilter","parseNumber","value","parsed","min","readAnnotationJson","max","parseString","alphabet","readDomain","Domain","parseRegex","err","makeWildcardOptions","char","makeDiscreteOptions","discreteValuesAnnotation","parseJson","v","isAlphabetic","semver.gt","getRawPlatformaInstance","makePredicate","alphabetic"],"mappings":";;AAwBO,SAASA,EACdC,GACAC,GACAC,GACS;AAET,MAAI,CADgBD,EAAQ,KAAK,CAACE,MAAMA,EAAE,UAAUH,EAAO,IAAI,EAC7C,QAAO;AAEzB,MAAII,EAAqBJ,EAAO,IAAI,KAAKE,EAAgB,SAAS,GAAG;AACnE,UAAMG,IAAYC,EAAmBN,CAAM;AAC3C,WAAOE,EAAgB,KAAK,CAACK,MAAWA,EAAO,UAAUF,CAAS;AAAA,EACpE;AAEA,SAAO;AACT;AAEO,SAASG,EAAeC,GAAiC;AAC9D,UAAQA,GAAA;AAAA,IACN,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,YAAM,MAAM,4BAA4BA,CAAoB,EAAE;AAAA,EAAA;AAEpE;AAEO,MAAMC,IAA+C;AAAA,EAC1D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GAEaC,IAA+C;AAAA,EAC1D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,SAASC,EAAiBC,GAA2D;AAG1F,WAFkBA,EAAO,SAAS,WAAWA,EAAO,KAAK,YAAYA,EAAO,KAAK,UAChC,WAAWF,IAAoBD,GAE7E,OAAO,CAACD,MAAUI,EAAO,SAAS,SAASJ,MAAS,aAAaA,MAAS,SAAS,EAAK,EACxF,IAAI,CAACA,OAAU,EAAE,OAAOA,GAAM,MAAMD,EAAeC,CAAI,EAAA,EAAI;AAChE;AAUO,MAAMK,IAAmD;AAAA,EAC9D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GAEaV,IAAuB,CAClCJ,MAEQc,EAA4C,SAASd,CAAM,GAGxDe,IAAmB,CAACf,MACxBI,EAAqBJ,EAAO,IAAI;AAGlC,SAASgB,EAAcH,GAA0BI,GAAwB;;AAC9E,WACEC,IAAAC,EAAeN,EAAO,MAAMO,EAAW,KAAK,MAA5C,gBAAAF,EAA+C,WAC/C,eAAeL,EAAO,OAAO,MAAMI,EAAM,SAAA;AAE7C;AAEO,SAASX,EAAmBN,GAAoD;AACrF,QAAMS,IAAOT,EAAO;AACpB,UAAQS,GAAA;AAAA,IACN,KAAK;AAAA,IACL,KAAK;AACH;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAOT,EAAO;AAAA,IAChB,KAAK;AACH,aAAOA,EAAO;AAAA,IAChB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAOA,EAAO;AAAA,IAChB;AACE,YAAM,MAAM,4BAA4BS,CAAoB,EAAE;AAAA,EAAA;AAEpE;AAEO,SAASY,EACdZ,GACAJ,GACe;AACf,UAAQI,GAAA;AAAA,IACN,KAAK;AAAA,IACL,KAAK;AACH,aAAO,EAAE,MAAAA,EAAA;AAAA,IACX,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,EAAE,MAAAA,GAAM,WAAW,OAAOJ,KAAc,WAAWA,IAAY,EAAA;AAAA,IACxE,KAAK;AACH,aAAO;AAAA,QACL,MAAAI;AAAA,QACA,YAAY,OAAOJ,KAAc,WAAWA,IAAY;AAAA,QACxD,mBAAmB;AAAA,QACnB,YAAY;AAAA,QACZ,mBAAmB;AAAA,MAAA;AAAA,IAEvB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,EAAE,MAAAI,GAAM,WAAW,OAAOJ,KAAc,WAAWA,IAAY,GAAA;AAAA,IACxE,KAAK;AACH,aAAO;AAAA,QACL,MAAAI;AAAA,QACA,WAAW,OAAOJ,KAAc,WAAWA,IAAY;AAAA,QACvD,UAAU;AAAA,QACV,mBAAmB;AAAA,QACnB,UAAU;AAAA,MAAA;AAAA,IAEd;AACE,YAAM,MAAM,4BAA4BI,CAAoB,EAAE;AAAA,EAAA;AAEpE;AAEO,SAASa,EACdtB,GACAS,GACAP,GACe;AACf,MAAIG,IAAYC,EAAmBN,CAAM;AACzC,SACEI,EAAqBK,CAAI,KACzBP,MAAoB,UACpBA,EAAgB,SAAS,KACzB,CAACA,EAAgB,KAAK,CAACK,MAAWA,EAAO,UAAUF,CAAS,MAE5DA,IAAYH,EAAgB,CAAC,EAAE,QAE1BmB,EAAiBZ,GAAMJ,CAAS;AACzC;AAEO,SAASkB,EAAYV,GAA0BW,GAAuB;AAC3E,QAAMC,IAAS,OAAOD,CAAK;AAC3B,MAAI,CAAC,OAAO,SAASC,CAAM,EAAG,OAAM,MAAM,8BAA8B;AAExE,QAAMhB,IAAOI,EAAO,SAAS,WAAWA,EAAO,KAAK,YAAYA,EAAO,KAAK;AAC5E,OAAKJ,MAAS,SAASA,MAAS,WAAW,CAAC,OAAO,UAAUgB,CAAM;AACjE,UAAM,MAAM,gCAAgC;AAE9C,QAAMC,IAAMC,EAAmBd,EAAO,MAAMO,EAAW,GAAG;AAC1D,MAAIM,MAAQ,UACN,OAAO,SAASA,CAAG,KAAKD,IAASC;AACnC,UAAM,MAAM,yBAAyB;AAIzC,QAAME,IAAMD,EAAmBd,EAAO,MAAMO,EAAW,GAAG;AAC1D,MAAIQ,MAAQ,UACN,OAAO,SAASA,CAAG,KAAKH,IAASG;AACnC,UAAM,MAAM,0BAA0B;AAI1C,SAAOH;AACT;AAEO,SAASI,EAAYhB,GAA0BW,GAAuB;AAC3E,QAAMM,IACJC,EAAWlB,EAAO,MAAMmB,EAAO,QAAQ,KAAKb,EAAeN,EAAO,MAAMO,EAAW,QAAQ;AAC7F,MAAIU,MAAa,gBAAgB,CAAC,kBAAkB,KAAKN,CAAK;AAC5D,UAAM,MAAM,kCAAkC;AAChD,MAAIM,MAAa,eAAe,CAAC,oDAAoD,KAAKN,CAAK;AAC7F,UAAM,MAAM,kCAAkC;AAChD,SAAOA;AACT;AAEO,SAASS,EAAWT,GAAuB;AAChD,MAAI;AACF,eAAI,OAAOA,CAAK,GACTA;AAAA,EACT,SAASU,GAAc;AACrB,UAAIA,aAAe,cAAmB,MAAM,8BAA8B,IACpEA;AAAA,EACR;AACF;AAEO,SAASC,EACdtB,GACAR,GACsB;AACtB,QAAMyB,IACJC,EAAWlB,EAAO,MAAMmB,EAAO,QAAQ,KAAKb,EAAeN,EAAO,MAAMO,EAAW,QAAQ;AAC7F,SAAIU,MAAa,eACR;AAAA,IACL;AAAA,MACE,OAAO;AAAA,MACP,OAAO;AAAA,IAAA;AAAA,EACT,IAGAA,MAAa,cACR;AAAA,IACL;AAAA,MACE,OAAO;AAAA,MACP,OAAO;AAAA,IAAA;AAAA,EACT,IAIU,CAAC,GAAG,IAAI,IAAYzB,CAAS,EAAE,MAAM,EACtC,KAAA,EAAO,IAAI,CAAC+B,OAAU;AAAA,IACjC,OAAOA;AAAA,IACP,OAAOA;AAAA,EAAA,EACP;AACJ;AAEO,SAASC,EAAoBxB,GAAyD;AAC3F,QAAMyB,IAA2BnB,EAAeN,EAAO,MAAMO,EAAW,cAAc;AACtF,MAAI,CAACkB,EAA0B,QAAO,CAAA;AAEtC,MAAI;AAEF,WADuBC,EAA+BD,CAAwB,EACxD,IAAI,CAACE,OAAO;AAAA,MAChC,OAAO,GAAGA,CAAC;AAAA,MACX,OAAOA;AAAA,IAAA,EACP;AAAA,EACJ,SAASN,GAAc;AACrB,mBAAQ;AAAA,MACN,UAAUrB,EAAO,EAAE,iBAAiBO,EAAW,cAAc,kBAAkBkB,CAAwB;AAAA,MACvGJ;AAAA,IAAA,GAEK,CAAA;AAAA,EACT;AACF;AAEO,SAASO,EAAa5B,GAAmC;AAC9D,SACE6B,EAAAA,GAAUC,EAAA,EAA0B,QAAQ,YAAY,QAAQ,MAC/D9B,EAAO,SAAS,WAAWA,EAAO,KAAK,YAAYA,EAAO,KAAK,UAAU,aACzEkB,EAAWlB,EAAO,MAAMmB,EAAO,QAAQ,KACtCb,EAAeN,EAAO,MAAMO,EAAW,QAAQ,OAAO;AAE5D;AAEO,SAASwB,EAAcC,GAAqB7C,GAA+C;AAChG,QAAMS,IAAOT,EAAO;AACpB,UAAQS,GAAA;AAAA,IACN,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,SAAS;AAAA,UACP,UAAU;AAAA,QAAA;AAAA,MACZ;AAAA,IAEJ,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,MAAA;AAAA,IAEd,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,WAAWT,EAAO;AAAA,MAAA;AAAA,IAEtB,KAAK;AACH,aAAO;AAAA,QACL,UAAU6C,IAAa,WAAW;AAAA,QAClC,WAAW7C,EAAO;AAAA,MAAA;AAAA,IAEtB,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,SAAS;AAAA,UACP,UAAU;AAAA,UACV,WAAWA,EAAO;AAAA,QAAA;AAAA,MACpB;AAAA,IAEJ,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,SAAS;AAAA,UACP,UAAU6C,IAAa,WAAW;AAAA,UAClC,WAAW7C,EAAO;AAAA,QAAA;AAAA,MACpB;AAAA,IAEJ,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,WAAWA,EAAO;AAAA,MAAA;AAAA,IAEtB,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,WAAWA,EAAO;AAAA,MAAA;AAAA,IAEtB,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,WAAWA,EAAO;AAAA,MAAA;AAAA,IAEtB,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,WAAWA,EAAO;AAAA,MAAA;AAAA,IAEtB,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,UAAU;AAAA,UACR;AAAA,YACE,UAAUA,EAAO,oBAAoB,mBAAmB;AAAA,YACxD,WAAWA,EAAO;AAAA,UAAA;AAAA,UAEpB;AAAA,YACE,UAAUA,EAAO,oBAAoB,gBAAgB;AAAA,YACrD,WAAWA,EAAO;AAAA,UAAA;AAAA,QACpB;AAAA,MACF;AAAA,IAEJ,KAAK;AACH,aAAO;AAAA,QACL,UAAU6C,IAAa,oBAAoB;AAAA,QAC3C,WAAW7C,EAAO;AAAA,MAAA;AAAA,IAEtB,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,SAAS;AAAA,UACP,UAAU6C,IAAa,oBAAoB;AAAA,UAC3C,WAAW7C,EAAO;AAAA,QAAA;AAAA,MACpB;AAAA,IAEJ,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,OAAOA,EAAO;AAAA,MAAA;AAAA,IAElB,KAAK;AACH,aAAO;AAAA,QACL,UAAU;AAAA,QACV,SAAS;AAAA,UACP,UAAU;AAAA,UACV,OAAOA,EAAO;AAAA,QAAA;AAAA,MAChB;AAAA,IAEJ,KAAK;AACH,aAAO;AAAA,QACL,UAAU6C,IAAa,yBAAyB;AAAA,QAChD,WAAW7C,EAAO;AAAA,QAClB,UAAUA,EAAO;AAAA,QACjB,mBAAmBA,EAAO;AAAA,QAC1B,UAAUA,EAAO;AAAA,MAAA;AAAA,IAErB;AACE,YAAM,MAAM,4BAA4BS,CAAoB,EAAE;AAAA,EAAA;AAEpE;"}

package/dist/components/PlTableFilters/types.d.ts

@@ -1,26 +0,0 @@
-import { ListOption } from '@milaboratories/uikit';
-import { PTableColumnSpec, PlTableFilter, PlDataTableFilterState, PlTableFilterType } from '@platforma-sdk/model';
-export type PlDataTableFiltersSettings = {
-    /** Table columns for the sourceId */
-    columns: PTableColumnSpec[];
-    /** Callback configuring filter options for the column */
-    config: (column: PTableColumnSpec) => {
-        options?: PlTableFilterType[];
-        default?: PlTableFilter;
-    };
-    /** Persisted selection for the sourceId */
-    cachedState: PlDataTableFilterState[];
-};
-export type PlDataTableFilterStateInternal = PlDataTableFilterState & {
-    spec: PTableColumnSpec;
-    filter: null | {
-        value: PlTableFilter;
-        disabled: boolean;
-        open: boolean;
-    };
-    label: string;
-    options: ListOption<PlTableFilterType>[];
-    discreteOptions: ListOption<number | string>[];
-    defaultFilter: PlTableFilter | null;
-};
-//# sourceMappingURL=types.d.ts.map

package/dist/components/PlTableFilters/types.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/components/PlTableFilters/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,KAAK,EACV,gBAAgB,EAChB,aAAa,EACb,sBAAsB,EACtB,iBAAiB,EAClB,MAAM,sBAAsB,CAAC;AAE9B,MAAM,MAAM,0BAA0B,GAAG;IACvC,qCAAqC;IACrC,OAAO,EAAE,gBAAgB,EAAE,CAAC;IAC5B,yDAAyD;IACzD,MAAM,EAAE,CAAC,MAAM,EAAE,gBAAgB,KAAK;QACpC,OAAO,CAAC,EAAE,iBAAiB,EAAE,CAAC;QAC9B,OAAO,CAAC,EAAE,aAAa,CAAC;KACzB,CAAC;IACF,2CAA2C;IAC3C,WAAW,EAAE,sBAAsB,EAAE,CAAC;CACvC,CAAC;AAEF,MAAM,MAAM,8BAA8B,GAAG,sBAAsB,GAAG;IACpE,IAAI,EAAE,gBAAgB,CAAC;IACvB,MAAM,EAAE,IAAI,GAAG;QACb,KAAK,EAAE,aAAa,CAAC;QACrB,QAAQ,EAAE,OAAO,CAAC;QAClB,IAAI,EAAE,OAAO,CAAC;KACf,CAAC;IACF,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,UAAU,CAAC,iBAAiB,CAAC,EAAE,CAAC;IACzC,eAAe,EAAE,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC;IAC/C,aAAa,EAAE,aAAa,GAAG,IAAI,CAAC;CACrC,CAAC"}

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/comparator.js

@@ -1,57 +0,0 @@
-import { __require as q } from "../internal/parse-options.js";
-import { __require as p } from "../internal/re.js";
-import { __require as _ } from "../functions/cmp.js";
-import { __require as d } from "../internal/debug.js";
-import { __require as W } from "./semver.js";
-import { __require as R } from "./range.js";
-var o, m;
-function S() {
-  if (m) return o;
-  m = 1;
-  const t = Symbol("SemVer ANY");
-  class i {
-    static get ANY() {
-      return t;
-    }
-    constructor(r, e) {
-      if (e = h(e), r instanceof i) {
-        if (r.loose === !!e.loose)
-          return r;
-        r = r.value;
-      }
-      r = r.trim().split(/\s+/).join(" "), u("comparator", r, e), this.options = e, this.loose = !!e.loose, this.parse(r), this.semver === t ? this.value = "" : this.value = this.operator + this.semver.version, u("comp", this);
-    }
-    parse(r) {
-      const e = this.options.loose ? n[l.COMPARATORLOOSE] : n[l.COMPARATOR], s = r.match(e);
-      if (!s)
-        throw new TypeError(`Invalid comparator: ${r}`);
-      this.operator = s[1] !== void 0 ? s[1] : "", this.operator === "=" && (this.operator = ""), s[2] ? this.semver = new f(s[2], this.options.loose) : this.semver = t;
-    }
-    toString() {
-      return this.value;
-    }
-    test(r) {
-      if (u("Comparator.test", r, this.options.loose), this.semver === t || r === t)
-        return !0;
-      if (typeof r == "string")
-        try {
-          r = new f(r, this.options);
-        } catch {
-          return !1;
-        }
-      return a(r, this.operator, this.semver, this.options);
-    }
-    intersects(r, e) {
-      if (!(r instanceof i))
-        throw new TypeError("a Comparator is required");
-      return this.operator === "" ? this.value === "" ? !0 : new v(r.value, e).test(this.value) : r.operator === "" ? r.value === "" ? !0 : new v(this.value, e).test(r.semver) : (e = h(e), e.includePrerelease && (this.value === "<0.0.0-0" || r.value === "<0.0.0-0") || !e.includePrerelease && (this.value.startsWith("<0.0.0") || r.value.startsWith("<0.0.0")) ? !1 : !!(this.operator.startsWith(">") && r.operator.startsWith(">") || this.operator.startsWith("<") && r.operator.startsWith("<") || this.semver.version === r.semver.version && this.operator.includes("=") && r.operator.includes("=") || a(this.semver, "<", r.semver, e) && this.operator.startsWith(">") && r.operator.startsWith("<") || a(this.semver, ">", r.semver, e) && this.operator.startsWith("<") && r.operator.startsWith(">")));
-    }
-  }
-  o = i;
-  const h = q(), { safeRe: n, t: l } = p(), a = _(), u = d(), f = W(), v = R();
-  return o;
-}
-export {
-  S as __require
-};
-//# sourceMappingURL=comparator.js.map

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/comparator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"comparator.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/comparator.js"],"sourcesContent":["'use strict'\n\nconst ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n  static get ANY () {\n    return ANY\n  }\n\n  constructor (comp, options) {\n    options = parseOptions(options)\n\n    if (comp instanceof Comparator) {\n      if (comp.loose === !!options.loose) {\n        return comp\n      } else {\n        comp = comp.value\n      }\n    }\n\n    comp = comp.trim().split(/\\s+/).join(' ')\n    debug('comparator', comp, options)\n    this.options = options\n    this.loose = !!options.loose\n    this.parse(comp)\n\n    if (this.semver === ANY) {\n      this.value = ''\n    } else {\n      this.value = this.operator + this.semver.version\n    }\n\n    debug('comp', this)\n  }\n\n  parse (comp) {\n    const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n    const m = comp.match(r)\n\n    if (!m) {\n      throw new TypeError(`Invalid comparator: ${comp}`)\n    }\n\n    this.operator = m[1] !== undefined ? m[1] : ''\n    if (this.operator === '=') {\n      this.operator = ''\n    }\n\n    // if it literally is just '>' or '' then allow anything.\n    if (!m[2]) {\n      this.semver = ANY\n    } else {\n      this.semver = new SemVer(m[2], this.options.loose)\n    }\n  }\n\n  toString () {\n    return this.value\n  }\n\n  test (version) {\n    debug('Comparator.test', version, this.options.loose)\n\n    if (this.semver === ANY || version === ANY) {\n      return true\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    return cmp(version, this.operator, this.semver, this.options)\n  }\n\n  intersects (comp, options) {\n    if (!(comp instanceof Comparator)) {\n      throw new TypeError('a Comparator is required')\n    }\n\n    if (this.operator === '') {\n      if (this.value === '') {\n        return true\n      }\n      return new Range(comp.value, options).test(this.value)\n    } else if (comp.operator === '') {\n      if (comp.value === '') {\n        return true\n      }\n      return new Range(this.value, options).test(comp.semver)\n    }\n\n    options = parseOptions(options)\n\n    // Special cases where nothing can possibly be lower\n    if (options.includePrerelease &&\n      (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n      return false\n    }\n    if (!options.includePrerelease &&\n      (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n      return false\n    }\n\n    // Same direction increasing (> or >=)\n    if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n      return true\n    }\n    // Same direction decreasing (< or <=)\n    if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // same SemVer and both sides are inclusive (<= or >=)\n    if (\n      (this.semver.version === comp.semver.version) &&\n      this.operator.includes('=') && comp.operator.includes('=')) {\n      return true\n    }\n    // opposite directions less than\n    if (cmp(this.semver, '<', comp.semver, options) &&\n      this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // opposite directions greater than\n    if (cmp(this.semver, '>', comp.semver, options) &&\n      this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n      return true\n    }\n    return false\n  }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n"],"names":["ANY","Comparator","comp","options","parseOptions","debug","r","re","t","m","SemVer","version","cmp","Range","comparator","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5"],"mappings":";;;;;;;;;;AAEA,QAAMA,IAAM,OAAO,YAAY;AAAA,EAE/B,MAAMC,EAAW;AAAA,IACf,WAAW,MAAO;AAChB,aAAOD;AAAA,IACX;AAAA,IAEE,YAAaE,GAAMC,GAAS;AAG1B,UAFAA,IAAUC,EAAaD,CAAO,GAE1BD,aAAgBD,GAAY;AAC9B,YAAIC,EAAK,UAAU,CAAC,CAACC,EAAQ;AAC3B,iBAAOD;AAEP,QAAAA,IAAOA,EAAK;AAAA,MAEpB;AAEI,MAAAA,IAAOA,EAAK,KAAI,EAAG,MAAM,KAAK,EAAE,KAAK,GAAG,GACxCG,EAAM,cAAcH,GAAMC,CAAO,GACjC,KAAK,UAAUA,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OACvB,KAAK,MAAMD,CAAI,GAEX,KAAK,WAAWF,IAClB,KAAK,QAAQ,KAEb,KAAK,QAAQ,KAAK,WAAW,KAAK,OAAO,SAG3CK,EAAM,QAAQ,IAAI;AAAA,IACtB;AAAA,IAEE,MAAOH,GAAM;AACX,YAAMI,IAAI,KAAK,QAAQ,QAAQC,EAAGC,EAAE,eAAe,IAAID,EAAGC,EAAE,UAAU,GAChEC,IAAIP,EAAK,MAAMI,CAAC;AAEtB,UAAI,CAACG;AACH,cAAM,IAAI,UAAU,uBAAuBP,CAAI,EAAE;AAGnD,WAAK,WAAWO,EAAE,CAAC,MAAM,SAAYA,EAAE,CAAC,IAAI,IACxC,KAAK,aAAa,QACpB,KAAK,WAAW,KAIbA,EAAE,CAAC,IAGN,KAAK,SAAS,IAAIC,EAAOD,EAAE,CAAC,GAAG,KAAK,QAAQ,KAAK,IAFjD,KAAK,SAAST;AAAA,IAIpB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,KAAMW,GAAS;AAGb,UAFAN,EAAM,mBAAmBM,GAAS,KAAK,QAAQ,KAAK,GAEhD,KAAK,WAAWX,KAAOW,MAAYX;AACrC,eAAO;AAGT,UAAI,OAAOW,KAAY;AACrB,YAAI;AACF,UAAAA,IAAU,IAAID,EAAOC,GAAS,KAAK,OAAO;AAAA,QAClD,QAAmB;AACX,iBAAO;AAAA,QACf;AAGI,aAAOC,EAAID,GAAS,KAAK,UAAU,KAAK,QAAQ,KAAK,OAAO;AAAA,IAChE;AAAA,IAEE,WAAYT,GAAMC,GAAS;AACzB,UAAI,EAAED,aAAgBD;AACpB,cAAM,IAAI,UAAU,0BAA0B;AAGhD,aAAI,KAAK,aAAa,KAChB,KAAK,UAAU,KACV,KAEF,IAAIY,EAAMX,EAAK,OAAOC,CAAO,EAAE,KAAK,KAAK,KAAK,IAC5CD,EAAK,aAAa,KACvBA,EAAK,UAAU,KACV,KAEF,IAAIW,EAAM,KAAK,OAAOV,CAAO,EAAE,KAAKD,EAAK,MAAM,KAGxDC,IAAUC,EAAaD,CAAO,GAG1BA,EAAQ,sBACT,KAAK,UAAU,cAAcD,EAAK,UAAU,eAG3C,CAACC,EAAQ,sBACV,KAAK,MAAM,WAAW,QAAQ,KAAKD,EAAK,MAAM,WAAW,QAAQ,KAC3D,KAIL,QAAK,SAAS,WAAW,GAAG,KAAKA,EAAK,SAAS,WAAW,GAAG,KAI7D,KAAK,SAAS,WAAW,GAAG,KAAKA,EAAK,SAAS,WAAW,GAAG,KAK9D,KAAK,OAAO,YAAYA,EAAK,OAAO,WACrC,KAAK,SAAS,SAAS,GAAG,KAAKA,EAAK,SAAS,SAAS,GAAG,KAIvDU,EAAI,KAAK,QAAQ,KAAKV,EAAK,QAAQC,CAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAKD,EAAK,SAAS,WAAW,GAAG,KAI3DU,EAAI,KAAK,QAAQ,KAAKV,EAAK,QAAQC,CAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAKD,EAAK,SAAS,WAAW,GAAG;AAAA,IAInE;AAAA,EACA;AAEA,EAAAY,IAAiBb;AAEjB,QAAMG,IAAeW,EAAA,GACf,EAAE,QAAQR,GAAI,GAAAC,EAAC,IAAKQ,EAAA,GACpBJ,IAAMK,EAAA,GACNZ,IAAQa,EAAA,GACRR,IAASS,EAAA,GACTN,IAAQO,EAAA;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/range.js

@@ -1,149 +0,0 @@
-import { __require as U } from "../internal/lrucache.js";
-import { __require as V } from "../internal/parse-options.js";
-import { __require as K } from "./comparator.js";
-import { __require as B } from "../internal/debug.js";
-import { __require as J } from "./semver.js";
-import { __require as Q } from "../internal/re.js";
-import { __require as W } from "../internal/constants.js";
-var A, w;
-function le() {
-  if (w) return A;
-  w = 1;
-  const C = /\s+/g;
-  class E {
-    constructor(e, i) {
-      if (i = _(i), e instanceof E)
-        return e.loose === !!i.loose && e.includePrerelease === !!i.includePrerelease ? e : new E(e.raw, i);
-      if (e instanceof p)
-        return this.raw = e.value, this.set = [[e]], this.formatted = void 0, this;
-      if (this.options = i, this.loose = !!i.loose, this.includePrerelease = !!i.includePrerelease, this.raw = e.trim().replace(C, " "), this.set = this.raw.split("||").map((t) => this.parseRange(t.trim())).filter((t) => t.length), !this.set.length)
-        throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
-      if (this.set.length > 1) {
-        const t = this.set[0];
-        if (this.set = this.set.filter((l) => !S(l[0])), this.set.length === 0)
-          this.set = [t];
-        else if (this.set.length > 1) {
-          for (const l of this.set)
-            if (l.length === 1 && x(l[0])) {
-              this.set = [l];
-              break;
-            }
-        }
-      }
-      this.formatted = void 0;
-    }
-    get range() {
-      if (this.formatted === void 0) {
-        this.formatted = "";
-        for (let e = 0; e < this.set.length; e++) {
-          e > 0 && (this.formatted += "||");
-          const i = this.set[e];
-          for (let t = 0; t < i.length; t++)
-            t > 0 && (this.formatted += " "), this.formatted += i[t].toString().trim();
-        }
-      }
-      return this.formatted;
-    }
-    format() {
-      return this.range;
-    }
-    toString() {
-      return this.range;
-    }
-    parseRange(e) {
-      const t = ((this.options.includePrerelease && v) | (this.options.loose && N)) + ":" + e, l = O.get(t);
-      if (l)
-        return l;
-      const s = this.options.loose, n = s ? d[u.HYPHENRANGELOOSE] : d[u.HYPHENRANGE];
-      e = e.replace(n, z(this.options.includePrerelease)), f("hyphen replace", e), e = e.replace(d[u.COMPARATORTRIM], y), f("comparator trim", e), e = e.replace(d[u.TILDETRIM], G), f("tilde trim", e), e = e.replace(d[u.CARETTRIM], m), f("caret trim", e);
-      let $ = e.split(" ").map((o) => I(o, this.options)).join(" ").split(/\s+/).map((o) => k(o, this.options));
-      s && ($ = $.filter((o) => (f("loose invalid filter", o, this.options), !!o.match(d[u.COMPARATORLOOSE])))), f("range list", $);
-      const a = /* @__PURE__ */ new Map(), c = $.map((o) => new p(o, this.options));
-      for (const o of c) {
-        if (S(o))
-          return [o];
-        a.set(o.value, o);
-      }
-      a.size > 1 && a.has("") && a.delete("");
-      const R = [...a.values()];
-      return O.set(t, R), R;
-    }
-    intersects(e, i) {
-      if (!(e instanceof E))
-        throw new TypeError("a Range is required");
-      return this.set.some((t) => q(t, i) && e.set.some((l) => q(l, i) && t.every((s) => l.every((n) => s.intersects(n, i)))));
-    }
-    // if ANY of the sets match ALL of its comparators, then pass
-    test(e) {
-      if (!e)
-        return !1;
-      if (typeof e == "string")
-        try {
-          e = new P(e, this.options);
-        } catch {
-          return !1;
-        }
-      for (let i = 0; i < this.set.length; i++)
-        if (F(this.set[i], e, this.options))
-          return !0;
-      return !1;
-    }
-  }
-  A = E;
-  const L = U(), O = new L(), _ = V(), p = K(), f = B(), P = J(), {
-    safeRe: d,
-    t: u,
-    comparatorTrimReplace: y,
-    tildeTrimReplace: G,
-    caretTrimReplace: m
-  } = Q(), { FLAG_INCLUDE_PRERELEASE: v, FLAG_LOOSE: N } = W(), S = (r) => r.value === "<0.0.0-0", x = (r) => r.value === "", q = (r, e) => {
-    let i = !0;
-    const t = r.slice();
-    let l = t.pop();
-    for (; i && t.length; )
-      i = t.every((s) => l.intersects(s, e)), l = t.pop();
-    return i;
-  }, I = (r, e) => (f("comp", r, e), r = j(r, e), f("caret", r), r = X(r, e), f("tildes", r), r = D(r, e), f("xrange", r), r = Y(r, e), f("stars", r), r), h = (r) => !r || r.toLowerCase() === "x" || r === "*", X = (r, e) => r.trim().split(/\s+/).map((i) => g(i, e)).join(" "), g = (r, e) => {
-    const i = e.loose ? d[u.TILDELOOSE] : d[u.TILDE];
-    return r.replace(i, (t, l, s, n, $) => {
-      f("tilde", r, t, l, s, n, $);
-      let a;
-      return h(l) ? a = "" : h(s) ? a = `>=${l}.0.0 <${+l + 1}.0.0-0` : h(n) ? a = `>=${l}.${s}.0 <${l}.${+s + 1}.0-0` : $ ? (f("replaceTilde pr", $), a = `>=${l}.${s}.${n}-${$} <${l}.${+s + 1}.0-0`) : a = `>=${l}.${s}.${n} <${l}.${+s + 1}.0-0`, f("tilde return", a), a;
-    });
-  }, j = (r, e) => r.trim().split(/\s+/).map((i) => b(i, e)).join(" "), b = (r, e) => {
-    f("caret", r, e);
-    const i = e.loose ? d[u.CARETLOOSE] : d[u.CARET], t = e.includePrerelease ? "-0" : "";
-    return r.replace(i, (l, s, n, $, a) => {
-      f("caret", r, l, s, n, $, a);
-      let c;
-      return h(s) ? c = "" : h(n) ? c = `>=${s}.0.0${t} <${+s + 1}.0.0-0` : h($) ? s === "0" ? c = `>=${s}.${n}.0${t} <${s}.${+n + 1}.0-0` : c = `>=${s}.${n}.0${t} <${+s + 1}.0.0-0` : a ? (f("replaceCaret pr", a), s === "0" ? n === "0" ? c = `>=${s}.${n}.${$}-${a} <${s}.${n}.${+$ + 1}-0` : c = `>=${s}.${n}.${$}-${a} <${s}.${+n + 1}.0-0` : c = `>=${s}.${n}.${$}-${a} <${+s + 1}.0.0-0`) : (f("no pr"), s === "0" ? n === "0" ? c = `>=${s}.${n}.${$}${t} <${s}.${n}.${+$ + 1}-0` : c = `>=${s}.${n}.${$}${t} <${s}.${+n + 1}.0-0` : c = `>=${s}.${n}.${$} <${+s + 1}.0.0-0`), f("caret return", c), c;
-    });
-  }, D = (r, e) => (f("replaceXRanges", r, e), r.split(/\s+/).map((i) => H(i, e)).join(" ")), H = (r, e) => {
-    r = r.trim();
-    const i = e.loose ? d[u.XRANGELOOSE] : d[u.XRANGE];
-    return r.replace(i, (t, l, s, n, $, a) => {
-      f("xRange", r, t, l, s, n, $, a);
-      const c = h(s), R = c || h(n), o = R || h($), T = o;
-      return l === "=" && T && (l = ""), a = e.includePrerelease ? "-0" : "", c ? l === ">" || l === "<" ? t = "<0.0.0-0" : t = "*" : l && T ? (R && (n = 0), $ = 0, l === ">" ? (l = ">=", R ? (s = +s + 1, n = 0, $ = 0) : (n = +n + 1, $ = 0)) : l === "<=" && (l = "<", R ? s = +s + 1 : n = +n + 1), l === "<" && (a = "-0"), t = `${l + s}.${n}.${$}${a}`) : R ? t = `>=${s}.0.0${a} <${+s + 1}.0.0-0` : o && (t = `>=${s}.${n}.0${a} <${s}.${+n + 1}.0-0`), f("xRange return", t), t;
-    });
-  }, Y = (r, e) => (f("replaceStars", r, e), r.trim().replace(d[u.STAR], "")), k = (r, e) => (f("replaceGTE0", r, e), r.trim().replace(d[e.includePrerelease ? u.GTE0PRE : u.GTE0], "")), z = (r) => (e, i, t, l, s, n, $, a, c, R, o, T) => (h(t) ? i = "" : h(l) ? i = `>=${t}.0.0${r ? "-0" : ""}` : h(s) ? i = `>=${t}.${l}.0${r ? "-0" : ""}` : n ? i = `>=${i}` : i = `>=${i}${r ? "-0" : ""}`, h(c) ? a = "" : h(R) ? a = `<${+c + 1}.0.0-0` : h(o) ? a = `<${c}.${+R + 1}.0-0` : T ? a = `<=${c}.${R}.${o}-${T}` : r ? a = `<${c}.${R}.${+o + 1}-0` : a = `<=${a}`, `${i} ${a}`.trim()), F = (r, e, i) => {
-    for (let t = 0; t < r.length; t++)
-      if (!r[t].test(e))
-        return !1;
-    if (e.prerelease.length && !i.includePrerelease) {
-      for (let t = 0; t < r.length; t++)
-        if (f(r[t].semver), r[t].semver !== p.ANY && r[t].semver.prerelease.length > 0) {
-          const l = r[t].semver;
-          if (l.major === e.major && l.minor === e.minor && l.patch === e.patch)
-            return !0;
-        }
-      return !1;
-    }
-    return !0;
-  };
-  return A;
-}
-export {
-  le as __require
-};
-//# sourceMappingURL=range.js.map

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/range.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"range.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/range.js"],"sourcesContent":["'use strict'\n\nconst SPACE_CHARACTERS = /\\s+/g\n\n// hoisted class for cyclic dependency\nclass Range {\n  constructor (range, options) {\n    options = parseOptions(options)\n\n    if (range instanceof Range) {\n      if (\n        range.loose === !!options.loose &&\n        range.includePrerelease === !!options.includePrerelease\n      ) {\n        return range\n      } else {\n        return new Range(range.raw, options)\n      }\n    }\n\n    if (range instanceof Comparator) {\n      // just put it in the set and return\n      this.raw = range.value\n      this.set = [[range]]\n      this.formatted = undefined\n      return this\n    }\n\n    this.options = options\n    this.loose = !!options.loose\n    this.includePrerelease = !!options.includePrerelease\n\n    // First reduce all whitespace as much as possible so we do not have to rely\n    // on potentially slow regexes like \\s*. This is then stored and used for\n    // future error messages as well.\n    this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')\n\n    // First, split on ||\n    this.set = this.raw\n      .split('||')\n      // map the range to a 2d array of comparators\n      .map(r => this.parseRange(r.trim()))\n      // throw out any comparator lists that are empty\n      // this generally means that it was not a valid range, which is allowed\n      // in loose mode, but will still throw if the WHOLE range is invalid.\n      .filter(c => c.length)\n\n    if (!this.set.length) {\n      throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n    }\n\n    // if we have any that are not the null set, throw out null sets.\n    if (this.set.length > 1) {\n      // keep the first one, in case they're all null sets\n      const first = this.set[0]\n      this.set = this.set.filter(c => !isNullSet(c[0]))\n      if (this.set.length === 0) {\n        this.set = [first]\n      } else if (this.set.length > 1) {\n        // if we have any that are *, then the range is just *\n        for (const c of this.set) {\n          if (c.length === 1 && isAny(c[0])) {\n            this.set = [c]\n            break\n          }\n        }\n      }\n    }\n\n    this.formatted = undefined\n  }\n\n  get range () {\n    if (this.formatted === undefined) {\n      this.formatted = ''\n      for (let i = 0; i < this.set.length; i++) {\n        if (i > 0) {\n          this.formatted += '||'\n        }\n        const comps = this.set[i]\n        for (let k = 0; k < comps.length; k++) {\n          if (k > 0) {\n            this.formatted += ' '\n          }\n          this.formatted += comps[k].toString().trim()\n        }\n      }\n    }\n    return this.formatted\n  }\n\n  format () {\n    return this.range\n  }\n\n  toString () {\n    return this.range\n  }\n\n  parseRange (range) {\n    // memoize range parsing for performance.\n    // this is a very hot path, and fully deterministic.\n    const memoOpts =\n      (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n      (this.options.loose && FLAG_LOOSE)\n    const memoKey = memoOpts + ':' + range\n    const cached = cache.get(memoKey)\n    if (cached) {\n      return cached\n    }\n\n    const loose = this.options.loose\n    // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n    const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n    range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n    debug('hyphen replace', range)\n\n    // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n    range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n    debug('comparator trim', range)\n\n    // `~ 1.2.3` => `~1.2.3`\n    range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n    debug('tilde trim', range)\n\n    // `^ 1.2.3` => `^1.2.3`\n    range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n    debug('caret trim', range)\n\n    // At this point, the range is completely trimmed and\n    // ready to be split into comparators.\n\n    let rangeList = range\n      .split(' ')\n      .map(comp => parseComparator(comp, this.options))\n      .join(' ')\n      .split(/\\s+/)\n      // >=0.0.0 is equivalent to *\n      .map(comp => replaceGTE0(comp, this.options))\n\n    if (loose) {\n      // in loose mode, throw out any that are not valid comparators\n      rangeList = rangeList.filter(comp => {\n        debug('loose invalid filter', comp, this.options)\n        return !!comp.match(re[t.COMPARATORLOOSE])\n      })\n    }\n    debug('range list', rangeList)\n\n    // if any comparators are the null set, then replace with JUST null set\n    // if more than one comparator, remove any * comparators\n    // also, don't include the same comparator more than once\n    const rangeMap = new Map()\n    const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n    for (const comp of comparators) {\n      if (isNullSet(comp)) {\n        return [comp]\n      }\n      rangeMap.set(comp.value, comp)\n    }\n    if (rangeMap.size > 1 && rangeMap.has('')) {\n      rangeMap.delete('')\n    }\n\n    const result = [...rangeMap.values()]\n    cache.set(memoKey, result)\n    return result\n  }\n\n  intersects (range, options) {\n    if (!(range instanceof Range)) {\n      throw new TypeError('a Range is required')\n    }\n\n    return this.set.some((thisComparators) => {\n      return (\n        isSatisfiable(thisComparators, options) &&\n        range.set.some((rangeComparators) => {\n          return (\n            isSatisfiable(rangeComparators, options) &&\n            thisComparators.every((thisComparator) => {\n              return rangeComparators.every((rangeComparator) => {\n                return thisComparator.intersects(rangeComparator, options)\n              })\n            })\n          )\n        })\n      )\n    })\n  }\n\n  // if ANY of the sets match ALL of its comparators, then pass\n  test (version) {\n    if (!version) {\n      return false\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    for (let i = 0; i < this.set.length; i++) {\n      if (testSet(this.set[i], version, this.options)) {\n        return true\n      }\n    }\n    return false\n  }\n}\n\nmodule.exports = Range\n\nconst LRU = require('../internal/lrucache')\nconst cache = new LRU()\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n  safeRe: re,\n  t,\n  comparatorTrimReplace,\n  tildeTrimReplace,\n  caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n  let result = true\n  const remainingComparators = comparators.slice()\n  let testComparator = remainingComparators.pop()\n\n  while (result && remainingComparators.length) {\n    result = remainingComparators.every((otherComparator) => {\n      return testComparator.intersects(otherComparator, options)\n    })\n\n    testComparator = remainingComparators.pop()\n  }\n\n  return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n  debug('comp', comp, options)\n  comp = replaceCarets(comp, options)\n  debug('caret', comp)\n  comp = replaceTildes(comp, options)\n  debug('tildes', comp)\n  comp = replaceXRanges(comp, options)\n  debug('xrange', comp)\n  comp = replaceStars(comp, options)\n  debug('stars', comp)\n  return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceTilde(c, options))\n    .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n  const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('tilde', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      // ~1.2 == >=1.2.0 <1.3.0-0\n      ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n    } else if (pr) {\n      debug('replaceTilde pr', pr)\n      ret = `>=${M}.${m}.${p}-${pr\n      } <${M}.${+m + 1}.0-0`\n    } else {\n      // ~1.2.3 == >=1.2.3 <1.3.0-0\n      ret = `>=${M}.${m}.${p\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('tilde return', ret)\n    return ret\n  })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceCaret(c, options))\n    .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n  debug('caret', comp, options)\n  const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n  const z = options.includePrerelease ? '-0' : ''\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('caret', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      if (M === '0') {\n        ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n      } else {\n        ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n      }\n    } else if (pr) {\n      debug('replaceCaret pr', pr)\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p}-${pr\n        } <${+M + 1}.0.0-0`\n      }\n    } else {\n      debug('no pr')\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p\n        } <${+M + 1}.0.0-0`\n      }\n    }\n\n    debug('caret return', ret)\n    return ret\n  })\n}\n\nconst replaceXRanges = (comp, options) => {\n  debug('replaceXRanges', comp, options)\n  return comp\n    .split(/\\s+/)\n    .map((c) => replaceXRange(c, options))\n    .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n  comp = comp.trim()\n  const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n    debug('xRange', comp, ret, gtlt, M, m, p, pr)\n    const xM = isX(M)\n    const xm = xM || isX(m)\n    const xp = xm || isX(p)\n    const anyX = xp\n\n    if (gtlt === '=' && anyX) {\n      gtlt = ''\n    }\n\n    // if we're including prereleases in the match, then we need\n    // to fix this to -0, the lowest possible prerelease value\n    pr = options.includePrerelease ? '-0' : ''\n\n    if (xM) {\n      if (gtlt === '>' || gtlt === '<') {\n        // nothing is allowed\n        ret = '<0.0.0-0'\n      } else {\n        // nothing is forbidden\n        ret = '*'\n      }\n    } else if (gtlt && anyX) {\n      // we know patch is an x, because we have any x at all.\n      // replace X with 0\n      if (xm) {\n        m = 0\n      }\n      p = 0\n\n      if (gtlt === '>') {\n        // >1 => >=2.0.0\n        // >1.2 => >=1.3.0\n        gtlt = '>='\n        if (xm) {\n          M = +M + 1\n          m = 0\n          p = 0\n        } else {\n          m = +m + 1\n          p = 0\n        }\n      } else if (gtlt === '<=') {\n        // <=0.7.x is actually <0.8.0, since any 0.7.x should\n        // pass.  Similarly, <=7.x is actually <8.0.0, etc.\n        gtlt = '<'\n        if (xm) {\n          M = +M + 1\n        } else {\n          m = +m + 1\n        }\n      }\n\n      if (gtlt === '<') {\n        pr = '-0'\n      }\n\n      ret = `${gtlt + M}.${m}.${p}${pr}`\n    } else if (xm) {\n      ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n    } else if (xp) {\n      ret = `>=${M}.${m}.0${pr\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('xRange return', ret)\n\n    return ret\n  })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n  debug('replaceStars', comp, options)\n  // Looseness is ignored here.  star is always as loose as it gets!\n  return comp\n    .trim()\n    .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n  debug('replaceGTE0', comp, options)\n  return comp\n    .trim()\n    .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\n// TODO build?\nconst hyphenReplace = incPr => ($0,\n  from, fM, fm, fp, fpr, fb,\n  to, tM, tm, tp, tpr) => {\n  if (isX(fM)) {\n    from = ''\n  } else if (isX(fm)) {\n    from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n  } else if (isX(fp)) {\n    from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n  } else if (fpr) {\n    from = `>=${from}`\n  } else {\n    from = `>=${from}${incPr ? '-0' : ''}`\n  }\n\n  if (isX(tM)) {\n    to = ''\n  } else if (isX(tm)) {\n    to = `<${+tM + 1}.0.0-0`\n  } else if (isX(tp)) {\n    to = `<${tM}.${+tm + 1}.0-0`\n  } else if (tpr) {\n    to = `<=${tM}.${tm}.${tp}-${tpr}`\n  } else if (incPr) {\n    to = `<${tM}.${tm}.${+tp + 1}-0`\n  } else {\n    to = `<=${to}`\n  }\n\n  return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n  for (let i = 0; i < set.length; i++) {\n    if (!set[i].test(version)) {\n      return false\n    }\n  }\n\n  if (version.prerelease.length && !options.includePrerelease) {\n    // Find the set of versions that are allowed to have prereleases\n    // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n    // That should allow `1.2.3-pr.2` to pass.\n    // However, `1.2.4-alpha.notready` should NOT be allowed,\n    // even though it's within the range set by the comparators.\n    for (let i = 0; i < set.length; i++) {\n      debug(set[i].semver)\n      if (set[i].semver === Comparator.ANY) {\n        continue\n      }\n\n      if (set[i].semver.prerelease.length > 0) {\n        const allowed = set[i].semver\n        if (allowed.major === version.major &&\n            allowed.minor === version.minor &&\n            allowed.patch === version.patch) {\n          return true\n        }\n      }\n    }\n\n    // Version has a -pre, but it's not one of the ones we like.\n    return false\n  }\n\n  return true\n}\n"],"names":["SPACE_CHARACTERS","Range","range","options","parseOptions","Comparator","r","c","first","isNullSet","isAny","i","comps","k","memoKey","FLAG_INCLUDE_PRERELEASE","FLAG_LOOSE","cached","cache","loose","hr","re","t","hyphenReplace","debug","comparatorTrimReplace","tildeTrimReplace","caretTrimReplace","rangeList","comp","parseComparator","replaceGTE0","rangeMap","comparators","result","thisComparators","isSatisfiable","rangeComparators","thisComparator","rangeComparator","version","SemVer","testSet","LRU","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","remainingComparators","testComparator","otherComparator","replaceCarets","replaceTildes","replaceXRanges","replaceStars","isX","id","replaceTilde","_","M","m","p","pr","ret","replaceCaret","z","replaceXRange","gtlt","xM","xm","xp","anyX","incPr","$0","from","fM","fm","fp","fpr","fb","to","tM","tm","tp","tpr","set","allowed"],"mappings":";;;;;;;;;;;AAEA,QAAMA,IAAmB;AAAA,EAGzB,MAAMC,EAAM;AAAA,IACV,YAAaC,GAAOC,GAAS;AAG3B,UAFAA,IAAUC,EAAaD,CAAO,GAE1BD,aAAiBD;AACnB,eACEC,EAAM,UAAU,CAAC,CAACC,EAAQ,SAC1BD,EAAM,sBAAsB,CAAC,CAACC,EAAQ,oBAE/BD,IAEA,IAAID,EAAMC,EAAM,KAAKC,CAAO;AAIvC,UAAID,aAAiBG;AAEnB,oBAAK,MAAMH,EAAM,OACjB,KAAK,MAAM,CAAC,CAACA,CAAK,CAAC,GACnB,KAAK,YAAY,QACV;AAsBT,UAnBA,KAAK,UAAUC,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OACvB,KAAK,oBAAoB,CAAC,CAACA,EAAQ,mBAKnC,KAAK,MAAMD,EAAM,KAAI,EAAG,QAAQF,GAAkB,GAAG,GAGrD,KAAK,MAAM,KAAK,IACb,MAAM,IAAI,EAEV,IAAI,CAAAM,MAAK,KAAK,WAAWA,EAAE,KAAI,CAAE,CAAC,EAIlC,OAAO,CAAAC,MAAKA,EAAE,MAAM,GAEnB,CAAC,KAAK,IAAI;AACZ,cAAM,IAAI,UAAU,yBAAyB,KAAK,GAAG,EAAE;AAIzD,UAAI,KAAK,IAAI,SAAS,GAAG;AAEvB,cAAMC,IAAQ,KAAK,IAAI,CAAC;AAExB,YADA,KAAK,MAAM,KAAK,IAAI,OAAO,CAAAD,MAAK,CAACE,EAAUF,EAAE,CAAC,CAAC,CAAC,GAC5C,KAAK,IAAI,WAAW;AACtB,eAAK,MAAM,CAACC,CAAK;AAAA,iBACR,KAAK,IAAI,SAAS;AAE3B,qBAAWD,KAAK,KAAK;AACnB,gBAAIA,EAAE,WAAW,KAAKG,EAAMH,EAAE,CAAC,CAAC,GAAG;AACjC,mBAAK,MAAM,CAACA,CAAC;AACb;AAAA,YACZ;AAAA;AAAA,MAGA;AAEI,WAAK,YAAY;AAAA,IACrB;AAAA,IAEE,IAAI,QAAS;AACX,UAAI,KAAK,cAAc,QAAW;AAChC,aAAK,YAAY;AACjB,iBAASI,IAAI,GAAGA,IAAI,KAAK,IAAI,QAAQA,KAAK;AACxC,UAAIA,IAAI,MACN,KAAK,aAAa;AAEpB,gBAAMC,IAAQ,KAAK,IAAID,CAAC;AACxB,mBAASE,IAAI,GAAGA,IAAID,EAAM,QAAQC;AAChC,YAAIA,IAAI,MACN,KAAK,aAAa,MAEpB,KAAK,aAAaD,EAAMC,CAAC,EAAE,SAAQ,EAAG,KAAI;AAAA,QAEpD;AAAA,MACA;AACI,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,SAAU;AACR,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,WAAYX,GAAO;AAMjB,YAAMY,MAFH,KAAK,QAAQ,qBAAqBC,MAClC,KAAK,QAAQ,SAASC,MACE,MAAMd,GAC3Be,IAASC,EAAM,IAAIJ,CAAO;AAChC,UAAIG;AACF,eAAOA;AAGT,YAAME,IAAQ,KAAK,QAAQ,OAErBC,IAAKD,IAAQE,EAAGC,EAAE,gBAAgB,IAAID,EAAGC,EAAE,WAAW;AAC5D,MAAApB,IAAQA,EAAM,QAAQkB,GAAIG,EAAc,KAAK,QAAQ,iBAAiB,CAAC,GACvEC,EAAM,kBAAkBtB,CAAK,GAG7BA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,cAAc,GAAGG,CAAqB,GACjED,EAAM,mBAAmBtB,CAAK,GAG9BA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,SAAS,GAAGI,CAAgB,GACvDF,EAAM,cAActB,CAAK,GAGzBA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,SAAS,GAAGK,CAAgB,GACvDH,EAAM,cAActB,CAAK;AAKzB,UAAI0B,IAAY1B,EACb,MAAM,GAAG,EACT,IAAI,CAAA2B,MAAQC,EAAgBD,GAAM,KAAK,OAAO,CAAC,EAC/C,KAAK,GAAG,EACR,MAAM,KAAK,EAEX,IAAI,CAAAA,MAAQE,EAAYF,GAAM,KAAK,OAAO,CAAC;AAE9C,MAAIV,MAEFS,IAAYA,EAAU,OAAO,CAAAC,OAC3BL,EAAM,wBAAwBK,GAAM,KAAK,OAAO,GACzC,CAAC,CAACA,EAAK,MAAMR,EAAGC,EAAE,eAAe,CAAC,EAC1C,IAEHE,EAAM,cAAcI,CAAS;AAK7B,YAAMI,IAAW,oBAAI,IAAG,GAClBC,IAAcL,EAAU,IAAI,CAAAC,MAAQ,IAAIxB,EAAWwB,GAAM,KAAK,OAAO,CAAC;AAC5E,iBAAWA,KAAQI,GAAa;AAC9B,YAAIxB,EAAUoB,CAAI;AAChB,iBAAO,CAACA,CAAI;AAEd,QAAAG,EAAS,IAAIH,EAAK,OAAOA,CAAI;AAAA,MACnC;AACI,MAAIG,EAAS,OAAO,KAAKA,EAAS,IAAI,EAAE,KACtCA,EAAS,OAAO,EAAE;AAGpB,YAAME,IAAS,CAAC,GAAGF,EAAS,OAAM,CAAE;AACpC,aAAAd,EAAM,IAAIJ,GAASoB,CAAM,GAClBA;AAAA,IACX;AAAA,IAEE,WAAYhC,GAAOC,GAAS;AAC1B,UAAI,EAAED,aAAiBD;AACrB,cAAM,IAAI,UAAU,qBAAqB;AAG3C,aAAO,KAAK,IAAI,KAAK,CAACkC,MAElBC,EAAcD,GAAiBhC,CAAO,KACtCD,EAAM,IAAI,KAAK,CAACmC,MAEZD,EAAcC,GAAkBlC,CAAO,KACvCgC,EAAgB,MAAM,CAACG,MACdD,EAAiB,MAAM,CAACE,MACtBD,EAAe,WAAWC,GAAiBpC,CAAO,CAC1D,CACF,CAEJ,CAEJ;AAAA,IACL;AAAA;AAAA,IAGE,KAAMqC,GAAS;AACb,UAAI,CAACA;AACH,eAAO;AAGT,UAAI,OAAOA,KAAY;AACrB,YAAI;AACF,UAAAA,IAAU,IAAIC,EAAOD,GAAS,KAAK,OAAO;AAAA,QAClD,QAAmB;AACX,iBAAO;AAAA,QACf;AAGI,eAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ;AACnC,YAAIE,EAAQ,KAAK,IAAI,CAAC,GAAGF,GAAS,KAAK,OAAO;AAC5C,iBAAO;AAGX,aAAO;AAAA,IACX;AAAA,EACA;AAEA,EAAAtC,IAAiBD;AAEjB,QAAM0C,IAAMC,EAAA,GACN1B,IAAQ,IAAIyB,EAAG,GAEfvC,IAAeyC,EAAA,GACfxC,IAAayC,EAAA,GACbtB,IAAQuB,EAAA,GACRN,IAASO,EAAA,GACT;AAAA,IACJ,QAAQ3B;AAAA,IACR,GAAAC;AAAA,IACA,uBAAAG;AAAA,IACA,kBAAAC;AAAA,IACA,kBAAAC;AAAA,EACF,IAAIsB,EAAA,GACE,EAAE,yBAAAlC,GAAyB,YAAAC,EAAU,IAAKkC,EAAA,GAE1CzC,IAAY,CAAAF,MAAKA,EAAE,UAAU,YAC7BG,IAAQ,CAAAH,MAAKA,EAAE,UAAU,IAIzB6B,IAAgB,CAACH,GAAa9B,MAAY;AAC9C,QAAI+B,IAAS;AACb,UAAMiB,IAAuBlB,EAAY,MAAK;AAC9C,QAAImB,IAAiBD,EAAqB,IAAG;AAE7C,WAAOjB,KAAUiB,EAAqB;AACpC,MAAAjB,IAASiB,EAAqB,MAAM,CAACE,MAC5BD,EAAe,WAAWC,GAAiBlD,CAAO,CAC1D,GAEDiD,IAAiBD,EAAqB,IAAG;AAG3C,WAAOjB;AAAA,EACT,GAKMJ,IAAkB,CAACD,GAAM1B,OAC7BqB,EAAM,QAAQK,GAAM1B,CAAO,GAC3B0B,IAAOyB,EAAczB,GAAM1B,CAAO,GAClCqB,EAAM,SAASK,CAAI,GACnBA,IAAO0B,EAAc1B,GAAM1B,CAAO,GAClCqB,EAAM,UAAUK,CAAI,GACpBA,IAAO2B,EAAe3B,GAAM1B,CAAO,GACnCqB,EAAM,UAAUK,CAAI,GACpBA,IAAO4B,EAAa5B,GAAM1B,CAAO,GACjCqB,EAAM,SAASK,CAAI,GACZA,IAGH6B,IAAM,CAAAC,MAAM,CAACA,KAAMA,EAAG,YAAW,MAAO,OAAOA,MAAO,KAStDJ,IAAgB,CAAC1B,GAAM1B,MACpB0B,EACJ,KAAI,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAMqD,EAAarD,GAAGJ,CAAO,CAAC,EACnC,KAAK,GAAG,GAGPyD,IAAe,CAAC/B,GAAM1B,MAAY;AACtC,UAAMG,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,UAAU,IAAID,EAAGC,EAAE,KAAK;AACvD,WAAOO,EAAK,QAAQvB,GAAG,CAACuD,GAAGC,GAAGC,GAAGC,GAAGC,MAAO;AACzC,MAAAzC,EAAM,SAASK,GAAMgC,GAAGC,GAAGC,GAAGC,GAAGC,CAAE;AACnC,UAAIC;AAEJ,aAAIR,EAAII,CAAC,IACPI,IAAM,KACGR,EAAIK,CAAC,IACdG,IAAM,KAAKJ,CAAC,SAAS,CAACA,IAAI,CAAC,WAClBJ,EAAIM,CAAC,IAEdE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,OAAOD,CAAC,IAAI,CAACC,IAAI,CAAC,SAC1BE,KACTzC,EAAM,mBAAmByC,CAAE,GAC3BC,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,MACrBH,CAAC,IAAI,CAACC,IAAI,CAAC,UAGhBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,MAChBF,CAAC,IAAI,CAACC,IAAI,CAAC,QAGlBvC,EAAM,gBAAgB0C,CAAG,GAClBA;AAAA,IACX,CAAG;AAAA,EACH,GAUMZ,IAAgB,CAACzB,GAAM1B,MACpB0B,EACJ,KAAI,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAM4D,EAAa5D,GAAGJ,CAAO,CAAC,EACnC,KAAK,GAAG,GAGPgE,IAAe,CAACtC,GAAM1B,MAAY;AACtC,IAAAqB,EAAM,SAASK,GAAM1B,CAAO;AAC5B,UAAMG,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,UAAU,IAAID,EAAGC,EAAE,KAAK,GACjD8C,IAAIjE,EAAQ,oBAAoB,OAAO;AAC7C,WAAO0B,EAAK,QAAQvB,GAAG,CAACuD,GAAGC,GAAGC,GAAGC,GAAGC,MAAO;AACzC,MAAAzC,EAAM,SAASK,GAAMgC,GAAGC,GAAGC,GAAGC,GAAGC,CAAE;AACnC,UAAIC;AAEJ,aAAIR,EAAII,CAAC,IACPI,IAAM,KACGR,EAAIK,CAAC,IACdG,IAAM,KAAKJ,CAAC,OAAOM,CAAC,KAAK,CAACN,IAAI,CAAC,WACtBJ,EAAIM,CAAC,IACVF,MAAM,MACRI,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAKN,CAAC,IAAI,CAACC,IAAI,CAAC,SAEvCG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAK,CAACN,IAAI,CAAC,WAE3BG,KACTzC,EAAM,mBAAmByC,CAAE,GACvBH,MAAM,MACJC,MAAM,MACRG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CACpC,KAAeH,CAAC,IAAIC,CAAC,IAAI,CAACC,IAAI,CAAC,OAErBE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,MACrBH,CAAC,IAAI,CAACC,IAAI,CAAC,SAGlBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CAClC,KAAa,CAACH,IAAI,CAAC,aAGbtC,EAAM,OAAO,GACTsC,MAAM,MACJC,MAAM,MACRG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC/B,GAAaI,CAAC,KAAKN,CAAC,IAAIC,CAAC,IAAI,CAACC,IAAI,CAAC,OAEzBE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC/B,GAAaI,CAAC,KAAKN,CAAC,IAAI,CAACC,IAAI,CAAC,SAGtBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC7B,KAAa,CAACF,IAAI,CAAC,WAIftC,EAAM,gBAAgB0C,CAAG,GAClBA;AAAA,IACX,CAAG;AAAA,EACH,GAEMV,IAAiB,CAAC3B,GAAM1B,OAC5BqB,EAAM,kBAAkBK,GAAM1B,CAAO,GAC9B0B,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAM8D,EAAc9D,GAAGJ,CAAO,CAAC,EACpC,KAAK,GAAG,IAGPkE,IAAgB,CAACxC,GAAM1B,MAAY;AACvC,IAAA0B,IAAOA,EAAK,KAAI;AAChB,UAAMvB,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,WAAW,IAAID,EAAGC,EAAE,MAAM;AACzD,WAAOO,EAAK,QAAQvB,GAAG,CAAC4D,GAAKI,GAAMR,GAAGC,GAAGC,GAAGC,MAAO;AACjD,MAAAzC,EAAM,UAAUK,GAAMqC,GAAKI,GAAMR,GAAGC,GAAGC,GAAGC,CAAE;AAC5C,YAAMM,IAAKb,EAAII,CAAC,GACVU,IAAKD,KAAMb,EAAIK,CAAC,GAChBU,IAAKD,KAAMd,EAAIM,CAAC,GAChBU,IAAOD;AAEb,aAAIH,MAAS,OAAOI,MAClBJ,IAAO,KAKTL,IAAK9D,EAAQ,oBAAoB,OAAO,IAEpCoE,IACED,MAAS,OAAOA,MAAS,MAE3BJ,IAAM,aAGNA,IAAM,MAECI,KAAQI,KAGbF,MACFT,IAAI,IAENC,IAAI,GAEAM,MAAS,OAGXA,IAAO,MACHE,KACFV,IAAI,CAACA,IAAI,GACTC,IAAI,GACJC,IAAI,MAEJD,IAAI,CAACA,IAAI,GACTC,IAAI,MAEGM,MAAS,SAGlBA,IAAO,KACHE,IACFV,IAAI,CAACA,IAAI,IAETC,IAAI,CAACA,IAAI,IAITO,MAAS,QACXL,IAAK,OAGPC,IAAM,GAAGI,IAAOR,CAAC,IAAIC,CAAC,IAAIC,CAAC,GAAGC,CAAE,MACvBO,IACTN,IAAM,KAAKJ,CAAC,OAAOG,CAAE,KAAK,CAACH,IAAI,CAAC,WACvBW,MACTP,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKE,MACjBH,CAAC,IAAI,CAACC,IAAI,CAAC,SAGlBvC,EAAM,iBAAiB0C,CAAG,GAEnBA;AAAA,IACX,CAAG;AAAA,EACH,GAIMT,IAAe,CAAC5B,GAAM1B,OAC1BqB,EAAM,gBAAgBK,GAAM1B,CAAO,GAE5B0B,EACJ,KAAI,EACJ,QAAQR,EAAGC,EAAE,IAAI,GAAG,EAAE,IAGrBS,IAAc,CAACF,GAAM1B,OACzBqB,EAAM,eAAeK,GAAM1B,CAAO,GAC3B0B,EACJ,KAAI,EACJ,QAAQR,EAAGlB,EAAQ,oBAAoBmB,EAAE,UAAUA,EAAE,IAAI,GAAG,EAAE,IAS7DC,IAAgB,CAAAoD,MAAS,CAACC,GAC9BC,GAAMC,GAAIC,GAAIC,GAAIC,GAAKC,GACvBC,GAAIC,GAAIC,GAAIC,GAAIC,OACZ7B,EAAIoB,CAAE,IACRD,IAAO,KACEnB,EAAIqB,CAAE,IACfF,IAAO,KAAKC,CAAE,OAAOH,IAAQ,OAAO,EAAE,KAC7BjB,EAAIsB,CAAE,IACfH,IAAO,KAAKC,CAAE,IAAIC,CAAE,KAAKJ,IAAQ,OAAO,EAAE,KACjCM,IACTJ,IAAO,KAAKA,CAAI,KAEhBA,IAAO,KAAKA,CAAI,GAAGF,IAAQ,OAAO,EAAE,IAGlCjB,EAAI0B,CAAE,IACRD,IAAK,KACIzB,EAAI2B,CAAE,IACfF,IAAK,IAAI,CAACC,IAAK,CAAC,WACP1B,EAAI4B,CAAE,IACfH,IAAK,IAAIC,CAAE,IAAI,CAACC,IAAK,CAAC,SACbE,IACTJ,IAAK,KAAKC,CAAE,IAAIC,CAAE,IAAIC,CAAE,IAAIC,CAAG,KACtBZ,IACTQ,IAAK,IAAIC,CAAE,IAAIC,CAAE,IAAI,CAACC,IAAK,CAAC,OAE5BH,IAAK,KAAKA,CAAE,IAGP,GAAGN,CAAI,IAAIM,CAAE,GAAG,KAAI,IAGvBzC,IAAU,CAAC8C,GAAKhD,GAASrC,MAAY;AACzC,aAASQ,IAAI,GAAGA,IAAI6E,EAAI,QAAQ7E;AAC9B,UAAI,CAAC6E,EAAI7E,CAAC,EAAE,KAAK6B,CAAO;AACtB,eAAO;AAIX,QAAIA,EAAQ,WAAW,UAAU,CAACrC,EAAQ,mBAAmB;AAM3D,eAASQ,IAAI,GAAGA,IAAI6E,EAAI,QAAQ7E;AAE9B,YADAa,EAAMgE,EAAI7E,CAAC,EAAE,MAAM,GACf6E,EAAI7E,CAAC,EAAE,WAAWN,EAAW,OAI7BmF,EAAI7E,CAAC,EAAE,OAAO,WAAW,SAAS,GAAG;AACvC,gBAAM8E,IAAUD,EAAI7E,CAAC,EAAE;AACvB,cAAI8E,EAAQ,UAAUjD,EAAQ,SAC1BiD,EAAQ,UAAUjD,EAAQ,SAC1BiD,EAAQ,UAAUjD,EAAQ;AAC5B,mBAAO;AAAA,QAEjB;AAII,aAAO;AAAA,IACX;AAEE,WAAO;AAAA,EACT;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/semver.js

@@ -1,170 +0,0 @@
-import { __require as w } from "../internal/debug.js";
-import { __require as g } from "../internal/constants.js";
-import { __require as E } from "../internal/re.js";
-import { __require as b } from "../internal/parse-options.js";
-import { __require as d } from "../internal/identifiers.js";
-var c, m;
-function k() {
-  if (m) return c;
-  m = 1;
-  const h = w(), { MAX_LENGTH: u, MAX_SAFE_INTEGER: l } = g(), { safeRe: o, t: p } = E(), f = b(), { compareIdentifiers: n } = d();
-  class a {
-    constructor(e, r) {
-      if (r = f(r), e instanceof a) {
-        if (e.loose === !!r.loose && e.includePrerelease === !!r.includePrerelease)
-          return e;
-        e = e.version;
-      } else if (typeof e != "string")
-        throw new TypeError(`Invalid version. Must be a string. Got type "${typeof e}".`);
-      if (e.length > u)
-        throw new TypeError(
-          `version is longer than ${u} characters`
-        );
-      h("SemVer", e, r), this.options = r, this.loose = !!r.loose, this.includePrerelease = !!r.includePrerelease;
-      const s = e.trim().match(r.loose ? o[p.LOOSE] : o[p.FULL]);
-      if (!s)
-        throw new TypeError(`Invalid Version: ${e}`);
-      if (this.raw = e, this.major = +s[1], this.minor = +s[2], this.patch = +s[3], this.major > l || this.major < 0)
-        throw new TypeError("Invalid major version");
-      if (this.minor > l || this.minor < 0)
-        throw new TypeError("Invalid minor version");
-      if (this.patch > l || this.patch < 0)
-        throw new TypeError("Invalid patch version");
-      s[4] ? this.prerelease = s[4].split(".").map((t) => {
-        if (/^[0-9]+$/.test(t)) {
-          const i = +t;
-          if (i >= 0 && i < l)
-            return i;
-        }
-        return t;
-      }) : this.prerelease = [], this.build = s[5] ? s[5].split(".") : [], this.format();
-    }
-    format() {
-      return this.version = `${this.major}.${this.minor}.${this.patch}`, this.prerelease.length && (this.version += `-${this.prerelease.join(".")}`), this.version;
-    }
-    toString() {
-      return this.version;
-    }
-    compare(e) {
-      if (h("SemVer.compare", this.version, this.options, e), !(e instanceof a)) {
-        if (typeof e == "string" && e === this.version)
-          return 0;
-        e = new a(e, this.options);
-      }
-      return e.version === this.version ? 0 : this.compareMain(e) || this.comparePre(e);
-    }
-    compareMain(e) {
-      return e instanceof a || (e = new a(e, this.options)), n(this.major, e.major) || n(this.minor, e.minor) || n(this.patch, e.patch);
-    }
-    comparePre(e) {
-      if (e instanceof a || (e = new a(e, this.options)), this.prerelease.length && !e.prerelease.length)
-        return -1;
-      if (!this.prerelease.length && e.prerelease.length)
-        return 1;
-      if (!this.prerelease.length && !e.prerelease.length)
-        return 0;
-      let r = 0;
-      do {
-        const s = this.prerelease[r], t = e.prerelease[r];
-        if (h("prerelease compare", r, s, t), s === void 0 && t === void 0)
-          return 0;
-        if (t === void 0)
-          return 1;
-        if (s === void 0)
-          return -1;
-        if (s === t)
-          continue;
-        return n(s, t);
-      } while (++r);
-    }
-    compareBuild(e) {
-      e instanceof a || (e = new a(e, this.options));
-      let r = 0;
-      do {
-        const s = this.build[r], t = e.build[r];
-        if (h("build compare", r, s, t), s === void 0 && t === void 0)
-          return 0;
-        if (t === void 0)
-          return 1;
-        if (s === void 0)
-          return -1;
-        if (s === t)
-          continue;
-        return n(s, t);
-      } while (++r);
-    }
-    // preminor will bump the version up to the next minor release, and immediately
-    // down to pre-release. premajor and prepatch work the same way.
-    inc(e, r, s) {
-      if (e.startsWith("pre")) {
-        if (!r && s === !1)
-          throw new Error("invalid increment argument: identifier is empty");
-        if (r) {
-          const t = `-${r}`.match(this.options.loose ? o[p.PRERELEASELOOSE] : o[p.PRERELEASE]);
-          if (!t || t[1] !== r)
-            throw new Error(`invalid identifier: ${r}`);
-        }
-      }
-      switch (e) {
-        case "premajor":
-          this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", r, s);
-          break;
-        case "preminor":
-          this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", r, s);
-          break;
-        case "prepatch":
-          this.prerelease.length = 0, this.inc("patch", r, s), this.inc("pre", r, s);
-          break;
-        // If the input is a non-prerelease version, this acts the same as
-        // prepatch.
-        case "prerelease":
-          this.prerelease.length === 0 && this.inc("patch", r, s), this.inc("pre", r, s);
-          break;
-        case "release":
-          if (this.prerelease.length === 0)
-            throw new Error(`version ${this.raw} is not a prerelease`);
-          this.prerelease.length = 0;
-          break;
-        case "major":
-          (this.minor !== 0 || this.patch !== 0 || this.prerelease.length === 0) && this.major++, this.minor = 0, this.patch = 0, this.prerelease = [];
-          break;
-        case "minor":
-          (this.patch !== 0 || this.prerelease.length === 0) && this.minor++, this.patch = 0, this.prerelease = [];
-          break;
-        case "patch":
-          this.prerelease.length === 0 && this.patch++, this.prerelease = [];
-          break;
-        // This probably shouldn't be used publicly.
-        // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.
-        case "pre": {
-          const t = Number(s) ? 1 : 0;
-          if (this.prerelease.length === 0)
-            this.prerelease = [t];
-          else {
-            let i = this.prerelease.length;
-            for (; --i >= 0; )
-              typeof this.prerelease[i] == "number" && (this.prerelease[i]++, i = -2);
-            if (i === -1) {
-              if (r === this.prerelease.join(".") && s === !1)
-                throw new Error("invalid increment argument: identifier already exists");
-              this.prerelease.push(t);
-            }
-          }
-          if (r) {
-            let i = [r, t];
-            s === !1 && (i = [r]), n(this.prerelease[0], r) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = i) : this.prerelease = i;
-          }
-          break;
-        }
-        default:
-          throw new Error(`invalid increment argument: ${e}`);
-      }
-      return this.raw = this.format(), this.build.length && (this.raw += `+${this.build.join(".")}`), this;
-    }
-  }
-  return c = a, c;
-}
-export {
-  k as __require
-};
-//# sourceMappingURL=semver.js.map

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/semver.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"semver.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/semver.js"],"sourcesContent":["'use strict'\n\nconst debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n  constructor (version, options) {\n    options = parseOptions(options)\n\n    if (version instanceof SemVer) {\n      if (version.loose === !!options.loose &&\n        version.includePrerelease === !!options.includePrerelease) {\n        return version\n      } else {\n        version = version.version\n      }\n    } else if (typeof version !== 'string') {\n      throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n    }\n\n    if (version.length > MAX_LENGTH) {\n      throw new TypeError(\n        `version is longer than ${MAX_LENGTH} characters`\n      )\n    }\n\n    debug('SemVer', version, options)\n    this.options = options\n    this.loose = !!options.loose\n    // this isn't actually relevant for versions, but keep it so that we\n    // don't run into trouble passing this.options around.\n    this.includePrerelease = !!options.includePrerelease\n\n    const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n    if (!m) {\n      throw new TypeError(`Invalid Version: ${version}`)\n    }\n\n    this.raw = version\n\n    // these are actually numbers\n    this.major = +m[1]\n    this.minor = +m[2]\n    this.patch = +m[3]\n\n    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n      throw new TypeError('Invalid major version')\n    }\n\n    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n      throw new TypeError('Invalid minor version')\n    }\n\n    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n      throw new TypeError('Invalid patch version')\n    }\n\n    // numberify any prerelease numeric ids\n    if (!m[4]) {\n      this.prerelease = []\n    } else {\n      this.prerelease = m[4].split('.').map((id) => {\n        if (/^[0-9]+$/.test(id)) {\n          const num = +id\n          if (num >= 0 && num < MAX_SAFE_INTEGER) {\n            return num\n          }\n        }\n        return id\n      })\n    }\n\n    this.build = m[5] ? m[5].split('.') : []\n    this.format()\n  }\n\n  format () {\n    this.version = `${this.major}.${this.minor}.${this.patch}`\n    if (this.prerelease.length) {\n      this.version += `-${this.prerelease.join('.')}`\n    }\n    return this.version\n  }\n\n  toString () {\n    return this.version\n  }\n\n  compare (other) {\n    debug('SemVer.compare', this.version, this.options, other)\n    if (!(other instanceof SemVer)) {\n      if (typeof other === 'string' && other === this.version) {\n        return 0\n      }\n      other = new SemVer(other, this.options)\n    }\n\n    if (other.version === this.version) {\n      return 0\n    }\n\n    return this.compareMain(other) || this.comparePre(other)\n  }\n\n  compareMain (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    return (\n      compareIdentifiers(this.major, other.major) ||\n      compareIdentifiers(this.minor, other.minor) ||\n      compareIdentifiers(this.patch, other.patch)\n    )\n  }\n\n  comparePre (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    // NOT having a prerelease is > having one\n    if (this.prerelease.length && !other.prerelease.length) {\n      return -1\n    } else if (!this.prerelease.length && other.prerelease.length) {\n      return 1\n    } else if (!this.prerelease.length && !other.prerelease.length) {\n      return 0\n    }\n\n    let i = 0\n    do {\n      const a = this.prerelease[i]\n      const b = other.prerelease[i]\n      debug('prerelease compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  compareBuild (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    let i = 0\n    do {\n      const a = this.build[i]\n      const b = other.build[i]\n      debug('build compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  // preminor will bump the version up to the next minor release, and immediately\n  // down to pre-release. premajor and prepatch work the same way.\n  inc (release, identifier, identifierBase) {\n    if (release.startsWith('pre')) {\n      if (!identifier && identifierBase === false) {\n        throw new Error('invalid increment argument: identifier is empty')\n      }\n      // Avoid an invalid semver results\n      if (identifier) {\n        const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE])\n        if (!match || match[1] !== identifier) {\n          throw new Error(`invalid identifier: ${identifier}`)\n        }\n      }\n    }\n\n    switch (release) {\n      case 'premajor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor = 0\n        this.major++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'preminor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'prepatch':\n        // If this is already a prerelease, it will bump to the next version\n        // drop any prereleases that might already exist, since they are not\n        // relevant at this point.\n        this.prerelease.length = 0\n        this.inc('patch', identifier, identifierBase)\n        this.inc('pre', identifier, identifierBase)\n        break\n      // If the input is a non-prerelease version, this acts the same as\n      // prepatch.\n      case 'prerelease':\n        if (this.prerelease.length === 0) {\n          this.inc('patch', identifier, identifierBase)\n        }\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'release':\n        if (this.prerelease.length === 0) {\n          throw new Error(`version ${this.raw} is not a prerelease`)\n        }\n        this.prerelease.length = 0\n        break\n\n      case 'major':\n        // If this is a pre-major version, bump up to the same major version.\n        // Otherwise increment major.\n        // 1.0.0-5 bumps to 1.0.0\n        // 1.1.0 bumps to 2.0.0\n        if (\n          this.minor !== 0 ||\n          this.patch !== 0 ||\n          this.prerelease.length === 0\n        ) {\n          this.major++\n        }\n        this.minor = 0\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'minor':\n        // If this is a pre-minor version, bump up to the same minor version.\n        // Otherwise increment minor.\n        // 1.2.0-5 bumps to 1.2.0\n        // 1.2.1 bumps to 1.3.0\n        if (this.patch !== 0 || this.prerelease.length === 0) {\n          this.minor++\n        }\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'patch':\n        // If this is not a pre-release version, it will increment the patch.\n        // If it is a pre-release it will bump up to the same patch version.\n        // 1.2.0-5 patches to 1.2.0\n        // 1.2.0 patches to 1.2.1\n        if (this.prerelease.length === 0) {\n          this.patch++\n        }\n        this.prerelease = []\n        break\n      // This probably shouldn't be used publicly.\n      // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n      case 'pre': {\n        const base = Number(identifierBase) ? 1 : 0\n\n        if (this.prerelease.length === 0) {\n          this.prerelease = [base]\n        } else {\n          let i = this.prerelease.length\n          while (--i >= 0) {\n            if (typeof this.prerelease[i] === 'number') {\n              this.prerelease[i]++\n              i = -2\n            }\n          }\n          if (i === -1) {\n            // didn't increment anything\n            if (identifier === this.prerelease.join('.') && identifierBase === false) {\n              throw new Error('invalid increment argument: identifier already exists')\n            }\n            this.prerelease.push(base)\n          }\n        }\n        if (identifier) {\n          // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n          // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n          let prerelease = [identifier, base]\n          if (identifierBase === false) {\n            prerelease = [identifier]\n          }\n          if (compareIdentifiers(this.prerelease[0], identifier) === 0) {\n            if (isNaN(this.prerelease[1])) {\n              this.prerelease = prerelease\n            }\n          } else {\n            this.prerelease = prerelease\n          }\n        }\n        break\n      }\n      default:\n        throw new Error(`invalid increment argument: ${release}`)\n    }\n    this.raw = this.format()\n    if (this.build.length) {\n      this.raw += `+${this.build.join('.')}`\n    }\n    return this\n  }\n}\n\nmodule.exports = SemVer\n"],"names":["debug","require$$0","MAX_LENGTH","MAX_SAFE_INTEGER","require$$1","re","t","require$$2","parseOptions","require$$3","compareIdentifiers","require$$4","SemVer","version","options","m","id","num","other","i","a","b","release","identifier","identifierBase","match","base","prerelease","semver"],"mappings":";;;;;;;;;AAEA,QAAMA,IAAQC,EAAA,GACR,EAAE,YAAAC,GAAY,kBAAAC,EAAgB,IAAKC,EAAA,GACnC,EAAE,QAAQC,GAAI,GAAAC,EAAC,IAAKC,EAAA,GAEpBC,IAAeC,EAAA,GACf,EAAE,oBAAAC,EAAkB,IAAKC,EAAA;AAAA,EAC/B,MAAMC,EAAO;AAAA,IACX,YAAaC,GAASC,GAAS;AAG7B,UAFAA,IAAUN,EAAaM,CAAO,GAE1BD,aAAmBD,GAAQ;AAC7B,YAAIC,EAAQ,UAAU,CAAC,CAACC,EAAQ,SAC9BD,EAAQ,sBAAsB,CAAC,CAACC,EAAQ;AACxC,iBAAOD;AAEP,QAAAA,IAAUA,EAAQ;AAAA,MAE1B,WAAe,OAAOA,KAAY;AAC5B,cAAM,IAAI,UAAU,gDAAgD,OAAOA,CAAO,IAAI;AAGxF,UAAIA,EAAQ,SAASX;AACnB,cAAM,IAAI;AAAA,UACR,0BAA0BA,CAAU;AAAA,QAC5C;AAGI,MAAAF,EAAM,UAAUa,GAASC,CAAO,GAChC,KAAK,UAAUA,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OAGvB,KAAK,oBAAoB,CAAC,CAACA,EAAQ;AAEnC,YAAMC,IAAIF,EAAQ,KAAI,EAAG,MAAMC,EAAQ,QAAQT,EAAGC,EAAE,KAAK,IAAID,EAAGC,EAAE,IAAI,CAAC;AAEvE,UAAI,CAACS;AACH,cAAM,IAAI,UAAU,oBAAoBF,CAAO,EAAE;AAUnD,UAPA,KAAK,MAAMA,GAGX,KAAK,QAAQ,CAACE,EAAE,CAAC,GACjB,KAAK,QAAQ,CAACA,EAAE,CAAC,GACjB,KAAK,QAAQ,CAACA,EAAE,CAAC,GAEb,KAAK,QAAQZ,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAG7C,UAAI,KAAK,QAAQA,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAG7C,UAAI,KAAK,QAAQA,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAI7C,MAAKY,EAAE,CAAC,IAGN,KAAK,aAAaA,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,CAACC,MAAO;AAC5C,YAAI,WAAW,KAAKA,CAAE,GAAG;AACvB,gBAAMC,IAAM,CAACD;AACb,cAAIC,KAAO,KAAKA,IAAMd;AACpB,mBAAOc;AAAA,QAEnB;AACQ,eAAOD;AAAA,MACf,CAAO,IAVD,KAAK,aAAa,CAAA,GAapB,KAAK,QAAQD,EAAE,CAAC,IAAIA,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA,GACtC,KAAK,OAAM;AAAA,IACf;AAAA,IAEE,SAAU;AACR,kBAAK,UAAU,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,IACpD,KAAK,WAAW,WAClB,KAAK,WAAW,IAAI,KAAK,WAAW,KAAK,GAAG,CAAC,KAExC,KAAK;AAAA,IAChB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,QAASG,GAAO;AAEd,UADAlB,EAAM,kBAAkB,KAAK,SAAS,KAAK,SAASkB,CAAK,GACrD,EAAEA,aAAiBN,IAAS;AAC9B,YAAI,OAAOM,KAAU,YAAYA,MAAU,KAAK;AAC9C,iBAAO;AAET,QAAAA,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO;AAAA,MAC5C;AAEI,aAAIA,EAAM,YAAY,KAAK,UAClB,IAGF,KAAK,YAAYA,CAAK,KAAK,KAAK,WAAWA,CAAK;AAAA,IAC3D;AAAA,IAEE,YAAaA,GAAO;AAClB,aAAMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO,IAItCR,EAAmB,KAAK,OAAOQ,EAAM,KAAK,KAC1CR,EAAmB,KAAK,OAAOQ,EAAM,KAAK,KAC1CR,EAAmB,KAAK,OAAOQ,EAAM,KAAK;AAAA,IAEhD;AAAA,IAEE,WAAYA,GAAO;AAMjB,UALMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO,IAIpC,KAAK,WAAW,UAAU,CAACA,EAAM,WAAW;AAC9C,eAAO;AACF,UAAI,CAAC,KAAK,WAAW,UAAUA,EAAM,WAAW;AACrD,eAAO;AACF,UAAI,CAAC,KAAK,WAAW,UAAU,CAACA,EAAM,WAAW;AACtD,eAAO;AAGT,UAAIC,IAAI;AACR,SAAG;AACD,cAAMC,IAAI,KAAK,WAAWD,CAAC,GACrBE,IAAIH,EAAM,WAAWC,CAAC;AAE5B,YADAnB,EAAM,sBAAsBmB,GAAGC,GAAGC,CAAC,GAC/BD,MAAM,UAAaC,MAAM;AAC3B,iBAAO;AACF,YAAIA,MAAM;AACf,iBAAO;AACF,YAAID,MAAM;AACf,iBAAO;AACF,YAAIA,MAAMC;AACf;AAEA,eAAOX,EAAmBU,GAAGC,CAAC;AAAA,MAEtC,SAAa,EAAEF;AAAA,IACf;AAAA,IAEE,aAAcD,GAAO;AACnB,MAAMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO;AAGxC,UAAIC,IAAI;AACR,SAAG;AACD,cAAMC,IAAI,KAAK,MAAMD,CAAC,GAChBE,IAAIH,EAAM,MAAMC,CAAC;AAEvB,YADAnB,EAAM,iBAAiBmB,GAAGC,GAAGC,CAAC,GAC1BD,MAAM,UAAaC,MAAM;AAC3B,iBAAO;AACF,YAAIA,MAAM;AACf,iBAAO;AACF,YAAID,MAAM;AACf,iBAAO;AACF,YAAIA,MAAMC;AACf;AAEA,eAAOX,EAAmBU,GAAGC,CAAC;AAAA,MAEtC,SAAa,EAAEF;AAAA,IACf;AAAA;AAAA;AAAA,IAIE,IAAKG,GAASC,GAAYC,GAAgB;AACxC,UAAIF,EAAQ,WAAW,KAAK,GAAG;AAC7B,YAAI,CAACC,KAAcC,MAAmB;AACpC,gBAAM,IAAI,MAAM,iDAAiD;AAGnE,YAAID,GAAY;AACd,gBAAME,IAAQ,IAAIF,CAAU,GAAG,MAAM,KAAK,QAAQ,QAAQlB,EAAGC,EAAE,eAAe,IAAID,EAAGC,EAAE,UAAU,CAAC;AAClG,cAAI,CAACmB,KAASA,EAAM,CAAC,MAAMF;AACzB,kBAAM,IAAI,MAAM,uBAAuBA,CAAU,EAAE;AAAA,QAE7D;AAAA,MACA;AAEI,cAAQD,GAAO;AAAA,QACb,KAAK;AACH,eAAK,WAAW,SAAS,GACzB,KAAK,QAAQ,GACb,KAAK,QAAQ,GACb,KAAK,SACL,KAAK,IAAI,OAAOC,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AACH,eAAK,WAAW,SAAS,GACzB,KAAK,QAAQ,GACb,KAAK,SACL,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AAIH,eAAK,WAAW,SAAS,GACzB,KAAK,IAAI,SAASD,GAAYC,CAAc,GAC5C,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA;AAAA;AAAA,QAGF,KAAK;AACH,UAAI,KAAK,WAAW,WAAW,KAC7B,KAAK,IAAI,SAASD,GAAYC,CAAc,GAE9C,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AACH,cAAI,KAAK,WAAW,WAAW;AAC7B,kBAAM,IAAI,MAAM,WAAW,KAAK,GAAG,sBAAsB;AAE3D,eAAK,WAAW,SAAS;AACzB;AAAA,QAEF,KAAK;AAKH,WACE,KAAK,UAAU,KACf,KAAK,UAAU,KACf,KAAK,WAAW,WAAW,MAE3B,KAAK,SAEP,KAAK,QAAQ,GACb,KAAK,QAAQ,GACb,KAAK,aAAa,CAAA;AAClB;AAAA,QACF,KAAK;AAKH,WAAI,KAAK,UAAU,KAAK,KAAK,WAAW,WAAW,MACjD,KAAK,SAEP,KAAK,QAAQ,GACb,KAAK,aAAa,CAAA;AAClB;AAAA,QACF,KAAK;AAKH,UAAI,KAAK,WAAW,WAAW,KAC7B,KAAK,SAEP,KAAK,aAAa,CAAA;AAClB;AAAA;AAAA;AAAA,QAGF,KAAK,OAAO;AACV,gBAAME,IAAO,OAAOF,CAAc,IAAI,IAAI;AAE1C,cAAI,KAAK,WAAW,WAAW;AAC7B,iBAAK,aAAa,CAACE,CAAI;AAAA,eAClB;AACL,gBAAI,IAAI,KAAK,WAAW;AACxB,mBAAO,EAAE,KAAK;AACZ,cAAI,OAAO,KAAK,WAAW,CAAC,KAAM,aAChC,KAAK,WAAW,CAAC,KACjB,IAAI;AAGR,gBAAI,MAAM,IAAI;AAEZ,kBAAIH,MAAe,KAAK,WAAW,KAAK,GAAG,KAAKC,MAAmB;AACjE,sBAAM,IAAI,MAAM,uDAAuD;AAEzE,mBAAK,WAAW,KAAKE,CAAI;AAAA,YACrC;AAAA,UACA;AACQ,cAAIH,GAAY;AAGd,gBAAII,IAAa,CAACJ,GAAYG,CAAI;AAClC,YAAIF,MAAmB,OACrBG,IAAa,CAACJ,CAAU,IAEtBb,EAAmB,KAAK,WAAW,CAAC,GAAGa,CAAU,MAAM,IACrD,MAAM,KAAK,WAAW,CAAC,CAAC,MAC1B,KAAK,aAAaI,KAGpB,KAAK,aAAaA;AAAA,UAE9B;AACQ;AAAA,QACR;AAAA,QACM;AACE,gBAAM,IAAI,MAAM,+BAA+BL,CAAO,EAAE;AAAA,MAChE;AACI,kBAAK,MAAM,KAAK,OAAM,GAClB,KAAK,MAAM,WACb,KAAK,OAAO,IAAI,KAAK,MAAM,KAAK,GAAG,CAAC,KAE/B;AAAA,IACX;AAAA,EACA;AAEA,SAAAM,IAAiBhB;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/clean.js

@@ -1,15 +0,0 @@
-import { __require as t } from "./parse.js";
-var r, n;
-function l() {
-  if (n) return r;
-  n = 1;
-  const a = t();
-  return r = (i, s) => {
-    const e = a(i.trim().replace(/^[=v]+/, ""), s);
-    return e ? e.version : null;
-  }, r;
-}
-export {
-  l as __require
-};
-//# sourceMappingURL=clean.js.map

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/clean.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"clean.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/clean.js"],"sourcesContent":["'use strict'\n\nconst parse = require('./parse')\nconst clean = (version, options) => {\n  const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n  return s ? s.version : null\n}\nmodule.exports = clean\n"],"names":["parse","require$$0","clean_1","version","options","s"],"mappings":";;;;;AAEA,QAAMA,IAAQC,EAAA;AAKd,SAAAC,IAJc,CAACC,GAASC,MAAY;AAClC,UAAMC,IAAIL,EAAMG,EAAQ,KAAI,EAAG,QAAQ,UAAU,EAAE,GAAGC,CAAO;AAC7D,WAAOC,IAAIA,EAAE,UAAU;AAAA,EACzB;;","x_google_ignoreList":[0]}