@langchain/core 1.2.4 → 1.2.6

package/dist/utils/json_schema.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"json_schema.cjs","names":["isStandardJsonSchema","isZodSchemaV4","interopZodTransformInputSchema","isZodObjectV4","interopZodObjectStrict","isZodSchemaV3","zodToJsonSchema"],"sources":["../../src/utils/json_schema.ts"],"sourcesContent":["import { toJSONSchema, type $ZodType } from \"zod/v4/core\";\nimport { dereference, type Schema } from \"@cfworker/json-schema\";\nimport {\n  isZodSchemaV3,\n  isZodSchemaV4,\n  InteropZodType,\n  interopZodObjectStrict,\n  isZodObjectV4,\n  interopZodTransformInputSchema,\n} from \"./types/zod.js\";\nimport {\n  type JsonSchema7Type as JSONSchema,\n  zodToJsonSchema,\n} from \"./zod-to-json-schema/index.js\";\nimport { StandardJSONSchemaV1 } from \"@standard-schema/spec\";\nimport { isStandardJsonSchema } from \"./standard_schema.js\";\n\nexport { deepCompareStrict, Validator } from \"@cfworker/json-schema\";\n\nexport type ToJSONSchemaParams = NonNullable<\n  Parameters<typeof toJSONSchema>[1]\n>;\n\n/**\n * WeakMap cache for Zod/Standard-Schema → JSON Schema conversions.\n *\n * Keyed on the schema object reference. Since Zod schemas are immutable and\n * the same `tool.schema` reference is passed on every LLM call, this\n * eliminates redundant serializations. For example, an agent with 6 tools\n * doing 15 steps across 3 parallel subagents would otherwise run 270\n * identical conversions per invocation.\n *\n * Only used when no custom `params` are passed (the common case for tool\n * binding). WeakMap ensures cached entries are GC'd when the schema goes\n * out of scope.\n *\n * @internal\n */\nconst _jsonSchemaCache = new WeakMap<object, JSONSchema>();\n\n/**\n * Converts a Standard JSON schema, Zod schema or JSON schema to a JSON schema.\n * Results are cached by schema reference when no custom params are passed.\n * @param schema - The schema to convert.\n * @param params - The parameters to pass to the toJSONSchema function.\n * @returns The converted schema.\n */\nexport function toJsonSchema(\n  schema: StandardJSONSchemaV1 | InteropZodType | JSONSchema,\n  params?: ToJSONSchemaParams\n): JSONSchema {\n  // Cache when no custom params are passed (the default for tool binding).\n  // Params can change the output (e.g., different target draft), so we\n  // bypass the cache when they're provided.\n  const canCache = !params && schema != null && typeof schema === \"object\";\n\n  if (canCache) {\n    const cached = _jsonSchemaCache.get(schema);\n    if (cached) return cached;\n  }\n\n  let result: JSONSchema;\n\n  if (isStandardJsonSchema(schema) && !isZodSchemaV4(schema)) {\n    result = schema[\"~standard\"].jsonSchema.input({\n      target: \"draft-07\",\n    }) as JSONSchema;\n  } else if (isZodSchemaV4(schema)) {\n    const inputSchema = interopZodTransformInputSchema(schema, true);\n    if (isZodObjectV4(inputSchema)) {\n      const strictSchema = interopZodObjectStrict(inputSchema, true);\n      result = toJSONSchema(strictSchema as unknown as $ZodType, params);\n    } else {\n      result = toJSONSchema(schema as unknown as $ZodType, params);\n    }\n  } else if (isZodSchemaV3(schema)) {\n    result = zodToJsonSchema(schema as never);\n  } else {\n    result = schema as JSONSchema;\n  }\n\n  if (canCache && result != null && typeof result === \"object\") {\n    _jsonSchemaCache.set(schema, result);\n  }\n\n  return result;\n}\n\n/**\n * Validates if a JSON schema validates only strings. May return false negatives in some edge cases\n * (like recursive or unresolvable refs).\n *\n * @param schema - The schema to validate.\n * @returns `true` if the schema validates only strings, `false` otherwise.\n */\nexport function validatesOnlyStrings(schema: unknown): boolean {\n  // Null, undefined, or empty schema\n  if (\n    !schema ||\n    typeof schema !== \"object\" ||\n    Object.keys(schema).length === 0 ||\n    Array.isArray(schema)\n  ) {\n    return false; // Validates anything, not just strings\n  }\n\n  // Explicit type constraint\n  if (\"type\" in schema) {\n    if (typeof schema.type === \"string\") {\n      return schema.type === \"string\";\n    }\n\n    if (Array.isArray(schema.type)) {\n      // not sure why someone would do `\"type\": [\"string\"]` or especially `\"type\": [\"string\",\n      // \"string\", \"string\", ...]` but we're not here to judge\n      return schema.type.every((t) => t === \"string\");\n    }\n    return false; // Invalid or non-string type\n  }\n\n  // Enum with only string values\n  if (\"enum\" in schema) {\n    return (\n      Array.isArray(schema.enum) &&\n      schema.enum.length > 0 &&\n      schema.enum.every((val) => typeof val === \"string\")\n    );\n  }\n\n  // String constant\n  if (\"const\" in schema) {\n    return typeof schema.const === \"string\";\n  }\n\n  // Schema combinations\n  if (\"allOf\" in schema && Array.isArray(schema.allOf)) {\n    // If any subschema validates only strings, then the overall schema validates only strings\n    return schema.allOf.some((subschema) => validatesOnlyStrings(subschema));\n  }\n\n  if (\n    (\"anyOf\" in schema && Array.isArray(schema.anyOf)) ||\n    (\"oneOf\" in schema && Array.isArray(schema.oneOf))\n  ) {\n    const subschemas = (\n      \"anyOf\" in schema ? schema.anyOf : schema.oneOf\n    ) as unknown[];\n\n    // All subschemas must validate only strings\n    return (\n      subschemas.length > 0 &&\n      subschemas.every((subschema) => validatesOnlyStrings(subschema))\n    );\n  }\n\n  // We're not going to try on this one, it's too complex - we just assume if it has a \"not\" key and hasn't matched one of the above checks, it's not a string schema.\n  if (\"not\" in schema) {\n    return false; // The not case can validate non-strings\n  }\n\n  if (\"$ref\" in schema && typeof schema.$ref === \"string\") {\n    const ref = schema.$ref as string;\n    const resolved = dereference(schema as Schema);\n    if (resolved[ref]) {\n      return validatesOnlyStrings(resolved[ref]);\n    }\n    return false;\n  }\n\n  // ignore recursive refs and other cases where type is omitted for now\n  // ignore other cases for now where type is omitted\n\n  return false;\n}\n\n// Re-export of the types used throughout langchain for json schema serialization.\n// The plan is to eventually nix zod-to-json-schema altogether in place for\n// zod v4 / a more standardized way of serializing validated inputs, so its re-exported\n// here to remove the dependency on zod-to-json-schema in downstream packages until\n// a determination is made.\n\nexport {\n  type JsonSchema7Type,\n  type JsonSchema7Type as JSONSchema,\n  type JsonSchema7ArrayType,\n  type JsonSchema7ObjectType,\n  type JsonSchema7StringType,\n  type JsonSchema7NumberType,\n  type JsonSchema7NullableType,\n} from \"./zod-to-json-schema/index.js\";\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCA,MAAM,mCAAmB,IAAI,SAA6B;;;;;;;;AAS1D,SAAgB,aACd,QACA,QACY;CAIZ,MAAM,WAAW,CAAC,UAAU,UAAU,QAAQ,OAAO,WAAW;AAEhE,KAAI,UAAU;EACZ,MAAM,SAAS,iBAAiB,IAAI,OAAO;AAC3C,MAAI,OAAQ,QAAO;;CAGrB,IAAI;AAEJ,KAAIA,8BAAAA,qBAAqB,OAAO,IAAI,CAACC,YAAAA,cAAc,OAAO,CACxD,UAAS,OAAO,aAAa,WAAW,MAAM,EAC5C,QAAQ,YACT,CAAC;UACOA,YAAAA,cAAc,OAAO,EAAE;EAChC,MAAM,cAAcC,YAAAA,+BAA+B,QAAQ,KAAK;AAChE,MAAIC,YAAAA,cAAc,YAAY,CAE5B,WAAA,GAAA,YAAA,cADqBC,YAAAA,uBAAuB,aAAa,KACvB,EAAyB,OAAO;MAElE,WAAA,GAAA,YAAA,cAAsB,QAA+B,OAAO;YAErDC,YAAAA,cAAc,OAAO,CAC9B,UAASC,wBAAAA,gBAAgB,OAAgB;KAEzC,UAAS;AAGX,KAAI,YAAY,UAAU,QAAQ,OAAO,WAAW,SAClD,kBAAiB,IAAI,QAAQ,OAAO;AAGtC,QAAO;;;;;;;;;AAUT,SAAgB,qBAAqB,QAA0B;AAE7D,KACE,CAAC,UACD,OAAO,WAAW,YAClB,OAAO,KAAK,OAAO,CAAC,WAAW,KAC/B,MAAM,QAAQ,OAAO,CAErB,QAAO;AAIT,KAAI,UAAU,QAAQ;AACpB,MAAI,OAAO,OAAO,SAAS,SACzB,QAAO,OAAO,SAAS;AAGzB,MAAI,MAAM,QAAQ,OAAO,KAAK,CAG5B,QAAO,OAAO,KAAK,OAAO,MAAM,MAAM,SAAS;AAEjD,SAAO;;AAIT,KAAI,UAAU,OACZ,QACE,MAAM,QAAQ,OAAO,KAAK,IAC1B,OAAO,KAAK,SAAS,KACrB,OAAO,KAAK,OAAO,QAAQ,OAAO,QAAQ,SAAS;AAKvD,KAAI,WAAW,OACb,QAAO,OAAO,OAAO,UAAU;AAIjC,KAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,CAElD,QAAO,OAAO,MAAM,MAAM,cAAc,qBAAqB,UAAU,CAAC;AAG1E,KACG,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,IAChD,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,EACjD;EACA,MAAM,aACJ,WAAW,SAAS,OAAO,QAAQ,OAAO;AAI5C,SACE,WAAW,SAAS,KACpB,WAAW,OAAO,cAAc,qBAAqB,UAAU,CAAC;;AAKpE,KAAI,SAAS,OACX,QAAO;AAGT,KAAI,UAAU,UAAU,OAAO,OAAO,SAAS,UAAU;EACvD,MAAM,MAAM,OAAO;EACnB,MAAM,YAAA,GAAA,sBAAA,aAAuB,OAAiB;AAC9C,MAAI,SAAS,KACX,QAAO,qBAAqB,SAAS,KAAK;AAE5C,SAAO;;AAMT,QAAO"}
+{"version":3,"file":"json_schema.cjs","names":["isStandardJsonSchema","isZodSchemaV4","interopZodTransformInputSchema","isZodObjectV4","interopZodObjectStrict","isZodSchemaV3","zodToJsonSchema"],"sources":["../../src/utils/json_schema.ts"],"sourcesContent":["import { toJSONSchema, type $ZodType } from \"zod/v4/core\";\nimport { dereference, type Schema } from \"@cfworker/json-schema\";\nimport {\n  isZodSchemaV3,\n  isZodSchemaV4,\n  InteropZodType,\n  interopZodObjectStrict,\n  isZodObjectV4,\n  interopZodTransformInputSchema,\n} from \"./types/zod.js\";\nimport {\n  type JsonSchema7Type as JSONSchema,\n  zodToJsonSchema,\n} from \"./zod-to-json-schema/index.js\";\nimport { StandardJSONSchemaV1 } from \"@standard-schema/spec\";\nimport { isStandardJsonSchema } from \"./standard_schema.js\";\n\nexport { deepCompareStrict, Validator } from \"@cfworker/json-schema\";\n\nexport type ToJSONSchemaParams = NonNullable<\n  Parameters<typeof toJSONSchema>[1]\n>;\n\n/**\n * WeakMap cache for Zod/Standard-Schema → JSON Schema conversions.\n *\n * Keyed on the schema object reference. Since Zod schemas are immutable and\n * the same `tool.schema` reference is passed on every LLM call, this\n * eliminates redundant serializations. For example, an agent with 6 tools\n * doing 15 steps across 3 parallel subagents would otherwise run 270\n * identical conversions per invocation.\n *\n * Only used when no custom `params` are passed (the common case for tool\n * binding). WeakMap ensures cached entries are GC'd when the schema goes\n * out of scope.\n *\n * @internal\n */\nconst _jsonSchemaCache = new WeakMap<object, JSONSchema>();\n\n/**\n * Converts a Standard JSON schema, Zod schema or JSON schema to a JSON schema.\n * Results are cached by schema reference when no custom params are passed.\n * @param schema - The schema to convert.\n * @param params - The parameters to pass to the toJSONSchema function.\n * @returns The converted schema.\n */\nexport function toJsonSchema(\n  schema: StandardJSONSchemaV1 | InteropZodType | JSONSchema,\n  params?: ToJSONSchemaParams\n): JSONSchema {\n  // Cache when no custom params are passed (the default for tool binding).\n  // Params can change the output (e.g., different target draft), so we\n  // bypass the cache when they're provided.\n  const canCache = !params && schema != null && typeof schema === \"object\";\n\n  if (canCache) {\n    const cached = _jsonSchemaCache.get(schema);\n    if (cached) return cached;\n  }\n\n  let result: JSONSchema;\n\n  if (isStandardJsonSchema(schema) && !isZodSchemaV4(schema)) {\n    result = schema[\"~standard\"].jsonSchema.input({\n      target: \"draft-07\",\n    }) as JSONSchema;\n  } else if (isZodSchemaV4(schema)) {\n    const inputSchema = interopZodTransformInputSchema(schema, true);\n    if (isZodObjectV4(inputSchema)) {\n      const strictSchema = interopZodObjectStrict(inputSchema, true);\n      result = toJSONSchema(strictSchema as unknown as $ZodType, params);\n    } else {\n      result = toJSONSchema(schema as unknown as $ZodType, params);\n    }\n  } else if (isZodSchemaV3(schema)) {\n    result = zodToJsonSchema(schema as never);\n  } else {\n    result = schema as JSONSchema;\n  }\n\n  if (canCache && result != null && typeof result === \"object\") {\n    _jsonSchemaCache.set(schema, result);\n  }\n\n  return result;\n}\n\n/**\n * Validates if a JSON schema validates only strings. May return false negatives in some edge cases\n * (like recursive or unresolvable refs).\n *\n * @param schema - The schema to validate.\n * @returns `true` if the schema validates only strings, `false` otherwise.\n */\nexport function validatesOnlyStrings(schema: unknown): boolean {\n  // Null, undefined, or empty schema\n  if (\n    !schema ||\n    typeof schema !== \"object\" ||\n    Object.keys(schema).length === 0 ||\n    Array.isArray(schema)\n  ) {\n    return false; // Validates anything, not just strings\n  }\n\n  // Explicit type constraint\n  if (\"type\" in schema) {\n    if (typeof schema.type === \"string\") {\n      return schema.type === \"string\";\n    }\n\n    if (Array.isArray(schema.type)) {\n      // not sure why someone would do `\"type\": [\"string\"]` or especially `\"type\": [\"string\",\n      // \"string\", \"string\", ...]` but we're not here to judge\n      return schema.type.every((t) => t === \"string\");\n    }\n    return false; // Invalid or non-string type\n  }\n\n  // Enum with only string values\n  if (\"enum\" in schema) {\n    return (\n      Array.isArray(schema.enum) &&\n      schema.enum.length > 0 &&\n      schema.enum.every((val) => typeof val === \"string\")\n    );\n  }\n\n  // String constant\n  if (\"const\" in schema) {\n    return typeof schema.const === \"string\";\n  }\n\n  // Schema combinations\n  if (\"allOf\" in schema && Array.isArray(schema.allOf)) {\n    // If any subschema validates only strings, then the overall schema validates only strings\n    return schema.allOf.some((subschema) => validatesOnlyStrings(subschema));\n  }\n\n  if (\n    (\"anyOf\" in schema && Array.isArray(schema.anyOf)) ||\n    (\"oneOf\" in schema && Array.isArray(schema.oneOf))\n  ) {\n    const subschemas = (\n      \"anyOf\" in schema ? schema.anyOf : schema.oneOf\n    ) as unknown[];\n\n    // All subschemas must validate only strings\n    return (\n      subschemas.length > 0 &&\n      subschemas.every((subschema) => validatesOnlyStrings(subschema))\n    );\n  }\n\n  // We're not going to try on this one, it's too complex - we just assume if it has a \"not\" key and hasn't matched one of the above checks, it's not a string schema.\n  if (\"not\" in schema) {\n    return false; // The not case can validate non-strings\n  }\n\n  if (\"$ref\" in schema && typeof schema.$ref === \"string\") {\n    const ref = schema.$ref as string;\n    const resolved = dereference(schema as Schema);\n    if (resolved[ref]) {\n      return validatesOnlyStrings(resolved[ref]);\n    }\n    return false;\n  }\n\n  // ignore recursive refs and other cases where type is omitted for now\n  // ignore other cases for now where type is omitted\n\n  return false;\n}\n\n// Re-export of the types used throughout langchain for json schema serialization.\n// The plan is to eventually nix zod-to-json-schema altogether in place for\n// zod v4 / a more standardized way of serializing validated inputs, so its re-exported\n// here to remove the dependency on zod-to-json-schema in downstream packages until\n// a determination is made.\n\nexport {\n  type JsonSchema7Type,\n  type JsonSchema7Type as JSONSchema,\n  type JsonSchema7ArrayType,\n  type JsonSchema7ObjectType,\n  type JsonSchema7StringType,\n  type JsonSchema7NumberType,\n  type JsonSchema7NullableType,\n} from \"./zod-to-json-schema/index.js\";\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCA,MAAM,mCAAmB,IAAI,QAA4B;;;;;;;;AASzD,SAAgB,aACd,QACA,QACY;CAIZ,MAAM,WAAW,CAAC,UAAU,UAAU,QAAQ,OAAO,WAAW;CAEhE,IAAI,UAAU;EACZ,MAAM,SAAS,iBAAiB,IAAI,MAAM;EAC1C,IAAI,QAAQ,OAAO;CACrB;CAEA,IAAI;CAEJ,IAAIA,8BAAAA,qBAAqB,MAAM,KAAK,CAACC,YAAAA,cAAc,MAAM,GACvD,SAAS,OAAO,YAAY,CAAC,WAAW,MAAM,EAC5C,QAAQ,WACV,CAAC;MACI,IAAIA,YAAAA,cAAc,MAAM,GAAG;EAChC,MAAM,cAAcC,YAAAA,+BAA+B,QAAQ,IAAI;EAC/D,IAAIC,YAAAA,cAAc,WAAW,GAE3B,UAAA,GAAA,YAAA,aAAA,CADqBC,YAAAA,uBAAuB,aAAa,IACxB,GAA0B,MAAM;OAEjE,UAAA,GAAA,YAAA,aAAA,CAAsB,QAA+B,MAAM;CAE/D,OAAO,IAAIC,YAAAA,cAAc,MAAM,GAC7B,SAASC,wBAAAA,gBAAgB,MAAe;MAExC,SAAS;CAGX,IAAI,YAAY,UAAU,QAAQ,OAAO,WAAW,UAClD,iBAAiB,IAAI,QAAQ,MAAM;CAGrC,OAAO;AACT;;;;;;;;AASA,SAAgB,qBAAqB,QAA0B;CAE7D,IACE,CAAC,UACD,OAAO,WAAW,YAClB,OAAO,KAAK,MAAM,CAAC,CAAC,WAAW,KAC/B,MAAM,QAAQ,MAAM,GAEpB,OAAO;CAIT,IAAI,UAAU,QAAQ;EACpB,IAAI,OAAO,OAAO,SAAS,UACzB,OAAO,OAAO,SAAS;EAGzB,IAAI,MAAM,QAAQ,OAAO,IAAI,GAG3B,OAAO,OAAO,KAAK,OAAO,MAAM,MAAM,QAAQ;EAEhD,OAAO;CACT;CAGA,IAAI,UAAU,QACZ,OACE,MAAM,QAAQ,OAAO,IAAI,KACzB,OAAO,KAAK,SAAS,KACrB,OAAO,KAAK,OAAO,QAAQ,OAAO,QAAQ,QAAQ;CAKtD,IAAI,WAAW,QACb,OAAO,OAAO,OAAO,UAAU;CAIjC,IAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,KAAK,GAEjD,OAAO,OAAO,MAAM,MAAM,cAAc,qBAAqB,SAAS,CAAC;CAGzE,IACG,WAAW,UAAU,MAAM,QAAQ,OAAO,KAAK,KAC/C,WAAW,UAAU,MAAM,QAAQ,OAAO,KAAK,GAChD;EACA,MAAM,aACJ,WAAW,SAAS,OAAO,QAAQ,OAAO;EAI5C,OACE,WAAW,SAAS,KACpB,WAAW,OAAO,cAAc,qBAAqB,SAAS,CAAC;CAEnE;CAGA,IAAI,SAAS,QACX,OAAO;CAGT,IAAI,UAAU,UAAU,OAAO,OAAO,SAAS,UAAU;EACvD,MAAM,MAAM,OAAO;EACnB,MAAM,YAAA,GAAA,sBAAA,YAAA,CAAuB,MAAgB;EAC7C,IAAI,SAAS,MACX,OAAO,qBAAqB,SAAS,IAAI;EAE3C,OAAO;CACT;CAKA,OAAO;AACT"}

package/dist/utils/json_schema.d.cts

@@ -5,10 +5,10 @@ import { JsonSchema7StringType } from "./zod-to-json-schema/parsers/string.cjs";
 import { JsonSchema7NullableType } from "./zod-to-json-schema/parsers/nullable.cjs";
 import { JsonSchema7ObjectType } from "./zod-to-json-schema/parsers/object.cjs";
 import { JsonSchema7Type } from "./zod-to-json-schema/parseTypes.cjs";
+import "./zod-to-json-schema/index.cjs";
 import { StandardJSONSchemaV1 } from "@standard-schema/spec";
 import { toJSONSchema } from "zod/v4/core";
 import { Validator, deepCompareStrict } from "@cfworker/json-schema";
-
 //#region src/utils/json_schema.d.ts
 type ToJSONSchemaParams = NonNullable<Parameters<typeof toJSONSchema>[1]>;
 /**

package/dist/utils/json_schema.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"json_schema.d.cts","names":[],"sources":["../../src/utils/json_schema.ts"],"mappings":";;;;;;;;;;;;KAmBY,kBAAA,GAAqB,WAAA,CAC/B,UAAA,QAAkB,YAAA;;;;;;;;iBA2BJ,YAAA,CACd,MAAA,EAAQ,oBAAA,GAAuB,cAAA,GAAiB,eAAA,EAChD,MAAA,GAAS,kBAAA,GACR,eAAA;;;;;;;;iBA6Ca,oBAAA,CAAqB,MAAA"}
+{"version":3,"file":"json_schema.d.cts","names":[],"sources":["../../src/utils/json_schema.ts"],"mappings":";;;;;;;;;;;;KAmBY,qBAAqB,YAC/B,kBAAkB;;;;;;;;iBA2BJ,aACd,QAAQ,uBAAuB,iBAAiB,iBAChD,SAAS,qBACR;;;;;;;;iBA6Ca,qBAAqB"}

package/dist/utils/json_schema.d.ts

@@ -5,10 +5,10 @@ import { JsonSchema7StringType } from "./zod-to-json-schema/parsers/string.js";
 import { JsonSchema7NullableType } from "./zod-to-json-schema/parsers/nullable.js";
 import { JsonSchema7ObjectType } from "./zod-to-json-schema/parsers/object.js";
 import { JsonSchema7Type } from "./zod-to-json-schema/parseTypes.js";
+import "./zod-to-json-schema/index.js";
 import { toJSONSchema } from "zod/v4/core";
 import { Validator, deepCompareStrict } from "@cfworker/json-schema";
 import { StandardJSONSchemaV1 } from "@standard-schema/spec";
-
 //#region src/utils/json_schema.d.ts
 type ToJSONSchemaParams = NonNullable<Parameters<typeof toJSONSchema>[1]>;
 /**

package/dist/utils/json_schema.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"json_schema.d.ts","names":[],"sources":["../../src/utils/json_schema.ts"],"mappings":";;;;;;;;;;;;KAmBY,kBAAA,GAAqB,WAAA,CAC/B,UAAA,QAAkB,YAAA;;;;;;;;iBA2BJ,YAAA,CACd,MAAA,EAAQ,oBAAA,GAAuB,cAAA,GAAiB,eAAA,EAChD,MAAA,GAAS,kBAAA,GACR,eAAA;;;;;;;;iBA6Ca,oBAAA,CAAqB,MAAA"}
+{"version":3,"file":"json_schema.d.ts","names":[],"sources":["../../src/utils/json_schema.ts"],"mappings":";;;;;;;;;;;;KAmBY,qBAAqB,YAC/B,kBAAkB;;;;;;;;iBA2BJ,aACd,QAAQ,uBAAuB,iBAAiB,iBAChD,SAAS,qBACR;;;;;;;;iBA6Ca,qBAAqB"}

package/dist/utils/json_schema.js.map

@@ -1 +1 @@
-{"version":3,"file":"json_schema.js","names":[],"sources":["../../src/utils/json_schema.ts"],"sourcesContent":["import { toJSONSchema, type $ZodType } from \"zod/v4/core\";\nimport { dereference, type Schema } from \"@cfworker/json-schema\";\nimport {\n  isZodSchemaV3,\n  isZodSchemaV4,\n  InteropZodType,\n  interopZodObjectStrict,\n  isZodObjectV4,\n  interopZodTransformInputSchema,\n} from \"./types/zod.js\";\nimport {\n  type JsonSchema7Type as JSONSchema,\n  zodToJsonSchema,\n} from \"./zod-to-json-schema/index.js\";\nimport { StandardJSONSchemaV1 } from \"@standard-schema/spec\";\nimport { isStandardJsonSchema } from \"./standard_schema.js\";\n\nexport { deepCompareStrict, Validator } from \"@cfworker/json-schema\";\n\nexport type ToJSONSchemaParams = NonNullable<\n  Parameters<typeof toJSONSchema>[1]\n>;\n\n/**\n * WeakMap cache for Zod/Standard-Schema → JSON Schema conversions.\n *\n * Keyed on the schema object reference. Since Zod schemas are immutable and\n * the same `tool.schema` reference is passed on every LLM call, this\n * eliminates redundant serializations. For example, an agent with 6 tools\n * doing 15 steps across 3 parallel subagents would otherwise run 270\n * identical conversions per invocation.\n *\n * Only used when no custom `params` are passed (the common case for tool\n * binding). WeakMap ensures cached entries are GC'd when the schema goes\n * out of scope.\n *\n * @internal\n */\nconst _jsonSchemaCache = new WeakMap<object, JSONSchema>();\n\n/**\n * Converts a Standard JSON schema, Zod schema or JSON schema to a JSON schema.\n * Results are cached by schema reference when no custom params are passed.\n * @param schema - The schema to convert.\n * @param params - The parameters to pass to the toJSONSchema function.\n * @returns The converted schema.\n */\nexport function toJsonSchema(\n  schema: StandardJSONSchemaV1 | InteropZodType | JSONSchema,\n  params?: ToJSONSchemaParams\n): JSONSchema {\n  // Cache when no custom params are passed (the default for tool binding).\n  // Params can change the output (e.g., different target draft), so we\n  // bypass the cache when they're provided.\n  const canCache = !params && schema != null && typeof schema === \"object\";\n\n  if (canCache) {\n    const cached = _jsonSchemaCache.get(schema);\n    if (cached) return cached;\n  }\n\n  let result: JSONSchema;\n\n  if (isStandardJsonSchema(schema) && !isZodSchemaV4(schema)) {\n    result = schema[\"~standard\"].jsonSchema.input({\n      target: \"draft-07\",\n    }) as JSONSchema;\n  } else if (isZodSchemaV4(schema)) {\n    const inputSchema = interopZodTransformInputSchema(schema, true);\n    if (isZodObjectV4(inputSchema)) {\n      const strictSchema = interopZodObjectStrict(inputSchema, true);\n      result = toJSONSchema(strictSchema as unknown as $ZodType, params);\n    } else {\n      result = toJSONSchema(schema as unknown as $ZodType, params);\n    }\n  } else if (isZodSchemaV3(schema)) {\n    result = zodToJsonSchema(schema as never);\n  } else {\n    result = schema as JSONSchema;\n  }\n\n  if (canCache && result != null && typeof result === \"object\") {\n    _jsonSchemaCache.set(schema, result);\n  }\n\n  return result;\n}\n\n/**\n * Validates if a JSON schema validates only strings. May return false negatives in some edge cases\n * (like recursive or unresolvable refs).\n *\n * @param schema - The schema to validate.\n * @returns `true` if the schema validates only strings, `false` otherwise.\n */\nexport function validatesOnlyStrings(schema: unknown): boolean {\n  // Null, undefined, or empty schema\n  if (\n    !schema ||\n    typeof schema !== \"object\" ||\n    Object.keys(schema).length === 0 ||\n    Array.isArray(schema)\n  ) {\n    return false; // Validates anything, not just strings\n  }\n\n  // Explicit type constraint\n  if (\"type\" in schema) {\n    if (typeof schema.type === \"string\") {\n      return schema.type === \"string\";\n    }\n\n    if (Array.isArray(schema.type)) {\n      // not sure why someone would do `\"type\": [\"string\"]` or especially `\"type\": [\"string\",\n      // \"string\", \"string\", ...]` but we're not here to judge\n      return schema.type.every((t) => t === \"string\");\n    }\n    return false; // Invalid or non-string type\n  }\n\n  // Enum with only string values\n  if (\"enum\" in schema) {\n    return (\n      Array.isArray(schema.enum) &&\n      schema.enum.length > 0 &&\n      schema.enum.every((val) => typeof val === \"string\")\n    );\n  }\n\n  // String constant\n  if (\"const\" in schema) {\n    return typeof schema.const === \"string\";\n  }\n\n  // Schema combinations\n  if (\"allOf\" in schema && Array.isArray(schema.allOf)) {\n    // If any subschema validates only strings, then the overall schema validates only strings\n    return schema.allOf.some((subschema) => validatesOnlyStrings(subschema));\n  }\n\n  if (\n    (\"anyOf\" in schema && Array.isArray(schema.anyOf)) ||\n    (\"oneOf\" in schema && Array.isArray(schema.oneOf))\n  ) {\n    const subschemas = (\n      \"anyOf\" in schema ? schema.anyOf : schema.oneOf\n    ) as unknown[];\n\n    // All subschemas must validate only strings\n    return (\n      subschemas.length > 0 &&\n      subschemas.every((subschema) => validatesOnlyStrings(subschema))\n    );\n  }\n\n  // We're not going to try on this one, it's too complex - we just assume if it has a \"not\" key and hasn't matched one of the above checks, it's not a string schema.\n  if (\"not\" in schema) {\n    return false; // The not case can validate non-strings\n  }\n\n  if (\"$ref\" in schema && typeof schema.$ref === \"string\") {\n    const ref = schema.$ref as string;\n    const resolved = dereference(schema as Schema);\n    if (resolved[ref]) {\n      return validatesOnlyStrings(resolved[ref]);\n    }\n    return false;\n  }\n\n  // ignore recursive refs and other cases where type is omitted for now\n  // ignore other cases for now where type is omitted\n\n  return false;\n}\n\n// Re-export of the types used throughout langchain for json schema serialization.\n// The plan is to eventually nix zod-to-json-schema altogether in place for\n// zod v4 / a more standardized way of serializing validated inputs, so its re-exported\n// here to remove the dependency on zod-to-json-schema in downstream packages until\n// a determination is made.\n\nexport {\n  type JsonSchema7Type,\n  type JsonSchema7Type as JSONSchema,\n  type JsonSchema7ArrayType,\n  type JsonSchema7ObjectType,\n  type JsonSchema7StringType,\n  type JsonSchema7NumberType,\n  type JsonSchema7NullableType,\n} from \"./zod-to-json-schema/index.js\";\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCA,MAAM,mCAAmB,IAAI,SAA6B;;;;;;;;AAS1D,SAAgB,aACd,QACA,QACY;CAIZ,MAAM,WAAW,CAAC,UAAU,UAAU,QAAQ,OAAO,WAAW;AAEhE,KAAI,UAAU;EACZ,MAAM,SAAS,iBAAiB,IAAI,OAAO;AAC3C,MAAI,OAAQ,QAAO;;CAGrB,IAAI;AAEJ,KAAI,qBAAqB,OAAO,IAAI,CAAC,cAAc,OAAO,CACxD,UAAS,OAAO,aAAa,WAAW,MAAM,EAC5C,QAAQ,YACT,CAAC;UACO,cAAc,OAAO,EAAE;EAChC,MAAM,cAAc,+BAA+B,QAAQ,KAAK;AAChE,MAAI,cAAc,YAAY,CAE5B,UAAS,aADY,uBAAuB,aAAa,KACvB,EAAyB,OAAO;MAElE,UAAS,aAAa,QAA+B,OAAO;YAErD,cAAc,OAAO,CAC9B,UAAS,gBAAgB,OAAgB;KAEzC,UAAS;AAGX,KAAI,YAAY,UAAU,QAAQ,OAAO,WAAW,SAClD,kBAAiB,IAAI,QAAQ,OAAO;AAGtC,QAAO;;;;;;;;;AAUT,SAAgB,qBAAqB,QAA0B;AAE7D,KACE,CAAC,UACD,OAAO,WAAW,YAClB,OAAO,KAAK,OAAO,CAAC,WAAW,KAC/B,MAAM,QAAQ,OAAO,CAErB,QAAO;AAIT,KAAI,UAAU,QAAQ;AACpB,MAAI,OAAO,OAAO,SAAS,SACzB,QAAO,OAAO,SAAS;AAGzB,MAAI,MAAM,QAAQ,OAAO,KAAK,CAG5B,QAAO,OAAO,KAAK,OAAO,MAAM,MAAM,SAAS;AAEjD,SAAO;;AAIT,KAAI,UAAU,OACZ,QACE,MAAM,QAAQ,OAAO,KAAK,IAC1B,OAAO,KAAK,SAAS,KACrB,OAAO,KAAK,OAAO,QAAQ,OAAO,QAAQ,SAAS;AAKvD,KAAI,WAAW,OACb,QAAO,OAAO,OAAO,UAAU;AAIjC,KAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,CAElD,QAAO,OAAO,MAAM,MAAM,cAAc,qBAAqB,UAAU,CAAC;AAG1E,KACG,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,IAChD,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,EACjD;EACA,MAAM,aACJ,WAAW,SAAS,OAAO,QAAQ,OAAO;AAI5C,SACE,WAAW,SAAS,KACpB,WAAW,OAAO,cAAc,qBAAqB,UAAU,CAAC;;AAKpE,KAAI,SAAS,OACX,QAAO;AAGT,KAAI,UAAU,UAAU,OAAO,OAAO,SAAS,UAAU;EACvD,MAAM,MAAM,OAAO;EACnB,MAAM,WAAW,YAAY,OAAiB;AAC9C,MAAI,SAAS,KACX,QAAO,qBAAqB,SAAS,KAAK;AAE5C,SAAO;;AAMT,QAAO"}
+{"version":3,"file":"json_schema.js","names":[],"sources":["../../src/utils/json_schema.ts"],"sourcesContent":["import { toJSONSchema, type $ZodType } from \"zod/v4/core\";\nimport { dereference, type Schema } from \"@cfworker/json-schema\";\nimport {\n  isZodSchemaV3,\n  isZodSchemaV4,\n  InteropZodType,\n  interopZodObjectStrict,\n  isZodObjectV4,\n  interopZodTransformInputSchema,\n} from \"./types/zod.js\";\nimport {\n  type JsonSchema7Type as JSONSchema,\n  zodToJsonSchema,\n} from \"./zod-to-json-schema/index.js\";\nimport { StandardJSONSchemaV1 } from \"@standard-schema/spec\";\nimport { isStandardJsonSchema } from \"./standard_schema.js\";\n\nexport { deepCompareStrict, Validator } from \"@cfworker/json-schema\";\n\nexport type ToJSONSchemaParams = NonNullable<\n  Parameters<typeof toJSONSchema>[1]\n>;\n\n/**\n * WeakMap cache for Zod/Standard-Schema → JSON Schema conversions.\n *\n * Keyed on the schema object reference. Since Zod schemas are immutable and\n * the same `tool.schema` reference is passed on every LLM call, this\n * eliminates redundant serializations. For example, an agent with 6 tools\n * doing 15 steps across 3 parallel subagents would otherwise run 270\n * identical conversions per invocation.\n *\n * Only used when no custom `params` are passed (the common case for tool\n * binding). WeakMap ensures cached entries are GC'd when the schema goes\n * out of scope.\n *\n * @internal\n */\nconst _jsonSchemaCache = new WeakMap<object, JSONSchema>();\n\n/**\n * Converts a Standard JSON schema, Zod schema or JSON schema to a JSON schema.\n * Results are cached by schema reference when no custom params are passed.\n * @param schema - The schema to convert.\n * @param params - The parameters to pass to the toJSONSchema function.\n * @returns The converted schema.\n */\nexport function toJsonSchema(\n  schema: StandardJSONSchemaV1 | InteropZodType | JSONSchema,\n  params?: ToJSONSchemaParams\n): JSONSchema {\n  // Cache when no custom params are passed (the default for tool binding).\n  // Params can change the output (e.g., different target draft), so we\n  // bypass the cache when they're provided.\n  const canCache = !params && schema != null && typeof schema === \"object\";\n\n  if (canCache) {\n    const cached = _jsonSchemaCache.get(schema);\n    if (cached) return cached;\n  }\n\n  let result: JSONSchema;\n\n  if (isStandardJsonSchema(schema) && !isZodSchemaV4(schema)) {\n    result = schema[\"~standard\"].jsonSchema.input({\n      target: \"draft-07\",\n    }) as JSONSchema;\n  } else if (isZodSchemaV4(schema)) {\n    const inputSchema = interopZodTransformInputSchema(schema, true);\n    if (isZodObjectV4(inputSchema)) {\n      const strictSchema = interopZodObjectStrict(inputSchema, true);\n      result = toJSONSchema(strictSchema as unknown as $ZodType, params);\n    } else {\n      result = toJSONSchema(schema as unknown as $ZodType, params);\n    }\n  } else if (isZodSchemaV3(schema)) {\n    result = zodToJsonSchema(schema as never);\n  } else {\n    result = schema as JSONSchema;\n  }\n\n  if (canCache && result != null && typeof result === \"object\") {\n    _jsonSchemaCache.set(schema, result);\n  }\n\n  return result;\n}\n\n/**\n * Validates if a JSON schema validates only strings. May return false negatives in some edge cases\n * (like recursive or unresolvable refs).\n *\n * @param schema - The schema to validate.\n * @returns `true` if the schema validates only strings, `false` otherwise.\n */\nexport function validatesOnlyStrings(schema: unknown): boolean {\n  // Null, undefined, or empty schema\n  if (\n    !schema ||\n    typeof schema !== \"object\" ||\n    Object.keys(schema).length === 0 ||\n    Array.isArray(schema)\n  ) {\n    return false; // Validates anything, not just strings\n  }\n\n  // Explicit type constraint\n  if (\"type\" in schema) {\n    if (typeof schema.type === \"string\") {\n      return schema.type === \"string\";\n    }\n\n    if (Array.isArray(schema.type)) {\n      // not sure why someone would do `\"type\": [\"string\"]` or especially `\"type\": [\"string\",\n      // \"string\", \"string\", ...]` but we're not here to judge\n      return schema.type.every((t) => t === \"string\");\n    }\n    return false; // Invalid or non-string type\n  }\n\n  // Enum with only string values\n  if (\"enum\" in schema) {\n    return (\n      Array.isArray(schema.enum) &&\n      schema.enum.length > 0 &&\n      schema.enum.every((val) => typeof val === \"string\")\n    );\n  }\n\n  // String constant\n  if (\"const\" in schema) {\n    return typeof schema.const === \"string\";\n  }\n\n  // Schema combinations\n  if (\"allOf\" in schema && Array.isArray(schema.allOf)) {\n    // If any subschema validates only strings, then the overall schema validates only strings\n    return schema.allOf.some((subschema) => validatesOnlyStrings(subschema));\n  }\n\n  if (\n    (\"anyOf\" in schema && Array.isArray(schema.anyOf)) ||\n    (\"oneOf\" in schema && Array.isArray(schema.oneOf))\n  ) {\n    const subschemas = (\n      \"anyOf\" in schema ? schema.anyOf : schema.oneOf\n    ) as unknown[];\n\n    // All subschemas must validate only strings\n    return (\n      subschemas.length > 0 &&\n      subschemas.every((subschema) => validatesOnlyStrings(subschema))\n    );\n  }\n\n  // We're not going to try on this one, it's too complex - we just assume if it has a \"not\" key and hasn't matched one of the above checks, it's not a string schema.\n  if (\"not\" in schema) {\n    return false; // The not case can validate non-strings\n  }\n\n  if (\"$ref\" in schema && typeof schema.$ref === \"string\") {\n    const ref = schema.$ref as string;\n    const resolved = dereference(schema as Schema);\n    if (resolved[ref]) {\n      return validatesOnlyStrings(resolved[ref]);\n    }\n    return false;\n  }\n\n  // ignore recursive refs and other cases where type is omitted for now\n  // ignore other cases for now where type is omitted\n\n  return false;\n}\n\n// Re-export of the types used throughout langchain for json schema serialization.\n// The plan is to eventually nix zod-to-json-schema altogether in place for\n// zod v4 / a more standardized way of serializing validated inputs, so its re-exported\n// here to remove the dependency on zod-to-json-schema in downstream packages until\n// a determination is made.\n\nexport {\n  type JsonSchema7Type,\n  type JsonSchema7Type as JSONSchema,\n  type JsonSchema7ArrayType,\n  type JsonSchema7ObjectType,\n  type JsonSchema7StringType,\n  type JsonSchema7NumberType,\n  type JsonSchema7NullableType,\n} from \"./zod-to-json-schema/index.js\";\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCA,MAAM,mCAAmB,IAAI,QAA4B;;;;;;;;AASzD,SAAgB,aACd,QACA,QACY;CAIZ,MAAM,WAAW,CAAC,UAAU,UAAU,QAAQ,OAAO,WAAW;CAEhE,IAAI,UAAU;EACZ,MAAM,SAAS,iBAAiB,IAAI,MAAM;EAC1C,IAAI,QAAQ,OAAO;CACrB;CAEA,IAAI;CAEJ,IAAI,qBAAqB,MAAM,KAAK,CAAC,cAAc,MAAM,GACvD,SAAS,OAAO,YAAY,CAAC,WAAW,MAAM,EAC5C,QAAQ,WACV,CAAC;MACI,IAAI,cAAc,MAAM,GAAG;EAChC,MAAM,cAAc,+BAA+B,QAAQ,IAAI;EAC/D,IAAI,cAAc,WAAW,GAE3B,SAAS,aADY,uBAAuB,aAAa,IACxB,GAA0B,MAAM;OAEjE,SAAS,aAAa,QAA+B,MAAM;CAE/D,OAAO,IAAI,cAAc,MAAM,GAC7B,SAAS,gBAAgB,MAAe;MAExC,SAAS;CAGX,IAAI,YAAY,UAAU,QAAQ,OAAO,WAAW,UAClD,iBAAiB,IAAI,QAAQ,MAAM;CAGrC,OAAO;AACT;;;;;;;;AASA,SAAgB,qBAAqB,QAA0B;CAE7D,IACE,CAAC,UACD,OAAO,WAAW,YAClB,OAAO,KAAK,MAAM,CAAC,CAAC,WAAW,KAC/B,MAAM,QAAQ,MAAM,GAEpB,OAAO;CAIT,IAAI,UAAU,QAAQ;EACpB,IAAI,OAAO,OAAO,SAAS,UACzB,OAAO,OAAO,SAAS;EAGzB,IAAI,MAAM,QAAQ,OAAO,IAAI,GAG3B,OAAO,OAAO,KAAK,OAAO,MAAM,MAAM,QAAQ;EAEhD,OAAO;CACT;CAGA,IAAI,UAAU,QACZ,OACE,MAAM,QAAQ,OAAO,IAAI,KACzB,OAAO,KAAK,SAAS,KACrB,OAAO,KAAK,OAAO,QAAQ,OAAO,QAAQ,QAAQ;CAKtD,IAAI,WAAW,QACb,OAAO,OAAO,OAAO,UAAU;CAIjC,IAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,KAAK,GAEjD,OAAO,OAAO,MAAM,MAAM,cAAc,qBAAqB,SAAS,CAAC;CAGzE,IACG,WAAW,UAAU,MAAM,QAAQ,OAAO,KAAK,KAC/C,WAAW,UAAU,MAAM,QAAQ,OAAO,KAAK,GAChD;EACA,MAAM,aACJ,WAAW,SAAS,OAAO,QAAQ,OAAO;EAI5C,OACE,WAAW,SAAS,KACpB,WAAW,OAAO,cAAc,qBAAqB,SAAS,CAAC;CAEnE;CAGA,IAAI,SAAS,QACX,OAAO;CAGT,IAAI,UAAU,UAAU,OAAO,OAAO,SAAS,UAAU;EACvD,MAAM,MAAM,OAAO;EACnB,MAAM,WAAW,YAAY,MAAgB;EAC7C,IAAI,SAAS,MACX,OAAO,qBAAqB,SAAS,IAAI;EAE3C,OAAO;CACT;CAKA,OAAO;AACT"}

package/dist/utils/math.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"math.cjs","names":["cosine","innerProductDistance","euclidean"],"sources":["../../src/utils/math.ts"],"sourcesContent":["import { cosine } from \"./ml-distance/similarities.js\";\nimport { innerProduct as innerProductDistance } from \"./ml-distance/distances.js\";\nimport { euclidean } from \"./ml-distance-euclidean/euclidean.js\";\n\ntype VectorFunction = (xVector: number[], yVector: number[]) => number;\n\n/**\n * Apply a row-wise function between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n * @param {VectorFunction} func - The function to apply.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.\n */\n\nexport function matrixFunc(\n  X: number[][],\n  Y: number[][],\n  func: VectorFunction\n): number[][] {\n  if (\n    X.length === 0 ||\n    X[0].length === 0 ||\n    Y.length === 0 ||\n    Y[0].length === 0\n  ) {\n    return [[]];\n  }\n\n  if (X[0].length !== Y[0].length) {\n    throw new Error(\n      `Number of columns in X and Y must be the same. X has shape ${[\n        X.length,\n        X[0].length,\n      ]} and Y has shape ${[Y.length, Y[0].length]}.`\n    );\n  }\n\n  return X.map((xVector) =>\n    Y.map((yVector) => func(xVector, yVector)).map((similarity) =>\n      Number.isNaN(similarity) ? 0 : similarity\n    )\n  );\n}\n\nexport function normalize(M: number[][], similarity = false): number[][] {\n  const max = matrixMaxVal(M);\n  return M.map((row) =>\n    row.map((val) => (similarity ? 1 - val / max : val / max))\n  );\n}\n\n/**\n * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.\n */\nexport function cosineSimilarity(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, cosine);\n}\n\nexport function innerProduct(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, innerProductDistance);\n}\n\nexport function euclideanDistance(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, euclidean);\n}\n\n/**\n * This function implements the Maximal Marginal Relevance algorithm\n * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.\n *\n * @param {number[]|number[][]} queryEmbedding - The query embedding.\n * @param {number[][]} embeddingList - The list of embeddings to select from.\n * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.\n * @param {number} [k=4] - The maximum number of embeddings to select.\n *\n * @returns {number[]} The indexes of the selected embeddings in the embeddingList.\n */\nexport function maximalMarginalRelevance(\n  queryEmbedding: number[] | number[][],\n  embeddingList: number[][],\n  lambda = 0.5,\n  k = 4\n): number[] {\n  if (Math.min(k, embeddingList.length) <= 0) {\n    return [];\n  }\n\n  const queryEmbeddingExpanded = (\n    Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding]\n  ) as number[][];\n\n  const similarityToQuery = cosineSimilarity(\n    queryEmbeddingExpanded,\n    embeddingList\n  )[0];\n  const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;\n\n  const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];\n  const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];\n\n  while (selectedEmbeddingsIndexes.length < Math.min(k, embeddingList.length)) {\n    let bestScore = -Infinity;\n    let bestIndex = -1;\n\n    const similarityToSelected = cosineSimilarity(\n      embeddingList,\n      selectedEmbeddings\n    );\n\n    similarityToQuery.forEach((queryScore, queryScoreIndex) => {\n      if (selectedEmbeddingsIndexes.includes(queryScoreIndex)) {\n        return;\n      }\n      const maxSimilarityToSelected = Math.max(\n        ...similarityToSelected[queryScoreIndex]\n      );\n      const score =\n        lambda * queryScore - (1 - lambda) * maxSimilarityToSelected;\n\n      if (score > bestScore) {\n        bestScore = score;\n        bestIndex = queryScoreIndex;\n      }\n    });\n    selectedEmbeddings.push(embeddingList[bestIndex]);\n    selectedEmbeddingsIndexes.push(bestIndex);\n  }\n\n  return selectedEmbeddingsIndexes;\n}\n\ntype MaxInfo = {\n  maxIndex: number;\n  maxValue: number;\n};\n\n/**\n * Finds the index of the maximum value in the given array.\n * @param {number[]} array - The input array.\n *\n * @returns {number} The index of the maximum value in the array. If the array is empty, returns -1.\n */\nfunction argMax(array: number[]): MaxInfo {\n  if (array.length === 0) {\n    return {\n      maxIndex: -1,\n      maxValue: NaN,\n    };\n  }\n\n  let maxValue = array[0];\n  let maxIndex = 0;\n\n  for (let i = 1; i < array.length; i += 1) {\n    if (array[i] > maxValue) {\n      maxIndex = i;\n      maxValue = array[i];\n    }\n  }\n  return { maxIndex, maxValue };\n}\n\nfunction matrixMaxVal(arrays: number[][]): number {\n  return arrays.reduce(\n    (acc, array) => Math.max(acc, argMax(array).maxValue),\n    0\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WACd,GACA,GACA,MACY;AACZ,KACE,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,KAChB,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,EAEhB,QAAO,CAAC,EAAE,CAAC;AAGb,KAAI,EAAE,GAAG,WAAW,EAAE,GAAG,OACvB,OAAM,IAAI,MACR,8DAA8D,CAC5D,EAAE,QACF,EAAE,GAAG,OACN,CAAC,mBAAmB,CAAC,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,GAC9C;AAGH,QAAO,EAAE,KAAK,YACZ,EAAE,KAAK,YAAY,KAAK,SAAS,QAAQ,CAAC,CAAC,KAAK,eAC9C,OAAO,MAAM,WAAW,GAAG,IAAI,WAChC,CACF;;AAGH,SAAgB,UAAU,GAAe,aAAa,OAAmB;CACvE,MAAM,MAAM,aAAa,EAAE;AAC3B,QAAO,EAAE,KAAK,QACZ,IAAI,KAAK,QAAS,aAAa,IAAI,MAAM,MAAM,MAAM,IAAK,CAC3D;;;;;;;;;;;;AAaH,SAAgB,iBAAiB,GAAe,GAA2B;AACzE,QAAO,WAAW,GAAG,GAAGA,qBAAAA,OAAO;;AAGjC,SAAgB,aAAa,GAAe,GAA2B;AACrE,QAAO,WAAW,GAAG,GAAGC,kBAAAA,aAAqB;;AAG/C,SAAgB,kBAAkB,GAAe,GAA2B;AAC1E,QAAO,WAAW,GAAG,GAAGC,kBAAAA,UAAU;;;;;;;;;;;;;AAcpC,SAAgB,yBACd,gBACA,eACA,SAAS,IACT,IAAI,GACM;AACV,KAAI,KAAK,IAAI,GAAG,cAAc,OAAO,IAAI,EACvC,QAAO,EAAE;CAOX,MAAM,oBAAoB,iBAHxB,MAAM,QAAQ,eAAe,GAAG,GAAG,iBAAiB,CAAC,eAAe,EAKpE,cACD,CAAC;CACF,MAAM,4BAA4B,OAAO,kBAAkB,CAAC;CAE5D,MAAM,qBAAqB,CAAC,cAAc,2BAA2B;CACrE,MAAM,4BAA4B,CAAC,0BAA0B;AAE7D,QAAO,0BAA0B,SAAS,KAAK,IAAI,GAAG,cAAc,OAAO,EAAE;EAC3E,IAAI,YAAY;EAChB,IAAI,YAAY;EAEhB,MAAM,uBAAuB,iBAC3B,eACA,mBACD;AAED,oBAAkB,SAAS,YAAY,oBAAoB;AACzD,OAAI,0BAA0B,SAAS,gBAAgB,CACrD;GAEF,MAAM,0BAA0B,KAAK,IACnC,GAAG,qBAAqB,iBACzB;GACD,MAAM,QACJ,SAAS,cAAc,IAAI,UAAU;AAEvC,OAAI,QAAQ,WAAW;AACrB,gBAAY;AACZ,gBAAY;;IAEd;AACF,qBAAmB,KAAK,cAAc,WAAW;AACjD,4BAA0B,KAAK,UAAU;;AAG3C,QAAO;;;;;;;;AAcT,SAAS,OAAO,OAA0B;AACxC,KAAI,MAAM,WAAW,EACnB,QAAO;EACL,UAAU;EACV,UAAU;EACX;CAGH,IAAI,WAAW,MAAM;CACrB,IAAI,WAAW;AAEf,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EACrC,KAAI,MAAM,KAAK,UAAU;AACvB,aAAW;AACX,aAAW,MAAM;;AAGrB,QAAO;EAAE;EAAU;EAAU;;AAG/B,SAAS,aAAa,QAA4B;AAChD,QAAO,OAAO,QACX,KAAK,UAAU,KAAK,IAAI,KAAK,OAAO,MAAM,CAAC,SAAS,EACrD,EACD"}
+{"version":3,"file":"math.cjs","names":["cosine","innerProductDistance","euclidean"],"sources":["../../src/utils/math.ts"],"sourcesContent":["import { cosine } from \"./ml-distance/similarities.js\";\nimport { innerProduct as innerProductDistance } from \"./ml-distance/distances.js\";\nimport { euclidean } from \"./ml-distance-euclidean/euclidean.js\";\n\ntype VectorFunction = (xVector: number[], yVector: number[]) => number;\n\n/**\n * Apply a row-wise function between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n * @param {VectorFunction} func - The function to apply.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.\n */\n\nexport function matrixFunc(\n  X: number[][],\n  Y: number[][],\n  func: VectorFunction\n): number[][] {\n  if (\n    X.length === 0 ||\n    X[0].length === 0 ||\n    Y.length === 0 ||\n    Y[0].length === 0\n  ) {\n    return [[]];\n  }\n\n  if (X[0].length !== Y[0].length) {\n    throw new Error(\n      `Number of columns in X and Y must be the same. X has shape ${[\n        X.length,\n        X[0].length,\n      ]} and Y has shape ${[Y.length, Y[0].length]}.`\n    );\n  }\n\n  return X.map((xVector) =>\n    Y.map((yVector) => func(xVector, yVector)).map((similarity) =>\n      Number.isNaN(similarity) ? 0 : similarity\n    )\n  );\n}\n\nexport function normalize(M: number[][], similarity = false): number[][] {\n  const max = matrixMaxVal(M);\n  return M.map((row) =>\n    row.map((val) => (similarity ? 1 - val / max : val / max))\n  );\n}\n\n/**\n * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.\n */\nexport function cosineSimilarity(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, cosine);\n}\n\nexport function innerProduct(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, innerProductDistance);\n}\n\nexport function euclideanDistance(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, euclidean);\n}\n\n/**\n * This function implements the Maximal Marginal Relevance algorithm\n * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.\n *\n * @param {number[]|number[][]} queryEmbedding - The query embedding.\n * @param {number[][]} embeddingList - The list of embeddings to select from.\n * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.\n * @param {number} [k=4] - The maximum number of embeddings to select.\n *\n * @returns {number[]} The indexes of the selected embeddings in the embeddingList.\n */\nexport function maximalMarginalRelevance(\n  queryEmbedding: number[] | number[][],\n  embeddingList: number[][],\n  lambda = 0.5,\n  k = 4\n): number[] {\n  if (Math.min(k, embeddingList.length) <= 0) {\n    return [];\n  }\n\n  const queryEmbeddingExpanded = (\n    Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding]\n  ) as number[][];\n\n  const similarityToQuery = cosineSimilarity(\n    queryEmbeddingExpanded,\n    embeddingList\n  )[0];\n  const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;\n\n  const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];\n  const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];\n\n  while (selectedEmbeddingsIndexes.length < Math.min(k, embeddingList.length)) {\n    let bestScore = -Infinity;\n    let bestIndex = -1;\n\n    const similarityToSelected = cosineSimilarity(\n      embeddingList,\n      selectedEmbeddings\n    );\n\n    similarityToQuery.forEach((queryScore, queryScoreIndex) => {\n      if (selectedEmbeddingsIndexes.includes(queryScoreIndex)) {\n        return;\n      }\n      const maxSimilarityToSelected = Math.max(\n        ...similarityToSelected[queryScoreIndex]\n      );\n      const score =\n        lambda * queryScore - (1 - lambda) * maxSimilarityToSelected;\n\n      if (score > bestScore) {\n        bestScore = score;\n        bestIndex = queryScoreIndex;\n      }\n    });\n    selectedEmbeddings.push(embeddingList[bestIndex]);\n    selectedEmbeddingsIndexes.push(bestIndex);\n  }\n\n  return selectedEmbeddingsIndexes;\n}\n\ntype MaxInfo = {\n  maxIndex: number;\n  maxValue: number;\n};\n\n/**\n * Finds the index of the maximum value in the given array.\n * @param {number[]} array - The input array.\n *\n * @returns {number} The index of the maximum value in the array. If the array is empty, returns -1.\n */\nfunction argMax(array: number[]): MaxInfo {\n  if (array.length === 0) {\n    return {\n      maxIndex: -1,\n      maxValue: NaN,\n    };\n  }\n\n  let maxValue = array[0];\n  let maxIndex = 0;\n\n  for (let i = 1; i < array.length; i += 1) {\n    if (array[i] > maxValue) {\n      maxIndex = i;\n      maxValue = array[i];\n    }\n  }\n  return { maxIndex, maxValue };\n}\n\nfunction matrixMaxVal(arrays: number[][]): number {\n  return arrays.reduce(\n    (acc, array) => Math.max(acc, argMax(array).maxValue),\n    0\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WACd,GACA,GACA,MACY;CACZ,IACE,EAAE,WAAW,KACb,EAAE,EAAE,CAAC,WAAW,KAChB,EAAE,WAAW,KACb,EAAE,EAAE,CAAC,WAAW,GAEhB,OAAO,CAAC,CAAC,CAAC;CAGZ,IAAI,EAAE,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC,QACvB,MAAM,IAAI,MACR,8DAA8D,CAC5D,EAAE,QACF,EAAE,EAAE,CAAC,MACP,EAAE,mBAAmB,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC,MAAM,EAAE,EAC/C;CAGF,OAAO,EAAE,KAAK,YACZ,EAAE,KAAK,YAAY,KAAK,SAAS,OAAO,CAAC,CAAC,CAAC,KAAK,eAC9C,OAAO,MAAM,UAAU,IAAI,IAAI,UACjC,CACF;AACF;AAEA,SAAgB,UAAU,GAAe,aAAa,OAAmB;CACvE,MAAM,MAAM,aAAa,CAAC;CAC1B,OAAO,EAAE,KAAK,QACZ,IAAI,KAAK,QAAS,aAAa,IAAI,MAAM,MAAM,MAAM,GAAI,CAC3D;AACF;;;;;;;;;;;AAYA,SAAgB,iBAAiB,GAAe,GAA2B;CACzE,OAAO,WAAW,GAAG,GAAGA,qBAAAA,MAAM;AAChC;AAEA,SAAgB,aAAa,GAAe,GAA2B;CACrE,OAAO,WAAW,GAAG,GAAGC,kBAAAA,YAAoB;AAC9C;AAEA,SAAgB,kBAAkB,GAAe,GAA2B;CAC1E,OAAO,WAAW,GAAG,GAAGC,kBAAAA,SAAS;AACnC;;;;;;;;;;;;AAaA,SAAgB,yBACd,gBACA,eACA,SAAS,IACT,IAAI,GACM;CACV,IAAI,KAAK,IAAI,GAAG,cAAc,MAAM,KAAK,GACvC,OAAO,CAAC;CAOV,MAAM,oBAAoB,iBAHxB,MAAM,QAAQ,eAAe,EAAE,IAAI,iBAAiB,CAAC,cAAc,GAKnE,aACF,CAAC,CAAC;CACF,MAAM,4BAA4B,OAAO,iBAAiB,CAAC,CAAC;CAE5D,MAAM,qBAAqB,CAAC,cAAc,0BAA0B;CACpE,MAAM,4BAA4B,CAAC,yBAAyB;CAE5D,OAAO,0BAA0B,SAAS,KAAK,IAAI,GAAG,cAAc,MAAM,GAAG;EAC3E,IAAI,YAAY;EAChB,IAAI,YAAY;EAEhB,MAAM,uBAAuB,iBAC3B,eACA,kBACF;EAEA,kBAAkB,SAAS,YAAY,oBAAoB;GACzD,IAAI,0BAA0B,SAAS,eAAe,GACpD;GAEF,MAAM,0BAA0B,KAAK,IACnC,GAAG,qBAAqB,gBAC1B;GACA,MAAM,QACJ,SAAS,cAAc,IAAI,UAAU;GAEvC,IAAI,QAAQ,WAAW;IACrB,YAAY;IACZ,YAAY;GACd;EACF,CAAC;EACD,mBAAmB,KAAK,cAAc,UAAU;EAChD,0BAA0B,KAAK,SAAS;CAC1C;CAEA,OAAO;AACT;;;;;;;AAaA,SAAS,OAAO,OAA0B;CACxC,IAAI,MAAM,WAAW,GACnB,OAAO;EACL,UAAU;EACV,UAAU;CACZ;CAGF,IAAI,WAAW,MAAM;CACrB,IAAI,WAAW;CAEf,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GACrC,IAAI,MAAM,KAAK,UAAU;EACvB,WAAW;EACX,WAAW,MAAM;CACnB;CAEF,OAAO;EAAE;EAAU;CAAS;AAC9B;AAEA,SAAS,aAAa,QAA4B;CAChD,OAAO,OAAO,QACX,KAAK,UAAU,KAAK,IAAI,KAAK,OAAO,KAAK,CAAC,CAAC,QAAQ,GACpD,CACF;AACF"}

package/dist/utils/math.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"math.d.cts","names":[],"sources":["../../src/utils/math.ts"],"mappings":";KAIK,cAAA,IAAkB,OAAA,YAAmB,OAAA;;;;;;AAc1C;;;;;;iBAAgB,UAAA,CACd,CAAA,cACA,CAAA,cACA,IAAA,EAAM,cAAA;AAAA,iBA2BQ,SAAA,CAAU,CAAA,cAAe,UAAA;;;AAAzC;;;;;AAiBA;;;iBAAgB,gBAAA,CAAiB,CAAA,cAAe,CAAA;AAAA,iBAIhC,YAAA,CAAa,CAAA,cAAe,CAAA;AAAA,iBAI5B,iBAAA,CAAkB,CAAA,cAAe,CAAA;;;;;AAAjD;;;;;AAeA;;iBAAgB,wBAAA,CACd,cAAA,yBACA,aAAA,cACA,MAAA,WACA,CAAA"}
+{"version":3,"file":"math.d.cts","names":[],"sources":["../../src/utils/math.ts"],"mappings":";KAIK,kBAAkB,mBAAmB;;;;;;;;;;;;iBAc1B,WACd,eACA,eACA,MAAM;iBA2BQ,UAAU,eAAe;;;;;;;;;;;iBAiBzB,iBAAiB,eAAe;iBAIhC,aAAa,eAAe;iBAI5B,kBAAkB,eAAe;;;;;;;;;;;;iBAejC,yBACd,uCACA,2BACA,iBACA"}

package/dist/utils/math.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"math.d.ts","names":[],"sources":["../../src/utils/math.ts"],"mappings":";KAIK,cAAA,IAAkB,OAAA,YAAmB,OAAA;;;;;;AAc1C;;;;;;iBAAgB,UAAA,CACd,CAAA,cACA,CAAA,cACA,IAAA,EAAM,cAAA;AAAA,iBA2BQ,SAAA,CAAU,CAAA,cAAe,UAAA;;;AAAzC;;;;;AAiBA;;;iBAAgB,gBAAA,CAAiB,CAAA,cAAe,CAAA;AAAA,iBAIhC,YAAA,CAAa,CAAA,cAAe,CAAA;AAAA,iBAI5B,iBAAA,CAAkB,CAAA,cAAe,CAAA;;;;;AAAjD;;;;;AAeA;;iBAAgB,wBAAA,CACd,cAAA,yBACA,aAAA,cACA,MAAA,WACA,CAAA"}
+{"version":3,"file":"math.d.ts","names":[],"sources":["../../src/utils/math.ts"],"mappings":";KAIK,kBAAkB,mBAAmB;;;;;;;;;;;;iBAc1B,WACd,eACA,eACA,MAAM;iBA2BQ,UAAU,eAAe;;;;;;;;;;;iBAiBzB,iBAAiB,eAAe;iBAIhC,aAAa,eAAe;iBAI5B,kBAAkB,eAAe;;;;;;;;;;;;iBAejC,yBACd,uCACA,2BACA,iBACA"}

package/dist/utils/math.js.map

@@ -1 +1 @@
-{"version":3,"file":"math.js","names":["innerProductDistance"],"sources":["../../src/utils/math.ts"],"sourcesContent":["import { cosine } from \"./ml-distance/similarities.js\";\nimport { innerProduct as innerProductDistance } from \"./ml-distance/distances.js\";\nimport { euclidean } from \"./ml-distance-euclidean/euclidean.js\";\n\ntype VectorFunction = (xVector: number[], yVector: number[]) => number;\n\n/**\n * Apply a row-wise function between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n * @param {VectorFunction} func - The function to apply.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.\n */\n\nexport function matrixFunc(\n  X: number[][],\n  Y: number[][],\n  func: VectorFunction\n): number[][] {\n  if (\n    X.length === 0 ||\n    X[0].length === 0 ||\n    Y.length === 0 ||\n    Y[0].length === 0\n  ) {\n    return [[]];\n  }\n\n  if (X[0].length !== Y[0].length) {\n    throw new Error(\n      `Number of columns in X and Y must be the same. X has shape ${[\n        X.length,\n        X[0].length,\n      ]} and Y has shape ${[Y.length, Y[0].length]}.`\n    );\n  }\n\n  return X.map((xVector) =>\n    Y.map((yVector) => func(xVector, yVector)).map((similarity) =>\n      Number.isNaN(similarity) ? 0 : similarity\n    )\n  );\n}\n\nexport function normalize(M: number[][], similarity = false): number[][] {\n  const max = matrixMaxVal(M);\n  return M.map((row) =>\n    row.map((val) => (similarity ? 1 - val / max : val / max))\n  );\n}\n\n/**\n * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.\n */\nexport function cosineSimilarity(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, cosine);\n}\n\nexport function innerProduct(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, innerProductDistance);\n}\n\nexport function euclideanDistance(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, euclidean);\n}\n\n/**\n * This function implements the Maximal Marginal Relevance algorithm\n * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.\n *\n * @param {number[]|number[][]} queryEmbedding - The query embedding.\n * @param {number[][]} embeddingList - The list of embeddings to select from.\n * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.\n * @param {number} [k=4] - The maximum number of embeddings to select.\n *\n * @returns {number[]} The indexes of the selected embeddings in the embeddingList.\n */\nexport function maximalMarginalRelevance(\n  queryEmbedding: number[] | number[][],\n  embeddingList: number[][],\n  lambda = 0.5,\n  k = 4\n): number[] {\n  if (Math.min(k, embeddingList.length) <= 0) {\n    return [];\n  }\n\n  const queryEmbeddingExpanded = (\n    Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding]\n  ) as number[][];\n\n  const similarityToQuery = cosineSimilarity(\n    queryEmbeddingExpanded,\n    embeddingList\n  )[0];\n  const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;\n\n  const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];\n  const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];\n\n  while (selectedEmbeddingsIndexes.length < Math.min(k, embeddingList.length)) {\n    let bestScore = -Infinity;\n    let bestIndex = -1;\n\n    const similarityToSelected = cosineSimilarity(\n      embeddingList,\n      selectedEmbeddings\n    );\n\n    similarityToQuery.forEach((queryScore, queryScoreIndex) => {\n      if (selectedEmbeddingsIndexes.includes(queryScoreIndex)) {\n        return;\n      }\n      const maxSimilarityToSelected = Math.max(\n        ...similarityToSelected[queryScoreIndex]\n      );\n      const score =\n        lambda * queryScore - (1 - lambda) * maxSimilarityToSelected;\n\n      if (score > bestScore) {\n        bestScore = score;\n        bestIndex = queryScoreIndex;\n      }\n    });\n    selectedEmbeddings.push(embeddingList[bestIndex]);\n    selectedEmbeddingsIndexes.push(bestIndex);\n  }\n\n  return selectedEmbeddingsIndexes;\n}\n\ntype MaxInfo = {\n  maxIndex: number;\n  maxValue: number;\n};\n\n/**\n * Finds the index of the maximum value in the given array.\n * @param {number[]} array - The input array.\n *\n * @returns {number} The index of the maximum value in the array. If the array is empty, returns -1.\n */\nfunction argMax(array: number[]): MaxInfo {\n  if (array.length === 0) {\n    return {\n      maxIndex: -1,\n      maxValue: NaN,\n    };\n  }\n\n  let maxValue = array[0];\n  let maxIndex = 0;\n\n  for (let i = 1; i < array.length; i += 1) {\n    if (array[i] > maxValue) {\n      maxIndex = i;\n      maxValue = array[i];\n    }\n  }\n  return { maxIndex, maxValue };\n}\n\nfunction matrixMaxVal(arrays: number[][]): number {\n  return arrays.reduce(\n    (acc, array) => Math.max(acc, argMax(array).maxValue),\n    0\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WACd,GACA,GACA,MACY;AACZ,KACE,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,KAChB,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,EAEhB,QAAO,CAAC,EAAE,CAAC;AAGb,KAAI,EAAE,GAAG,WAAW,EAAE,GAAG,OACvB,OAAM,IAAI,MACR,8DAA8D,CAC5D,EAAE,QACF,EAAE,GAAG,OACN,CAAC,mBAAmB,CAAC,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,GAC9C;AAGH,QAAO,EAAE,KAAK,YACZ,EAAE,KAAK,YAAY,KAAK,SAAS,QAAQ,CAAC,CAAC,KAAK,eAC9C,OAAO,MAAM,WAAW,GAAG,IAAI,WAChC,CACF;;AAGH,SAAgB,UAAU,GAAe,aAAa,OAAmB;CACvE,MAAM,MAAM,aAAa,EAAE;AAC3B,QAAO,EAAE,KAAK,QACZ,IAAI,KAAK,QAAS,aAAa,IAAI,MAAM,MAAM,MAAM,IAAK,CAC3D;;;;;;;;;;;;AAaH,SAAgB,iBAAiB,GAAe,GAA2B;AACzE,QAAO,WAAW,GAAG,GAAG,OAAO;;AAGjC,SAAgB,aAAa,GAAe,GAA2B;AACrE,QAAO,WAAW,GAAG,GAAGA,eAAqB;;AAG/C,SAAgB,kBAAkB,GAAe,GAA2B;AAC1E,QAAO,WAAW,GAAG,GAAG,UAAU;;;;;;;;;;;;;AAcpC,SAAgB,yBACd,gBACA,eACA,SAAS,IACT,IAAI,GACM;AACV,KAAI,KAAK,IAAI,GAAG,cAAc,OAAO,IAAI,EACvC,QAAO,EAAE;CAOX,MAAM,oBAAoB,iBAHxB,MAAM,QAAQ,eAAe,GAAG,GAAG,iBAAiB,CAAC,eAAe,EAKpE,cACD,CAAC;CACF,MAAM,4BAA4B,OAAO,kBAAkB,CAAC;CAE5D,MAAM,qBAAqB,CAAC,cAAc,2BAA2B;CACrE,MAAM,4BAA4B,CAAC,0BAA0B;AAE7D,QAAO,0BAA0B,SAAS,KAAK,IAAI,GAAG,cAAc,OAAO,EAAE;EAC3E,IAAI,YAAY;EAChB,IAAI,YAAY;EAEhB,MAAM,uBAAuB,iBAC3B,eACA,mBACD;AAED,oBAAkB,SAAS,YAAY,oBAAoB;AACzD,OAAI,0BAA0B,SAAS,gBAAgB,CACrD;GAEF,MAAM,0BAA0B,KAAK,IACnC,GAAG,qBAAqB,iBACzB;GACD,MAAM,QACJ,SAAS,cAAc,IAAI,UAAU;AAEvC,OAAI,QAAQ,WAAW;AACrB,gBAAY;AACZ,gBAAY;;IAEd;AACF,qBAAmB,KAAK,cAAc,WAAW;AACjD,4BAA0B,KAAK,UAAU;;AAG3C,QAAO;;;;;;;;AAcT,SAAS,OAAO,OAA0B;AACxC,KAAI,MAAM,WAAW,EACnB,QAAO;EACL,UAAU;EACV,UAAU;EACX;CAGH,IAAI,WAAW,MAAM;CACrB,IAAI,WAAW;AAEf,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EACrC,KAAI,MAAM,KAAK,UAAU;AACvB,aAAW;AACX,aAAW,MAAM;;AAGrB,QAAO;EAAE;EAAU;EAAU;;AAG/B,SAAS,aAAa,QAA4B;AAChD,QAAO,OAAO,QACX,KAAK,UAAU,KAAK,IAAI,KAAK,OAAO,MAAM,CAAC,SAAS,EACrD,EACD"}
+{"version":3,"file":"math.js","names":["innerProductDistance"],"sources":["../../src/utils/math.ts"],"sourcesContent":["import { cosine } from \"./ml-distance/similarities.js\";\nimport { innerProduct as innerProductDistance } from \"./ml-distance/distances.js\";\nimport { euclidean } from \"./ml-distance-euclidean/euclidean.js\";\n\ntype VectorFunction = (xVector: number[], yVector: number[]) => number;\n\n/**\n * Apply a row-wise function between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n * @param {VectorFunction} func - The function to apply.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.\n */\n\nexport function matrixFunc(\n  X: number[][],\n  Y: number[][],\n  func: VectorFunction\n): number[][] {\n  if (\n    X.length === 0 ||\n    X[0].length === 0 ||\n    Y.length === 0 ||\n    Y[0].length === 0\n  ) {\n    return [[]];\n  }\n\n  if (X[0].length !== Y[0].length) {\n    throw new Error(\n      `Number of columns in X and Y must be the same. X has shape ${[\n        X.length,\n        X[0].length,\n      ]} and Y has shape ${[Y.length, Y[0].length]}.`\n    );\n  }\n\n  return X.map((xVector) =>\n    Y.map((yVector) => func(xVector, yVector)).map((similarity) =>\n      Number.isNaN(similarity) ? 0 : similarity\n    )\n  );\n}\n\nexport function normalize(M: number[][], similarity = false): number[][] {\n  const max = matrixMaxVal(M);\n  return M.map((row) =>\n    row.map((val) => (similarity ? 1 - val / max : val / max))\n  );\n}\n\n/**\n * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.\n */\nexport function cosineSimilarity(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, cosine);\n}\n\nexport function innerProduct(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, innerProductDistance);\n}\n\nexport function euclideanDistance(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, euclidean);\n}\n\n/**\n * This function implements the Maximal Marginal Relevance algorithm\n * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.\n *\n * @param {number[]|number[][]} queryEmbedding - The query embedding.\n * @param {number[][]} embeddingList - The list of embeddings to select from.\n * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.\n * @param {number} [k=4] - The maximum number of embeddings to select.\n *\n * @returns {number[]} The indexes of the selected embeddings in the embeddingList.\n */\nexport function maximalMarginalRelevance(\n  queryEmbedding: number[] | number[][],\n  embeddingList: number[][],\n  lambda = 0.5,\n  k = 4\n): number[] {\n  if (Math.min(k, embeddingList.length) <= 0) {\n    return [];\n  }\n\n  const queryEmbeddingExpanded = (\n    Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding]\n  ) as number[][];\n\n  const similarityToQuery = cosineSimilarity(\n    queryEmbeddingExpanded,\n    embeddingList\n  )[0];\n  const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;\n\n  const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];\n  const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];\n\n  while (selectedEmbeddingsIndexes.length < Math.min(k, embeddingList.length)) {\n    let bestScore = -Infinity;\n    let bestIndex = -1;\n\n    const similarityToSelected = cosineSimilarity(\n      embeddingList,\n      selectedEmbeddings\n    );\n\n    similarityToQuery.forEach((queryScore, queryScoreIndex) => {\n      if (selectedEmbeddingsIndexes.includes(queryScoreIndex)) {\n        return;\n      }\n      const maxSimilarityToSelected = Math.max(\n        ...similarityToSelected[queryScoreIndex]\n      );\n      const score =\n        lambda * queryScore - (1 - lambda) * maxSimilarityToSelected;\n\n      if (score > bestScore) {\n        bestScore = score;\n        bestIndex = queryScoreIndex;\n      }\n    });\n    selectedEmbeddings.push(embeddingList[bestIndex]);\n    selectedEmbeddingsIndexes.push(bestIndex);\n  }\n\n  return selectedEmbeddingsIndexes;\n}\n\ntype MaxInfo = {\n  maxIndex: number;\n  maxValue: number;\n};\n\n/**\n * Finds the index of the maximum value in the given array.\n * @param {number[]} array - The input array.\n *\n * @returns {number} The index of the maximum value in the array. If the array is empty, returns -1.\n */\nfunction argMax(array: number[]): MaxInfo {\n  if (array.length === 0) {\n    return {\n      maxIndex: -1,\n      maxValue: NaN,\n    };\n  }\n\n  let maxValue = array[0];\n  let maxIndex = 0;\n\n  for (let i = 1; i < array.length; i += 1) {\n    if (array[i] > maxValue) {\n      maxIndex = i;\n      maxValue = array[i];\n    }\n  }\n  return { maxIndex, maxValue };\n}\n\nfunction matrixMaxVal(arrays: number[][]): number {\n  return arrays.reduce(\n    (acc, array) => Math.max(acc, argMax(array).maxValue),\n    0\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WACd,GACA,GACA,MACY;CACZ,IACE,EAAE,WAAW,KACb,EAAE,EAAE,CAAC,WAAW,KAChB,EAAE,WAAW,KACb,EAAE,EAAE,CAAC,WAAW,GAEhB,OAAO,CAAC,CAAC,CAAC;CAGZ,IAAI,EAAE,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC,QACvB,MAAM,IAAI,MACR,8DAA8D,CAC5D,EAAE,QACF,EAAE,EAAE,CAAC,MACP,EAAE,mBAAmB,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC,MAAM,EAAE,EAC/C;CAGF,OAAO,EAAE,KAAK,YACZ,EAAE,KAAK,YAAY,KAAK,SAAS,OAAO,CAAC,CAAC,CAAC,KAAK,eAC9C,OAAO,MAAM,UAAU,IAAI,IAAI,UACjC,CACF;AACF;AAEA,SAAgB,UAAU,GAAe,aAAa,OAAmB;CACvE,MAAM,MAAM,aAAa,CAAC;CAC1B,OAAO,EAAE,KAAK,QACZ,IAAI,KAAK,QAAS,aAAa,IAAI,MAAM,MAAM,MAAM,GAAI,CAC3D;AACF;;;;;;;;;;;AAYA,SAAgB,iBAAiB,GAAe,GAA2B;CACzE,OAAO,WAAW,GAAG,GAAG,MAAM;AAChC;AAEA,SAAgB,aAAa,GAAe,GAA2B;CACrE,OAAO,WAAW,GAAG,GAAGA,cAAoB;AAC9C;AAEA,SAAgB,kBAAkB,GAAe,GAA2B;CAC1E,OAAO,WAAW,GAAG,GAAG,SAAS;AACnC;;;;;;;;;;;;AAaA,SAAgB,yBACd,gBACA,eACA,SAAS,IACT,IAAI,GACM;CACV,IAAI,KAAK,IAAI,GAAG,cAAc,MAAM,KAAK,GACvC,OAAO,CAAC;CAOV,MAAM,oBAAoB,iBAHxB,MAAM,QAAQ,eAAe,EAAE,IAAI,iBAAiB,CAAC,cAAc,GAKnE,aACF,CAAC,CAAC;CACF,MAAM,4BAA4B,OAAO,iBAAiB,CAAC,CAAC;CAE5D,MAAM,qBAAqB,CAAC,cAAc,0BAA0B;CACpE,MAAM,4BAA4B,CAAC,yBAAyB;CAE5D,OAAO,0BAA0B,SAAS,KAAK,IAAI,GAAG,cAAc,MAAM,GAAG;EAC3E,IAAI,YAAY;EAChB,IAAI,YAAY;EAEhB,MAAM,uBAAuB,iBAC3B,eACA,kBACF;EAEA,kBAAkB,SAAS,YAAY,oBAAoB;GACzD,IAAI,0BAA0B,SAAS,eAAe,GACpD;GAEF,MAAM,0BAA0B,KAAK,IACnC,GAAG,qBAAqB,gBAC1B;GACA,MAAM,QACJ,SAAS,cAAc,IAAI,UAAU;GAEvC,IAAI,QAAQ,WAAW;IACrB,YAAY;IACZ,YAAY;GACd;EACF,CAAC;EACD,mBAAmB,KAAK,cAAc,UAAU;EAChD,0BAA0B,KAAK,SAAS;CAC1C;CAEA,OAAO;AACT;;;;;;;AAaA,SAAS,OAAO,OAA0B;CACxC,IAAI,MAAM,WAAW,GACnB,OAAO;EACL,UAAU;EACV,UAAU;CACZ;CAGF,IAAI,WAAW,MAAM;CACrB,IAAI,WAAW;CAEf,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GACrC,IAAI,MAAM,KAAK,UAAU;EACvB,WAAW;EACX,WAAW,MAAM;CACnB;CAEF,OAAO;EAAE;EAAU;CAAS;AAC9B;AAEA,SAAS,aAAa,QAA4B;CAChD,OAAO,OAAO,QACX,KAAK,UAAU,KAAK,IAAI,KAAK,OAAO,KAAK,CAAC,CAAC,QAAQ,GACpD,CACF;AACF"}

package/dist/utils/ml-distance/distances.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"distances.cjs","names":[],"sources":["../../../src/utils/ml-distance/distances.ts"],"sourcesContent":["/**\n *Returns the Inner Product similarity between vectors a and b\n * @link [Inner Product Similarity algorithm](https://www.naun.org/main/NAUN/ijmmas/mmmas-49.pdf)\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function innerProduct(a: number[], b: number[]): number {\n  let ans = 0;\n  for (let i = 0; i < a.length; i++) {\n    ans += a[i] * b[i];\n  }\n  return ans;\n}\n"],"mappings":";;;;;;;;AAOA,SAAgB,aAAa,GAAa,GAAqB;CAC7D,IAAI,MAAM;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC5B,QAAO,EAAE,KAAK,EAAE;AAElB,QAAO"}
+{"version":3,"file":"distances.cjs","names":[],"sources":["../../../src/utils/ml-distance/distances.ts"],"sourcesContent":["/**\n *Returns the Inner Product similarity between vectors a and b\n * @link [Inner Product Similarity algorithm](https://www.naun.org/main/NAUN/ijmmas/mmmas-49.pdf)\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function innerProduct(a: number[], b: number[]): number {\n  let ans = 0;\n  for (let i = 0; i < a.length; i++) {\n    ans += a[i] * b[i];\n  }\n  return ans;\n}\n"],"mappings":";;;;;;;;AAOA,SAAgB,aAAa,GAAa,GAAqB;CAC7D,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,OAAO,EAAE,KAAK,EAAE;CAElB,OAAO;AACT"}

package/dist/utils/ml-distance/distances.js.map

@@ -1 +1 @@
-{"version":3,"file":"distances.js","names":[],"sources":["../../../src/utils/ml-distance/distances.ts"],"sourcesContent":["/**\n *Returns the Inner Product similarity between vectors a and b\n * @link [Inner Product Similarity algorithm](https://www.naun.org/main/NAUN/ijmmas/mmmas-49.pdf)\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function innerProduct(a: number[], b: number[]): number {\n  let ans = 0;\n  for (let i = 0; i < a.length; i++) {\n    ans += a[i] * b[i];\n  }\n  return ans;\n}\n"],"mappings":";;;;;;;;AAOA,SAAgB,aAAa,GAAa,GAAqB;CAC7D,IAAI,MAAM;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC5B,QAAO,EAAE,KAAK,EAAE;AAElB,QAAO"}
+{"version":3,"file":"distances.js","names":[],"sources":["../../../src/utils/ml-distance/distances.ts"],"sourcesContent":["/**\n *Returns the Inner Product similarity between vectors a and b\n * @link [Inner Product Similarity algorithm](https://www.naun.org/main/NAUN/ijmmas/mmmas-49.pdf)\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function innerProduct(a: number[], b: number[]): number {\n  let ans = 0;\n  for (let i = 0; i < a.length; i++) {\n    ans += a[i] * b[i];\n  }\n  return ans;\n}\n"],"mappings":";;;;;;;;AAOA,SAAgB,aAAa,GAAa,GAAqB;CAC7D,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,OAAO,EAAE,KAAK,EAAE;CAElB,OAAO;AACT"}

package/dist/utils/ml-distance/similarities.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"similarities.cjs","names":[],"sources":["../../../src/utils/ml-distance/similarities.ts"],"sourcesContent":["/**\n * Returns the average of cosine distances between vectors a and b\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function cosine(a: number[], b: number[]): number {\n  let p = 0;\n  let p2 = 0;\n  let q2 = 0;\n  for (let i = 0; i < a.length; i++) {\n    p += a[i] * b[i];\n    p2 += a[i] * a[i];\n    q2 += b[i] * b[i];\n  }\n  return p / (Math.sqrt(p2) * Math.sqrt(q2));\n}\n"],"mappings":";;;;;;;AAMA,SAAgB,OAAO,GAAa,GAAqB;CACvD,IAAI,IAAI;CACR,IAAI,KAAK;CACT,IAAI,KAAK;AACT,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,OAAK,EAAE,KAAK,EAAE;AACd,QAAM,EAAE,KAAK,EAAE;AACf,QAAM,EAAE,KAAK,EAAE;;AAEjB,QAAO,KAAK,KAAK,KAAK,GAAG,GAAG,KAAK,KAAK,GAAG"}
+{"version":3,"file":"similarities.cjs","names":[],"sources":["../../../src/utils/ml-distance/similarities.ts"],"sourcesContent":["/**\n * Returns the average of cosine distances between vectors a and b\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function cosine(a: number[], b: number[]): number {\n  let p = 0;\n  let p2 = 0;\n  let q2 = 0;\n  for (let i = 0; i < a.length; i++) {\n    p += a[i] * b[i];\n    p2 += a[i] * a[i];\n    q2 += b[i] * b[i];\n  }\n  return p / (Math.sqrt(p2) * Math.sqrt(q2));\n}\n"],"mappings":";;;;;;;AAMA,SAAgB,OAAO,GAAa,GAAqB;CACvD,IAAI,IAAI;CACR,IAAI,KAAK;CACT,IAAI,KAAK;CACT,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,KAAK,EAAE,KAAK,EAAE;EACd,MAAM,EAAE,KAAK,EAAE;EACf,MAAM,EAAE,KAAK,EAAE;CACjB;CACA,OAAO,KAAK,KAAK,KAAK,EAAE,IAAI,KAAK,KAAK,EAAE;AAC1C"}

package/dist/utils/ml-distance/similarities.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"similarities.d.cts","names":[],"sources":["../../../src/utils/ml-distance/similarities.ts"],"mappings":";;AAMA;;;;;iBAAgB,MAAA,CAAO,CAAA,YAAa,CAAA"}
+{"version":3,"file":"similarities.d.cts","names":[],"sources":["../../../src/utils/ml-distance/similarities.ts"],"mappings":";;;;;;;iBAMgB,OAAO,aAAa"}

package/dist/utils/ml-distance/similarities.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"similarities.d.ts","names":[],"sources":["../../../src/utils/ml-distance/similarities.ts"],"mappings":";;AAMA;;;;;iBAAgB,MAAA,CAAO,CAAA,YAAa,CAAA"}
+{"version":3,"file":"similarities.d.ts","names":[],"sources":["../../../src/utils/ml-distance/similarities.ts"],"mappings":";;;;;;;iBAMgB,OAAO,aAAa"}

