beeai-framework 0.1.2

package/dist/internals/helpers/guards.d.cts

@@ -0,0 +1,19 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+type Primitive = string | number | symbol | bigint | boolean | null | undefined;
+declare function isPrimitive(value: unknown): value is Primitive;
+
+export { type Primitive, isPrimitive };

package/dist/internals/helpers/guards.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+type Primitive = string | number | symbol | bigint | boolean | null | undefined;
+declare function isPrimitive(value: unknown): value is Primitive;
+
+export { type Primitive, isPrimitive };

package/dist/internals/helpers/guards.js

@@ -0,0 +1,12 @@
+import * as R from 'remeda';
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function isPrimitive(value) {
+  return R.isString(value) || R.isNumber(value) || R.isBoolean(value) || R.isNullish(value) || R.isSymbol(value);
+}
+__name(isPrimitive, "isPrimitive");
+
+export { isPrimitive };
+//# sourceMappingURL=guards.js.map
+//# sourceMappingURL=guards.js.map

package/dist/internals/helpers/guards.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/guards.ts"],"names":["isPrimitive","value","R","isString","isNumber","isBoolean","isNullish","isSymbol"],"mappings":";;;;AAmBO,SAASA,YAAYC,KAAc,EAAA;AACxC,EAAA,OACEC,EAAEC,QAASF,CAAAA,KAAAA,KACXC,CAAEE,CAAAA,QAAAA,CAASH,KAAAA,CACXC,IAAAA,CAAAA,CAAEG,SAAUJ,CAAAA,KAAAA,KACZC,CAAEI,CAAAA,SAAAA,CAAUL,KAAAA,CACZC,IAAAA,CAAAA,CAAEK,SAASN,KAAAA,CAAAA;AAEf;AARgBD,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA","file":"guards.js","sourcesContent":["/**\n * Copyright 2025 IBM Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport * as R from \"remeda\";\n\nexport type Primitive = string | number | symbol | bigint | boolean | null | undefined;\nexport function isPrimitive(value: unknown): value is Primitive {\n  return (\n    R.isString(value) ||\n    R.isNumber(value) ||\n    R.isBoolean(value) ||\n    R.isNullish(value) ||\n    R.isSymbol(value)\n  );\n}\n"]}

package/dist/internals/helpers/hash.cjs

@@ -0,0 +1,21 @@
+'use strict';
+
+var node_crypto = require('node:crypto');
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function createHash(input, length = 4) {
+  return node_crypto.createHash("shake256", {
+    outputLength: length
+  }).update(input).digest("hex");
+}
+__name(createHash, "createHash");
+function createRandomHash(length = 4) {
+  return createHash(node_crypto.randomBytes(20).toString("base64"), length);
+}
+__name(createRandomHash, "createRandomHash");
+
+exports.createHash = createHash;
+exports.createRandomHash = createRandomHash;
+//# sourceMappingURL=hash.cjs.map
+//# sourceMappingURL=hash.cjs.map

package/dist/internals/helpers/hash.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/hash.ts"],"names":["createHash","input","length","_createHash","outputLength","update","digest","createRandomHash","randomBytes","toString"],"mappings":";;;;;;AAkBO,SAASA,UAAAA,CAAWC,KAAeC,EAAAA,MAAAA,GAAS,CAAC,EAAA;AAClD,EAAA,OAAOC,uBAAY,UAAY,EAAA;IAC7BC,YAAcF,EAAAA;AAChB,GAAA,CACGG,CAAAA,MAAAA,CAAOJ,KAAAA,CAAAA,CACPK,OAAO,KAAA,CAAA;AACZ;AANgBN,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAQT,SAASO,gBAAAA,CAAiBL,SAAS,CAAC,EAAA;AACzC,EAAA,OAAOF,WAAWQ,uBAAY,CAAA,EAAA,EAAIC,QAAS,CAAA,QAAA,GAAWP,MAAAA,CAAAA;AACxD;AAFgBK,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA","file":"hash.cjs","sourcesContent":["/**\n * Copyright 2025 IBM Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { createHash as _createHash, randomBytes } from \"node:crypto\";\n\nexport function createHash(input: string, length = 4) {\n  return _createHash(\"shake256\", {\n    outputLength: length,\n  })\n    .update(input)\n    .digest(\"hex\");\n}\n\nexport function createRandomHash(length = 4) {\n  return createHash(randomBytes(20).toString(\"base64\"), length);\n}\n"]}

package/dist/internals/helpers/hash.d.cts

@@ -0,0 +1,19 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+declare function createHash(input: string, length?: number): string;
+declare function createRandomHash(length?: number): string;
+
+export { createHash, createRandomHash };

package/dist/internals/helpers/hash.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+declare function createHash(input: string, length?: number): string;
+declare function createRandomHash(length?: number): string;
+
+export { createHash, createRandomHash };

package/dist/internals/helpers/hash.js

@@ -0,0 +1,18 @@
+import { createHash as createHash$1, randomBytes } from 'node:crypto';
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function createHash(input, length = 4) {
+  return createHash$1("shake256", {
+    outputLength: length
+  }).update(input).digest("hex");
+}
+__name(createHash, "createHash");
+function createRandomHash(length = 4) {
+  return createHash(randomBytes(20).toString("base64"), length);
+}
+__name(createRandomHash, "createRandomHash");
+
+export { createHash, createRandomHash };
+//# sourceMappingURL=hash.js.map
+//# sourceMappingURL=hash.js.map

package/dist/internals/helpers/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/hash.ts"],"names":["createHash","input","length","_createHash","outputLength","update","digest","createRandomHash","randomBytes","toString"],"mappings":";;;;AAkBO,SAASA,UAAAA,CAAWC,KAAeC,EAAAA,MAAAA,GAAS,CAAC,EAAA;AAClD,EAAA,OAAOC,aAAY,UAAY,EAAA;IAC7BC,YAAcF,EAAAA;AAChB,GAAA,CACGG,CAAAA,MAAAA,CAAOJ,KAAAA,CAAAA,CACPK,OAAO,KAAA,CAAA;AACZ;AANgBN,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAQT,SAASO,gBAAAA,CAAiBL,SAAS,CAAC,EAAA;AACzC,EAAA,OAAOF,WAAWQ,WAAY,CAAA,EAAA,EAAIC,QAAS,CAAA,QAAA,GAAWP,MAAAA,CAAAA;AACxD;AAFgBK,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA","file":"hash.js","sourcesContent":["/**\n * Copyright 2025 IBM Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { createHash as _createHash, randomBytes } from \"node:crypto\";\n\nexport function createHash(input: string, length = 4) {\n  return _createHash(\"shake256\", {\n    outputLength: length,\n  })\n    .update(input)\n    .digest(\"hex\");\n}\n\nexport function createRandomHash(length = 4) {\n  return createHash(randomBytes(20).toString(\"base64\"), length);\n}\n"]}

package/dist/internals/helpers/map.cjs

@@ -0,0 +1,16 @@
+'use strict';
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function findUniqueKey(baseKey, map) {
+  let key = baseKey;
+  for (let i = 1; map.has(key); i++) {
+    key = baseKey.concat(String(i));
+  }
+  return key;
+}
+__name(findUniqueKey, "findUniqueKey");
+
+exports.findUniqueKey = findUniqueKey;
+//# sourceMappingURL=map.cjs.map
+//# sourceMappingURL=map.cjs.map

package/dist/internals/helpers/map.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/map.ts"],"names":["findUniqueKey","baseKey","map","key","i","has","concat","String"],"mappings":";;;;AAgBO,SAASA,aAAAA,CAAcC,SAAiBC,GAAyB,EAAA;AACtE,EAAA,IAAIC,GAAMF,GAAAA,OAAAA;AACV,EAAA,KAAA,IAASG,IAAI,CAAGF,EAAAA,GAAAA,CAAIG,GAAIF,CAAAA,GAAAA,GAAMC,CAAK,EAAA,EAAA;AACjCD,IAAAA,GAAAA,GAAMF,OAAQK,CAAAA,MAAAA,CAAOC,MAAOH,CAAAA,CAAAA,CAAAA,CAAAA;AAC9B;AACA,EAAOD,OAAAA,GAAAA;AACT;AANgBH,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA","file":"map.cjs","sourcesContent":["/**\n * Copyright 2025 IBM Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport function findUniqueKey(baseKey: string, map: Map<string, unknown>) {\n  let key = baseKey;\n  for (let i = 1; map.has(key); i++) {\n    key = baseKey.concat(String(i));\n  }\n  return key;\n}\n"]}

package/dist/internals/helpers/map.d.cts

@@ -0,0 +1,18 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+declare function findUniqueKey(baseKey: string, map: Map<string, unknown>): string;
+
+export { findUniqueKey };

package/dist/internals/helpers/map.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+declare function findUniqueKey(baseKey: string, map: Map<string, unknown>): string;
+
+export { findUniqueKey };

package/dist/internals/helpers/map.js

@@ -0,0 +1,14 @@
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function findUniqueKey(baseKey, map) {
+  let key = baseKey;
+  for (let i = 1; map.has(key); i++) {
+    key = baseKey.concat(String(i));
+  }
+  return key;
+}
+__name(findUniqueKey, "findUniqueKey");
+
+export { findUniqueKey };
+//# sourceMappingURL=map.js.map
+//# sourceMappingURL=map.js.map

package/dist/internals/helpers/map.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/map.ts"],"names":["findUniqueKey","baseKey","map","key","i","has","concat","String"],"mappings":";;AAgBO,SAASA,aAAAA,CAAcC,SAAiBC,GAAyB,EAAA;AACtE,EAAA,IAAIC,GAAMF,GAAAA,OAAAA;AACV,EAAA,KAAA,IAASG,IAAI,CAAGF,EAAAA,GAAAA,CAAIG,GAAIF,CAAAA,GAAAA,GAAMC,CAAK,EAAA,EAAA;AACjCD,IAAAA,GAAAA,GAAMF,OAAQK,CAAAA,MAAAA,CAAOC,MAAOH,CAAAA,CAAAA,CAAAA,CAAAA;AAC9B;AACA,EAAOD,OAAAA,GAAAA;AACT;AANgBH,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA","file":"map.js","sourcesContent":["/**\n * Copyright 2025 IBM Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport function findUniqueKey(baseKey: string, map: Map<string, unknown>) {\n  let key = baseKey;\n  for (let i = 1; map.has(key); i++) {\n    key = baseKey.concat(String(i));\n  }\n  return key;\n}\n"]}

package/dist/internals/helpers/math.cjs

@@ -0,0 +1,31 @@
+'use strict';
+
+var errors_cjs = require('../../errors.cjs');
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function cosineSimilarity(vecA, vecB) {
+  if (vecA.length !== vecB.length) {
+    throw new errors_cjs.ValueError("Vectors must have equal length");
+  }
+  const dot = vecA.reduce((sum, value, index) => sum + value * vecB[index], 0);
+  const magA = Math.sqrt(vecA.reduce((sum, value) => sum + value ** 2, 0));
+  const magB = Math.sqrt(vecB.reduce((sum, value) => sum + value ** 2, 0));
+  if (magA === 0 || magB === 0) {
+    throw new errors_cjs.ValueError("Vectors cannot not have zero magnitude");
+  }
+  return dot / (magA * magB);
+}
+__name(cosineSimilarity, "cosineSimilarity");
+function cosineSimilarityMatrix(matrixA, matrixB) {
+  if ((matrixA[0]?.length ?? 0) !== (matrixA[0]?.length ?? 0)) {
+    throw new errors_cjs.ValueError("Matrices must have the same number of columns.");
+  }
+  return matrixA.map((rowA) => matrixB.map((rowB) => cosineSimilarity(rowA, rowB)));
+}
+__name(cosineSimilarityMatrix, "cosineSimilarityMatrix");
+
+exports.cosineSimilarity = cosineSimilarity;
+exports.cosineSimilarityMatrix = cosineSimilarityMatrix;
+//# sourceMappingURL=math.cjs.map
+//# sourceMappingURL=math.cjs.map

package/dist/internals/helpers/math.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/math.ts"],"names":["cosineSimilarity","vecA","vecB","length","ValueError","dot","reduce","sum","value","index","magA","Math","sqrt","magB","cosineSimilarityMatrix","matrixA","matrixB","map","rowA","rowB"],"mappings":";;;;;;AAkBO,SAASA,gBAAAA,CAAiBC,MAAgBC,IAAc,EAAA;AAC7D,EAAID,IAAAA,IAAAA,CAAKE,MAAWD,KAAAA,IAAAA,CAAKC,MAAQ,EAAA;AAC/B,IAAM,MAAA,IAAIC,sBAAW,gCAAA,CAAA;AACvB;AAEA,EAAA,MAAMC,GAAMJ,GAAAA,IAAAA,CAAKK,MAAO,CAAA,CAACC,GAAKC,EAAAA,KAAAA,EAAOC,KAAUF,KAAAA,GAAAA,GAAMC,KAAQN,GAAAA,IAAAA,CAAKO,KAAAA,CAAAA,EAAQ,CAAA,CAAA;AAC1E,EAAA,MAAMC,IAAOC,GAAAA,IAAAA,CAAKC,IAAKX,CAAAA,IAAAA,CAAKK,MAAO,CAAA,CAACC,GAAKC,EAAAA,KAAAA,KAAUD,GAAMC,GAAAA,KAAAA,IAAS,CAAG,EAAA,CAAA,CAAA,CAAA;AACrE,EAAA,MAAMK,IAAOF,GAAAA,IAAAA,CAAKC,IAAKV,CAAAA,IAAAA,CAAKI,MAAO,CAAA,CAACC,GAAKC,EAAAA,KAAAA,KAAUD,GAAMC,GAAAA,KAAAA,IAAS,CAAG,EAAA,CAAA,CAAA,CAAA;AAErE,EAAIE,IAAAA,IAAAA,KAAS,CAAKG,IAAAA,IAAAA,KAAS,CAAG,EAAA;AAC5B,IAAM,MAAA,IAAIT,sBAAW,wCAAA,CAAA;AACvB;AACA,EAAA,OAAOC,OAAOK,IAAOG,GAAAA,IAAAA,CAAAA;AACvB;AAbgBb,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA;AAeT,SAASc,sBAAAA,CAAuBC,SAAqBC,OAAmB,EAAA;AAC7E,EAAKD,IAAAA,CAAAA,OAAAA,CAAQ,CAAA,CAAIZ,EAAAA,MAAAA,IAAU,QAAQY,OAAQ,CAAA,CAAA,CAAIZ,EAAAA,MAAAA,IAAU,CAAI,CAAA,EAAA;AAC3D,IAAM,MAAA,IAAIC,sBAAW,gDAAA,CAAA;AACvB;AAEA,EAAA,OAAOW,OAAQE,CAAAA,GAAAA,CAAI,CAACC,IAAAA,KAASF,OAAQC,CAAAA,GAAAA,CAAI,CAACE,IAAAA,KAASnB,gBAAiBkB,CAAAA,IAAAA,EAAMC,IAAAA,CAAAA,CAAAA,CAAAA;AAC5E;AANgBL,MAAAA,CAAAA,sBAAAA,EAAAA,wBAAAA,CAAAA","file":"math.cjs","sourcesContent":["/**\n * Copyright 2025 IBM Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ValueError } from \"@/errors.js\";\n\nexport function cosineSimilarity(vecA: number[], vecB: number[]): number {\n  if (vecA.length !== vecB.length) {\n    throw new ValueError(\"Vectors must have equal length\");\n  }\n  // (cos θ) = (A · B) / (|A| * |B|)\n  const dot = vecA.reduce((sum, value, index) => sum + value * vecB[index], 0);\n  const magA = Math.sqrt(vecA.reduce((sum, value) => sum + value ** 2, 0));\n  const magB = Math.sqrt(vecB.reduce((sum, value) => sum + value ** 2, 0));\n\n  if (magA === 0 || magB === 0) {\n    throw new ValueError(\"Vectors cannot not have zero magnitude\");\n  }\n  return dot / (magA * magB);\n}\n\nexport function cosineSimilarityMatrix(matrixA: number[][], matrixB: number[][]): number[][] {\n  if ((matrixA[0]?.length ?? 0) !== (matrixA[0]?.length ?? 0)) {\n    throw new ValueError(\"Matrices must have the same number of columns.\");\n  }\n\n  return matrixA.map((rowA) => matrixB.map((rowB) => cosineSimilarity(rowA, rowB)));\n}\n"]}

package/dist/internals/helpers/math.d.cts

@@ -0,0 +1,19 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+declare function cosineSimilarity(vecA: number[], vecB: number[]): number;
+declare function cosineSimilarityMatrix(matrixA: number[][], matrixB: number[][]): number[][];
+
+export { cosineSimilarity, cosineSimilarityMatrix };

package/dist/internals/helpers/math.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+declare function cosineSimilarity(vecA: number[], vecB: number[]): number;
+declare function cosineSimilarityMatrix(matrixA: number[][], matrixB: number[][]): number[][];
+
+export { cosineSimilarity, cosineSimilarityMatrix };

package/dist/internals/helpers/math.js

@@ -0,0 +1,28 @@
+import { ValueError } from '../../errors.js';
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function cosineSimilarity(vecA, vecB) {
+  if (vecA.length !== vecB.length) {
+    throw new ValueError("Vectors must have equal length");
+  }
+  const dot = vecA.reduce((sum, value, index) => sum + value * vecB[index], 0);
+  const magA = Math.sqrt(vecA.reduce((sum, value) => sum + value ** 2, 0));
+  const magB = Math.sqrt(vecB.reduce((sum, value) => sum + value ** 2, 0));
+  if (magA === 0 || magB === 0) {
+    throw new ValueError("Vectors cannot not have zero magnitude");
+  }
+  return dot / (magA * magB);
+}
+__name(cosineSimilarity, "cosineSimilarity");
+function cosineSimilarityMatrix(matrixA, matrixB) {
+  if ((matrixA[0]?.length ?? 0) !== (matrixA[0]?.length ?? 0)) {
+    throw new ValueError("Matrices must have the same number of columns.");
+  }
+  return matrixA.map((rowA) => matrixB.map((rowB) => cosineSimilarity(rowA, rowB)));
+}
+__name(cosineSimilarityMatrix, "cosineSimilarityMatrix");
+
+export { cosineSimilarity, cosineSimilarityMatrix };
+//# sourceMappingURL=math.js.map
+//# sourceMappingURL=math.js.map

package/dist/internals/helpers/math.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/math.ts"],"names":["cosineSimilarity","vecA","vecB","length","ValueError","dot","reduce","sum","value","index","magA","Math","sqrt","magB","cosineSimilarityMatrix","matrixA","matrixB","map","rowA","rowB"],"mappings":";;;;AAkBO,SAASA,gBAAAA,CAAiBC,MAAgBC,IAAc,EAAA;AAC7D,EAAID,IAAAA,IAAAA,CAAKE,MAAWD,KAAAA,IAAAA,CAAKC,MAAQ,EAAA;AAC/B,IAAM,MAAA,IAAIC,WAAW,gCAAA,CAAA;AACvB;AAEA,EAAA,MAAMC,GAAMJ,GAAAA,IAAAA,CAAKK,MAAO,CAAA,CAACC,GAAKC,EAAAA,KAAAA,EAAOC,KAAUF,KAAAA,GAAAA,GAAMC,KAAQN,GAAAA,IAAAA,CAAKO,KAAAA,CAAAA,EAAQ,CAAA,CAAA;AAC1E,EAAA,MAAMC,IAAOC,GAAAA,IAAAA,CAAKC,IAAKX,CAAAA,IAAAA,CAAKK,MAAO,CAAA,CAACC,GAAKC,EAAAA,KAAAA,KAAUD,GAAMC,GAAAA,KAAAA,IAAS,CAAG,EAAA,CAAA,CAAA,CAAA;AACrE,EAAA,MAAMK,IAAOF,GAAAA,IAAAA,CAAKC,IAAKV,CAAAA,IAAAA,CAAKI,MAAO,CAAA,CAACC,GAAKC,EAAAA,KAAAA,KAAUD,GAAMC,GAAAA,KAAAA,IAAS,CAAG,EAAA,CAAA,CAAA,CAAA;AAErE,EAAIE,IAAAA,IAAAA,KAAS,CAAKG,IAAAA,IAAAA,KAAS,CAAG,EAAA;AAC5B,IAAM,MAAA,IAAIT,WAAW,wCAAA,CAAA;AACvB;AACA,EAAA,OAAOC,OAAOK,IAAOG,GAAAA,IAAAA,CAAAA;AACvB;AAbgBb,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA;AAeT,SAASc,sBAAAA,CAAuBC,SAAqBC,OAAmB,EAAA;AAC7E,EAAKD,IAAAA,CAAAA,OAAAA,CAAQ,CAAA,CAAIZ,EAAAA,MAAAA,IAAU,QAAQY,OAAQ,CAAA,CAAA,CAAIZ,EAAAA,MAAAA,IAAU,CAAI,CAAA,EAAA;AAC3D,IAAM,MAAA,IAAIC,WAAW,gDAAA,CAAA;AACvB;AAEA,EAAA,OAAOW,OAAQE,CAAAA,GAAAA,CAAI,CAACC,IAAAA,KAASF,OAAQC,CAAAA,GAAAA,CAAI,CAACE,IAAAA,KAASnB,gBAAiBkB,CAAAA,IAAAA,EAAMC,IAAAA,CAAAA,CAAAA,CAAAA;AAC5E;AANgBL,MAAAA,CAAAA,sBAAAA,EAAAA,wBAAAA,CAAAA","file":"math.js","sourcesContent":["/**\n * Copyright 2025 IBM Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ValueError } from \"@/errors.js\";\n\nexport function cosineSimilarity(vecA: number[], vecB: number[]): number {\n  if (vecA.length !== vecB.length) {\n    throw new ValueError(\"Vectors must have equal length\");\n  }\n  // (cos θ) = (A · B) / (|A| * |B|)\n  const dot = vecA.reduce((sum, value, index) => sum + value * vecB[index], 0);\n  const magA = Math.sqrt(vecA.reduce((sum, value) => sum + value ** 2, 0));\n  const magB = Math.sqrt(vecB.reduce((sum, value) => sum + value ** 2, 0));\n\n  if (magA === 0 || magB === 0) {\n    throw new ValueError(\"Vectors cannot not have zero magnitude\");\n  }\n  return dot / (magA * magB);\n}\n\nexport function cosineSimilarityMatrix(matrixA: number[][], matrixB: number[][]): number[][] {\n  if ((matrixA[0]?.length ?? 0) !== (matrixA[0]?.length ?? 0)) {\n    throw new ValueError(\"Matrices must have the same number of columns.\");\n  }\n\n  return matrixA.map((rowA) => matrixB.map((rowB) => cosineSimilarity(rowA, rowB)));\n}\n"]}

package/dist/internals/helpers/number.cjs

@@ -0,0 +1,48 @@
+'use strict';
+
+var R = require('remeda');
+
+function _interopNamespace(e) {
+  if (e && e.__esModule) return e;
+  var n = Object.create(null);
+  if (e) {
+    Object.keys(e).forEach(function (k) {
+      if (k !== 'default') {
+        var d = Object.getOwnPropertyDescriptor(e, k);
+        Object.defineProperty(n, k, d.get ? d : {
+          enumerable: true,
+          get: function () { return e[k]; }
+        });
+      }
+    });
+  }
+  n.default = e;
+  return Object.freeze(n);
+}
+
+var R__namespace = /*#__PURE__*/_interopNamespace(R);
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function safeSum(...numbers) {
+  return R__namespace.sum(numbers?.filter(R__namespace.isNonNullish) || [
+    0
+  ]);
+}
+__name(safeSum, "safeSum");
+function takeBigger(...numbers) {
+  return Math.max(...numbers?.filter(R__namespace.isNonNullish) || [
+    0
+  ]) || 0;
+}
+__name(takeBigger, "takeBigger");
+function ensureRange(value, options) {
+  return Math.max(options.min ?? -Infinity, Math.min(value, options.max ?? Infinity));
+}
+__name(ensureRange, "ensureRange");
+
+exports.ensureRange = ensureRange;
+exports.safeSum = safeSum;
+exports.takeBigger = takeBigger;
+//# sourceMappingURL=number.cjs.map
+//# sourceMappingURL=number.cjs.map

