@langchain/core 0.3.59 → 0.3.61

package/dist/utils/js-sha256/hash.js

@@ -0,0 +1,445 @@
+// @ts-nocheck
+// Inlined to deal with portability issues with importing crypto module
+/**
+ * [js-sha256]{@link https://github.com/emn178/js-sha256}
+ *
+ * @version 0.11.1
+ * @author Chen, Yi-Cyuan [emn178@gmail.com]
+ * @copyright Chen, Yi-Cyuan 2014-2025
+ * @license MIT
+ */
+/*jslint bitwise: true */
+"use strict";
+var HEX_CHARS = "0123456789abcdef".split("");
+var EXTRA = [-2147483648, 8388608, 32768, 128];
+var SHIFT = [24, 16, 8, 0];
+var K = [
+    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1,
+    0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
+    0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786,
+    0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
+    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147,
+    0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
+    0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b,
+    0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
+    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a,
+    0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
+    0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
+];
+var OUTPUT_TYPES = ["hex", "array", "digest", "arrayBuffer"];
+var blocks = [];
+function Sha256(is224, sharedMemory) {
+    if (sharedMemory) {
+        blocks[0] =
+            blocks[16] =
+                blocks[1] =
+                    blocks[2] =
+                        blocks[3] =
+                            blocks[4] =
+                                blocks[5] =
+                                    blocks[6] =
+                                        blocks[7] =
+                                            blocks[8] =
+                                                blocks[9] =
+                                                    blocks[10] =
+                                                        blocks[11] =
+                                                            blocks[12] =
+                                                                blocks[13] =
+                                                                    blocks[14] =
+                                                                        blocks[15] =
+                                                                            0;
+        this.blocks = blocks;
+    }
+    else {
+        this.blocks = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
+    }
+    if (is224) {
+        this.h0 = 0xc1059ed8;
+        this.h1 = 0x367cd507;
+        this.h2 = 0x3070dd17;
+        this.h3 = 0xf70e5939;
+        this.h4 = 0xffc00b31;
+        this.h5 = 0x68581511;
+        this.h6 = 0x64f98fa7;
+        this.h7 = 0xbefa4fa4;
+    }
+    else {
+        // 256
+        this.h0 = 0x6a09e667;
+        this.h1 = 0xbb67ae85;
+        this.h2 = 0x3c6ef372;
+        this.h3 = 0xa54ff53a;
+        this.h4 = 0x510e527f;
+        this.h5 = 0x9b05688c;
+        this.h6 = 0x1f83d9ab;
+        this.h7 = 0x5be0cd19;
+    }
+    this.block = this.start = this.bytes = this.hBytes = 0;
+    this.finalized = this.hashed = false;
+    this.first = true;
+    this.is224 = is224;
+}
+Sha256.prototype.update = function (message) {
+    if (this.finalized) {
+        return;
+    }
+    var notString, type = typeof message;
+    if (type !== "string") {
+        if (type === "object") {
+            if (message === null) {
+                throw new Error(ERROR);
+            }
+            else if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {
+                message = new Uint8Array(message);
+            }
+            else if (!Array.isArray(message)) {
+                if (!ARRAY_BUFFER || !ArrayBuffer.isView(message)) {
+                    throw new Error(ERROR);
+                }
+            }
+        }
+        else {
+            throw new Error(ERROR);
+        }
+        notString = true;
+    }
+    var code, index = 0, i, length = message.length, blocks = this.blocks;
+    while (index < length) {
+        if (this.hashed) {
+            this.hashed = false;
+            blocks[0] = this.block;
+            this.block =
+                blocks[16] =
+                    blocks[1] =
+                        blocks[2] =
+                            blocks[3] =
+                                blocks[4] =
+                                    blocks[5] =
+                                        blocks[6] =
+                                            blocks[7] =
+                                                blocks[8] =
+                                                    blocks[9] =
+                                                        blocks[10] =
+                                                            blocks[11] =
+                                                                blocks[12] =
+                                                                    blocks[13] =
+                                                                        blocks[14] =
+                                                                            blocks[15] =
+                                                                                0;
+        }
+        if (notString) {
+            for (i = this.start; index < length && i < 64; ++index) {
+                blocks[i >>> 2] |= message[index] << SHIFT[i++ & 3];
+            }
+        }
+        else {
+            for (i = this.start; index < length && i < 64; ++index) {
+                code = message.charCodeAt(index);
+                if (code < 0x80) {
+                    blocks[i >>> 2] |= code << SHIFT[i++ & 3];
+                }
+                else if (code < 0x800) {
+                    blocks[i >>> 2] |= (0xc0 | (code >>> 6)) << SHIFT[i++ & 3];
+                    blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
+                }
+                else if (code < 0xd800 || code >= 0xe000) {
+                    blocks[i >>> 2] |= (0xe0 | (code >>> 12)) << SHIFT[i++ & 3];
+                    blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
+                    blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
+                }
+                else {
+                    code =
+                        0x10000 +
+                            (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
+                    blocks[i >>> 2] |= (0xf0 | (code >>> 18)) << SHIFT[i++ & 3];
+                    blocks[i >>> 2] |= (0x80 | ((code >>> 12) & 0x3f)) << SHIFT[i++ & 3];
+                    blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
+                    blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
+                }
+            }
+        }
+        this.lastByteIndex = i;
+        this.bytes += i - this.start;
+        if (i >= 64) {
+            this.block = blocks[16];
+            this.start = i - 64;
+            this.hash();
+            this.hashed = true;
+        }
+        else {
+            this.start = i;
+        }
+    }
+    if (this.bytes > 4294967295) {
+        this.hBytes += (this.bytes / 4294967296) << 0;
+        this.bytes = this.bytes % 4294967296;
+    }
+    return this;
+};
+Sha256.prototype.finalize = function () {
+    if (this.finalized) {
+        return;
+    }
+    this.finalized = true;
+    var blocks = this.blocks, i = this.lastByteIndex;
+    blocks[16] = this.block;
+    blocks[i >>> 2] |= EXTRA[i & 3];
+    this.block = blocks[16];
+    if (i >= 56) {
+        if (!this.hashed) {
+            this.hash();
+        }
+        blocks[0] = this.block;
+        blocks[16] =
+            blocks[1] =
+                blocks[2] =
+                    blocks[3] =
+                        blocks[4] =
+                            blocks[5] =
+                                blocks[6] =
+                                    blocks[7] =
+                                        blocks[8] =
+                                            blocks[9] =
+                                                blocks[10] =
+                                                    blocks[11] =
+                                                        blocks[12] =
+                                                            blocks[13] =
+                                                                blocks[14] =
+                                                                    blocks[15] =
+                                                                        0;
+    }
+    blocks[14] = (this.hBytes << 3) | (this.bytes >>> 29);
+    blocks[15] = this.bytes << 3;
+    this.hash();
+};
+Sha256.prototype.hash = function () {
+    var a = this.h0, b = this.h1, c = this.h2, d = this.h3, e = this.h4, f = this.h5, g = this.h6, h = this.h7, blocks = this.blocks, j, s0, s1, maj, t1, t2, ch, ab, da, cd, bc;
+    for (j = 16; j < 64; ++j) {
+        // rightrotate
+        t1 = blocks[j - 15];
+        s0 = ((t1 >>> 7) | (t1 << 25)) ^ ((t1 >>> 18) | (t1 << 14)) ^ (t1 >>> 3);
+        t1 = blocks[j - 2];
+        s1 = ((t1 >>> 17) | (t1 << 15)) ^ ((t1 >>> 19) | (t1 << 13)) ^ (t1 >>> 10);
+        blocks[j] = (blocks[j - 16] + s0 + blocks[j - 7] + s1) << 0;
+    }
+    bc = b & c;
+    for (j = 0; j < 64; j += 4) {
+        if (this.first) {
+            if (this.is224) {
+                ab = 300032;
+                t1 = blocks[0] - 1413257819;
+                h = (t1 - 150054599) << 0;
+                d = (t1 + 24177077) << 0;
+            }
+            else {
+                ab = 704751109;
+                t1 = blocks[0] - 210244248;
+                h = (t1 - 1521486534) << 0;
+                d = (t1 + 143694565) << 0;
+            }
+            this.first = false;
+        }
+        else {
+            s0 =
+                ((a >>> 2) | (a << 30)) ^
+                    ((a >>> 13) | (a << 19)) ^
+                    ((a >>> 22) | (a << 10));
+            s1 =
+                ((e >>> 6) | (e << 26)) ^
+                    ((e >>> 11) | (e << 21)) ^
+                    ((e >>> 25) | (e << 7));
+            ab = a & b;
+            maj = ab ^ (a & c) ^ bc;
+            ch = (e & f) ^ (~e & g);
+            t1 = h + s1 + ch + K[j] + blocks[j];
+            t2 = s0 + maj;
+            h = (d + t1) << 0;
+            d = (t1 + t2) << 0;
+        }
+        s0 =
+            ((d >>> 2) | (d << 30)) ^
+                ((d >>> 13) | (d << 19)) ^
+                ((d >>> 22) | (d << 10));
+        s1 =
+            ((h >>> 6) | (h << 26)) ^
+                ((h >>> 11) | (h << 21)) ^
+                ((h >>> 25) | (h << 7));
+        da = d & a;
+        maj = da ^ (d & b) ^ ab;
+        ch = (g & h) ^ (~g & e);
+        t1 = f + s1 + ch + K[j + 1] + blocks[j + 1];
+        t2 = s0 + maj;
+        g = (c + t1) << 0;
+        c = (t1 + t2) << 0;
+        s0 =
+            ((c >>> 2) | (c << 30)) ^
+                ((c >>> 13) | (c << 19)) ^
+                ((c >>> 22) | (c << 10));
+        s1 =
+            ((g >>> 6) | (g << 26)) ^
+                ((g >>> 11) | (g << 21)) ^
+                ((g >>> 25) | (g << 7));
+        cd = c & d;
+        maj = cd ^ (c & a) ^ da;
+        ch = (f & g) ^ (~f & h);
+        t1 = e + s1 + ch + K[j + 2] + blocks[j + 2];
+        t2 = s0 + maj;
+        f = (b + t1) << 0;
+        b = (t1 + t2) << 0;
+        s0 =
+            ((b >>> 2) | (b << 30)) ^
+                ((b >>> 13) | (b << 19)) ^
+                ((b >>> 22) | (b << 10));
+        s1 =
+            ((f >>> 6) | (f << 26)) ^
+                ((f >>> 11) | (f << 21)) ^
+                ((f >>> 25) | (f << 7));
+        bc = b & c;
+        maj = bc ^ (b & d) ^ cd;
+        ch = (f & g) ^ (~f & h);
+        t1 = e + s1 + ch + K[j + 3] + blocks[j + 3];
+        t2 = s0 + maj;
+        e = (a + t1) << 0;
+        a = (t1 + t2) << 0;
+        this.chromeBugWorkAround = true;
+    }
+    this.h0 = (this.h0 + a) << 0;
+    this.h1 = (this.h1 + b) << 0;
+    this.h2 = (this.h2 + c) << 0;
+    this.h3 = (this.h3 + d) << 0;
+    this.h4 = (this.h4 + e) << 0;
+    this.h5 = (this.h5 + f) << 0;
+    this.h6 = (this.h6 + g) << 0;
+    this.h7 = (this.h7 + h) << 0;
+};
+Sha256.prototype.hex = function () {
+    this.finalize();
+    var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4, h5 = this.h5, h6 = this.h6, h7 = this.h7;
+    var hex = HEX_CHARS[(h0 >>> 28) & 0x0f] +
+        HEX_CHARS[(h0 >>> 24) & 0x0f] +
+        HEX_CHARS[(h0 >>> 20) & 0x0f] +
+        HEX_CHARS[(h0 >>> 16) & 0x0f] +
+        HEX_CHARS[(h0 >>> 12) & 0x0f] +
+        HEX_CHARS[(h0 >>> 8) & 0x0f] +
+        HEX_CHARS[(h0 >>> 4) & 0x0f] +
+        HEX_CHARS[h0 & 0x0f] +
+        HEX_CHARS[(h1 >>> 28) & 0x0f] +
+        HEX_CHARS[(h1 >>> 24) & 0x0f] +
+        HEX_CHARS[(h1 >>> 20) & 0x0f] +
+        HEX_CHARS[(h1 >>> 16) & 0x0f] +
+        HEX_CHARS[(h1 >>> 12) & 0x0f] +
+        HEX_CHARS[(h1 >>> 8) & 0x0f] +
+        HEX_CHARS[(h1 >>> 4) & 0x0f] +
+        HEX_CHARS[h1 & 0x0f] +
+        HEX_CHARS[(h2 >>> 28) & 0x0f] +
+        HEX_CHARS[(h2 >>> 24) & 0x0f] +
+        HEX_CHARS[(h2 >>> 20) & 0x0f] +
+        HEX_CHARS[(h2 >>> 16) & 0x0f] +
+        HEX_CHARS[(h2 >>> 12) & 0x0f] +
+        HEX_CHARS[(h2 >>> 8) & 0x0f] +
+        HEX_CHARS[(h2 >>> 4) & 0x0f] +
+        HEX_CHARS[h2 & 0x0f] +
+        HEX_CHARS[(h3 >>> 28) & 0x0f] +
+        HEX_CHARS[(h3 >>> 24) & 0x0f] +
+        HEX_CHARS[(h3 >>> 20) & 0x0f] +
+        HEX_CHARS[(h3 >>> 16) & 0x0f] +
+        HEX_CHARS[(h3 >>> 12) & 0x0f] +
+        HEX_CHARS[(h3 >>> 8) & 0x0f] +
+        HEX_CHARS[(h3 >>> 4) & 0x0f] +
+        HEX_CHARS[h3 & 0x0f] +
+        HEX_CHARS[(h4 >>> 28) & 0x0f] +
+        HEX_CHARS[(h4 >>> 24) & 0x0f] +
+        HEX_CHARS[(h4 >>> 20) & 0x0f] +
+        HEX_CHARS[(h4 >>> 16) & 0x0f] +
+        HEX_CHARS[(h4 >>> 12) & 0x0f] +
+        HEX_CHARS[(h4 >>> 8) & 0x0f] +
+        HEX_CHARS[(h4 >>> 4) & 0x0f] +
+        HEX_CHARS[h4 & 0x0f] +
+        HEX_CHARS[(h5 >>> 28) & 0x0f] +
+        HEX_CHARS[(h5 >>> 24) & 0x0f] +
+        HEX_CHARS[(h5 >>> 20) & 0x0f] +
+        HEX_CHARS[(h5 >>> 16) & 0x0f] +
+        HEX_CHARS[(h5 >>> 12) & 0x0f] +
+        HEX_CHARS[(h5 >>> 8) & 0x0f] +
+        HEX_CHARS[(h5 >>> 4) & 0x0f] +
+        HEX_CHARS[h5 & 0x0f] +
+        HEX_CHARS[(h6 >>> 28) & 0x0f] +
+        HEX_CHARS[(h6 >>> 24) & 0x0f] +
+        HEX_CHARS[(h6 >>> 20) & 0x0f] +
+        HEX_CHARS[(h6 >>> 16) & 0x0f] +
+        HEX_CHARS[(h6 >>> 12) & 0x0f] +
+        HEX_CHARS[(h6 >>> 8) & 0x0f] +
+        HEX_CHARS[(h6 >>> 4) & 0x0f] +
+        HEX_CHARS[h6 & 0x0f];
+    if (!this.is224) {
+        hex +=
+            HEX_CHARS[(h7 >>> 28) & 0x0f] +
+                HEX_CHARS[(h7 >>> 24) & 0x0f] +
+                HEX_CHARS[(h7 >>> 20) & 0x0f] +
+                HEX_CHARS[(h7 >>> 16) & 0x0f] +
+                HEX_CHARS[(h7 >>> 12) & 0x0f] +
+                HEX_CHARS[(h7 >>> 8) & 0x0f] +
+                HEX_CHARS[(h7 >>> 4) & 0x0f] +
+                HEX_CHARS[h7 & 0x0f];
+    }
+    return hex;
+};
+Sha256.prototype.toString = Sha256.prototype.hex;
+Sha256.prototype.digest = function () {
+    this.finalize();
+    var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4, h5 = this.h5, h6 = this.h6, h7 = this.h7;
+    var arr = [
+        (h0 >>> 24) & 0xff,
+        (h0 >>> 16) & 0xff,
+        (h0 >>> 8) & 0xff,
+        h0 & 0xff,
+        (h1 >>> 24) & 0xff,
+        (h1 >>> 16) & 0xff,
+        (h1 >>> 8) & 0xff,
+        h1 & 0xff,
+        (h2 >>> 24) & 0xff,
+        (h2 >>> 16) & 0xff,
+        (h2 >>> 8) & 0xff,
+        h2 & 0xff,
+        (h3 >>> 24) & 0xff,
+        (h3 >>> 16) & 0xff,
+        (h3 >>> 8) & 0xff,
+        h3 & 0xff,
+        (h4 >>> 24) & 0xff,
+        (h4 >>> 16) & 0xff,
+        (h4 >>> 8) & 0xff,
+        h4 & 0xff,
+        (h5 >>> 24) & 0xff,
+        (h5 >>> 16) & 0xff,
+        (h5 >>> 8) & 0xff,
+        h5 & 0xff,
+        (h6 >>> 24) & 0xff,
+        (h6 >>> 16) & 0xff,
+        (h6 >>> 8) & 0xff,
+        h6 & 0xff,
+    ];
+    if (!this.is224) {
+        arr.push((h7 >>> 24) & 0xff, (h7 >>> 16) & 0xff, (h7 >>> 8) & 0xff, h7 & 0xff);
+    }
+    return arr;
+};
+Sha256.prototype.array = Sha256.prototype.digest;
+Sha256.prototype.arrayBuffer = function () {
+    this.finalize();
+    var buffer = new ArrayBuffer(this.is224 ? 28 : 32);
+    var dataView = new DataView(buffer);
+    dataView.setUint32(0, this.h0);
+    dataView.setUint32(4, this.h1);
+    dataView.setUint32(8, this.h2);
+    dataView.setUint32(12, this.h3);
+    dataView.setUint32(16, this.h4);
+    dataView.setUint32(20, this.h5);
+    dataView.setUint32(24, this.h6);
+    if (!this.is224) {
+        dataView.setUint32(28, this.h7);
+    }
+    return buffer;
+};
+export const sha256 = (...strings) => {
+    return new Sha256(false, true).update(strings.join("")).hex();
+};

package/dist/utils/json.cjs

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.parsePartialJson = exports.parseJsonMarkdown = void 0;
+exports.parseJsonMarkdown = parseJsonMarkdown;
+exports.parsePartialJson = parsePartialJson;
 function parseJsonMarkdown(s, parser = parsePartialJson) {
     // eslint-disable-next-line no-param-reassign
     s = s.trim();
@@ -25,7 +26,6 @@ function parseJsonMarkdown(s, parser = parsePartialJson) {
     }
     return parser(finalContent.trim());
 }
-exports.parseJsonMarkdown = parseJsonMarkdown;
 // Adapted from https://github.com/KillianLucas/open-interpreter/blob/main/interpreter/core/llm/utils/parse_partial_json.py
 // MIT License
 function parsePartialJson(s) {
@@ -103,4 +103,3 @@ function parsePartialJson(s) {
         return null;
     }
 }
-exports.parsePartialJson = parsePartialJson;

package/dist/utils/json_schema.cjs

@@ -1,6 +1,8 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.validatesOnlyStrings = exports.toJsonSchema = exports.Validator = exports.deepCompareStrict = void 0;
+exports.Validator = exports.deepCompareStrict = void 0;
+exports.toJsonSchema = toJsonSchema;
+exports.validatesOnlyStrings = validatesOnlyStrings;
 const core_1 = require("zod/v4/core");
 const zod_to_json_schema_1 = require("zod-to-json-schema");
 const json_schema_1 = require("@cfworker/json-schema");
@@ -15,14 +17,20 @@ Object.defineProperty(exports, "Validator", { enumerable: true, get: function ()
  */
 function toJsonSchema(schema) {
     if ((0, zod_js_1.isZodSchemaV4)(schema)) {
-        return (0, core_1.toJSONSchema)(schema);
+        const inputSchema = (0, zod_js_1.interopZodTransformInputSchema)(schema, true);
+        if ((0, zod_js_1.isZodObjectV4)(inputSchema)) {
+            const strictSchema = (0, zod_js_1.interopZodObjectStrict)(inputSchema, true);
+            return (0, core_1.toJSONSchema)(strictSchema);
+        }
+        else {
+            return (0, core_1.toJSONSchema)(schema);
+        }
     }
     if ((0, zod_js_1.isZodSchemaV3)(schema)) {
         return (0, zod_to_json_schema_1.zodToJsonSchema)(schema);
     }
     return schema;
 }
-exports.toJsonSchema = toJsonSchema;
 /**
  * Validates if a JSON schema validates only strings. May return false negatives in some edge cases
  * (like recursive or unresolvable refs).
@@ -88,4 +96,3 @@ function validatesOnlyStrings(schema) {
     // ignore other cases for now where type is omitted
     return false;
 }
-exports.validatesOnlyStrings = validatesOnlyStrings;

package/dist/utils/json_schema.js

@@ -1,7 +1,7 @@
 import { toJSONSchema } from "zod/v4/core";
 import { zodToJsonSchema } from "zod-to-json-schema";
 import { dereference } from "@cfworker/json-schema";
-import { isZodSchemaV3, isZodSchemaV4 } from "./types/zod.js";
+import { isZodSchemaV3, isZodSchemaV4, interopZodObjectStrict, isZodObjectV4, interopZodTransformInputSchema, } from "./types/zod.js";
 export { deepCompareStrict, Validator } from "@cfworker/json-schema";
 /**
  * Converts a Zod schema or JSON schema to a JSON schema.
@@ -10,7 +10,14 @@ export { deepCompareStrict, Validator } from "@cfworker/json-schema";
  */
 export function toJsonSchema(schema) {
     if (isZodSchemaV4(schema)) {
-        return toJSONSchema(schema);
+        const inputSchema = interopZodTransformInputSchema(schema, true);
+        if (isZodObjectV4(inputSchema)) {
+            const strictSchema = interopZodObjectStrict(inputSchema, true);
+            return toJSONSchema(strictSchema);
+        }
+        else {
+            return toJSONSchema(schema);
+        }
     }
     if (isZodSchemaV3(schema)) {
         return zodToJsonSchema(schema);

package/dist/utils/math.cjs

@@ -1,6 +1,11 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.maximalMarginalRelevance = exports.euclideanDistance = exports.innerProduct = exports.cosineSimilarity = exports.normalize = exports.matrixFunc = void 0;
+exports.matrixFunc = matrixFunc;
+exports.normalize = normalize;
+exports.cosineSimilarity = cosineSimilarity;
+exports.innerProduct = innerProduct;
+exports.euclideanDistance = euclideanDistance;
+exports.maximalMarginalRelevance = maximalMarginalRelevance;
 const similarities_js_1 = require("./ml-distance/similarities.cjs");
 const distances_js_1 = require("./ml-distance/distances.cjs");
 const euclidean_js_1 = require("./ml-distance-euclidean/euclidean.cjs");
@@ -30,12 +35,10 @@ function matrixFunc(X, Y, func) {
     }
     return X.map((xVector) => Y.map((yVector) => func(xVector, yVector)).map((similarity) => Number.isNaN(similarity) ? 0 : similarity));
 }
-exports.matrixFunc = matrixFunc;
 function normalize(M, similarity = false) {
     const max = matrixMaxVal(M);
     return M.map((row) => row.map((val) => (similarity ? 1 - val / max : val / max)));
 }
-exports.normalize = normalize;
 /**
  * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.
  *
@@ -49,15 +52,12 @@ exports.normalize = normalize;
 function cosineSimilarity(X, Y) {
     return matrixFunc(X, Y, similarities_js_1.cosine);
 }
-exports.cosineSimilarity = cosineSimilarity;
 function innerProduct(X, Y) {
     return matrixFunc(X, Y, distances_js_1.innerProduct);
 }
-exports.innerProduct = innerProduct;
 function euclideanDistance(X, Y) {
     return matrixFunc(X, Y, euclidean_js_1.euclidean);
 }
-exports.euclideanDistance = euclideanDistance;
 /**
  * This function implements the Maximal Marginal Relevance algorithm
  * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.
@@ -98,7 +98,6 @@ function maximalMarginalRelevance(queryEmbedding, embeddingList, lambda = 0.5, k
     }
     return selectedEmbeddingsIndexes;
 }
-exports.maximalMarginalRelevance = maximalMarginalRelevance;
 /**
  * Finds the index of the maximum value in the given array.
  * @param {number[]} array - The input array.

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

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.innerProduct = void 0;
+exports.innerProduct = innerProduct;
 /**
  *Returns the Inner Product similarity between vectors a and b
  * @link [Inner Product Similarity algorithm](https://www.naun.org/main/NAUN/ijmmas/mmmas-49.pdf)
@@ -15,4 +15,3 @@ function innerProduct(a, b) {
     }
     return ans;
 }
-exports.innerProduct = innerProduct;

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

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.cosine = void 0;
+exports.cosine = cosine;
 /**
  * Returns the average of cosine distances between vectors a and b
  * @param a - first vector
@@ -18,4 +18,3 @@ function cosine(a, b) {
     }
     return p / (Math.sqrt(p2) * Math.sqrt(q2));
 }
-exports.cosine = cosine;

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

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.euclidean = exports.squaredEuclidean = void 0;
+exports.squaredEuclidean = squaredEuclidean;
+exports.euclidean = euclidean;
 function squaredEuclidean(p, q) {
     let d = 0;
     for (let i = 0; i < p.length; i++) {
@@ -8,8 +9,6 @@ function squaredEuclidean(p, q) {
     }
     return d;
 }
-exports.squaredEuclidean = squaredEuclidean;
 function euclidean(p, q) {
     return Math.sqrt(squaredEuclidean(p, q));
 }
-exports.euclidean = euclidean;