package/dist/utils/ml-distance/similarities.js.map

@@ -1 +1 @@
-{"version":3,"file":"similarities.js","names":[],"sources":["../../../src/utils/ml-distance/similarities.ts"],"sourcesContent":["/**\n * Returns the average of cosine distances between vectors a and b\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function cosine(a: number[], b: number[]): number {\n  let p = 0;\n  let p2 = 0;\n  let q2 = 0;\n  for (let i = 0; i < a.length; i++) {\n    p += a[i] * b[i];\n    p2 += a[i] * a[i];\n    q2 += b[i] * b[i];\n  }\n  return p / (Math.sqrt(p2) * Math.sqrt(q2));\n}\n"],"mappings":";;;;;;;AAMA,SAAgB,OAAO,GAAa,GAAqB;CACvD,IAAI,IAAI;CACR,IAAI,KAAK;CACT,IAAI,KAAK;AACT,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,OAAK,EAAE,KAAK,EAAE;AACd,QAAM,EAAE,KAAK,EAAE;AACf,QAAM,EAAE,KAAK,EAAE;;AAEjB,QAAO,KAAK,KAAK,KAAK,GAAG,GAAG,KAAK,KAAK,GAAG"}
+{"version":3,"file":"similarities.js","names":[],"sources":["../../../src/utils/ml-distance/similarities.ts"],"sourcesContent":["/**\n * Returns the average of cosine distances between vectors a and b\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function cosine(a: number[], b: number[]): number {\n  let p = 0;\n  let p2 = 0;\n  let q2 = 0;\n  for (let i = 0; i < a.length; i++) {\n    p += a[i] * b[i];\n    p2 += a[i] * a[i];\n    q2 += b[i] * b[i];\n  }\n  return p / (Math.sqrt(p2) * Math.sqrt(q2));\n}\n"],"mappings":";;;;;;;AAMA,SAAgB,OAAO,GAAa,GAAqB;CACvD,IAAI,IAAI;CACR,IAAI,KAAK;CACT,IAAI,KAAK;CACT,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,KAAK,EAAE,KAAK,EAAE;EACd,MAAM,EAAE,KAAK,EAAE;EACf,MAAM,EAAE,KAAK,EAAE;CACjB;CACA,OAAO,KAAK,KAAK,KAAK,EAAE,IAAI,KAAK,KAAK,EAAE;AAC1C"}