package/dist/internals/helpers/number.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/number.ts"],"names":["safeSum","numbers","R","sum","filter","isNonNullish","takeBigger","Math","max","ensureRange","value","options","min","Infinity"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAkBO,SAASA,WAAWC,OAAsC,EAAA;AAC/D,EAAA,OAAOC,aAAEC,GAAIF,CAAAA,OAAAA,EAASG,MAAOF,CAAAA,YAAAA,CAAEG,YAAY,CAAK,IAAA;AAAC,IAAA;AAAE,GAAA,CAAA;AACrD;AAFgBL,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAIT,SAASM,cAAcL,OAAsC,EAAA;AAClE,EAAA,OAAOM,KAAKC,GAAG,CAAA,GAAKP,SAASG,MAAOF,CAAAA,YAAAA,CAAEG,YAAY,CAAK,IAAA;AAAC,IAAA;GAAE,CAAM,IAAA,CAAA;AAClE;AAFgBC,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAIT,SAASG,WAAAA,CAAYC,OAAeC,OAAuC,EAAA;AAChF,EAAOJ,OAAAA,IAAAA,CAAKC,GAAIG,CAAAA,OAAAA,CAAQC,GAAO,IAAA,CAAA,QAAA,EAAWL,IAAKK,CAAAA,GAAAA,CAAIF,KAAOC,EAAAA,OAAAA,CAAQH,GAAOK,IAAAA,QAAAA,CAAAA,CAAAA;AAC3E;AAFgBJ,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA","file":"number.cjs","sourcesContent":["/**\n * Copyright 2025 IBM Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport * as R from \"remeda\";\n\nexport function safeSum(...numbers: (number | undefined | null)[]): number {\n  return R.sum(numbers?.filter(R.isNonNullish) || [0]);\n}\n\nexport function takeBigger(...numbers: (number | undefined | null)[]): number {\n  return Math.max(...(numbers?.filter(R.isNonNullish) || [0])) || 0;\n}\n\nexport function ensureRange(value: number, options: { min?: number; max?: number }): number {\n  return Math.max(options.min ?? -Infinity, Math.min(value, options.max ?? Infinity));\n}\n"]}

