@langchain/core 0.3.72 → 1.0.0-alpha.2

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

@@ -1,372 +1,284 @@
-// @ts-nocheck
-// Inlined to deal with portability issues with importing crypto module
-/*
- * [js-sha1]{@link https://github.com/emn178/js-sha1}
- *
- * @version 0.6.0
- * @author Chen, Yi-Cyuan [emn178@gmail.com]
- * @copyright Chen, Yi-Cyuan 2014-2017
- * @license MIT
- */
-/*jslint bitwise: true */
-"use strict";
+
+
+import { __export } from "../../_virtual/rolldown_runtime.js";
+
+//#region src/utils/js-sha1/hash.ts
+var hash_exports = {};
+__export(hash_exports, { insecureHash: () => insecureHash });
 var root = typeof window === "object" ? window : {};
 var HEX_CHARS = "0123456789abcdef".split("");
-var EXTRA = [-2147483648, 8388608, 32768, 128];
-var SHIFT = [24, 16, 8, 0];
-var OUTPUT_TYPES = ["hex", "array", "digest", "arrayBuffer"];
+var EXTRA = [
+	-2147483648,
+	8388608,
+	32768,
+	128
+];
+var SHIFT = [
+	24,
+	16,
+	8,
+	0
+];
 var blocks = [];
 function Sha1(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];
-    }
-    this.h0 = 0x67452301;
-    this.h1 = 0xefcdab89;
-    this.h2 = 0x98badcfe;
-    this.h3 = 0x10325476;
-    this.h4 = 0xc3d2e1f0;
-    this.block = this.start = this.bytes = this.hBytes = 0;
-    this.finalized = this.hashed = false;
-    this.first = true;
+	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
+	];
+	this.h0 = 1732584193;
+	this.h1 = 4023233417;
+	this.h2 = 2562383102;
+	this.h3 = 271733878;
+	this.h4 = 3285377520;
+	this.block = this.start = this.bytes = this.hBytes = 0;
+	this.finalized = this.hashed = false;
+	this.first = true;
 }