package/dist/utils/ml-distance-euclidean/euclidean.cjs

@@ -9,5 +9,6 @@ function euclidean(p, q) {
 }
 //#endregion
 exports.euclidean = euclidean;
+exports.squaredEuclidean = squaredEuclidean;
 
 //# sourceMappingURL=euclidean.cjs.map

package/dist/utils/ml-distance-euclidean/euclidean.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"euclidean.cjs","names":[],"sources":["../../../src/utils/ml-distance-euclidean/euclidean.ts"],"sourcesContent":["export function squaredEuclidean(p: number[], q: number[]) {\n  let d = 0;\n  for (let i = 0; i < p.length; i++) {\n    d += (p[i] - q[i]) * (p[i] - q[i]);\n  }\n  return d;\n}\n\nexport function euclidean(p: number[], q: number[]) {\n  return Math.sqrt(squaredEuclidean(p, q));\n}\n"],"mappings":";AAAA,SAAgB,iBAAiB,GAAa,GAAa;CACzD,IAAI,IAAI;AACR,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC5B,OAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;AAEjC,QAAO;;AAGT,SAAgB,UAAU,GAAa,GAAa;AAClD,QAAO,KAAK,KAAK,iBAAiB,GAAG,EAAE,CAAC"}
+{"version":3,"file":"euclidean.cjs","names":[],"sources":["../../../src/utils/ml-distance-euclidean/euclidean.ts"],"sourcesContent":["export function squaredEuclidean(p: number[], q: number[]) {\n  let d = 0;\n  for (let i = 0; i < p.length; i++) {\n    d += (p[i] - q[i]) * (p[i] - q[i]);\n  }\n  return d;\n}\n\nexport function euclidean(p: number[], q: number[]) {\n  return Math.sqrt(squaredEuclidean(p, q));\n}\n"],"mappings":";AAAA,SAAgB,iBAAiB,GAAa,GAAa;CACzD,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;CAEjC,OAAO;AACT;AAEA,SAAgB,UAAU,GAAa,GAAa;CAClD,OAAO,KAAK,KAAK,iBAAiB,GAAG,CAAC,CAAC;AACzC"}