package/dist/internals/helpers/number.d.cts

@@ -0,0 +1,23 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+declare function safeSum(...numbers: (number | undefined | null)[]): number;
+declare function takeBigger(...numbers: (number | undefined | null)[]): number;
+declare function ensureRange(value: number, options: {
+    min?: number;
+    max?: number;
+}): number;
+
+export { ensureRange, safeSum, takeBigger };

package/dist/internals/helpers/number.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+declare function safeSum(...numbers: (number | undefined | null)[]): number;
+declare function takeBigger(...numbers: (number | undefined | null)[]): number;
+declare function ensureRange(value: number, options: {
+    min?: number;
+    max?: number;
+}): number;
+
+export { ensureRange, safeSum, takeBigger };

package/dist/internals/helpers/number.js

@@ -0,0 +1,24 @@
+import * as R from 'remeda';
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function safeSum(...numbers) {
+  return R.sum(numbers?.filter(R.isNonNullish) || [
+    0
+  ]);
+}
+__name(safeSum, "safeSum");
+function takeBigger(...numbers) {
+  return Math.max(...numbers?.filter(R.isNonNullish) || [
+    0
+  ]) || 0;
+}
+__name(takeBigger, "takeBigger");
+function ensureRange(value, options) {
+  return Math.max(options.min ?? -Infinity, Math.min(value, options.max ?? Infinity));
+}
+__name(ensureRange, "ensureRange");
+
+export { ensureRange, safeSum, takeBigger };
+//# sourceMappingURL=number.js.map
+//# sourceMappingURL=number.js.map