-Sha1.prototype.update = function (message) {
-    if (this.finalized) {
-        return;
-    }
-    var notString = typeof message !== "string";
-    if (notString && message.constructor === root.ArrayBuffer) {
-        message = new Uint8Array(message);
-    }
-    var code, index = 0, i, length = message.length || 0, blocks = this.blocks;
-    while (index < length) {
-        if (this.hashed) {
-            this.hashed = false;
-            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;
-        }
-        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;
+Sha1.prototype.update = function(message) {
+	if (this.finalized) return;
+	var notString = typeof message !== "string";
+	if (notString && message.constructor === root.ArrayBuffer) message = new Uint8Array(message);
+	var code, index = 0, i, length = message.length || 0, blocks$1 = this.blocks;
+	while (index < length) {
+		if (this.hashed) {
+			this.hashed = false;
+			blocks$1[0] = this.block;
+			blocks$1[16] = blocks$1[1] = blocks$1[2] = blocks$1[3] = blocks$1[4] = blocks$1[5] = blocks$1[6] = blocks$1[7] = blocks$1[8] = blocks$1[9] = blocks$1[10] = blocks$1[11] = blocks$1[12] = blocks$1[13] = blocks$1[14] = blocks$1[15] = 0;
+		}
+		if (notString) for (i = this.start; index < length && i < 64; ++index) blocks$1[i >> 2] |= message[index] << SHIFT[i++ & 3];
+		else for (i = this.start; index < length && i < 64; ++index) {
+			code = message.charCodeAt(index);
+			if (code < 128) blocks$1[i >> 2] |= code << SHIFT[i++ & 3];
+			else if (code < 2048) {
+				blocks$1[i >> 2] |= (192 | code >> 6) << SHIFT[i++ & 3];
+				blocks$1[i >> 2] |= (128 | code & 63) << SHIFT[i++ & 3];
+			} else if (code < 55296 || code >= 57344) {
+				blocks$1[i >> 2] |= (224 | code >> 12) << SHIFT[i++ & 3];
+				blocks$1[i >> 2] |= (128 | code >> 6 & 63) << SHIFT[i++ & 3];
+				blocks$1[i >> 2] |= (128 | code & 63) << SHIFT[i++ & 3];
+			} else {
+				code = 65536 + ((code & 1023) << 10 | message.charCodeAt(++index) & 1023);
+				blocks$1[i >> 2] |= (240 | code >> 18) << SHIFT[i++ & 3];
+				blocks$1[i >> 2] |= (128 | code >> 12 & 63) << SHIFT[i++ & 3];
+				blocks$1[i >> 2] |= (128 | code >> 6 & 63) << SHIFT[i++ & 3];
+				blocks$1[i >> 2] |= (128 | code & 63) << SHIFT[i++ & 3];
+			}
+		}
+		this.lastByteIndex = i;
+		this.bytes += i - this.start;
+		if (i >= 64) {
+			this.block = blocks$1[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;
 };
-Sha1.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();
+Sha1.prototype.finalize = function() {
+	if (this.finalized) return;
+	this.finalized = true;
+	var blocks$1 = this.blocks, i = this.lastByteIndex;
+	blocks$1[16] = this.block;
+	blocks$1[i >> 2] |= EXTRA[i & 3];
+	this.block = blocks$1[16];
+	if (i >= 56) {
+		if (!this.hashed) this.hash();
+		blocks$1[0] = this.block;
+		blocks$1[16] = blocks$1[1] = blocks$1[2] = blocks$1[3] = blocks$1[4] = blocks$1[5] = blocks$1[6] = blocks$1[7] = blocks$1[8] = blocks$1[9] = blocks$1[10] = blocks$1[11] = blocks$1[12] = blocks$1[13] = blocks$1[14] = blocks$1[15] = 0;
+	}
+	blocks$1[14] = this.hBytes << 3 | this.bytes >>> 29;
+	blocks$1[15] = this.bytes << 3;
+	this.hash();
 };
-Sha1.prototype.hash = function () {
-    var a = this.h0, b = this.h1, c = this.h2, d = this.h3, e = this.h4;
-    var f, j, t, blocks = this.blocks;
-    for (j = 16; j < 80; ++j) {
-        t = blocks[j - 3] ^ blocks[j - 8] ^ blocks[j - 14] ^ blocks[j - 16];
-        blocks[j] = (t << 1) | (t >>> 31);
-    }
-    for (j = 0; j < 20; j += 5) {
-        f = (b & c) | (~b & d);
-        t = (a << 5) | (a >>> 27);
-        e = (t + f + e + 1518500249 + blocks[j]) << 0;
-        b = (b << 30) | (b >>> 2);
-        f = (a & b) | (~a & c);
-        t = (e << 5) | (e >>> 27);
-        d = (t + f + d + 1518500249 + blocks[j + 1]) << 0;
-        a = (a << 30) | (a >>> 2);
-        f = (e & a) | (~e & b);
-        t = (d << 5) | (d >>> 27);
-        c = (t + f + c + 1518500249 + blocks[j + 2]) << 0;
-        e = (e << 30) | (e >>> 2);
-        f = (d & e) | (~d & a);
-        t = (c << 5) | (c >>> 27);
-        b = (t + f + b + 1518500249 + blocks[j + 3]) << 0;
-        d = (d << 30) | (d >>> 2);
-        f = (c & d) | (~c & e);
-        t = (b << 5) | (b >>> 27);
-        a = (t + f + a + 1518500249 + blocks[j + 4]) << 0;
-        c = (c << 30) | (c >>> 2);
-    }
-    for (; j < 40; j += 5) {
-        f = b ^ c ^ d;
-        t = (a << 5) | (a >>> 27);
-        e = (t + f + e + 1859775393 + blocks[j]) << 0;
-        b = (b << 30) | (b >>> 2);
-        f = a ^ b ^ c;
-        t = (e << 5) | (e >>> 27);
-        d = (t + f + d + 1859775393 + blocks[j + 1]) << 0;
-        a = (a << 30) | (a >>> 2);
-        f = e ^ a ^ b;
-        t = (d << 5) | (d >>> 27);
-        c = (t + f + c + 1859775393 + blocks[j + 2]) << 0;
-        e = (e << 30) | (e >>> 2);
-        f = d ^ e ^ a;
-        t = (c << 5) | (c >>> 27);
-        b = (t + f + b + 1859775393 + blocks[j + 3]) << 0;
-        d = (d << 30) | (d >>> 2);
-        f = c ^ d ^ e;
-        t = (b << 5) | (b >>> 27);
-        a = (t + f + a + 1859775393 + blocks[j + 4]) << 0;
-        c = (c << 30) | (c >>> 2);
-    }
-    for (; j < 60; j += 5) {
-        f = (b & c) | (b & d) | (c & d);
-        t = (a << 5) | (a >>> 27);
-        e = (t + f + e - 1894007588 + blocks[j]) << 0;
-        b = (b << 30) | (b >>> 2);
-        f = (a & b) | (a & c) | (b & c);
-        t = (e << 5) | (e >>> 27);
-        d = (t + f + d - 1894007588 + blocks[j + 1]) << 0;
-        a = (a << 30) | (a >>> 2);
-        f = (e & a) | (e & b) | (a & b);
-        t = (d << 5) | (d >>> 27);
-        c = (t + f + c - 1894007588 + blocks[j + 2]) << 0;
-        e = (e << 30) | (e >>> 2);
-        f = (d & e) | (d & a) | (e & a);
-        t = (c << 5) | (c >>> 27);
-        b = (t + f + b - 1894007588 + blocks[j + 3]) << 0;
-        d = (d << 30) | (d >>> 2);
-        f = (c & d) | (c & e) | (d & e);
-        t = (b << 5) | (b >>> 27);
-        a = (t + f + a - 1894007588 + blocks[j + 4]) << 0;
-        c = (c << 30) | (c >>> 2);
-    }
-    for (; j < 80; j += 5) {
-        f = b ^ c ^ d;
-        t = (a << 5) | (a >>> 27);
-        e = (t + f + e - 899497514 + blocks[j]) << 0;
-        b = (b << 30) | (b >>> 2);
-        f = a ^ b ^ c;
-        t = (e << 5) | (e >>> 27);
-        d = (t + f + d - 899497514 + blocks[j + 1]) << 0;
-        a = (a << 30) | (a >>> 2);
-        f = e ^ a ^ b;
-        t = (d << 5) | (d >>> 27);
-        c = (t + f + c - 899497514 + blocks[j + 2]) << 0;
-        e = (e << 30) | (e >>> 2);
-        f = d ^ e ^ a;
-        t = (c << 5) | (c >>> 27);
-        b = (t + f + b - 899497514 + blocks[j + 3]) << 0;
-        d = (d << 30) | (d >>> 2);
-        f = c ^ d ^ e;
-        t = (b << 5) | (b >>> 27);
-        a = (t + f + a - 899497514 + blocks[j + 4]) << 0;
-        c = (c << 30) | (c >>> 2);
-    }
-    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;
+Sha1.prototype.hash = function() {
+	var a = this.h0, b = this.h1, c = this.h2, d = this.h3, e = this.h4;
+	var f, j, t, blocks$1 = this.blocks;
+	for (j = 16; j < 80; ++j) {
+		t = blocks$1[j - 3] ^ blocks$1[j - 8] ^ blocks$1[j - 14] ^ blocks$1[j - 16];
+		blocks$1[j] = t << 1 | t >>> 31;
+	}
+	for (j = 0; j < 20; j += 5) {
+		f = b & c | ~b & d;
+		t = a << 5 | a >>> 27;
+		e = t + f + e + 1518500249 + blocks$1[j] << 0;
+		b = b << 30 | b >>> 2;
+		f = a & b | ~a & c;
+		t = e << 5 | e >>> 27;
+		d = t + f + d + 1518500249 + blocks$1[j + 1] << 0;
+		a = a << 30 | a >>> 2;
+		f = e & a | ~e & b;
+		t = d << 5 | d >>> 27;
+		c = t + f + c + 1518500249 + blocks$1[j + 2] << 0;
+		e = e << 30 | e >>> 2;
+		f = d & e | ~d & a;
+		t = c << 5 | c >>> 27;
+		b = t + f + b + 1518500249 + blocks$1[j + 3] << 0;
+		d = d << 30 | d >>> 2;
+		f = c & d | ~c & e;
+		t = b << 5 | b >>> 27;
+		a = t + f + a + 1518500249 + blocks$1[j + 4] << 0;
+		c = c << 30 | c >>> 2;
+	}
+	for (; j < 40; j += 5) {
+		f = b ^ c ^ d;
+		t = a << 5 | a >>> 27;
+		e = t + f + e + 1859775393 + blocks$1[j] << 0;
+		b = b << 30 | b >>> 2;
+		f = a ^ b ^ c;
+		t = e << 5 | e >>> 27;
+		d = t + f + d + 1859775393 + blocks$1[j + 1] << 0;
+		a = a << 30 | a >>> 2;
+		f = e ^ a ^ b;
+		t = d << 5 | d >>> 27;
+		c = t + f + c + 1859775393 + blocks$1[j + 2] << 0;
+		e = e << 30 | e >>> 2;
+		f = d ^ e ^ a;
+		t = c << 5 | c >>> 27;
+		b = t + f + b + 1859775393 + blocks$1[j + 3] << 0;
+		d = d << 30 | d >>> 2;
+		f = c ^ d ^ e;
+		t = b << 5 | b >>> 27;
+		a = t + f + a + 1859775393 + blocks$1[j + 4] << 0;
+		c = c << 30 | c >>> 2;
+	}
+	for (; j < 60; j += 5) {
+		f = b & c | b & d | c & d;
+		t = a << 5 | a >>> 27;
+		e = t + f + e - 1894007588 + blocks$1[j] << 0;
+		b = b << 30 | b >>> 2;
+		f = a & b | a & c | b & c;
+		t = e << 5 | e >>> 27;
+		d = t + f + d - 1894007588 + blocks$1[j + 1] << 0;
+		a = a << 30 | a >>> 2;
+		f = e & a | e & b | a & b;
+		t = d << 5 | d >>> 27;
+		c = t + f + c - 1894007588 + blocks$1[j + 2] << 0;
+		e = e << 30 | e >>> 2;
+		f = d & e | d & a | e & a;
+		t = c << 5 | c >>> 27;
+		b = t + f + b - 1894007588 + blocks$1[j + 3] << 0;
+		d = d << 30 | d >>> 2;
+		f = c & d | c & e | d & e;
+		t = b << 5 | b >>> 27;
+		a = t + f + a - 1894007588 + blocks$1[j + 4] << 0;
+		c = c << 30 | c >>> 2;
+	}
+	for (; j < 80; j += 5) {
+		f = b ^ c ^ d;
+		t = a << 5 | a >>> 27;
+		e = t + f + e - 899497514 + blocks$1[j] << 0;
+		b = b << 30 | b >>> 2;
+		f = a ^ b ^ c;
+		t = e << 5 | e >>> 27;
+		d = t + f + d - 899497514 + blocks$1[j + 1] << 0;
+		a = a << 30 | a >>> 2;
+		f = e ^ a ^ b;
+		t = d << 5 | d >>> 27;
+		c = t + f + c - 899497514 + blocks$1[j + 2] << 0;
+		e = e << 30 | e >>> 2;
+		f = d ^ e ^ a;
+		t = c << 5 | c >>> 27;
+		b = t + f + b - 899497514 + blocks$1[j + 3] << 0;
+		d = d << 30 | d >>> 2;
+		f = c ^ d ^ e;
+		t = b << 5 | b >>> 27;
+		a = t + f + a - 899497514 + blocks$1[j + 4] << 0;
+		c = c << 30 | c >>> 2;
+	}
+	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;
 };
-Sha1.prototype.hex = function () {
-    this.finalize();
-    var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4;
-    return (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]);
+Sha1.prototype.hex = function() {
+	this.finalize();
+	var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4;
+	return HEX_CHARS[h0 >> 28 & 15] + HEX_CHARS[h0 >> 24 & 15] + HEX_CHARS[h0 >> 20 & 15] + HEX_CHARS[h0 >> 16 & 15] + HEX_CHARS[h0 >> 12 & 15] + HEX_CHARS[h0 >> 8 & 15] + HEX_CHARS[h0 >> 4 & 15] + HEX_CHARS[h0 & 15] + HEX_CHARS[h1 >> 28 & 15] + HEX_CHARS[h1 >> 24 & 15] + HEX_CHARS[h1 >> 20 & 15] + HEX_CHARS[h1 >> 16 & 15] + HEX_CHARS[h1 >> 12 & 15] + HEX_CHARS[h1 >> 8 & 15] + HEX_CHARS[h1 >> 4 & 15] + HEX_CHARS[h1 & 15] + HEX_CHARS[h2 >> 28 & 15] + HEX_CHARS[h2 >> 24 & 15] + HEX_CHARS[h2 >> 20 & 15] + HEX_CHARS[h2 >> 16 & 15] + HEX_CHARS[h2 >> 12 & 15] + HEX_CHARS[h2 >> 8 & 15] + HEX_CHARS[h2 >> 4 & 15] + HEX_CHARS[h2 & 15] + HEX_CHARS[h3 >> 28 & 15] + HEX_CHARS[h3 >> 24 & 15] + HEX_CHARS[h3 >> 20 & 15] + HEX_CHARS[h3 >> 16 & 15] + HEX_CHARS[h3 >> 12 & 15] + HEX_CHARS[h3 >> 8 & 15] + HEX_CHARS[h3 >> 4 & 15] + HEX_CHARS[h3 & 15] + HEX_CHARS[h4 >> 28 & 15] + HEX_CHARS[h4 >> 24 & 15] + HEX_CHARS[h4 >> 20 & 15] + HEX_CHARS[h4 >> 16 & 15] + HEX_CHARS[h4 >> 12 & 15] + HEX_CHARS[h4 >> 8 & 15] + HEX_CHARS[h4 >> 4 & 15] + HEX_CHARS[h4 & 15];
 };
 Sha1.prototype.toString = Sha1.prototype.hex;
-Sha1.prototype.digest = function () {
-    this.finalize();
-    var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4;
-    return [
-        (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,
-    ];
+Sha1.prototype.digest = function() {
+	this.finalize();
+	var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4;
+	return [
+		h0 >> 24 & 255,
+		h0 >> 16 & 255,
+		h0 >> 8 & 255,
+		h0 & 255,
+		h1 >> 24 & 255,
+		h1 >> 16 & 255,
+		h1 >> 8 & 255,
+		h1 & 255,
+		h2 >> 24 & 255,
+		h2 >> 16 & 255,
+		h2 >> 8 & 255,
+		h2 & 255,
+		h3 >> 24 & 255,
+		h3 >> 16 & 255,
+		h3 >> 8 & 255,
+		h3 & 255,
+		h4 >> 24 & 255,
+		h4 >> 16 & 255,
+		h4 >> 8 & 255,
+		h4 & 255
+	];
 };
 Sha1.prototype.array = Sha1.prototype.digest;
-Sha1.prototype.arrayBuffer = function () {
-    this.finalize();
-    var buffer = new ArrayBuffer(20);
-    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);
-    return buffer;
+Sha1.prototype.arrayBuffer = function() {
+	this.finalize();
+	var buffer = /* @__PURE__ */ new ArrayBuffer(20);
+	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);
+	return buffer;
 };
 let hasLoggedWarning = false;
 /**
- * @deprecated Use `makeDefaultKeyEncoder()` to create a custom key encoder.
- * This function will be removed in a future version.
- */
-export const insecureHash = (message) => {
-    if (!hasLoggedWarning) {
-        console.warn([
-            `The default method for hashing keys is insecure and will be replaced in a future version,`,
-            `but hasn't been replaced yet as to not break existing caches. It's recommended that you use`,
-            `a more secure hashing algorithm to avoid cache poisoning.`,
-            ``,
-            `See this page for more information:`,
-            `|`,
-            `└> https://js.langchain.com/docs/troubleshooting/warnings/insecure-cache-algorithm`,
-        ].join("\n"));
-        hasLoggedWarning = true;
-    }
-    return new Sha1(true).update(message)["hex"]();
+* @deprecated Use `makeDefaultKeyEncoder()` to create a custom key encoder.
+* This function will be removed in a future version.
+*/
+const insecureHash = (message) => {
+	if (!hasLoggedWarning) {
+		console.warn([
+			`The default method for hashing keys is insecure and will be replaced in a future version,`,
+			`but hasn't been replaced yet as to not break existing caches. It's recommended that you use`,
+			`a more secure hashing algorithm to avoid cache poisoning.`,
+			``,
+			`See this page for more information:`,
+			`|`,
+			`└> https://js.langchain.com/docs/troubleshooting/warnings/insecure-cache-algorithm`
+		].join("\n"));
+		hasLoggedWarning = true;
+	}
+	return new Sha1(true).update(message)["hex"]();
 };
+
+//#endregion
+export { hash_exports, insecureHash };
+//# sourceMappingURL=hash.js.map