package/dist/utils/ml-distance-euclidean/euclidean.js

@@ -8,6 +8,6 @@ function euclidean(p, q) {
 	return Math.sqrt(squaredEuclidean(p, q));
 }
 //#endregion
-export { euclidean };
+export { euclidean, squaredEuclidean };
 
 //# sourceMappingURL=euclidean.js.map

package/dist/utils/ml-distance-euclidean/euclidean.js.map

@@ -1 +1 @@
-{"version":3,"file":"euclidean.js","names":[],"sources":["../../../src/utils/ml-distance-euclidean/euclidean.ts"],"sourcesContent":["export function squaredEuclidean(p: number[], q: number[]) {\n  let d = 0;\n  for (let i = 0; i < p.length; i++) {\n    d += (p[i] - q[i]) * (p[i] - q[i]);\n  }\n  return d;\n}\n\nexport function euclidean(p: number[], q: number[]) {\n  return Math.sqrt(squaredEuclidean(p, q));\n}\n"],"mappings":";AAAA,SAAgB,iBAAiB,GAAa,GAAa;CACzD,IAAI,IAAI;AACR,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC5B,OAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;AAEjC,QAAO;;AAGT,SAAgB,UAAU,GAAa,GAAa;AAClD,QAAO,KAAK,KAAK,iBAAiB,GAAG,EAAE,CAAC"}
+{"version":3,"file":"euclidean.js","names":[],"sources":["../../../src/utils/ml-distance-euclidean/euclidean.ts"],"sourcesContent":["export function squaredEuclidean(p: number[], q: number[]) {\n  let d = 0;\n  for (let i = 0; i < p.length; i++) {\n    d += (p[i] - q[i]) * (p[i] - q[i]);\n  }\n  return d;\n}\n\nexport function euclidean(p: number[], q: number[]) {\n  return Math.sqrt(squaredEuclidean(p, q));\n}\n"],"mappings":";AAAA,SAAgB,iBAAiB,GAAa,GAAa;CACzD,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;CAEjC,OAAO;AACT;AAEA,SAAgB,UAAU,GAAa,GAAa;CAClD,OAAO,KAAK,KAAK,iBAAiB,GAAG,CAAC,CAAC;AACzC"}