package/dist/internals/helpers/number.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/number.ts"],"names":["safeSum","numbers","R","sum","filter","isNonNullish","takeBigger","Math","max","ensureRange","value","options","min","Infinity"],"mappings":";;;;AAkBO,SAASA,WAAWC,OAAsC,EAAA;AAC/D,EAAA,OAAOC,EAAEC,GAAIF,CAAAA,OAAAA,EAASG,MAAOF,CAAAA,CAAAA,CAAEG,YAAY,CAAK,IAAA;AAAC,IAAA;AAAE,GAAA,CAAA;AACrD;AAFgBL,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAIT,SAASM,cAAcL,OAAsC,EAAA;AAClE,EAAA,OAAOM,KAAKC,GAAG,CAAA,GAAKP,SAASG,MAAOF,CAAAA,CAAAA,CAAEG,YAAY,CAAK,IAAA;AAAC,IAAA;GAAE,CAAM,IAAA,CAAA;AAClE;AAFgBC,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAIT,SAASG,WAAAA,CAAYC,OAAeC,OAAuC,EAAA;AAChF,EAAOJ,OAAAA,IAAAA,CAAKC,GAAIG,CAAAA,OAAAA,CAAQC,GAAO,IAAA,CAAA,QAAA,EAAWL,IAAKK,CAAAA,GAAAA,CAAIF,KAAOC,EAAAA,OAAAA,CAAQH,GAAOK,IAAAA,QAAAA,CAAAA,CAAAA;AAC3E;AAFgBJ,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA","file":"number.js","sourcesContent":["/**\n * Copyright 2025 IBM Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport * as R from \"remeda\";\n\nexport function safeSum(...numbers: (number | undefined | null)[]): number {\n  return R.sum(numbers?.filter(R.isNonNullish) || [0]);\n}\n\nexport function takeBigger(...numbers: (number | undefined | null)[]): number {\n  return Math.max(...(numbers?.filter(R.isNonNullish) || [0])) || 0;\n}\n\nexport function ensureRange(value: number, options: { min?: number; max?: number }): number {\n  return Math.max(options.min ?? -Infinity, Math.min(value, options.max ?? Infinity));\n}\n"]}

package/dist/internals/helpers/object.cjs

@@ -0,0 +1,142 @@
+'use strict';
+
+var R = require('remeda');
+var errors_cjs = require('../../errors.cjs');
+
+function _interopNamespace(e) {
+  if (e && e.__esModule) return e;
+  var n = Object.create(null);
+  if (e) {
+    Object.keys(e).forEach(function (k) {
+      if (k !== 'default') {
+        var d = Object.getOwnPropertyDescriptor(e, k);
+        Object.defineProperty(n, k, d.get ? d : {
+          enumerable: true,
+          get: function () { return e[k]; }
+        });
+      }
+    });
+  }
+  n.default = e;
+  return Object.freeze(n);
+}
+
+var R__namespace = /*#__PURE__*/_interopNamespace(R);
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function assignFactory(target) {
+  return (source) => {
+    Object.assign(target, source);
+  };
+}
+__name(assignFactory, "assignFactory");
+const assign = /* @__PURE__ */ __name((a, b) => assignFactory(a)(b), "assign");
+const omitEmptyValues = R__namespace.pickBy(R__namespace.isTruthy);
+const omitUndefined = R__namespace.pickBy(R__namespace.isDefined);
+function hasProp(target, key) {
+  return Boolean(target) && Object.prototype.hasOwnProperty.call(target, key);
+}
+__name(hasProp, "hasProp");
+function hasProps(keys) {
+  return (target) => keys.every((key) => hasProp(target, key));
+}
+__name(hasProps, "hasProps");
+function setProp(target, paths, value) {
+  for (const entry of paths.entries()) {
+    const [idx, key] = entry;
+    if (!R__namespace.isPlainObject(target) && !R__namespace.isArray(target)) {
+      throw new TypeError("Only plain objects and arrays are supported!");
+    }
+    const isLast = idx === paths.length - 1;
+    const newValue = isLast ? value : target[key] ?? {};
+    Object.assign(target, {
+      [key]: newValue
+    });
+    target = target[key];
+  }
+}
+__name(setProp, "setProp");
+function getPropStrict(target, path) {
+  if (!target || !(path in target)) {
+    throw new TypeError(`Target does not contain key "${path}"`);
+  }
+  return target[path];
+}
+__name(getPropStrict, "getPropStrict");
+function getProp(target, paths, defaultValue = void 0) {
+  let value = target;
+  if (!value) {
+    return void 0;
+  }
+  for (const key of paths) {
+    if (!hasProp(value, key)) {
+      return defaultValue;
+    }
+    value = value[key];
+  }
+  return value;
+}
+__name(getProp, "getProp");
+function deleteProps(target, keys) {
+  keys.forEach((key) => {
+    delete target[key];
+  });
+}
+__name(deleteProps, "deleteProps");
+function updateObject(old, update) {
+  for (const [key, val] of Object.entries(update)) {
+    const existing = old[key];
+    if (existing !== void 0 && existing !== null) {
+      throw new errors_cjs.FrameworkError(`Cannot update object. Key '${key}' already exists and is defined.`, [], {
+        context: {
+          existing,
+          update: val
+        }
+      });
+    }
+    old[key] = val;
+  }
+}
+__name(updateObject, "updateObject");
+function customMerge(results, processors) {
+  if (results.length === 0) {
+    throw new TypeError("Cannot merge content of an empty array!");
+  }
+  const finalResult = {};
+  for (const next of results) {
+    for (const [key, value] of R__namespace.entries(next)) {
+      const oldValue = finalResult[key];
+      finalResult[key] = (processors[key] ?? R__namespace.takeFirstBy(1))(value, oldValue);
+    }
+  }
+  return finalResult;
+}
+__name(customMerge, "customMerge");
+function mapObj(obj) {
+  return function(fn) {
+    const updated = {};
+    for (const pair of Object.entries(obj)) {
+      const [key, value] = pair;
+      updated[key] = fn(key, value);
+    }
+    return updated;
+  };
+}
+__name(mapObj, "mapObj");
+
+exports.assign = assign;
+exports.assignFactory = assignFactory;
+exports.customMerge = customMerge;
+exports.deleteProps = deleteProps;
+exports.getProp = getProp;
+exports.getPropStrict = getPropStrict;
+exports.hasProp = hasProp;
+exports.hasProps = hasProps;
+exports.mapObj = mapObj;
+exports.omitEmptyValues = omitEmptyValues;
+exports.omitUndefined = omitUndefined;
+exports.setProp = setProp;
+exports.updateObject = updateObject;
+//# sourceMappingURL=object.cjs.map
+//# sourceMappingURL=object.cjs.map