@langchain/core 1.1.32 → 1.1.33-dev-1773709997654

package/dist/utils/math.cjs

@@ -1,9 +1,8 @@
-Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-const require_runtime = require('../_virtual/_rolldown/runtime.cjs');
-const require_similarities = require('./ml-distance/similarities.cjs');
-const require_distances = require('./ml-distance/distances.cjs');
-const require_euclidean = require('./ml-distance-euclidean/euclidean.cjs');
-
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_runtime = require("../_virtual/_rolldown/runtime.cjs");
+const require_similarities = require("./ml-distance/similarities.cjs");
+const require_distances = require("./ml-distance/distances.cjs");
+const require_euclidean = require("./ml-distance-euclidean/euclidean.cjs");
 //#region src/utils/math.ts
 var math_exports = /* @__PURE__ */ require_runtime.__exportAll({
 	cosineSimilarity: () => cosineSimilarity,
@@ -112,18 +111,18 @@ function argMax(array) {
 function matrixMaxVal(arrays) {
 	return arrays.reduce((acc, array) => Math.max(acc, argMax(array).maxValue), 0);
 }
-
 //#endregion
 exports.cosineSimilarity = cosineSimilarity;
 exports.euclideanDistance = euclideanDistance;
 exports.innerProduct = innerProduct;
-Object.defineProperty(exports, 'math_exports', {
-  enumerable: true,
-  get: function () {
-    return math_exports;
-  }
+Object.defineProperty(exports, "math_exports", {
+	enumerable: true,
+	get: function() {
+		return math_exports;
+	}
 });
 exports.matrixFunc = matrixFunc;
 exports.maximalMarginalRelevance = maximalMarginalRelevance;
 exports.normalize = normalize;
+
 //# sourceMappingURL=math.cjs.map

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,4BAAO;;AAGjC,SAAgB,aAAa,GAAe,GAA2B;AACrE,QAAO,WAAW,GAAG,GAAGC,+BAAqB;;AAG/C,SAAgB,kBAAkB,GAAe,GAA2B;AAC1E,QAAO,WAAW,GAAG,GAAGC,4BAAU;;;;;;;;;;;;;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;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"}

package/dist/utils/math.js

@@ -2,7 +2,6 @@ import { __exportAll } from "../_virtual/_rolldown/runtime.js";
 import { cosine } from "./ml-distance/similarities.js";
 import { innerProduct as innerProduct$1 } from "./ml-distance/distances.js";
 import { euclidean } from "./ml-distance-euclidean/euclidean.js";
-
 //#region src/utils/math.ts
 var math_exports = /* @__PURE__ */ __exportAll({
 	cosineSimilarity: () => cosineSimilarity,
@@ -111,7 +110,7 @@ function argMax(array) {
 function matrixMaxVal(arrays) {
 	return arrays.reduce((acc, array) => Math.max(acc, argMax(array).maxValue), 0);
 }
-
 //#endregion
 export { cosineSimilarity, euclideanDistance, innerProduct, math_exports, matrixFunc, maximalMarginalRelevance, normalize };
+
 //# sourceMappingURL=math.js.map

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;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"}

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

@@ -1,4 +1,3 @@
-
 //#region src/utils/ml-distance/distances.ts
 /**
 *Returns the Inner Product similarity between vectors a and b
@@ -12,7 +11,7 @@ function innerProduct(a, b) {
 	for (let i = 0; i < a.length; i++) ans += a[i] * b[i];
 	return ans;
 }
-
 //#endregion
 exports.innerProduct = innerProduct;
+
 //# sourceMappingURL=distances.cjs.map

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;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC5B,QAAO,EAAE,KAAK,EAAE;AAElB,QAAO"}

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

@@ -11,7 +11,7 @@ function innerProduct(a, b) {
 	for (let i = 0; i < a.length; i++) ans += a[i] * b[i];
 	return ans;
 }
-
 //#endregion
 export { innerProduct };
+
 //# sourceMappingURL=distances.js.map

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

@@ -1,4 +1,3 @@
-
 //#region src/utils/ml-distance/similarities.ts
 /**
 * Returns the average of cosine distances between vectors a and b
@@ -17,7 +16,7 @@ function cosine(a, b) {
 	}
 	return p / (Math.sqrt(p2) * Math.sqrt(q2));
 }
-
 //#endregion
 exports.cosine = cosine;
+
 //# sourceMappingURL=similarities.cjs.map

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;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"}

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

@@ -16,7 +16,7 @@ function cosine(a, b) {
 	}
 	return p / (Math.sqrt(p2) * Math.sqrt(q2));
 }
-
 //#endregion
 export { cosine };
+
 //# sourceMappingURL=similarities.js.map

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

@@ -1,4 +1,3 @@
-
 //#region src/utils/ml-distance-euclidean/euclidean.ts
 function squaredEuclidean(p, q) {
 	let d = 0;
@@ -8,7 +7,7 @@ function squaredEuclidean(p, q) {
 function euclidean(p, q) {
 	return Math.sqrt(squaredEuclidean(p, q));
 }
-
 //#endregion
 exports.euclidean = euclidean;
+
 //# 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;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"}

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

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

package/dist/utils/namespace.cjs

@@ -1,4 +1,3 @@
-
 //#region src/utils/namespace.ts
 /**
 * Create a symbol-based namespace for hierarchical `isInstance` checking.
@@ -57,7 +56,7 @@ function createNamespace(path) {
 }
 /** Base namespace used throughout LangChain */
 const ns = createNamespace("langchain");
-
 //#endregion
 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":["/* eslint-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":["/* eslint-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"}

package/dist/utils/namespace.js

@@ -56,7 +56,7 @@ function createNamespace(path) {
 }
 /** Base namespace used throughout LangChain */
 const ns = createNamespace("langchain");
-
 //#endregion
 export { ns };
+
 //# sourceMappingURL=namespace.js.map

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

@@ -1,5 +1,4 @@
-const require_index = require('../is-network-error/index.cjs');
-
+const require_index = require("../is-network-error/index.cjs");
 //#region src/utils/p-retry/index.js
 function validateRetries(retries) {
 	if (typeof retries === "number") {
@@ -135,7 +134,7 @@ async function pRetry(input, options = {}) {
 	}
 	throw new Error("Retry attempts exhausted without throwing an error.");
 }
-
 //#endregion
 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":["/* eslint-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  const delayTime = calculateDelay(retriesConsumed, options);\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,OACrB,OAAM,IAAI,UAAU,iDAAiD;;AAIzE,SAAS,qBACP,MACA,OACA,EAAE,MAAM,GAAG,gBAAgB,UAAU,EAAE,EACvC;AACA,KAAI,UAAU,OACZ;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,sBAAe,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,MAAM,YAAY,eAAe,iBAAiB,QAAQ;CAC1D,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":["/* eslint-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  const delayTime = calculateDelay(retriesConsumed, options);\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,MAAM,YAAY,eAAe,iBAAiB,QAAQ;CAC1D,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"}

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

@@ -1,5 +1,4 @@
 import isNetworkError from "../is-network-error/index.js";
-
 //#region src/utils/p-retry/index.js
 function validateRetries(retries) {
 	if (typeof retries === "number") {
@@ -135,7 +134,7 @@ async function pRetry(input, options = {}) {
 	}
 	throw new Error("Retry attempts exhausted without throwing an error.");
 }
-
 //#endregion
 export { 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":["/* eslint-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  const delayTime = calculateDelay(retriesConsumed, options);\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,OACrB,OAAM,IAAI,UAAU,iDAAiD;;AAIzE,SAAS,qBACP,MACA,OACA,EAAE,MAAM,GAAG,gBAAgB,UAAU,EAAE,EACvC;AACA,KAAI,UAAU,OACZ;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,MAAM,YAAY,eAAe,iBAAiB,QAAQ;CAC1D,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":["/* eslint-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  const delayTime = calculateDelay(retriesConsumed, options);\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,MAAM,YAAY,eAAe,iBAAiB,QAAQ;CAC1D,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"}

package/dist/utils/sax-js/sax.cjs

@@ -1,4 +1,3 @@
-
 //#region src/utils/sax-js/sax.ts
 const initializeSax = function() {
 	const sax = {};
@@ -1196,7 +1195,7 @@ const initializeSax = function() {
 	return sax;
 };
 const sax = initializeSax();
-
 //#endregion
 exports.sax = sax;
+
 //# sourceMappingURL=sax.cjs.map