package/dist/utils/namespace.cjs

@@ -42,6 +42,9 @@ function createNamespace(path) {
 				static isInstance(obj) {
 					return typeof obj === "object" && obj !== null && brandSymbol in obj && obj[brandSymbol] === true;
 				}
+				static [Symbol.hasInstance](obj) {
+					return this.isInstance(obj);
+				}
 			}
 			Object.defineProperty(_Branded, "name", { value: Base.name });
 			return _Branded;
@@ -57,6 +60,7 @@ function createNamespace(path) {
 /** Base namespace used throughout LangChain */
 const ns = createNamespace("langchain");
 //#endregion
+exports.createNamespace = createNamespace;
 exports.ns = ns;
 
 //# sourceMappingURL=namespace.cjs.map

package/dist/utils/namespace.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"namespace.cjs","names":[],"sources":["../../src/utils/namespace.ts"],"sourcesContent":["/* oxlint-disable @typescript-eslint/no-explicit-any */\n\n/**\n * A constructor type that can be used as a base class for branding.\n */\ntype Constructor = abstract new (...args: any[]) => any;\n\n/**\n * The return type of `Namespace.brand()`: the original base class\n * intersected with a polymorphic `isInstance` type guard.\n */\ntype BrandedClass<TBase extends Constructor> = TBase & {\n  isInstance: IsInstanceFn;\n};\n\n/**\n * A static `isInstance` type guard that resolves to the subclass it's\n * called on via the generic `this` parameter.\n *\n * At call sites TypeScript infers `T` from the class, so\n * `StandardError.isInstance(obj)` narrows `obj` to `StandardError`.\n */\ntype IsInstanceFn = <T extends Constructor>(\n  this: T,\n  obj: unknown\n) => obj is InstanceType<T>;\n\n/**\n * A namespace object for hierarchical symbol-based branding.\n *\n * Namespaces are internal authoring tools. They are not intended to be\n * part of the public API -- only the branded classes are.\n *\n * @example\n * ```typescript\n * const langchain = createNamespace(\"langchain\");\n * const errorNs = langchain.sub(\"error\");\n *\n * export class LangChainError extends errorNs.brand(Error) {\n *   readonly name = \"LangChainError\";\n * }\n *\n * export class ModelAbortError extends errorNs.brand(LangChainError, \"model-abort\") {\n *   readonly name = \"ModelAbortError\";\n * }\n * ```\n */\nexport interface Namespace {\n  /**\n   * Brand a base class with this namespace's symbols.\n   *\n   * Without a marker, creates a namespace-level base class whose\n   * `static isInstance` checks for the namespace's own symbol.\n   *\n   * With a marker, creates a leaf class whose `static isInstance`\n   * checks for the marker-specific symbol.\n   *\n   * @param Base - The base class to extend\n   * @param marker - Optional marker for leaf classes\n   * @returns A new class extending Base with symbol branding and static isInstance\n   */\n  brand<TBase extends Constructor>(\n    Base: TBase,\n    marker?: string\n  ): BrandedClass<TBase>;\n\n  /**\n   * Create a child namespace.\n   *\n   * @param childPath - The child segment to append to the current path\n   * @returns A new Namespace with the extended path\n   */\n  sub(childPath: string): Namespace;\n\n  /**\n   * Check if an object is branded under this namespace (at any level).\n   *\n   * @param obj - The object to check\n   * @returns true if the object carries this namespace's symbol\n   */\n  isInstance(obj: unknown): boolean;\n}\n\n/**\n * Create a symbol-based namespace for hierarchical `isInstance` checking.\n *\n * Each namespace level gets its own `Symbol.for(path)`. When a class is\n * branded via `.brand()`, only the new symbol for that level is stamped\n * on the prototype. Parent symbols are inherited implicitly through the\n * class extension chain -- `symbol in obj` traverses the prototype chain,\n * so a `ConfigError` instance is recognized by `LangChainError.isInstance()`\n * because it extends `GoogleError` which extends `LangChainError`, whose\n * prototype already carries the `langchain.error` symbol.\n *\n * @param path - The dot-separated namespace path (e.g. \"langchain.error\")\n * @returns A Namespace object with `.brand()`, `.sub()`, and `.isInstance()`\n *\n * @example\n * ```typescript\n * const langchain = createNamespace(\"langchain\");\n * const errorNs = langchain.sub(\"error\");\n * const googleNs = errorNs.sub(\"google\");\n *\n * class LangChainError extends errorNs.brand(Error) {}\n * class GoogleError extends googleNs.brand(LangChainError) {}\n * class ConfigError extends googleNs.brand(GoogleError, \"configuration\") {}\n *\n * const err = new ConfigError(\"bad config\");\n * LangChainError.isInstance(err); // true (checks langchain.error symbol)\n * GoogleError.isInstance(err);    // true (checks langchain.error.google symbol)\n * ConfigError.isInstance(err);    // true (checks langchain.error.google.configuration symbol)\n * ```\n */\nexport function createNamespace(path: string): Namespace {\n  const symbol: symbol = Symbol.for(path);\n\n  return {\n    brand<TBase extends Constructor>(Base: TBase, marker?: string) {\n      const brandSymbol: symbol = marker\n        ? Symbol.for(`${path}.${marker}`)\n        : symbol;\n\n      class _Branded extends (Base as any) {\n        readonly [brandSymbol] = true as const;\n\n        constructor(...args: any[]) {\n          super(...args);\n        }\n\n        static isInstance(obj: unknown): boolean {\n          return (\n            typeof obj === \"object\" &&\n            obj !== null &&\n            brandSymbol in obj &&\n            (obj as Record<symbol, unknown>)[brandSymbol] === true\n          );\n        }\n      }\n\n      // Inherit the base class's name so \"_Branded\" doesn't leak\n      // through the static prototype chain.\n      Object.defineProperty(_Branded, \"name\", { value: Base.name });\n\n      return _Branded as unknown as BrandedClass<TBase>;\n    },\n\n    sub(childPath: string): Namespace {\n      return createNamespace(`${path}.${childPath}`);\n    },\n\n    isInstance(obj: unknown): boolean {\n      return (\n        typeof obj === \"object\" &&\n        obj !== null &&\n        symbol in obj &&\n        (obj as Record<symbol, unknown>)[symbol] === true\n      );\n    },\n  };\n}\n\n/** Base namespace used throughout LangChain */\nexport const ns = createNamespace(\"langchain\");\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiHA,SAAgB,gBAAgB,MAAyB;CACvD,MAAM,SAAiB,OAAO,IAAI,KAAK;AAEvC,QAAO;EACL,MAAiC,MAAa,QAAiB;GAC7D,MAAM,cAAsB,SACxB,OAAO,IAAI,GAAG,KAAK,GAAG,SAAS,GAC/B;GAEJ,MAAM,iBAAkB,KAAa;IACnC,CAAU,eAAe;IAEzB,YAAY,GAAG,MAAa;AAC1B,WAAM,GAAG,KAAK;;IAGhB,OAAO,WAAW,KAAuB;AACvC,YACE,OAAO,QAAQ,YACf,QAAQ,QACR,eAAe,OACd,IAAgC,iBAAiB;;;AAOxD,UAAO,eAAe,UAAU,QAAQ,EAAE,OAAO,KAAK,MAAM,CAAC;AAE7D,UAAO;;EAGT,IAAI,WAA8B;AAChC,UAAO,gBAAgB,GAAG,KAAK,GAAG,YAAY;;EAGhD,WAAW,KAAuB;AAChC,UACE,OAAO,QAAQ,YACf,QAAQ,QACR,UAAU,OACT,IAAgC,YAAY;;EAGlD;;;AAIH,MAAa,KAAK,gBAAgB,YAAY"}
+{"version":3,"file":"namespace.cjs","names":[],"sources":["../../src/utils/namespace.ts"],"sourcesContent":["/* oxlint-disable @typescript-eslint/no-explicit-any */\n\n/**\n * A constructor type that can be used as a base class for branding.\n */\ntype Constructor = abstract new (...args: any[]) => any;\n\n/**\n * The return type of `Namespace.brand()`: the original base class\n * intersected with a polymorphic `isInstance` type guard.\n */\ntype BrandedClass<TBase extends Constructor> = TBase & {\n  isInstance: IsInstanceFn;\n};\n\n/**\n * A static `isInstance` type guard that resolves to the subclass it's\n * called on via the generic `this` parameter.\n *\n * At call sites TypeScript infers `T` from the class, so\n * `StandardError.isInstance(obj)` narrows `obj` to `StandardError`.\n */\ntype IsInstanceFn = <T extends Constructor>(\n  this: T,\n  obj: unknown\n) => obj is InstanceType<T>;\n\n/**\n * A namespace object for hierarchical symbol-based branding.\n *\n * Namespaces are internal authoring tools. They are not intended to be\n * part of the public API -- only the branded classes are.\n *\n * @example\n * ```typescript\n * const langchain = createNamespace(\"langchain\");\n * const errorNs = langchain.sub(\"error\");\n *\n * export class LangChainError extends errorNs.brand(Error) {\n *   readonly name = \"LangChainError\";\n * }\n *\n * export class ModelAbortError extends errorNs.brand(LangChainError, \"model-abort\") {\n *   readonly name = \"ModelAbortError\";\n * }\n * ```\n */\nexport interface Namespace {\n  /**\n   * Brand a base class with this namespace's symbols.\n   *\n   * Without a marker, creates a namespace-level base class whose\n   * `static isInstance` checks for the namespace's own symbol.\n   *\n   * With a marker, creates a leaf class whose `static isInstance`\n   * checks for the marker-specific symbol.\n   *\n   * @param Base - The base class to extend\n   * @param marker - Optional marker for leaf classes\n   * @returns A new class extending Base with symbol branding and static isInstance\n   */\n  brand<TBase extends Constructor>(\n    Base: TBase,\n    marker?: string\n  ): BrandedClass<TBase>;\n\n  /**\n   * Create a child namespace.\n   *\n   * @param childPath - The child segment to append to the current path\n   * @returns A new Namespace with the extended path\n   */\n  sub(childPath: string): Namespace;\n\n  /**\n   * Check if an object is branded under this namespace (at any level).\n   *\n   * @param obj - The object to check\n   * @returns true if the object carries this namespace's symbol\n   */\n  isInstance(obj: unknown): boolean;\n}\n\n/**\n * Create a symbol-based namespace for hierarchical `isInstance` checking.\n *\n * Each namespace level gets its own `Symbol.for(path)`. When a class is\n * branded via `.brand()`, only the new symbol for that level is stamped\n * on the prototype. Parent symbols are inherited implicitly through the\n * class extension chain -- `symbol in obj` traverses the prototype chain,\n * so a `ConfigError` instance is recognized by `LangChainError.isInstance()`\n * because it extends `GoogleError` which extends `LangChainError`, whose\n * prototype already carries the `langchain.error` symbol.\n *\n * @param path - The dot-separated namespace path (e.g. \"langchain.error\")\n * @returns A Namespace object with `.brand()`, `.sub()`, and `.isInstance()`\n *\n * @example\n * ```typescript\n * const langchain = createNamespace(\"langchain\");\n * const errorNs = langchain.sub(\"error\");\n * const googleNs = errorNs.sub(\"google\");\n *\n * class LangChainError extends errorNs.brand(Error) {}\n * class GoogleError extends googleNs.brand(LangChainError) {}\n * class ConfigError extends googleNs.brand(GoogleError, \"configuration\") {}\n *\n * const err = new ConfigError(\"bad config\");\n * LangChainError.isInstance(err); // true (checks langchain.error symbol)\n * GoogleError.isInstance(err);    // true (checks langchain.error.google symbol)\n * ConfigError.isInstance(err);    // true (checks langchain.error.google.configuration symbol)\n * ```\n */\nexport function createNamespace(path: string): Namespace {\n  const symbol: symbol = Symbol.for(path);\n\n  return {\n    brand<TBase extends Constructor>(Base: TBase, marker?: string) {\n      const brandSymbol: symbol = marker\n        ? Symbol.for(`${path}.${marker}`)\n        : symbol;\n\n      class _Branded extends (Base as any) {\n        readonly [brandSymbol] = true as const;\n\n        constructor(...args: any[]) {\n          super(...args);\n        }\n\n        static isInstance(obj: unknown): boolean {\n          return (\n            typeof obj === \"object\" &&\n            obj !== null &&\n            brandSymbol in obj &&\n            (obj as Record<symbol, unknown>)[brandSymbol] === true\n          );\n        }\n\n        static [Symbol.hasInstance](obj: unknown) {\n          return this.isInstance(obj);\n        }\n      }\n\n      // Inherit the base class's name so \"_Branded\" doesn't leak\n      // through the static prototype chain.\n      Object.defineProperty(_Branded, \"name\", { value: Base.name });\n\n      return _Branded as unknown as BrandedClass<TBase>;\n    },\n\n    sub(childPath: string): Namespace {\n      return createNamespace(`${path}.${childPath}`);\n    },\n\n    isInstance(obj: unknown): boolean {\n      return (\n        typeof obj === \"object\" &&\n        obj !== null &&\n        symbol in obj &&\n        (obj as Record<symbol, unknown>)[symbol] === true\n      );\n    },\n  };\n}\n\n/** Base namespace used throughout LangChain */\nexport const ns = createNamespace(\"langchain\");\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiHA,SAAgB,gBAAgB,MAAyB;CACvD,MAAM,SAAiB,OAAO,IAAI,IAAI;CAEtC,OAAO;EACL,MAAiC,MAAa,QAAiB;GAC7D,MAAM,cAAsB,SACxB,OAAO,IAAI,GAAG,KAAK,GAAG,QAAQ,IAC9B;GAEJ,MAAM,iBAAkB,KAAa;IACnC,CAAU,eAAe;IAEzB,YAAY,GAAG,MAAa;KAC1B,MAAM,GAAG,IAAI;IACf;IAEA,OAAO,WAAW,KAAuB;KACvC,OACE,OAAO,QAAQ,YACf,QAAQ,QACR,eAAe,OACd,IAAgC,iBAAiB;IAEtD;IAEA,QAAQ,OAAO,aAAa,KAAc;KACxC,OAAO,KAAK,WAAW,GAAG;IAC5B;GACF;GAIA,OAAO,eAAe,UAAU,QAAQ,EAAE,OAAO,KAAK,KAAK,CAAC;GAE5D,OAAO;EACT;EAEA,IAAI,WAA8B;GAChC,OAAO,gBAAgB,GAAG,KAAK,GAAG,WAAW;EAC/C;EAEA,WAAW,KAAuB;GAChC,OACE,OAAO,QAAQ,YACf,QAAQ,QACR,UAAU,OACT,IAAgC,YAAY;EAEjD;CACF;AACF;;AAGA,MAAa,KAAK,gBAAgB,WAAW"}

package/dist/utils/namespace.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"namespace.d.cts","names":[],"sources":["../../src/utils/namespace.ts"],"mappings":";;;;KAKK,WAAA,oBAA+B,IAAA;;;AAAI;;KAMnC,YAAA,eAA2B,WAAA,IAAe,KAAA;EAC7C,UAAA,EAAY,YAAA;AAAA;;;;;;;;KAUT,YAAA,cAA0B,WAAA,EAC7B,IAAA,EAAM,CAAA,EACN,GAAA,cACG,GAAA,IAAO,YAAA,CAAa,CAAA;;;AAbC;;;;;;;;;;;;;;;;;;UAmCT,SAAA;EAAA;;;;;;;;;;;;;EAcf,KAAA,eAAoB,WAAA,EAClB,IAAA,EAAM,KAAA,EACN,MAAA,YACC,YAAA,CAAa,KAAA;EAFd;;;;;;EAUF,GAAA,CAAI,SAAA,WAAoB,SAAA;EAQxB;;;;;;EAAA,UAAA,CAAW,GAAA;AAAA"}
+{"version":3,"file":"namespace.d.cts","names":[],"sources":["../../src/utils/namespace.ts"],"mappings":";;;;KAKK,+BAA+B;;;;;KAM/B,aAAa,cAAc,eAAe;EAC7C,YAAY;;;;;;;;;KAUT,gBAAgB,UAAU,aAC7B,MAAM,GACN,iBACG,OAAO,aAAa;;;;;;;;;;;;;;;;;;;;;UAsBR;;;;;;;;;;;;;;EAcf,MAAM,cAAc,aAClB,MAAM,OACN,kBACC,aAAa;;;;;;;EAQhB,IAAI,oBAAoB;;;;;;;EAQxB,WAAW"}

package/dist/utils/namespace.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"namespace.d.ts","names":[],"sources":["../../src/utils/namespace.ts"],"mappings":";;;;KAKK,WAAA,oBAA+B,IAAA;;;AAAI;;KAMnC,YAAA,eAA2B,WAAA,IAAe,KAAA;EAC7C,UAAA,EAAY,YAAA;AAAA;;;;;;;;KAUT,YAAA,cAA0B,WAAA,EAC7B,IAAA,EAAM,CAAA,EACN,GAAA,cACG,GAAA,IAAO,YAAA,CAAa,CAAA;;;AAbC;;;;;;;;;;;;;;;;;;UAmCT,SAAA;EAAA;;;;;;;;;;;;;EAcf,KAAA,eAAoB,WAAA,EAClB,IAAA,EAAM,KAAA,EACN,MAAA,YACC,YAAA,CAAa,KAAA;EAFd;;;;;;EAUF,GAAA,CAAI,SAAA,WAAoB,SAAA;EAQxB;;;;;;EAAA,UAAA,CAAW,GAAA;AAAA"}
+{"version":3,"file":"namespace.d.ts","names":[],"sources":["../../src/utils/namespace.ts"],"mappings":";;;;KAKK,+BAA+B;;;;;KAM/B,aAAa,cAAc,eAAe;EAC7C,YAAY;;;;;;;;;KAUT,gBAAgB,UAAU,aAC7B,MAAM,GACN,iBACG,OAAO,aAAa;;;;;;;;;;;;;;;;;;;;;UAsBR;;;;;;;;;;;;;;EAcf,MAAM,cAAc,aAClB,MAAM,OACN,kBACC,aAAa;;;;;;;EAQhB,IAAI,oBAAoB;;;;;;;EAQxB,WAAW"}

package/dist/utils/namespace.js

@@ -42,6 +42,9 @@ function createNamespace(path) {
 				static isInstance(obj) {
 					return typeof obj === "object" && obj !== null && brandSymbol in obj && obj[brandSymbol] === true;
 				}
+				static [Symbol.hasInstance](obj) {
+					return this.isInstance(obj);
+				}
 			}
 			Object.defineProperty(_Branded, "name", { value: Base.name });
 			return _Branded;
@@ -57,6 +60,6 @@ function createNamespace(path) {
 /** Base namespace used throughout LangChain */
 const ns = createNamespace("langchain");
 //#endregion
-export { ns };
+export { createNamespace, ns };
 
 //# sourceMappingURL=namespace.js.map

package/dist/utils/namespace.js.map

@@ -1 +1 @@
-{"version":3,"file":"namespace.js","names":[],"sources":["../../src/utils/namespace.ts"],"sourcesContent":["/* oxlint-disable @typescript-eslint/no-explicit-any */\n\n/**\n * A constructor type that can be used as a base class for branding.\n */\ntype Constructor = abstract new (...args: any[]) => any;\n\n/**\n * The return type of `Namespace.brand()`: the original base class\n * intersected with a polymorphic `isInstance` type guard.\n */\ntype BrandedClass<TBase extends Constructor> = TBase & {\n  isInstance: IsInstanceFn;\n};\n\n/**\n * A static `isInstance` type guard that resolves to the subclass it's\n * called on via the generic `this` parameter.\n *\n * At call sites TypeScript infers `T` from the class, so\n * `StandardError.isInstance(obj)` narrows `obj` to `StandardError`.\n */\ntype IsInstanceFn = <T extends Constructor>(\n  this: T,\n  obj: unknown\n) => obj is InstanceType<T>;\n\n/**\n * A namespace object for hierarchical symbol-based branding.\n *\n * Namespaces are internal authoring tools. They are not intended to be\n * part of the public API -- only the branded classes are.\n *\n * @example\n * ```typescript\n * const langchain = createNamespace(\"langchain\");\n * const errorNs = langchain.sub(\"error\");\n *\n * export class LangChainError extends errorNs.brand(Error) {\n *   readonly name = \"LangChainError\";\n * }\n *\n * export class ModelAbortError extends errorNs.brand(LangChainError, \"model-abort\") {\n *   readonly name = \"ModelAbortError\";\n * }\n * ```\n */\nexport interface Namespace {\n  /**\n   * Brand a base class with this namespace's symbols.\n   *\n   * Without a marker, creates a namespace-level base class whose\n   * `static isInstance` checks for the namespace's own symbol.\n   *\n   * With a marker, creates a leaf class whose `static isInstance`\n   * checks for the marker-specific symbol.\n   *\n   * @param Base - The base class to extend\n   * @param marker - Optional marker for leaf classes\n   * @returns A new class extending Base with symbol branding and static isInstance\n   */\n  brand<TBase extends Constructor>(\n    Base: TBase,\n    marker?: string\n  ): BrandedClass<TBase>;\n\n  /**\n   * Create a child namespace.\n   *\n   * @param childPath - The child segment to append to the current path\n   * @returns A new Namespace with the extended path\n   */\n  sub(childPath: string): Namespace;\n\n  /**\n   * Check if an object is branded under this namespace (at any level).\n   *\n   * @param obj - The object to check\n   * @returns true if the object carries this namespace's symbol\n   */\n  isInstance(obj: unknown): boolean;\n}\n\n/**\n * Create a symbol-based namespace for hierarchical `isInstance` checking.\n *\n * Each namespace level gets its own `Symbol.for(path)`. When a class is\n * branded via `.brand()`, only the new symbol for that level is stamped\n * on the prototype. Parent symbols are inherited implicitly through the\n * class extension chain -- `symbol in obj` traverses the prototype chain,\n * so a `ConfigError` instance is recognized by `LangChainError.isInstance()`\n * because it extends `GoogleError` which extends `LangChainError`, whose\n * prototype already carries the `langchain.error` symbol.\n *\n * @param path - The dot-separated namespace path (e.g. \"langchain.error\")\n * @returns A Namespace object with `.brand()`, `.sub()`, and `.isInstance()`\n *\n * @example\n * ```typescript\n * const langchain = createNamespace(\"langchain\");\n * const errorNs = langchain.sub(\"error\");\n * const googleNs = errorNs.sub(\"google\");\n *\n * class LangChainError extends errorNs.brand(Error) {}\n * class GoogleError extends googleNs.brand(LangChainError) {}\n * class ConfigError extends googleNs.brand(GoogleError, \"configuration\") {}\n *\n * const err = new ConfigError(\"bad config\");\n * LangChainError.isInstance(err); // true (checks langchain.error symbol)\n * GoogleError.isInstance(err);    // true (checks langchain.error.google symbol)\n * ConfigError.isInstance(err);    // true (checks langchain.error.google.configuration symbol)\n * ```\n */\nexport function createNamespace(path: string): Namespace {\n  const symbol: symbol = Symbol.for(path);\n\n  return {\n    brand<TBase extends Constructor>(Base: TBase, marker?: string) {\n      const brandSymbol: symbol = marker\n        ? Symbol.for(`${path}.${marker}`)\n        : symbol;\n\n      class _Branded extends (Base as any) {\n        readonly [brandSymbol] = true as const;\n\n        constructor(...args: any[]) {\n          super(...args);\n        }\n\n        static isInstance(obj: unknown): boolean {\n          return (\n            typeof obj === \"object\" &&\n            obj !== null &&\n            brandSymbol in obj &&\n            (obj as Record<symbol, unknown>)[brandSymbol] === true\n          );\n        }\n      }\n\n      // Inherit the base class's name so \"_Branded\" doesn't leak\n      // through the static prototype chain.\n      Object.defineProperty(_Branded, \"name\", { value: Base.name });\n\n      return _Branded as unknown as BrandedClass<TBase>;\n    },\n\n    sub(childPath: string): Namespace {\n      return createNamespace(`${path}.${childPath}`);\n    },\n\n    isInstance(obj: unknown): boolean {\n      return (\n        typeof obj === \"object\" &&\n        obj !== null &&\n        symbol in obj &&\n        (obj as Record<symbol, unknown>)[symbol] === true\n      );\n    },\n  };\n}\n\n/** Base namespace used throughout LangChain */\nexport const ns = createNamespace(\"langchain\");\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiHA,SAAgB,gBAAgB,MAAyB;CACvD,MAAM,SAAiB,OAAO,IAAI,KAAK;AAEvC,QAAO;EACL,MAAiC,MAAa,QAAiB;GAC7D,MAAM,cAAsB,SACxB,OAAO,IAAI,GAAG,KAAK,GAAG,SAAS,GAC/B;GAEJ,MAAM,iBAAkB,KAAa;IACnC,CAAU,eAAe;IAEzB,YAAY,GAAG,MAAa;AAC1B,WAAM,GAAG,KAAK;;IAGhB,OAAO,WAAW,KAAuB;AACvC,YACE,OAAO,QAAQ,YACf,QAAQ,QACR,eAAe,OACd,IAAgC,iBAAiB;;;AAOxD,UAAO,eAAe,UAAU,QAAQ,EAAE,OAAO,KAAK,MAAM,CAAC;AAE7D,UAAO;;EAGT,IAAI,WAA8B;AAChC,UAAO,gBAAgB,GAAG,KAAK,GAAG,YAAY;;EAGhD,WAAW,KAAuB;AAChC,UACE,OAAO,QAAQ,YACf,QAAQ,QACR,UAAU,OACT,IAAgC,YAAY;;EAGlD;;;AAIH,MAAa,KAAK,gBAAgB,YAAY"}
+{"version":3,"file":"namespace.js","names":[],"sources":["../../src/utils/namespace.ts"],"sourcesContent":["/* oxlint-disable @typescript-eslint/no-explicit-any */\n\n/**\n * A constructor type that can be used as a base class for branding.\n */\ntype Constructor = abstract new (...args: any[]) => any;\n\n/**\n * The return type of `Namespace.brand()`: the original base class\n * intersected with a polymorphic `isInstance` type guard.\n */\ntype BrandedClass<TBase extends Constructor> = TBase & {\n  isInstance: IsInstanceFn;\n};\n\n/**\n * A static `isInstance` type guard that resolves to the subclass it's\n * called on via the generic `this` parameter.\n *\n * At call sites TypeScript infers `T` from the class, so\n * `StandardError.isInstance(obj)` narrows `obj` to `StandardError`.\n */\ntype IsInstanceFn = <T extends Constructor>(\n  this: T,\n  obj: unknown\n) => obj is InstanceType<T>;\n\n/**\n * A namespace object for hierarchical symbol-based branding.\n *\n * Namespaces are internal authoring tools. They are not intended to be\n * part of the public API -- only the branded classes are.\n *\n * @example\n * ```typescript\n * const langchain = createNamespace(\"langchain\");\n * const errorNs = langchain.sub(\"error\");\n *\n * export class LangChainError extends errorNs.brand(Error) {\n *   readonly name = \"LangChainError\";\n * }\n *\n * export class ModelAbortError extends errorNs.brand(LangChainError, \"model-abort\") {\n *   readonly name = \"ModelAbortError\";\n * }\n * ```\n */\nexport interface Namespace {\n  /**\n   * Brand a base class with this namespace's symbols.\n   *\n   * Without a marker, creates a namespace-level base class whose\n   * `static isInstance` checks for the namespace's own symbol.\n   *\n   * With a marker, creates a leaf class whose `static isInstance`\n   * checks for the marker-specific symbol.\n   *\n   * @param Base - The base class to extend\n   * @param marker - Optional marker for leaf classes\n   * @returns A new class extending Base with symbol branding and static isInstance\n   */\n  brand<TBase extends Constructor>(\n    Base: TBase,\n    marker?: string\n  ): BrandedClass<TBase>;\n\n  /**\n   * Create a child namespace.\n   *\n   * @param childPath - The child segment to append to the current path\n   * @returns A new Namespace with the extended path\n   */\n  sub(childPath: string): Namespace;\n\n  /**\n   * Check if an object is branded under this namespace (at any level).\n   *\n   * @param obj - The object to check\n   * @returns true if the object carries this namespace's symbol\n   */\n  isInstance(obj: unknown): boolean;\n}\n\n/**\n * Create a symbol-based namespace for hierarchical `isInstance` checking.\n *\n * Each namespace level gets its own `Symbol.for(path)`. When a class is\n * branded via `.brand()`, only the new symbol for that level is stamped\n * on the prototype. Parent symbols are inherited implicitly through the\n * class extension chain -- `symbol in obj` traverses the prototype chain,\n * so a `ConfigError` instance is recognized by `LangChainError.isInstance()`\n * because it extends `GoogleError` which extends `LangChainError`, whose\n * prototype already carries the `langchain.error` symbol.\n *\n * @param path - The dot-separated namespace path (e.g. \"langchain.error\")\n * @returns A Namespace object with `.brand()`, `.sub()`, and `.isInstance()`\n *\n * @example\n * ```typescript\n * const langchain = createNamespace(\"langchain\");\n * const errorNs = langchain.sub(\"error\");\n * const googleNs = errorNs.sub(\"google\");\n *\n * class LangChainError extends errorNs.brand(Error) {}\n * class GoogleError extends googleNs.brand(LangChainError) {}\n * class ConfigError extends googleNs.brand(GoogleError, \"configuration\") {}\n *\n * const err = new ConfigError(\"bad config\");\n * LangChainError.isInstance(err); // true (checks langchain.error symbol)\n * GoogleError.isInstance(err);    // true (checks langchain.error.google symbol)\n * ConfigError.isInstance(err);    // true (checks langchain.error.google.configuration symbol)\n * ```\n */\nexport function createNamespace(path: string): Namespace {\n  const symbol: symbol = Symbol.for(path);\n\n  return {\n    brand<TBase extends Constructor>(Base: TBase, marker?: string) {\n      const brandSymbol: symbol = marker\n        ? Symbol.for(`${path}.${marker}`)\n        : symbol;\n\n      class _Branded extends (Base as any) {\n        readonly [brandSymbol] = true as const;\n\n        constructor(...args: any[]) {\n          super(...args);\n        }\n\n        static isInstance(obj: unknown): boolean {\n          return (\n            typeof obj === \"object\" &&\n            obj !== null &&\n            brandSymbol in obj &&\n            (obj as Record<symbol, unknown>)[brandSymbol] === true\n          );\n        }\n\n        static [Symbol.hasInstance](obj: unknown) {\n          return this.isInstance(obj);\n        }\n      }\n\n      // Inherit the base class's name so \"_Branded\" doesn't leak\n      // through the static prototype chain.\n      Object.defineProperty(_Branded, \"name\", { value: Base.name });\n\n      return _Branded as unknown as BrandedClass<TBase>;\n    },\n\n    sub(childPath: string): Namespace {\n      return createNamespace(`${path}.${childPath}`);\n    },\n\n    isInstance(obj: unknown): boolean {\n      return (\n        typeof obj === \"object\" &&\n        obj !== null &&\n        symbol in obj &&\n        (obj as Record<symbol, unknown>)[symbol] === true\n      );\n    },\n  };\n}\n\n/** Base namespace used throughout LangChain */\nexport const ns = createNamespace(\"langchain\");\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiHA,SAAgB,gBAAgB,MAAyB;CACvD,MAAM,SAAiB,OAAO,IAAI,IAAI;CAEtC,OAAO;EACL,MAAiC,MAAa,QAAiB;GAC7D,MAAM,cAAsB,SACxB,OAAO,IAAI,GAAG,KAAK,GAAG,QAAQ,IAC9B;GAEJ,MAAM,iBAAkB,KAAa;IACnC,CAAU,eAAe;IAEzB,YAAY,GAAG,MAAa;KAC1B,MAAM,GAAG,IAAI;IACf;IAEA,OAAO,WAAW,KAAuB;KACvC,OACE,OAAO,QAAQ,YACf,QAAQ,QACR,eAAe,OACd,IAAgC,iBAAiB;IAEtD;IAEA,QAAQ,OAAO,aAAa,KAAc;KACxC,OAAO,KAAK,WAAW,GAAG;IAC5B;GACF;GAIA,OAAO,eAAe,UAAU,QAAQ,EAAE,OAAO,KAAK,KAAK,CAAC;GAE5D,OAAO;EACT;EAEA,IAAI,WAA8B;GAChC,OAAO,gBAAgB,GAAG,KAAK,GAAG,WAAW;EAC/C;EAEA,WAAW,KAAuB;GAChC,OACE,OAAO,QAAQ,YACf,QAAQ,QACR,UAAU,OACT,IAAgC,YAAY;EAEjD;CACF;AACF;;AAGA,MAAa,KAAK,gBAAgB,WAAW"}

package/dist/utils/p-retry/index.cjs

@@ -137,6 +137,7 @@ async function pRetry(input, options = {}) {
 	throw new Error("Retry attempts exhausted without throwing an error.");
 }
 //#endregion
+exports.AbortError = AbortError;
 exports.default = pRetry;
 
 //# sourceMappingURL=index.cjs.map

package/dist/utils/p-retry/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","names":["isNetworkError"],"sources":["../../../src/utils/p-retry/index.js"],"sourcesContent":["/* oxlint-disable */\nimport isNetworkError from \"../is-network-error/index.js\";\n\nfunction validateRetries(retries) {\n  if (typeof retries === \"number\") {\n    if (retries < 0) {\n      throw new TypeError(\"Expected `retries` to be a non-negative number.\");\n    }\n\n    if (Number.isNaN(retries)) {\n      throw new TypeError(\n        \"Expected `retries` to be a valid number or Infinity, got NaN.\"\n      );\n    }\n  } else if (retries !== undefined) {\n    throw new TypeError(\"Expected `retries` to be a number or Infinity.\");\n  }\n}\n\nfunction validateNumberOption(\n  name,\n  value,\n  { min = 0, allowInfinity = false } = {}\n) {\n  if (value === undefined) {\n    return;\n  }\n\n  if (typeof value !== \"number\" || Number.isNaN(value)) {\n    throw new TypeError(\n      `Expected \\`${name}\\` to be a number${\n        allowInfinity ? \" or Infinity\" : \"\"\n      }.`\n    );\n  }\n\n  if (!allowInfinity && !Number.isFinite(value)) {\n    throw new TypeError(`Expected \\`${name}\\` to be a finite number.`);\n  }\n\n  if (value < min) {\n    throw new TypeError(`Expected \\`${name}\\` to be \\u2265 ${min}.`);\n  }\n}\n\nexport class AbortError extends Error {\n  constructor(message) {\n    super();\n\n    if (message instanceof Error) {\n      this.originalError = message;\n      ({ message } = message);\n    } else {\n      this.originalError = new Error(message);\n      this.originalError.stack = this.stack;\n    }\n\n    this.name = \"AbortError\";\n    this.message = message;\n  }\n}\n\nfunction calculateDelay(retriesConsumed, options) {\n  const attempt = Math.max(1, retriesConsumed + 1);\n  const random = options.randomize ? Math.random() + 1 : 1;\n\n  let timeout = Math.round(\n    random * options.minTimeout * options.factor ** (attempt - 1)\n  );\n  timeout = Math.min(timeout, options.maxTimeout);\n\n  return timeout;\n}\n\nfunction calculateRemainingTime(start, max) {\n  if (!Number.isFinite(max)) {\n    return max;\n  }\n\n  return max - (performance.now() - start);\n}\n\nasync function onAttemptFailure({\n  error,\n  attemptNumber,\n  retriesConsumed,\n  startTime,\n  options,\n}) {\n  const normalizedError =\n    error instanceof Error\n      ? error\n      : new TypeError(\n          `Non-error was thrown: \"${error}\". You should only throw errors.`\n        );\n\n  if (normalizedError instanceof AbortError) {\n    throw normalizedError.originalError;\n  }\n\n  const retriesLeft = Number.isFinite(options.retries)\n    ? Math.max(0, options.retries - retriesConsumed)\n    : options.retries;\n\n  const maxRetryTime = options.maxRetryTime ?? Number.POSITIVE_INFINITY;\n\n  const context = Object.freeze({\n    error: normalizedError,\n    attemptNumber,\n    retriesLeft,\n    retriesConsumed,\n  });\n\n  await options.onFailedAttempt(context);\n\n  if (calculateRemainingTime(startTime, maxRetryTime) <= 0) {\n    throw normalizedError;\n  }\n\n  const consumeRetry = await options.shouldConsumeRetry(context);\n\n  const remainingTime = calculateRemainingTime(startTime, maxRetryTime);\n\n  if (remainingTime <= 0 || retriesLeft <= 0) {\n    throw normalizedError;\n  }\n\n  if (\n    normalizedError instanceof TypeError &&\n    !isNetworkError(normalizedError)\n  ) {\n    if (consumeRetry) {\n      throw normalizedError;\n    }\n\n    options.signal?.throwIfAborted();\n    return false;\n  }\n\n  if (!(await options.shouldRetry(context))) {\n    throw normalizedError;\n  }\n\n  if (!consumeRetry) {\n    options.signal?.throwIfAborted();\n    return false;\n  }\n\n  let delayTime = calculateDelay(retriesConsumed, options);\n  const retryAfterMs =\n    typeof normalizedError.retryAfterMs === \"number\" &&\n    normalizedError.retryAfterMs >= 0\n      ? normalizedError.retryAfterMs\n      : undefined;\n\n  if (retryAfterMs !== undefined) {\n    delayTime = Math.max(delayTime, retryAfterMs);\n  }\n\n  const finalDelay = Math.min(delayTime, remainingTime);\n\n  if (finalDelay > 0) {\n    await new Promise((resolve, reject) => {\n      const onAbort = () => {\n        clearTimeout(timeoutToken);\n        options.signal?.removeEventListener(\"abort\", onAbort);\n        reject(options.signal.reason);\n      };\n\n      const timeoutToken = setTimeout(() => {\n        options.signal?.removeEventListener(\"abort\", onAbort);\n        resolve();\n      }, finalDelay);\n\n      if (options.unref) {\n        timeoutToken.unref?.();\n      }\n\n      options.signal?.addEventListener(\"abort\", onAbort, { once: true });\n    });\n  }\n\n  options.signal?.throwIfAborted();\n\n  return true;\n}\n\nexport default async function pRetry(input, options = {}) {\n  options = { ...options };\n\n  validateRetries(options.retries);\n\n  if (Object.hasOwn(options, \"forever\")) {\n    throw new Error(\n      \"The `forever` option is no longer supported. For many use-cases, you can set `retries: Infinity` instead.\"\n    );\n  }\n\n  options.retries ??= 10;\n  options.factor ??= 2;\n  options.minTimeout ??= 1000;\n  options.maxTimeout ??= Number.POSITIVE_INFINITY;\n  options.maxRetryTime ??= Number.POSITIVE_INFINITY;\n  options.randomize ??= false;\n  options.onFailedAttempt ??= () => {};\n  options.shouldRetry ??= () => true;\n  options.shouldConsumeRetry ??= () => true;\n\n  // Validate numeric options and normalize edge cases\n  validateNumberOption(\"factor\", options.factor, {\n    min: 0,\n    allowInfinity: false,\n  });\n  validateNumberOption(\"minTimeout\", options.minTimeout, {\n    min: 0,\n    allowInfinity: false,\n  });\n  validateNumberOption(\"maxTimeout\", options.maxTimeout, {\n    min: 0,\n    allowInfinity: true,\n  });\n  validateNumberOption(\"maxRetryTime\", options.maxRetryTime, {\n    min: 0,\n    allowInfinity: true,\n  });\n\n  // Treat non-positive factor as 1 to avoid zero backoff or negative behavior\n  if (!(options.factor > 0)) {\n    options.factor = 1;\n  }\n\n  options.signal?.throwIfAborted();\n\n  let attemptNumber = 0;\n  let retriesConsumed = 0;\n  const startTime = performance.now();\n\n  while (\n    Number.isFinite(options.retries) ? retriesConsumed <= options.retries : true\n  ) {\n    attemptNumber++;\n\n    try {\n      options.signal?.throwIfAborted();\n\n      const result = await input(attemptNumber);\n\n      options.signal?.throwIfAborted();\n\n      return result;\n    } catch (error) {\n      if (\n        await onAttemptFailure({\n          error,\n          attemptNumber,\n          retriesConsumed,\n          startTime,\n          options,\n        })\n      ) {\n        retriesConsumed++;\n      }\n    }\n  }\n\n  // Should not reach here, but in case it does, throw an error\n  throw new Error(\"Retry attempts exhausted without throwing an error.\");\n}\n\nexport function makeRetriable(function_, options) {\n  return function (...arguments_) {\n    return pRetry(() => function_.apply(this, arguments_), options);\n  };\n}\n"],"mappings":";;AAGA,SAAS,gBAAgB,SAAS;AAChC,KAAI,OAAO,YAAY,UAAU;AAC/B,MAAI,UAAU,EACZ,OAAM,IAAI,UAAU,kDAAkD;AAGxE,MAAI,OAAO,MAAM,QAAQ,CACvB,OAAM,IAAI,UACR,gEACD;YAEM,YAAY,KAAA,EACrB,OAAM,IAAI,UAAU,iDAAiD;;AAIzE,SAAS,qBACP,MACA,OACA,EAAE,MAAM,GAAG,gBAAgB,UAAU,EAAE,EACvC;AACA,KAAI,UAAU,KAAA,EACZ;AAGF,KAAI,OAAO,UAAU,YAAY,OAAO,MAAM,MAAM,CAClD,OAAM,IAAI,UACR,cAAc,KAAK,mBACjB,gBAAgB,iBAAiB,GAClC,GACF;AAGH,KAAI,CAAC,iBAAiB,CAAC,OAAO,SAAS,MAAM,CAC3C,OAAM,IAAI,UAAU,cAAc,KAAK,2BAA2B;AAGpE,KAAI,QAAQ,IACV,OAAM,IAAI,UAAU,cAAc,KAAK,kBAAkB,IAAI,GAAG;;AAIpE,IAAa,aAAb,cAAgC,MAAM;CACpC,YAAY,SAAS;AACnB,SAAO;AAEP,MAAI,mBAAmB,OAAO;AAC5B,QAAK,gBAAgB;AACrB,IAAC,CAAE,WAAY;SACV;AACL,QAAK,gBAAgB,IAAI,MAAM,QAAQ;AACvC,QAAK,cAAc,QAAQ,KAAK;;AAGlC,OAAK,OAAO;AACZ,OAAK,UAAU;;;AAInB,SAAS,eAAe,iBAAiB,SAAS;CAChD,MAAM,UAAU,KAAK,IAAI,GAAG,kBAAkB,EAAE;CAChD,MAAM,SAAS,QAAQ,YAAY,KAAK,QAAQ,GAAG,IAAI;CAEvD,IAAI,UAAU,KAAK,MACjB,SAAS,QAAQ,aAAa,QAAQ,WAAW,UAAU,GAC5D;AACD,WAAU,KAAK,IAAI,SAAS,QAAQ,WAAW;AAE/C,QAAO;;AAGT,SAAS,uBAAuB,OAAO,KAAK;AAC1C,KAAI,CAAC,OAAO,SAAS,IAAI,CACvB,QAAO;AAGT,QAAO,OAAO,YAAY,KAAK,GAAG;;AAGpC,eAAe,iBAAiB,EAC9B,OACA,eACA,iBACA,WACA,WACC;CACD,MAAM,kBACJ,iBAAiB,QACb,wBACA,IAAI,UACF,0BAA0B,MAAM,kCACjC;AAEP,KAAI,2BAA2B,WAC7B,OAAM,gBAAgB;CAGxB,MAAM,cAAc,OAAO,SAAS,QAAQ,QAAQ,GAChD,KAAK,IAAI,GAAG,QAAQ,UAAU,gBAAgB,GAC9C,QAAQ;CAEZ,MAAM,eAAe,QAAQ,gBAAgB,OAAO;CAEpD,MAAM,UAAU,OAAO,OAAO;EAC5B,OAAO;EACP;EACA;EACA;EACD,CAAC;AAEF,OAAM,QAAQ,gBAAgB,QAAQ;AAEtC,KAAI,uBAAuB,WAAW,aAAa,IAAI,EACrD,OAAM;CAGR,MAAM,eAAe,MAAM,QAAQ,mBAAmB,QAAQ;CAE9D,MAAM,gBAAgB,uBAAuB,WAAW,aAAa;AAErE,KAAI,iBAAiB,KAAK,eAAe,EACvC,OAAM;AAGR,KACE,2BAA2B,aAC3B,CAACA,cAAAA,QAAe,gBAAgB,EAChC;AACA,MAAI,aACF,OAAM;AAGR,UAAQ,QAAQ,gBAAgB;AAChC,SAAO;;AAGT,KAAI,CAAE,MAAM,QAAQ,YAAY,QAAQ,CACtC,OAAM;AAGR,KAAI,CAAC,cAAc;AACjB,UAAQ,QAAQ,gBAAgB;AAChC,SAAO;;CAGT,IAAI,YAAY,eAAe,iBAAiB,QAAQ;CACxD,MAAM,eACJ,OAAO,gBAAgB,iBAAiB,YACxC,gBAAgB,gBAAgB,IAC5B,gBAAgB,eAChB,KAAA;AAEN,KAAI,iBAAiB,KAAA,EACnB,aAAY,KAAK,IAAI,WAAW,aAAa;CAG/C,MAAM,aAAa,KAAK,IAAI,WAAW,cAAc;AAErD,KAAI,aAAa,EACf,OAAM,IAAI,SAAS,SAAS,WAAW;EACrC,MAAM,gBAAgB;AACpB,gBAAa,aAAa;AAC1B,WAAQ,QAAQ,oBAAoB,SAAS,QAAQ;AACrD,UAAO,QAAQ,OAAO,OAAO;;EAG/B,MAAM,eAAe,iBAAiB;AACpC,WAAQ,QAAQ,oBAAoB,SAAS,QAAQ;AACrD,YAAS;KACR,WAAW;AAEd,MAAI,QAAQ,MACV,cAAa,SAAS;AAGxB,UAAQ,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,MAAM,CAAC;GAClE;AAGJ,SAAQ,QAAQ,gBAAgB;AAEhC,QAAO;;AAGT,eAA8B,OAAO,OAAO,UAAU,EAAE,EAAE;AACxD,WAAU,EAAE,GAAG,SAAS;AAExB,iBAAgB,QAAQ,QAAQ;AAEhC,KAAI,OAAO,OAAO,SAAS,UAAU,CACnC,OAAM,IAAI,MACR,4GACD;AAGH,SAAQ,YAAY;AACpB,SAAQ,WAAW;AACnB,SAAQ,eAAe;AACvB,SAAQ,eAAe,OAAO;AAC9B,SAAQ,iBAAiB,OAAO;AAChC,SAAQ,cAAc;AACtB,SAAQ,0BAA0B;AAClC,SAAQ,sBAAsB;AAC9B,SAAQ,6BAA6B;AAGrC,sBAAqB,UAAU,QAAQ,QAAQ;EAC7C,KAAK;EACL,eAAe;EAChB,CAAC;AACF,sBAAqB,cAAc,QAAQ,YAAY;EACrD,KAAK;EACL,eAAe;EAChB,CAAC;AACF,sBAAqB,cAAc,QAAQ,YAAY;EACrD,KAAK;EACL,eAAe;EAChB,CAAC;AACF,sBAAqB,gBAAgB,QAAQ,cAAc;EACzD,KAAK;EACL,eAAe;EAChB,CAAC;AAGF,KAAI,EAAE,QAAQ,SAAS,GACrB,SAAQ,SAAS;AAGnB,SAAQ,QAAQ,gBAAgB;CAEhC,IAAI,gBAAgB;CACpB,IAAI,kBAAkB;CACtB,MAAM,YAAY,YAAY,KAAK;AAEnC,QACE,OAAO,SAAS,QAAQ,QAAQ,GAAG,mBAAmB,QAAQ,UAAU,MACxE;AACA;AAEA,MAAI;AACF,WAAQ,QAAQ,gBAAgB;GAEhC,MAAM,SAAS,MAAM,MAAM,cAAc;AAEzC,WAAQ,QAAQ,gBAAgB;AAEhC,UAAO;WACA,OAAO;AACd,OACE,MAAM,iBAAiB;IACrB;IACA;IACA;IACA;IACA;IACD,CAAC,CAEF;;;AAMN,OAAM,IAAI,MAAM,sDAAsD"}
+{"version":3,"file":"index.cjs","names":["isNetworkError"],"sources":["../../../src/utils/p-retry/index.js"],"sourcesContent":["/* oxlint-disable */\nimport isNetworkError from \"../is-network-error/index.js\";\n\nfunction validateRetries(retries) {\n  if (typeof retries === \"number\") {\n    if (retries < 0) {\n      throw new TypeError(\"Expected `retries` to be a non-negative number.\");\n    }\n\n    if (Number.isNaN(retries)) {\n      throw new TypeError(\n        \"Expected `retries` to be a valid number or Infinity, got NaN.\"\n      );\n    }\n  } else if (retries !== undefined) {\n    throw new TypeError(\"Expected `retries` to be a number or Infinity.\");\n  }\n}\n\nfunction validateNumberOption(\n  name,\n  value,\n  { min = 0, allowInfinity = false } = {}\n) {\n  if (value === undefined) {\n    return;\n  }\n\n  if (typeof value !== \"number\" || Number.isNaN(value)) {\n    throw new TypeError(\n      `Expected \\`${name}\\` to be a number${\n        allowInfinity ? \" or Infinity\" : \"\"\n      }.`\n    );\n  }\n\n  if (!allowInfinity && !Number.isFinite(value)) {\n    throw new TypeError(`Expected \\`${name}\\` to be a finite number.`);\n  }\n\n  if (value < min) {\n    throw new TypeError(`Expected \\`${name}\\` to be \\u2265 ${min}.`);\n  }\n}\n\nexport class AbortError extends Error {\n  constructor(message) {\n    super();\n\n    if (message instanceof Error) {\n      this.originalError = message;\n      ({ message } = message);\n    } else {\n      this.originalError = new Error(message);\n      this.originalError.stack = this.stack;\n    }\n\n    this.name = \"AbortError\";\n    this.message = message;\n  }\n}\n\nfunction calculateDelay(retriesConsumed, options) {\n  const attempt = Math.max(1, retriesConsumed + 1);\n  const random = options.randomize ? Math.random() + 1 : 1;\n\n  let timeout = Math.round(\n    random * options.minTimeout * options.factor ** (attempt - 1)\n  );\n  timeout = Math.min(timeout, options.maxTimeout);\n\n  return timeout;\n}\n\nfunction calculateRemainingTime(start, max) {\n  if (!Number.isFinite(max)) {\n    return max;\n  }\n\n  return max - (performance.now() - start);\n}\n\nasync function onAttemptFailure({\n  error,\n  attemptNumber,\n  retriesConsumed,\n  startTime,\n  options,\n}) {\n  const normalizedError =\n    error instanceof Error\n      ? error\n      : new TypeError(\n          `Non-error was thrown: \"${error}\". You should only throw errors.`\n        );\n\n  if (normalizedError instanceof AbortError) {\n    throw normalizedError.originalError;\n  }\n\n  const retriesLeft = Number.isFinite(options.retries)\n    ? Math.max(0, options.retries - retriesConsumed)\n    : options.retries;\n\n  const maxRetryTime = options.maxRetryTime ?? Number.POSITIVE_INFINITY;\n\n  const context = Object.freeze({\n    error: normalizedError,\n    attemptNumber,\n    retriesLeft,\n    retriesConsumed,\n  });\n\n  await options.onFailedAttempt(context);\n\n  if (calculateRemainingTime(startTime, maxRetryTime) <= 0) {\n    throw normalizedError;\n  }\n\n  const consumeRetry = await options.shouldConsumeRetry(context);\n\n  const remainingTime = calculateRemainingTime(startTime, maxRetryTime);\n\n  if (remainingTime <= 0 || retriesLeft <= 0) {\n    throw normalizedError;\n  }\n\n  if (\n    normalizedError instanceof TypeError &&\n    !isNetworkError(normalizedError)\n  ) {\n    if (consumeRetry) {\n      throw normalizedError;\n    }\n\n    options.signal?.throwIfAborted();\n    return false;\n  }\n\n  if (!(await options.shouldRetry(context))) {\n    throw normalizedError;\n  }\n\n  if (!consumeRetry) {\n    options.signal?.throwIfAborted();\n    return false;\n  }\n\n  let delayTime = calculateDelay(retriesConsumed, options);\n  const retryAfterMs =\n    typeof normalizedError.retryAfterMs === \"number\" &&\n    normalizedError.retryAfterMs >= 0\n      ? normalizedError.retryAfterMs\n      : undefined;\n\n  if (retryAfterMs !== undefined) {\n    delayTime = Math.max(delayTime, retryAfterMs);\n  }\n\n  const finalDelay = Math.min(delayTime, remainingTime);\n\n  if (finalDelay > 0) {\n    await new Promise((resolve, reject) => {\n      const onAbort = () => {\n        clearTimeout(timeoutToken);\n        options.signal?.removeEventListener(\"abort\", onAbort);\n        reject(options.signal.reason);\n      };\n\n      const timeoutToken = setTimeout(() => {\n        options.signal?.removeEventListener(\"abort\", onAbort);\n        resolve();\n      }, finalDelay);\n\n      if (options.unref) {\n        timeoutToken.unref?.();\n      }\n\n      options.signal?.addEventListener(\"abort\", onAbort, { once: true });\n    });\n  }\n\n  options.signal?.throwIfAborted();\n\n  return true;\n}\n\nexport default async function pRetry(input, options = {}) {\n  options = { ...options };\n\n  validateRetries(options.retries);\n\n  if (Object.hasOwn(options, \"forever\")) {\n    throw new Error(\n      \"The `forever` option is no longer supported. For many use-cases, you can set `retries: Infinity` instead.\"\n    );\n  }\n\n  options.retries ??= 10;\n  options.factor ??= 2;\n  options.minTimeout ??= 1000;\n  options.maxTimeout ??= Number.POSITIVE_INFINITY;\n  options.maxRetryTime ??= Number.POSITIVE_INFINITY;\n  options.randomize ??= false;\n  options.onFailedAttempt ??= () => {};\n  options.shouldRetry ??= () => true;\n  options.shouldConsumeRetry ??= () => true;\n\n  // Validate numeric options and normalize edge cases\n  validateNumberOption(\"factor\", options.factor, {\n    min: 0,\n    allowInfinity: false,\n  });\n  validateNumberOption(\"minTimeout\", options.minTimeout, {\n    min: 0,\n    allowInfinity: false,\n  });\n  validateNumberOption(\"maxTimeout\", options.maxTimeout, {\n    min: 0,\n    allowInfinity: true,\n  });\n  validateNumberOption(\"maxRetryTime\", options.maxRetryTime, {\n    min: 0,\n    allowInfinity: true,\n  });\n\n  // Treat non-positive factor as 1 to avoid zero backoff or negative behavior\n  if (!(options.factor > 0)) {\n    options.factor = 1;\n  }\n\n  options.signal?.throwIfAborted();\n\n  let attemptNumber = 0;\n  let retriesConsumed = 0;\n  const startTime = performance.now();\n\n  while (\n    Number.isFinite(options.retries) ? retriesConsumed <= options.retries : true\n  ) {\n    attemptNumber++;\n\n    try {\n      options.signal?.throwIfAborted();\n\n      const result = await input(attemptNumber);\n\n      options.signal?.throwIfAborted();\n\n      return result;\n    } catch (error) {\n      if (\n        await onAttemptFailure({\n          error,\n          attemptNumber,\n          retriesConsumed,\n          startTime,\n          options,\n        })\n      ) {\n        retriesConsumed++;\n      }\n    }\n  }\n\n  // Should not reach here, but in case it does, throw an error\n  throw new Error(\"Retry attempts exhausted without throwing an error.\");\n}\n\nexport function makeRetriable(function_, options) {\n  return function (...arguments_) {\n    return pRetry(() => function_.apply(this, arguments_), options);\n  };\n}\n"],"mappings":";;AAGA,SAAS,gBAAgB,SAAS;CAChC,IAAI,OAAO,YAAY,UAAU;EAC/B,IAAI,UAAU,GACZ,MAAM,IAAI,UAAU,iDAAiD;EAGvE,IAAI,OAAO,MAAM,OAAO,GACtB,MAAM,IAAI,UACR,+DACF;CAEJ,OAAO,IAAI,YAAY,KAAA,GACrB,MAAM,IAAI,UAAU,gDAAgD;AAExE;AAEA,SAAS,qBACP,MACA,OACA,EAAE,MAAM,GAAG,gBAAgB,UAAU,CAAC,GACtC;CACA,IAAI,UAAU,KAAA,GACZ;CAGF,IAAI,OAAO,UAAU,YAAY,OAAO,MAAM,KAAK,GACjD,MAAM,IAAI,UACR,cAAc,KAAK,mBACjB,gBAAgB,iBAAiB,GAClC,EACH;CAGF,IAAI,CAAC,iBAAiB,CAAC,OAAO,SAAS,KAAK,GAC1C,MAAM,IAAI,UAAU,cAAc,KAAK,0BAA0B;CAGnE,IAAI,QAAQ,KACV,MAAM,IAAI,UAAU,cAAc,KAAK,kBAAkB,IAAI,EAAE;AAEnE;AAEA,IAAa,aAAb,cAAgC,MAAM;CACpC,YAAY,SAAS;EACnB,MAAM;EAEN,IAAI,mBAAmB,OAAO;GAC5B,KAAK,gBAAgB;GACrB,CAAC,CAAE,WAAY;EACjB,OAAO;GACL,KAAK,gBAAgB,IAAI,MAAM,OAAO;GACtC,KAAK,cAAc,QAAQ,KAAK;EAClC;EAEA,KAAK,OAAO;EACZ,KAAK,UAAU;CACjB;AACF;AAEA,SAAS,eAAe,iBAAiB,SAAS;CAChD,MAAM,UAAU,KAAK,IAAI,GAAG,kBAAkB,CAAC;CAC/C,MAAM,SAAS,QAAQ,YAAY,KAAK,OAAO,IAAI,IAAI;CAEvD,IAAI,UAAU,KAAK,MACjB,SAAS,QAAQ,aAAa,QAAQ,WAAW,UAAU,EAC7D;CACA,UAAU,KAAK,IAAI,SAAS,QAAQ,UAAU;CAE9C,OAAO;AACT;AAEA,SAAS,uBAAuB,OAAO,KAAK;CAC1C,IAAI,CAAC,OAAO,SAAS,GAAG,GACtB,OAAO;CAGT,OAAO,OAAO,YAAY,IAAI,IAAI;AACpC;AAEA,eAAe,iBAAiB,EAC9B,OACA,eACA,iBACA,WACA,WACC;CACD,MAAM,kBACJ,iBAAiB,QACb,wBACA,IAAI,UACF,0BAA0B,MAAM,iCAClC;CAEN,IAAI,2BAA2B,YAC7B,MAAM,gBAAgB;CAGxB,MAAM,cAAc,OAAO,SAAS,QAAQ,OAAO,IAC/C,KAAK,IAAI,GAAG,QAAQ,UAAU,eAAe,IAC7C,QAAQ;CAEZ,MAAM,eAAe,QAAQ,gBAAgB,OAAO;CAEpD,MAAM,UAAU,OAAO,OAAO;EAC5B,OAAO;EACP;EACA;EACA;CACF,CAAC;CAED,MAAM,QAAQ,gBAAgB,OAAO;CAErC,IAAI,uBAAuB,WAAW,YAAY,KAAK,GACrD,MAAM;CAGR,MAAM,eAAe,MAAM,QAAQ,mBAAmB,OAAO;CAE7D,MAAM,gBAAgB,uBAAuB,WAAW,YAAY;CAEpE,IAAI,iBAAiB,KAAK,eAAe,GACvC,MAAM;CAGR,IACE,2BAA2B,aAC3B,CAACA,cAAAA,QAAe,eAAe,GAC/B;EACA,IAAI,cACF,MAAM;EAGR,QAAQ,QAAQ,eAAe;EAC/B,OAAO;CACT;CAEA,IAAI,CAAE,MAAM,QAAQ,YAAY,OAAO,GACrC,MAAM;CAGR,IAAI,CAAC,cAAc;EACjB,QAAQ,QAAQ,eAAe;EAC/B,OAAO;CACT;CAEA,IAAI,YAAY,eAAe,iBAAiB,OAAO;CACvD,MAAM,eACJ,OAAO,gBAAgB,iBAAiB,YACxC,gBAAgB,gBAAgB,IAC5B,gBAAgB,eAChB,KAAA;CAEN,IAAI,iBAAiB,KAAA,GACnB,YAAY,KAAK,IAAI,WAAW,YAAY;CAG9C,MAAM,aAAa,KAAK,IAAI,WAAW,aAAa;CAEpD,IAAI,aAAa,GACf,MAAM,IAAI,SAAS,SAAS,WAAW;EACrC,MAAM,gBAAgB;GACpB,aAAa,YAAY;GACzB,QAAQ,QAAQ,oBAAoB,SAAS,OAAO;GACpD,OAAO,QAAQ,OAAO,MAAM;EAC9B;EAEA,MAAM,eAAe,iBAAiB;GACpC,QAAQ,QAAQ,oBAAoB,SAAS,OAAO;GACpD,QAAQ;EACV,GAAG,UAAU;EAEb,IAAI,QAAQ,OACV,aAAa,QAAQ;EAGvB,QAAQ,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;CACnE,CAAC;CAGH,QAAQ,QAAQ,eAAe;CAE/B,OAAO;AACT;AAEA,eAA8B,OAAO,OAAO,UAAU,CAAC,GAAG;CACxD,UAAU,EAAE,GAAG,QAAQ;CAEvB,gBAAgB,QAAQ,OAAO;CAE/B,IAAI,OAAO,OAAO,SAAS,SAAS,GAClC,MAAM,IAAI,MACR,2GACF;CAGF,QAAQ,YAAY;CACpB,QAAQ,WAAW;CACnB,QAAQ,eAAe;CACvB,QAAQ,eAAe,OAAO;CAC9B,QAAQ,iBAAiB,OAAO;CAChC,QAAQ,cAAc;CACtB,QAAQ,0BAA0B,CAAC;CACnC,QAAQ,sBAAsB;CAC9B,QAAQ,6BAA6B;CAGrC,qBAAqB,UAAU,QAAQ,QAAQ;EAC7C,KAAK;EACL,eAAe;CACjB,CAAC;CACD,qBAAqB,cAAc,QAAQ,YAAY;EACrD,KAAK;EACL,eAAe;CACjB,CAAC;CACD,qBAAqB,cAAc,QAAQ,YAAY;EACrD,KAAK;EACL,eAAe;CACjB,CAAC;CACD,qBAAqB,gBAAgB,QAAQ,cAAc;EACzD,KAAK;EACL,eAAe;CACjB,CAAC;CAGD,IAAI,EAAE,QAAQ,SAAS,IACrB,QAAQ,SAAS;CAGnB,QAAQ,QAAQ,eAAe;CAE/B,IAAI,gBAAgB;CACpB,IAAI,kBAAkB;CACtB,MAAM,YAAY,YAAY,IAAI;CAElC,OACE,OAAO,SAAS,QAAQ,OAAO,IAAI,mBAAmB,QAAQ,UAAU,MACxE;EACA;EAEA,IAAI;GACF,QAAQ,QAAQ,eAAe;GAE/B,MAAM,SAAS,MAAM,MAAM,aAAa;GAExC,QAAQ,QAAQ,eAAe;GAE/B,OAAO;EACT,SAAS,OAAO;GACd,IACE,MAAM,iBAAiB;IACrB;IACA;IACA;IACA;IACA;GACF,CAAC,GAED;EAEJ;CACF;CAGA,MAAM,IAAI,MAAM,qDAAqD;AACvE"}

package/dist/utils/p-retry/index.js

@@ -137,6 +137,6 @@ async function pRetry(input, options = {}) {
 	throw new Error("Retry attempts exhausted without throwing an error.");
 }
 //#endregion
-export { pRetry as default };
+export { AbortError, pRetry as default };
 
 //# sourceMappingURL=index.js.map

package/dist/utils/p-retry/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../../src/utils/p-retry/index.js"],"sourcesContent":["/* oxlint-disable */\nimport isNetworkError from \"../is-network-error/index.js\";\n\nfunction validateRetries(retries) {\n  if (typeof retries === \"number\") {\n    if (retries < 0) {\n      throw new TypeError(\"Expected `retries` to be a non-negative number.\");\n    }\n\n    if (Number.isNaN(retries)) {\n      throw new TypeError(\n        \"Expected `retries` to be a valid number or Infinity, got NaN.\"\n      );\n    }\n  } else if (retries !== undefined) {\n    throw new TypeError(\"Expected `retries` to be a number or Infinity.\");\n  }\n}\n\nfunction validateNumberOption(\n  name,\n  value,\n  { min = 0, allowInfinity = false } = {}\n) {\n  if (value === undefined) {\n    return;\n  }\n\n  if (typeof value !== \"number\" || Number.isNaN(value)) {\n    throw new TypeError(\n      `Expected \\`${name}\\` to be a number${\n        allowInfinity ? \" or Infinity\" : \"\"\n      }.`\n    );\n  }\n\n  if (!allowInfinity && !Number.isFinite(value)) {\n    throw new TypeError(`Expected \\`${name}\\` to be a finite number.`);\n  }\n\n  if (value < min) {\n    throw new TypeError(`Expected \\`${name}\\` to be \\u2265 ${min}.`);\n  }\n}\n\nexport class AbortError extends Error {\n  constructor(message) {\n    super();\n\n    if (message instanceof Error) {\n      this.originalError = message;\n      ({ message } = message);\n    } else {\n      this.originalError = new Error(message);\n      this.originalError.stack = this.stack;\n    }\n\n    this.name = \"AbortError\";\n    this.message = message;\n  }\n}\n\nfunction calculateDelay(retriesConsumed, options) {\n  const attempt = Math.max(1, retriesConsumed + 1);\n  const random = options.randomize ? Math.random() + 1 : 1;\n\n  let timeout = Math.round(\n    random * options.minTimeout * options.factor ** (attempt - 1)\n  );\n  timeout = Math.min(timeout, options.maxTimeout);\n\n  return timeout;\n}\n\nfunction calculateRemainingTime(start, max) {\n  if (!Number.isFinite(max)) {\n    return max;\n  }\n\n  return max - (performance.now() - start);\n}\n\nasync function onAttemptFailure({\n  error,\n  attemptNumber,\n  retriesConsumed,\n  startTime,\n  options,\n}) {\n  const normalizedError =\n    error instanceof Error\n      ? error\n      : new TypeError(\n          `Non-error was thrown: \"${error}\". You should only throw errors.`\n        );\n\n  if (normalizedError instanceof AbortError) {\n    throw normalizedError.originalError;\n  }\n\n  const retriesLeft = Number.isFinite(options.retries)\n    ? Math.max(0, options.retries - retriesConsumed)\n    : options.retries;\n\n  const maxRetryTime = options.maxRetryTime ?? Number.POSITIVE_INFINITY;\n\n  const context = Object.freeze({\n    error: normalizedError,\n    attemptNumber,\n    retriesLeft,\n    retriesConsumed,\n  });\n\n  await options.onFailedAttempt(context);\n\n  if (calculateRemainingTime(startTime, maxRetryTime) <= 0) {\n    throw normalizedError;\n  }\n\n  const consumeRetry = await options.shouldConsumeRetry(context);\n\n  const remainingTime = calculateRemainingTime(startTime, maxRetryTime);\n\n  if (remainingTime <= 0 || retriesLeft <= 0) {\n    throw normalizedError;\n  }\n\n  if (\n    normalizedError instanceof TypeError &&\n    !isNetworkError(normalizedError)\n  ) {\n    if (consumeRetry) {\n      throw normalizedError;\n    }\n\n    options.signal?.throwIfAborted();\n    return false;\n  }\n\n  if (!(await options.shouldRetry(context))) {\n    throw normalizedError;\n  }\n\n  if (!consumeRetry) {\n    options.signal?.throwIfAborted();\n    return false;\n  }\n\n  let delayTime = calculateDelay(retriesConsumed, options);\n  const retryAfterMs =\n    typeof normalizedError.retryAfterMs === \"number\" &&\n    normalizedError.retryAfterMs >= 0\n      ? normalizedError.retryAfterMs\n      : undefined;\n\n  if (retryAfterMs !== undefined) {\n    delayTime = Math.max(delayTime, retryAfterMs);\n  }\n\n  const finalDelay = Math.min(delayTime, remainingTime);\n\n  if (finalDelay > 0) {\n    await new Promise((resolve, reject) => {\n      const onAbort = () => {\n        clearTimeout(timeoutToken);\n        options.signal?.removeEventListener(\"abort\", onAbort);\n        reject(options.signal.reason);\n      };\n\n      const timeoutToken = setTimeout(() => {\n        options.signal?.removeEventListener(\"abort\", onAbort);\n        resolve();\n      }, finalDelay);\n\n      if (options.unref) {\n        timeoutToken.unref?.();\n      }\n\n      options.signal?.addEventListener(\"abort\", onAbort, { once: true });\n    });\n  }\n\n  options.signal?.throwIfAborted();\n\n  return true;\n}\n\nexport default async function pRetry(input, options = {}) {\n  options = { ...options };\n\n  validateRetries(options.retries);\n\n  if (Object.hasOwn(options, \"forever\")) {\n    throw new Error(\n      \"The `forever` option is no longer supported. For many use-cases, you can set `retries: Infinity` instead.\"\n    );\n  }\n\n  options.retries ??= 10;\n  options.factor ??= 2;\n  options.minTimeout ??= 1000;\n  options.maxTimeout ??= Number.POSITIVE_INFINITY;\n  options.maxRetryTime ??= Number.POSITIVE_INFINITY;\n  options.randomize ??= false;\n  options.onFailedAttempt ??= () => {};\n  options.shouldRetry ??= () => true;\n  options.shouldConsumeRetry ??= () => true;\n\n  // Validate numeric options and normalize edge cases\n  validateNumberOption(\"factor\", options.factor, {\n    min: 0,\n    allowInfinity: false,\n  });\n  validateNumberOption(\"minTimeout\", options.minTimeout, {\n    min: 0,\n    allowInfinity: false,\n  });\n  validateNumberOption(\"maxTimeout\", options.maxTimeout, {\n    min: 0,\n    allowInfinity: true,\n  });\n  validateNumberOption(\"maxRetryTime\", options.maxRetryTime, {\n    min: 0,\n    allowInfinity: true,\n  });\n\n  // Treat non-positive factor as 1 to avoid zero backoff or negative behavior\n  if (!(options.factor > 0)) {\n    options.factor = 1;\n  }\n\n  options.signal?.throwIfAborted();\n\n  let attemptNumber = 0;\n  let retriesConsumed = 0;\n  const startTime = performance.now();\n\n  while (\n    Number.isFinite(options.retries) ? retriesConsumed <= options.retries : true\n  ) {\n    attemptNumber++;\n\n    try {\n      options.signal?.throwIfAborted();\n\n      const result = await input(attemptNumber);\n\n      options.signal?.throwIfAborted();\n\n      return result;\n    } catch (error) {\n      if (\n        await onAttemptFailure({\n          error,\n          attemptNumber,\n          retriesConsumed,\n          startTime,\n          options,\n        })\n      ) {\n        retriesConsumed++;\n      }\n    }\n  }\n\n  // Should not reach here, but in case it does, throw an error\n  throw new Error(\"Retry attempts exhausted without throwing an error.\");\n}\n\nexport function makeRetriable(function_, options) {\n  return function (...arguments_) {\n    return pRetry(() => function_.apply(this, arguments_), options);\n  };\n}\n"],"mappings":";;AAGA,SAAS,gBAAgB,SAAS;AAChC,KAAI,OAAO,YAAY,UAAU;AAC/B,MAAI,UAAU,EACZ,OAAM,IAAI,UAAU,kDAAkD;AAGxE,MAAI,OAAO,MAAM,QAAQ,CACvB,OAAM,IAAI,UACR,gEACD;YAEM,YAAY,KAAA,EACrB,OAAM,IAAI,UAAU,iDAAiD;;AAIzE,SAAS,qBACP,MACA,OACA,EAAE,MAAM,GAAG,gBAAgB,UAAU,EAAE,EACvC;AACA,KAAI,UAAU,KAAA,EACZ;AAGF,KAAI,OAAO,UAAU,YAAY,OAAO,MAAM,MAAM,CAClD,OAAM,IAAI,UACR,cAAc,KAAK,mBACjB,gBAAgB,iBAAiB,GAClC,GACF;AAGH,KAAI,CAAC,iBAAiB,CAAC,OAAO,SAAS,MAAM,CAC3C,OAAM,IAAI,UAAU,cAAc,KAAK,2BAA2B;AAGpE,KAAI,QAAQ,IACV,OAAM,IAAI,UAAU,cAAc,KAAK,kBAAkB,IAAI,GAAG;;AAIpE,IAAa,aAAb,cAAgC,MAAM;CACpC,YAAY,SAAS;AACnB,SAAO;AAEP,MAAI,mBAAmB,OAAO;AAC5B,QAAK,gBAAgB;AACrB,IAAC,CAAE,WAAY;SACV;AACL,QAAK,gBAAgB,IAAI,MAAM,QAAQ;AACvC,QAAK,cAAc,QAAQ,KAAK;;AAGlC,OAAK,OAAO;AACZ,OAAK,UAAU;;;AAInB,SAAS,eAAe,iBAAiB,SAAS;CAChD,MAAM,UAAU,KAAK,IAAI,GAAG,kBAAkB,EAAE;CAChD,MAAM,SAAS,QAAQ,YAAY,KAAK,QAAQ,GAAG,IAAI;CAEvD,IAAI,UAAU,KAAK,MACjB,SAAS,QAAQ,aAAa,QAAQ,WAAW,UAAU,GAC5D;AACD,WAAU,KAAK,IAAI,SAAS,QAAQ,WAAW;AAE/C,QAAO;;AAGT,SAAS,uBAAuB,OAAO,KAAK;AAC1C,KAAI,CAAC,OAAO,SAAS,IAAI,CACvB,QAAO;AAGT,QAAO,OAAO,YAAY,KAAK,GAAG;;AAGpC,eAAe,iBAAiB,EAC9B,OACA,eACA,iBACA,WACA,WACC;CACD,MAAM,kBACJ,iBAAiB,QACb,wBACA,IAAI,UACF,0BAA0B,MAAM,kCACjC;AAEP,KAAI,2BAA2B,WAC7B,OAAM,gBAAgB;CAGxB,MAAM,cAAc,OAAO,SAAS,QAAQ,QAAQ,GAChD,KAAK,IAAI,GAAG,QAAQ,UAAU,gBAAgB,GAC9C,QAAQ;CAEZ,MAAM,eAAe,QAAQ,gBAAgB,OAAO;CAEpD,MAAM,UAAU,OAAO,OAAO;EAC5B,OAAO;EACP;EACA;EACA;EACD,CAAC;AAEF,OAAM,QAAQ,gBAAgB,QAAQ;AAEtC,KAAI,uBAAuB,WAAW,aAAa,IAAI,EACrD,OAAM;CAGR,MAAM,eAAe,MAAM,QAAQ,mBAAmB,QAAQ;CAE9D,MAAM,gBAAgB,uBAAuB,WAAW,aAAa;AAErE,KAAI,iBAAiB,KAAK,eAAe,EACvC,OAAM;AAGR,KACE,2BAA2B,aAC3B,CAAC,eAAe,gBAAgB,EAChC;AACA,MAAI,aACF,OAAM;AAGR,UAAQ,QAAQ,gBAAgB;AAChC,SAAO;;AAGT,KAAI,CAAE,MAAM,QAAQ,YAAY,QAAQ,CACtC,OAAM;AAGR,KAAI,CAAC,cAAc;AACjB,UAAQ,QAAQ,gBAAgB;AAChC,SAAO;;CAGT,IAAI,YAAY,eAAe,iBAAiB,QAAQ;CACxD,MAAM,eACJ,OAAO,gBAAgB,iBAAiB,YACxC,gBAAgB,gBAAgB,IAC5B,gBAAgB,eAChB,KAAA;AAEN,KAAI,iBAAiB,KAAA,EACnB,aAAY,KAAK,IAAI,WAAW,aAAa;CAG/C,MAAM,aAAa,KAAK,IAAI,WAAW,cAAc;AAErD,KAAI,aAAa,EACf,OAAM,IAAI,SAAS,SAAS,WAAW;EACrC,MAAM,gBAAgB;AACpB,gBAAa,aAAa;AAC1B,WAAQ,QAAQ,oBAAoB,SAAS,QAAQ;AACrD,UAAO,QAAQ,OAAO,OAAO;;EAG/B,MAAM,eAAe,iBAAiB;AACpC,WAAQ,QAAQ,oBAAoB,SAAS,QAAQ;AACrD,YAAS;KACR,WAAW;AAEd,MAAI,QAAQ,MACV,cAAa,SAAS;AAGxB,UAAQ,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,MAAM,CAAC;GAClE;AAGJ,SAAQ,QAAQ,gBAAgB;AAEhC,QAAO;;AAGT,eAA8B,OAAO,OAAO,UAAU,EAAE,EAAE;AACxD,WAAU,EAAE,GAAG,SAAS;AAExB,iBAAgB,QAAQ,QAAQ;AAEhC,KAAI,OAAO,OAAO,SAAS,UAAU,CACnC,OAAM,IAAI,MACR,4GACD;AAGH,SAAQ,YAAY;AACpB,SAAQ,WAAW;AACnB,SAAQ,eAAe;AACvB,SAAQ,eAAe,OAAO;AAC9B,SAAQ,iBAAiB,OAAO;AAChC,SAAQ,cAAc;AACtB,SAAQ,0BAA0B;AAClC,SAAQ,sBAAsB;AAC9B,SAAQ,6BAA6B;AAGrC,sBAAqB,UAAU,QAAQ,QAAQ;EAC7C,KAAK;EACL,eAAe;EAChB,CAAC;AACF,sBAAqB,cAAc,QAAQ,YAAY;EACrD,KAAK;EACL,eAAe;EAChB,CAAC;AACF,sBAAqB,cAAc,QAAQ,YAAY;EACrD,KAAK;EACL,eAAe;EAChB,CAAC;AACF,sBAAqB,gBAAgB,QAAQ,cAAc;EACzD,KAAK;EACL,eAAe;EAChB,CAAC;AAGF,KAAI,EAAE,QAAQ,SAAS,GACrB,SAAQ,SAAS;AAGnB,SAAQ,QAAQ,gBAAgB;CAEhC,IAAI,gBAAgB;CACpB,IAAI,kBAAkB;CACtB,MAAM,YAAY,YAAY,KAAK;AAEnC,QACE,OAAO,SAAS,QAAQ,QAAQ,GAAG,mBAAmB,QAAQ,UAAU,MACxE;AACA;AAEA,MAAI;AACF,WAAQ,QAAQ,gBAAgB;GAEhC,MAAM,SAAS,MAAM,MAAM,cAAc;AAEzC,WAAQ,QAAQ,gBAAgB;AAEhC,UAAO;WACA,OAAO;AACd,OACE,MAAM,iBAAiB;IACrB;IACA;IACA;IACA;IACA;IACD,CAAC,CAEF;;;AAMN,OAAM,IAAI,MAAM,sDAAsD"}
+{"version":3,"file":"index.js","names":[],"sources":["../../../src/utils/p-retry/index.js"],"sourcesContent":["/* oxlint-disable */\nimport isNetworkError from \"../is-network-error/index.js\";\n\nfunction validateRetries(retries) {\n  if (typeof retries === \"number\") {\n    if (retries < 0) {\n      throw new TypeError(\"Expected `retries` to be a non-negative number.\");\n    }\n\n    if (Number.isNaN(retries)) {\n      throw new TypeError(\n        \"Expected `retries` to be a valid number or Infinity, got NaN.\"\n      );\n    }\n  } else if (retries !== undefined) {\n    throw new TypeError(\"Expected `retries` to be a number or Infinity.\");\n  }\n}\n\nfunction validateNumberOption(\n  name,\n  value,\n  { min = 0, allowInfinity = false } = {}\n) {\n  if (value === undefined) {\n    return;\n  }\n\n  if (typeof value !== \"number\" || Number.isNaN(value)) {\n    throw new TypeError(\n      `Expected \\`${name}\\` to be a number${\n        allowInfinity ? \" or Infinity\" : \"\"\n      }.`\n    );\n  }\n\n  if (!allowInfinity && !Number.isFinite(value)) {\n    throw new TypeError(`Expected \\`${name}\\` to be a finite number.`);\n  }\n\n  if (value < min) {\n    throw new TypeError(`Expected \\`${name}\\` to be \\u2265 ${min}.`);\n  }\n}\n\nexport class AbortError extends Error {\n  constructor(message) {\n    super();\n\n    if (message instanceof Error) {\n      this.originalError = message;\n      ({ message } = message);\n    } else {\n      this.originalError = new Error(message);\n      this.originalError.stack = this.stack;\n    }\n\n    this.name = \"AbortError\";\n    this.message = message;\n  }\n}\n\nfunction calculateDelay(retriesConsumed, options) {\n  const attempt = Math.max(1, retriesConsumed + 1);\n  const random = options.randomize ? Math.random() + 1 : 1;\n\n  let timeout = Math.round(\n    random * options.minTimeout * options.factor ** (attempt - 1)\n  );\n  timeout = Math.min(timeout, options.maxTimeout);\n\n  return timeout;\n}\n\nfunction calculateRemainingTime(start, max) {\n  if (!Number.isFinite(max)) {\n    return max;\n  }\n\n  return max - (performance.now() - start);\n}\n\nasync function onAttemptFailure({\n  error,\n  attemptNumber,\n  retriesConsumed,\n  startTime,\n  options,\n}) {\n  const normalizedError =\n    error instanceof Error\n      ? error\n      : new TypeError(\n          `Non-error was thrown: \"${error}\". You should only throw errors.`\n        );\n\n  if (normalizedError instanceof AbortError) {\n    throw normalizedError.originalError;\n  }\n\n  const retriesLeft = Number.isFinite(options.retries)\n    ? Math.max(0, options.retries - retriesConsumed)\n    : options.retries;\n\n  const maxRetryTime = options.maxRetryTime ?? Number.POSITIVE_INFINITY;\n\n  const context = Object.freeze({\n    error: normalizedError,\n    attemptNumber,\n    retriesLeft,\n    retriesConsumed,\n  });\n\n  await options.onFailedAttempt(context);\n\n  if (calculateRemainingTime(startTime, maxRetryTime) <= 0) {\n    throw normalizedError;\n  }\n\n  const consumeRetry = await options.shouldConsumeRetry(context);\n\n  const remainingTime = calculateRemainingTime(startTime, maxRetryTime);\n\n  if (remainingTime <= 0 || retriesLeft <= 0) {\n    throw normalizedError;\n  }\n\n  if (\n    normalizedError instanceof TypeError &&\n    !isNetworkError(normalizedError)\n  ) {\n    if (consumeRetry) {\n      throw normalizedError;\n    }\n\n    options.signal?.throwIfAborted();\n    return false;\n  }\n\n  if (!(await options.shouldRetry(context))) {\n    throw normalizedError;\n  }\n\n  if (!consumeRetry) {\n    options.signal?.throwIfAborted();\n    return false;\n  }\n\n  let delayTime = calculateDelay(retriesConsumed, options);\n  const retryAfterMs =\n    typeof normalizedError.retryAfterMs === \"number\" &&\n    normalizedError.retryAfterMs >= 0\n      ? normalizedError.retryAfterMs\n      : undefined;\n\n  if (retryAfterMs !== undefined) {\n    delayTime = Math.max(delayTime, retryAfterMs);\n  }\n\n  const finalDelay = Math.min(delayTime, remainingTime);\n\n  if (finalDelay > 0) {\n    await new Promise((resolve, reject) => {\n      const onAbort = () => {\n        clearTimeout(timeoutToken);\n        options.signal?.removeEventListener(\"abort\", onAbort);\n        reject(options.signal.reason);\n      };\n\n      const timeoutToken = setTimeout(() => {\n        options.signal?.removeEventListener(\"abort\", onAbort);\n        resolve();\n      }, finalDelay);\n\n      if (options.unref) {\n        timeoutToken.unref?.();\n      }\n\n      options.signal?.addEventListener(\"abort\", onAbort, { once: true });\n    });\n  }\n\n  options.signal?.throwIfAborted();\n\n  return true;\n}\n\nexport default async function pRetry(input, options = {}) {\n  options = { ...options };\n\n  validateRetries(options.retries);\n\n  if (Object.hasOwn(options, \"forever\")) {\n    throw new Error(\n      \"The `forever` option is no longer supported. For many use-cases, you can set `retries: Infinity` instead.\"\n    );\n  }\n\n  options.retries ??= 10;\n  options.factor ??= 2;\n  options.minTimeout ??= 1000;\n  options.maxTimeout ??= Number.POSITIVE_INFINITY;\n  options.maxRetryTime ??= Number.POSITIVE_INFINITY;\n  options.randomize ??= false;\n  options.onFailedAttempt ??= () => {};\n  options.shouldRetry ??= () => true;\n  options.shouldConsumeRetry ??= () => true;\n\n  // Validate numeric options and normalize edge cases\n  validateNumberOption(\"factor\", options.factor, {\n    min: 0,\n    allowInfinity: false,\n  });\n  validateNumberOption(\"minTimeout\", options.minTimeout, {\n    min: 0,\n    allowInfinity: false,\n  });\n  validateNumberOption(\"maxTimeout\", options.maxTimeout, {\n    min: 0,\n    allowInfinity: true,\n  });\n  validateNumberOption(\"maxRetryTime\", options.maxRetryTime, {\n    min: 0,\n    allowInfinity: true,\n  });\n\n  // Treat non-positive factor as 1 to avoid zero backoff or negative behavior\n  if (!(options.factor > 0)) {\n    options.factor = 1;\n  }\n\n  options.signal?.throwIfAborted();\n\n  let attemptNumber = 0;\n  let retriesConsumed = 0;\n  const startTime = performance.now();\n\n  while (\n    Number.isFinite(options.retries) ? retriesConsumed <= options.retries : true\n  ) {\n    attemptNumber++;\n\n    try {\n      options.signal?.throwIfAborted();\n\n      const result = await input(attemptNumber);\n\n      options.signal?.throwIfAborted();\n\n      return result;\n    } catch (error) {\n      if (\n        await onAttemptFailure({\n          error,\n          attemptNumber,\n          retriesConsumed,\n          startTime,\n          options,\n        })\n      ) {\n        retriesConsumed++;\n      }\n    }\n  }\n\n  // Should not reach here, but in case it does, throw an error\n  throw new Error(\"Retry attempts exhausted without throwing an error.\");\n}\n\nexport function makeRetriable(function_, options) {\n  return function (...arguments_) {\n    return pRetry(() => function_.apply(this, arguments_), options);\n  };\n}\n"],"mappings":";;AAGA,SAAS,gBAAgB,SAAS;CAChC,IAAI,OAAO,YAAY,UAAU;EAC/B,IAAI,UAAU,GACZ,MAAM,IAAI,UAAU,iDAAiD;EAGvE,IAAI,OAAO,MAAM,OAAO,GACtB,MAAM,IAAI,UACR,+DACF;CAEJ,OAAO,IAAI,YAAY,KAAA,GACrB,MAAM,IAAI,UAAU,gDAAgD;AAExE;AAEA,SAAS,qBACP,MACA,OACA,EAAE,MAAM,GAAG,gBAAgB,UAAU,CAAC,GACtC;CACA,IAAI,UAAU,KAAA,GACZ;CAGF,IAAI,OAAO,UAAU,YAAY,OAAO,MAAM,KAAK,GACjD,MAAM,IAAI,UACR,cAAc,KAAK,mBACjB,gBAAgB,iBAAiB,GAClC,EACH;CAGF,IAAI,CAAC,iBAAiB,CAAC,OAAO,SAAS,KAAK,GAC1C,MAAM,IAAI,UAAU,cAAc,KAAK,0BAA0B;CAGnE,IAAI,QAAQ,KACV,MAAM,IAAI,UAAU,cAAc,KAAK,kBAAkB,IAAI,EAAE;AAEnE;AAEA,IAAa,aAAb,cAAgC,MAAM;CACpC,YAAY,SAAS;EACnB,MAAM;EAEN,IAAI,mBAAmB,OAAO;GAC5B,KAAK,gBAAgB;GACrB,CAAC,CAAE,WAAY;EACjB,OAAO;GACL,KAAK,gBAAgB,IAAI,MAAM,OAAO;GACtC,KAAK,cAAc,QAAQ,KAAK;EAClC;EAEA,KAAK,OAAO;EACZ,KAAK,UAAU;CACjB;AACF;AAEA,SAAS,eAAe,iBAAiB,SAAS;CAChD,MAAM,UAAU,KAAK,IAAI,GAAG,kBAAkB,CAAC;CAC/C,MAAM,SAAS,QAAQ,YAAY,KAAK,OAAO,IAAI,IAAI;CAEvD,IAAI,UAAU,KAAK,MACjB,SAAS,QAAQ,aAAa,QAAQ,WAAW,UAAU,EAC7D;CACA,UAAU,KAAK,IAAI,SAAS,QAAQ,UAAU;CAE9C,OAAO;AACT;AAEA,SAAS,uBAAuB,OAAO,KAAK;CAC1C,IAAI,CAAC,OAAO,SAAS,GAAG,GACtB,OAAO;CAGT,OAAO,OAAO,YAAY,IAAI,IAAI;AACpC;AAEA,eAAe,iBAAiB,EAC9B,OACA,eACA,iBACA,WACA,WACC;CACD,MAAM,kBACJ,iBAAiB,QACb,wBACA,IAAI,UACF,0BAA0B,MAAM,iCAClC;CAEN,IAAI,2BAA2B,YAC7B,MAAM,gBAAgB;CAGxB,MAAM,cAAc,OAAO,SAAS,QAAQ,OAAO,IAC/C,KAAK,IAAI,GAAG,QAAQ,UAAU,eAAe,IAC7C,QAAQ;CAEZ,MAAM,eAAe,QAAQ,gBAAgB,OAAO;CAEpD,MAAM,UAAU,OAAO,OAAO;EAC5B,OAAO;EACP;EACA;EACA;CACF,CAAC;CAED,MAAM,QAAQ,gBAAgB,OAAO;CAErC,IAAI,uBAAuB,WAAW,YAAY,KAAK,GACrD,MAAM;CAGR,MAAM,eAAe,MAAM,QAAQ,mBAAmB,OAAO;CAE7D,MAAM,gBAAgB,uBAAuB,WAAW,YAAY;CAEpE,IAAI,iBAAiB,KAAK,eAAe,GACvC,MAAM;CAGR,IACE,2BAA2B,aAC3B,CAAC,eAAe,eAAe,GAC/B;EACA,IAAI,cACF,MAAM;EAGR,QAAQ,QAAQ,eAAe;EAC/B,OAAO;CACT;CAEA,IAAI,CAAE,MAAM,QAAQ,YAAY,OAAO,GACrC,MAAM;CAGR,IAAI,CAAC,cAAc;EACjB,QAAQ,QAAQ,eAAe;EAC/B,OAAO;CACT;CAEA,IAAI,YAAY,eAAe,iBAAiB,OAAO;CACvD,MAAM,eACJ,OAAO,gBAAgB,iBAAiB,YACxC,gBAAgB,gBAAgB,IAC5B,gBAAgB,eAChB,KAAA;CAEN,IAAI,iBAAiB,KAAA,GACnB,YAAY,KAAK,IAAI,WAAW,YAAY;CAG9C,MAAM,aAAa,KAAK,IAAI,WAAW,aAAa;CAEpD,IAAI,aAAa,GACf,MAAM,IAAI,SAAS,SAAS,WAAW;EACrC,MAAM,gBAAgB;GACpB,aAAa,YAAY;GACzB,QAAQ,QAAQ,oBAAoB,SAAS,OAAO;GACpD,OAAO,QAAQ,OAAO,MAAM;EAC9B;EAEA,MAAM,eAAe,iBAAiB;GACpC,QAAQ,QAAQ,oBAAoB,SAAS,OAAO;GACpD,QAAQ;EACV,GAAG,UAAU;EAEb,IAAI,QAAQ,OACV,aAAa,QAAQ;EAGvB,QAAQ,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;CACnE,CAAC;CAGH,QAAQ,QAAQ,eAAe;CAE/B,OAAO;AACT;AAEA,eAA8B,OAAO,OAAO,UAAU,CAAC,GAAG;CACxD,UAAU,EAAE,GAAG,QAAQ;CAEvB,gBAAgB,QAAQ,OAAO;CAE/B,IAAI,OAAO,OAAO,SAAS,SAAS,GAClC,MAAM,IAAI,MACR,2GACF;CAGF,QAAQ,YAAY;CACpB,QAAQ,WAAW;CACnB,QAAQ,eAAe;CACvB,QAAQ,eAAe,OAAO;CAC9B,QAAQ,iBAAiB,OAAO;CAChC,QAAQ,cAAc;CACtB,QAAQ,0BAA0B,CAAC;CACnC,QAAQ,sBAAsB;CAC9B,QAAQ,6BAA6B;CAGrC,qBAAqB,UAAU,QAAQ,QAAQ;EAC7C,KAAK;EACL,eAAe;CACjB,CAAC;CACD,qBAAqB,cAAc,QAAQ,YAAY;EACrD,KAAK;EACL,eAAe;CACjB,CAAC;CACD,qBAAqB,cAAc,QAAQ,YAAY;EACrD,KAAK;EACL,eAAe;CACjB,CAAC;CACD,qBAAqB,gBAAgB,QAAQ,cAAc;EACzD,KAAK;EACL,eAAe;CACjB,CAAC;CAGD,IAAI,EAAE,QAAQ,SAAS,IACrB,QAAQ,SAAS;CAGnB,QAAQ,QAAQ,eAAe;CAE/B,IAAI,gBAAgB;CACpB,IAAI,kBAAkB;CACtB,MAAM,YAAY,YAAY,IAAI;CAElC,OACE,OAAO,SAAS,QAAQ,OAAO,IAAI,mBAAmB,QAAQ,UAAU,MACxE;EACA;EAEA,IAAI;GACF,QAAQ,QAAQ,eAAe;GAE/B,MAAM,SAAS,MAAM,MAAM,aAAa;GAExC,QAAQ,QAAQ,eAAe;GAE/B,OAAO;EACT,SAAS,OAAO;GACd,IACE,MAAM,iBAAiB;IACrB;IACA;IACA;IACA;IACA;GACF,CAAC,GAED;EAEJ;CACF;CAGA,MAAM,IAAI,MAAM,qDAAqD;AACvE"}