@langchain/core 1.0.0-alpha.3 → 1.0.0-alpha.4

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

@@ -1,284 +0,0 @@
-
-
-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 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 = 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$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$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$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 & 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 & 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 = /* @__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.
-*/
-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

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

@@ -1 +0,0 @@
-{"version":3,"file":"hash.js","names":["blocks"],"sources":["../../../src/utils/js-sha1/hash.ts"],"sourcesContent":["// @ts-nocheck\n\n// Inlined to deal with portability issues with importing crypto module\n\n/*\n * [js-sha1]{@link https://github.com/emn178/js-sha1}\n *\n * @version 0.6.0\n * @author Chen, Yi-Cyuan [emn178@gmail.com]\n * @copyright Chen, Yi-Cyuan 2014-2017\n * @license MIT\n */\n/*jslint bitwise: true */\n\"use strict\";\n\nvar root = typeof window === \"object\" ? window : {};\nvar HEX_CHARS = \"0123456789abcdef\".split(\"\");\nvar EXTRA = [-2147483648, 8388608, 32768, 128];\nvar SHIFT = [24, 16, 8, 0];\nvar OUTPUT_TYPES = [\"hex\", \"array\", \"digest\", \"arrayBuffer\"];\n\nvar blocks = [];\n\nfunction Sha1(sharedMemory) {\n  if (sharedMemory) {\n    blocks[0] =\n      blocks[16] =\n      blocks[1] =\n      blocks[2] =\n      blocks[3] =\n      blocks[4] =\n      blocks[5] =\n      blocks[6] =\n      blocks[7] =\n      blocks[8] =\n      blocks[9] =\n      blocks[10] =\n      blocks[11] =\n      blocks[12] =\n      blocks[13] =\n      blocks[14] =\n      blocks[15] =\n        0;\n    this.blocks = blocks;\n  } else {\n    this.blocks = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];\n  }\n\n  this.h0 = 0x67452301;\n  this.h1 = 0xefcdab89;\n  this.h2 = 0x98badcfe;\n  this.h3 = 0x10325476;\n  this.h4 = 0xc3d2e1f0;\n\n  this.block = this.start = this.bytes = this.hBytes = 0;\n  this.finalized = this.hashed = false;\n  this.first = true;\n}\n\nSha1.prototype.update = function (message) {\n  if (this.finalized) {\n    return;\n  }\n  var notString = typeof message !== \"string\";\n  if (notString && message.constructor === root.ArrayBuffer) {\n    message = new Uint8Array(message);\n  }\n  var code,\n    index = 0,\n    i,\n    length = message.length || 0,\n    blocks = this.blocks;\n\n  while (index < length) {\n    if (this.hashed) {\n      this.hashed = false;\n      blocks[0] = this.block;\n      blocks[16] =\n        blocks[1] =\n        blocks[2] =\n        blocks[3] =\n        blocks[4] =\n        blocks[5] =\n        blocks[6] =\n        blocks[7] =\n        blocks[8] =\n        blocks[9] =\n        blocks[10] =\n        blocks[11] =\n        blocks[12] =\n        blocks[13] =\n        blocks[14] =\n        blocks[15] =\n          0;\n    }\n\n    if (notString) {\n      for (i = this.start; index < length && i < 64; ++index) {\n        blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];\n      }\n    } else {\n      for (i = this.start; index < length && i < 64; ++index) {\n        code = message.charCodeAt(index);\n        if (code < 0x80) {\n          blocks[i >> 2] |= code << SHIFT[i++ & 3];\n        } else if (code < 0x800) {\n          blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];\n          blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n        } else if (code < 0xd800 || code >= 0xe000) {\n          blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];\n          blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n          blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n        } else {\n          code =\n            0x10000 +\n            (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));\n          blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];\n          blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];\n          blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n          blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n        }\n      }\n    }\n\n    this.lastByteIndex = i;\n    this.bytes += i - this.start;\n    if (i >= 64) {\n      this.block = blocks[16];\n      this.start = i - 64;\n      this.hash();\n      this.hashed = true;\n    } else {\n      this.start = i;\n    }\n  }\n  if (this.bytes > 4294967295) {\n    this.hBytes += (this.bytes / 4294967296) << 0;\n    this.bytes = this.bytes % 4294967296;\n  }\n  return this;\n};\n\nSha1.prototype.finalize = function () {\n  if (this.finalized) {\n    return;\n  }\n  this.finalized = true;\n  var blocks = this.blocks,\n    i = this.lastByteIndex;\n  blocks[16] = this.block;\n  blocks[i >> 2] |= EXTRA[i & 3];\n  this.block = blocks[16];\n  if (i >= 56) {\n    if (!this.hashed) {\n      this.hash();\n    }\n    blocks[0] = this.block;\n    blocks[16] =\n      blocks[1] =\n      blocks[2] =\n      blocks[3] =\n      blocks[4] =\n      blocks[5] =\n      blocks[6] =\n      blocks[7] =\n      blocks[8] =\n      blocks[9] =\n      blocks[10] =\n      blocks[11] =\n      blocks[12] =\n      blocks[13] =\n      blocks[14] =\n      blocks[15] =\n        0;\n  }\n  blocks[14] = (this.hBytes << 3) | (this.bytes >>> 29);\n  blocks[15] = this.bytes << 3;\n  this.hash();\n};\n\nSha1.prototype.hash = function () {\n  var a = this.h0,\n    b = this.h1,\n    c = this.h2,\n    d = this.h3,\n    e = this.h4;\n  var f,\n    j,\n    t,\n    blocks = this.blocks;\n\n  for (j = 16; j < 80; ++j) {\n    t = blocks[j - 3] ^ blocks[j - 8] ^ blocks[j - 14] ^ blocks[j - 16];\n    blocks[j] = (t << 1) | (t >>> 31);\n  }\n\n  for (j = 0; j < 20; j += 5) {\n    f = (b & c) | (~b & d);\n    t = (a << 5) | (a >>> 27);\n    e = (t + f + e + 1518500249 + blocks[j]) << 0;\n    b = (b << 30) | (b >>> 2);\n\n    f = (a & b) | (~a & c);\n    t = (e << 5) | (e >>> 27);\n    d = (t + f + d + 1518500249 + blocks[j + 1]) << 0;\n    a = (a << 30) | (a >>> 2);\n\n    f = (e & a) | (~e & b);\n    t = (d << 5) | (d >>> 27);\n    c = (t + f + c + 1518500249 + blocks[j + 2]) << 0;\n    e = (e << 30) | (e >>> 2);\n\n    f = (d & e) | (~d & a);\n    t = (c << 5) | (c >>> 27);\n    b = (t + f + b + 1518500249 + blocks[j + 3]) << 0;\n    d = (d << 30) | (d >>> 2);\n\n    f = (c & d) | (~c & e);\n    t = (b << 5) | (b >>> 27);\n    a = (t + f + a + 1518500249 + blocks[j + 4]) << 0;\n    c = (c << 30) | (c >>> 2);\n  }\n\n  for (; j < 40; j += 5) {\n    f = b ^ c ^ d;\n    t = (a << 5) | (a >>> 27);\n    e = (t + f + e + 1859775393 + blocks[j]) << 0;\n    b = (b << 30) | (b >>> 2);\n\n    f = a ^ b ^ c;\n    t = (e << 5) | (e >>> 27);\n    d = (t + f + d + 1859775393 + blocks[j + 1]) << 0;\n    a = (a << 30) | (a >>> 2);\n\n    f = e ^ a ^ b;\n    t = (d << 5) | (d >>> 27);\n    c = (t + f + c + 1859775393 + blocks[j + 2]) << 0;\n    e = (e << 30) | (e >>> 2);\n\n    f = d ^ e ^ a;\n    t = (c << 5) | (c >>> 27);\n    b = (t + f + b + 1859775393 + blocks[j + 3]) << 0;\n    d = (d << 30) | (d >>> 2);\n\n    f = c ^ d ^ e;\n    t = (b << 5) | (b >>> 27);\n    a = (t + f + a + 1859775393 + blocks[j + 4]) << 0;\n    c = (c << 30) | (c >>> 2);\n  }\n\n  for (; j < 60; j += 5) {\n    f = (b & c) | (b & d) | (c & d);\n    t = (a << 5) | (a >>> 27);\n    e = (t + f + e - 1894007588 + blocks[j]) << 0;\n    b = (b << 30) | (b >>> 2);\n\n    f = (a & b) | (a & c) | (b & c);\n    t = (e << 5) | (e >>> 27);\n    d = (t + f + d - 1894007588 + blocks[j + 1]) << 0;\n    a = (a << 30) | (a >>> 2);\n\n    f = (e & a) | (e & b) | (a & b);\n    t = (d << 5) | (d >>> 27);\n    c = (t + f + c - 1894007588 + blocks[j + 2]) << 0;\n    e = (e << 30) | (e >>> 2);\n\n    f = (d & e) | (d & a) | (e & a);\n    t = (c << 5) | (c >>> 27);\n    b = (t + f + b - 1894007588 + blocks[j + 3]) << 0;\n    d = (d << 30) | (d >>> 2);\n\n    f = (c & d) | (c & e) | (d & e);\n    t = (b << 5) | (b >>> 27);\n    a = (t + f + a - 1894007588 + blocks[j + 4]) << 0;\n    c = (c << 30) | (c >>> 2);\n  }\n\n  for (; j < 80; j += 5) {\n    f = b ^ c ^ d;\n    t = (a << 5) | (a >>> 27);\n    e = (t + f + e - 899497514 + blocks[j]) << 0;\n    b = (b << 30) | (b >>> 2);\n\n    f = a ^ b ^ c;\n    t = (e << 5) | (e >>> 27);\n    d = (t + f + d - 899497514 + blocks[j + 1]) << 0;\n    a = (a << 30) | (a >>> 2);\n\n    f = e ^ a ^ b;\n    t = (d << 5) | (d >>> 27);\n    c = (t + f + c - 899497514 + blocks[j + 2]) << 0;\n    e = (e << 30) | (e >>> 2);\n\n    f = d ^ e ^ a;\n    t = (c << 5) | (c >>> 27);\n    b = (t + f + b - 899497514 + blocks[j + 3]) << 0;\n    d = (d << 30) | (d >>> 2);\n\n    f = c ^ d ^ e;\n    t = (b << 5) | (b >>> 27);\n    a = (t + f + a - 899497514 + blocks[j + 4]) << 0;\n    c = (c << 30) | (c >>> 2);\n  }\n\n  this.h0 = (this.h0 + a) << 0;\n  this.h1 = (this.h1 + b) << 0;\n  this.h2 = (this.h2 + c) << 0;\n  this.h3 = (this.h3 + d) << 0;\n  this.h4 = (this.h4 + e) << 0;\n};\n\nSha1.prototype.hex = function () {\n  this.finalize();\n\n  var h0 = this.h0,\n    h1 = this.h1,\n    h2 = this.h2,\n    h3 = this.h3,\n    h4 = this.h4;\n\n  return (\n    HEX_CHARS[(h0 >> 28) & 0x0f] +\n    HEX_CHARS[(h0 >> 24) & 0x0f] +\n    HEX_CHARS[(h0 >> 20) & 0x0f] +\n    HEX_CHARS[(h0 >> 16) & 0x0f] +\n    HEX_CHARS[(h0 >> 12) & 0x0f] +\n    HEX_CHARS[(h0 >> 8) & 0x0f] +\n    HEX_CHARS[(h0 >> 4) & 0x0f] +\n    HEX_CHARS[h0 & 0x0f] +\n    HEX_CHARS[(h1 >> 28) & 0x0f] +\n    HEX_CHARS[(h1 >> 24) & 0x0f] +\n    HEX_CHARS[(h1 >> 20) & 0x0f] +\n    HEX_CHARS[(h1 >> 16) & 0x0f] +\n    HEX_CHARS[(h1 >> 12) & 0x0f] +\n    HEX_CHARS[(h1 >> 8) & 0x0f] +\n    HEX_CHARS[(h1 >> 4) & 0x0f] +\n    HEX_CHARS[h1 & 0x0f] +\n    HEX_CHARS[(h2 >> 28) & 0x0f] +\n    HEX_CHARS[(h2 >> 24) & 0x0f] +\n    HEX_CHARS[(h2 >> 20) & 0x0f] +\n    HEX_CHARS[(h2 >> 16) & 0x0f] +\n    HEX_CHARS[(h2 >> 12) & 0x0f] +\n    HEX_CHARS[(h2 >> 8) & 0x0f] +\n    HEX_CHARS[(h2 >> 4) & 0x0f] +\n    HEX_CHARS[h2 & 0x0f] +\n    HEX_CHARS[(h3 >> 28) & 0x0f] +\n    HEX_CHARS[(h3 >> 24) & 0x0f] +\n    HEX_CHARS[(h3 >> 20) & 0x0f] +\n    HEX_CHARS[(h3 >> 16) & 0x0f] +\n    HEX_CHARS[(h3 >> 12) & 0x0f] +\n    HEX_CHARS[(h3 >> 8) & 0x0f] +\n    HEX_CHARS[(h3 >> 4) & 0x0f] +\n    HEX_CHARS[h3 & 0x0f] +\n    HEX_CHARS[(h4 >> 28) & 0x0f] +\n    HEX_CHARS[(h4 >> 24) & 0x0f] +\n    HEX_CHARS[(h4 >> 20) & 0x0f] +\n    HEX_CHARS[(h4 >> 16) & 0x0f] +\n    HEX_CHARS[(h4 >> 12) & 0x0f] +\n    HEX_CHARS[(h4 >> 8) & 0x0f] +\n    HEX_CHARS[(h4 >> 4) & 0x0f] +\n    HEX_CHARS[h4 & 0x0f]\n  );\n};\n\nSha1.prototype.toString = Sha1.prototype.hex;\n\nSha1.prototype.digest = function () {\n  this.finalize();\n\n  var h0 = this.h0,\n    h1 = this.h1,\n    h2 = this.h2,\n    h3 = this.h3,\n    h4 = this.h4;\n\n  return [\n    (h0 >> 24) & 0xff,\n    (h0 >> 16) & 0xff,\n    (h0 >> 8) & 0xff,\n    h0 & 0xff,\n    (h1 >> 24) & 0xff,\n    (h1 >> 16) & 0xff,\n    (h1 >> 8) & 0xff,\n    h1 & 0xff,\n    (h2 >> 24) & 0xff,\n    (h2 >> 16) & 0xff,\n    (h2 >> 8) & 0xff,\n    h2 & 0xff,\n    (h3 >> 24) & 0xff,\n    (h3 >> 16) & 0xff,\n    (h3 >> 8) & 0xff,\n    h3 & 0xff,\n    (h4 >> 24) & 0xff,\n    (h4 >> 16) & 0xff,\n    (h4 >> 8) & 0xff,\n    h4 & 0xff,\n  ];\n};\n\nSha1.prototype.array = Sha1.prototype.digest;\n\nSha1.prototype.arrayBuffer = function () {\n  this.finalize();\n\n  var buffer = new ArrayBuffer(20);\n  var dataView = new DataView(buffer);\n  dataView.setUint32(0, this.h0);\n  dataView.setUint32(4, this.h1);\n  dataView.setUint32(8, this.h2);\n  dataView.setUint32(12, this.h3);\n  dataView.setUint32(16, this.h4);\n  return buffer;\n};\n\nlet hasLoggedWarning = false;\n\n/**\n * @deprecated Use `makeDefaultKeyEncoder()` to create a custom key encoder.\n * This function will be removed in a future version.\n */\nexport const insecureHash = (message) => {\n  if (!hasLoggedWarning) {\n    console.warn(\n      [\n        `The default method for hashing keys is insecure and will be replaced in a future version,`,\n        `but hasn't been replaced yet as to not break existing caches. It's recommended that you use`,\n        `a more secure hashing algorithm to avoid cache poisoning.`,\n        ``,\n        `See this page for more information:`,\n        `|`,\n        `└> https://js.langchain.com/docs/troubleshooting/warnings/insecure-cache-algorithm`,\n      ].join(\"\\n\")\n    );\n    hasLoggedWarning = true;\n  }\n  return new Sha1(true).update(message)[\"hex\"]();\n};\n"],"mappings":";;;;;;;AAeA,IAAI,OAAO,OAAO,WAAW,WAAW,SAAS,CAAE;AACnD,IAAI,YAAY,mBAAmB,MAAM,GAAG;AAC5C,IAAI,QAAQ;CAAC;CAAa;CAAS;CAAO;AAAI;AAC9C,IAAI,QAAQ;CAAC;CAAI;CAAI;CAAG;AAAE;AAG1B,IAAI,SAAS,CAAE;AAEf,SAAS,KAAK,cAAc;AAC1B,KAAI,cAAc;EAChB,OAAO,KACL,OAAO,MACP,OAAO,KACP,OAAO,KACP,OAAO,KACP,OAAO,KACP,OAAO,KACP,OAAO,KACP,OAAO,KACP,OAAO,KACP,OAAO,KACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACL;EACJ,KAAK,SAAS;CACf,OACC,KAAK,SAAS;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAE;CAGnE,KAAK,KAAK;CACV,KAAK,KAAK;CACV,KAAK,KAAK;CACV,KAAK,KAAK;CACV,KAAK,KAAK;CAEV,KAAK,QAAQ,KAAK,QAAQ,KAAK,QAAQ,KAAK,SAAS;CACrD,KAAK,YAAY,KAAK,SAAS;CAC/B,KAAK,QAAQ;AACd;AAED,KAAK,UAAU,SAAS,SAAU,SAAS;AACzC,KAAI,KAAK,UACP;CAEF,IAAI,YAAY,OAAO,YAAY;AACnC,KAAI,aAAa,QAAQ,gBAAgB,KAAK,aAC5C,UAAU,IAAI,WAAW;CAE3B,IAAI,MACF,QAAQ,GACR,GACA,SAAS,QAAQ,UAAU,GAC3BA,WAAS,KAAK;AAEhB,QAAO,QAAQ,QAAQ;AACrB,MAAI,KAAK,QAAQ;GACf,KAAK,SAAS;GACdA,SAAO,KAAK,KAAK;GACjBA,SAAO,MACLA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,MACPA,SAAO,MACPA,SAAO,MACPA,SAAO,MACPA,SAAO,MACPA,SAAO,MACL;EACL;AAED,MAAI,UACF,MAAK,IAAI,KAAK,OAAO,QAAQ,UAAU,IAAI,IAAI,EAAE,OAC/CA,SAAO,KAAK,MAAM,QAAQ,UAAU,MAAM,MAAM;MAGlD,MAAK,IAAI,KAAK,OAAO,QAAQ,UAAU,IAAI,IAAI,EAAE,OAAO;GACtD,OAAO,QAAQ,WAAW,MAAM;AAChC,OAAI,OAAO,KACTA,SAAO,KAAK,MAAM,QAAQ,MAAM,MAAM;YAC7B,OAAO,MAAO;IACvBA,SAAO,KAAK,OAAO,MAAQ,QAAQ,MAAO,MAAM,MAAM;IACtDA,SAAO,KAAK,OAAO,MAAQ,OAAO,OAAU,MAAM,MAAM;GACzD,WAAU,OAAO,SAAU,QAAQ,OAAQ;IAC1CA,SAAO,KAAK,OAAO,MAAQ,QAAQ,OAAQ,MAAM,MAAM;IACvDA,SAAO,KAAK,OAAO,MAAS,QAAQ,IAAK,OAAU,MAAM,MAAM;IAC/DA,SAAO,KAAK,OAAO,MAAQ,OAAO,OAAU,MAAM,MAAM;GACzD,OAAM;IACL,OACE,UACG,OAAO,SAAU,KAAO,QAAQ,WAAW,EAAE,MAAM,GAAG;IAC3DA,SAAO,KAAK,OAAO,MAAQ,QAAQ,OAAQ,MAAM,MAAM;IACvDA,SAAO,KAAK,OAAO,MAAS,QAAQ,KAAM,OAAU,MAAM,MAAM;IAChEA,SAAO,KAAK,OAAO,MAAS,QAAQ,IAAK,OAAU,MAAM,MAAM;IAC/DA,SAAO,KAAK,OAAO,MAAQ,OAAO,OAAU,MAAM,MAAM;GACzD;EACF;EAGH,KAAK,gBAAgB;EACrB,KAAK,SAAS,IAAI,KAAK;AACvB,MAAI,KAAK,IAAI;GACX,KAAK,QAAQA,SAAO;GACpB,KAAK,QAAQ,IAAI;GACjB,KAAK,MAAM;GACX,KAAK,SAAS;EACf,OACC,KAAK,QAAQ;CAEhB;AACD,KAAI,KAAK,QAAQ,YAAY;EAC3B,KAAK,UAAW,KAAK,QAAQ,cAAe;EAC5C,KAAK,QAAQ,KAAK,QAAQ;CAC3B;AACD,QAAO;AACR;AAED,KAAK,UAAU,WAAW,WAAY;AACpC,KAAI,KAAK,UACP;CAEF,KAAK,YAAY;CACjB,IAAIA,WAAS,KAAK,QAChB,IAAI,KAAK;CACXA,SAAO,MAAM,KAAK;CAClBA,SAAO,KAAK,MAAM,MAAM,IAAI;CAC5B,KAAK,QAAQA,SAAO;AACpB,KAAI,KAAK,IAAI;AACX,MAAI,CAAC,KAAK,QACR,KAAK,MAAM;EAEbA,SAAO,KAAK,KAAK;EACjBA,SAAO,MACLA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,KACPA,SAAO,MACPA,SAAO,MACPA,SAAO,MACPA,SAAO,MACPA,SAAO,MACPA,SAAO,MACL;CACL;CACDA,SAAO,MAAO,KAAK,UAAU,IAAM,KAAK,UAAU;CAClDA,SAAO,MAAM,KAAK,SAAS;CAC3B,KAAK,MAAM;AACZ;AAED,KAAK,UAAU,OAAO,WAAY;CAChC,IAAI,IAAI,KAAK,IACX,IAAI,KAAK,IACT,IAAI,KAAK,IACT,IAAI,KAAK,IACT,IAAI,KAAK;CACX,IAAI,GACF,GACA,GACAA,WAAS,KAAK;AAEhB,MAAK,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG;EACxB,IAAIA,SAAO,IAAI,KAAKA,SAAO,IAAI,KAAKA,SAAO,IAAI,MAAMA,SAAO,IAAI;EAChEA,SAAO,KAAM,KAAK,IAAM,MAAM;CAC/B;AAED,MAAK,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;EAC1B,IAAK,IAAI,IAAM,CAAC,IAAI;EACpB,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,MAAO;EAC5C,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAK,IAAI,IAAM,CAAC,IAAI;EACpB,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAK,IAAI,IAAM,CAAC,IAAI;EACpB,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAK,IAAI,IAAM,CAAC,IAAI;EACpB,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAK,IAAI,IAAM,CAAC,IAAI;EACpB,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;CACxB;AAED,QAAO,IAAI,IAAI,KAAK,GAAG;EACrB,IAAI,IAAI,IAAI;EACZ,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,MAAO;EAC5C,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAI,IAAI,IAAI;EACZ,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAI,IAAI,IAAI;EACZ,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAI,IAAI,IAAI;EACZ,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAI,IAAI,IAAI;EACZ,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;CACxB;AAED,QAAO,IAAI,IAAI,KAAK,GAAG;EACrB,IAAK,IAAI,IAAM,IAAI,IAAM,IAAI;EAC7B,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,MAAO;EAC5C,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAK,IAAI,IAAM,IAAI,IAAM,IAAI;EAC7B,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAK,IAAI,IAAM,IAAI,IAAM,IAAI;EAC7B,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAK,IAAI,IAAM,IAAI,IAAM,IAAI;EAC7B,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAK,IAAI,IAAM,IAAI,IAAM,IAAI;EAC7B,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,aAAaA,SAAO,IAAI,MAAO;EAChD,IAAK,KAAK,KAAO,MAAM;CACxB;AAED,QAAO,IAAI,IAAI,KAAK,GAAG;EACrB,IAAI,IAAI,IAAI;EACZ,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,YAAYA,SAAO,MAAO;EAC3C,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAI,IAAI,IAAI;EACZ,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,YAAYA,SAAO,IAAI,MAAO;EAC/C,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAI,IAAI,IAAI;EACZ,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,YAAYA,SAAO,IAAI,MAAO;EAC/C,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAI,IAAI,IAAI;EACZ,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,YAAYA,SAAO,IAAI,MAAO;EAC/C,IAAK,KAAK,KAAO,MAAM;EAEvB,IAAI,IAAI,IAAI;EACZ,IAAK,KAAK,IAAM,MAAM;EACtB,IAAK,IAAI,IAAI,IAAI,YAAYA,SAAO,IAAI,MAAO;EAC/C,IAAK,KAAK,KAAO,MAAM;CACxB;CAED,KAAK,KAAM,KAAK,KAAK,KAAM;CAC3B,KAAK,KAAM,KAAK,KAAK,KAAM;CAC3B,KAAK,KAAM,KAAK,KAAK,KAAM;CAC3B,KAAK,KAAM,KAAK,KAAK,KAAM;CAC3B,KAAK,KAAM,KAAK,KAAK,KAAM;AAC5B;AAED,KAAK,UAAU,MAAM,WAAY;CAC/B,KAAK,UAAU;CAEf,IAAI,KAAK,KAAK,IACZ,KAAK,KAAK,IACV,KAAK,KAAK,IACV,KAAK,KAAK,IACV,KAAK,KAAK;AAEZ,QACE,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,IAAK,MACtB,UAAW,MAAM,IAAK,MACtB,UAAU,KAAK,MACf,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,IAAK,MACtB,UAAW,MAAM,IAAK,MACtB,UAAU,KAAK,MACf,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,IAAK,MACtB,UAAW,MAAM,IAAK,MACtB,UAAU,KAAK,MACf,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,IAAK,MACtB,UAAW,MAAM,IAAK,MACtB,UAAU,KAAK,MACf,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,KAAM,MACvB,UAAW,MAAM,IAAK,MACtB,UAAW,MAAM,IAAK,MACtB,UAAU,KAAK;AAElB;AAED,KAAK,UAAU,WAAW,KAAK,UAAU;AAEzC,KAAK,UAAU,SAAS,WAAY;CAClC,KAAK,UAAU;CAEf,IAAI,KAAK,KAAK,IACZ,KAAK,KAAK,IACV,KAAK,KAAK,IACV,KAAK,KAAK,IACV,KAAK,KAAK;AAEZ,QAAO;EACJ,MAAM,KAAM;EACZ,MAAM,KAAM;EACZ,MAAM,IAAK;EACZ,KAAK;EACJ,MAAM,KAAM;EACZ,MAAM,KAAM;EACZ,MAAM,IAAK;EACZ,KAAK;EACJ,MAAM,KAAM;EACZ,MAAM,KAAM;EACZ,MAAM,IAAK;EACZ,KAAK;EACJ,MAAM,KAAM;EACZ,MAAM,KAAM;EACZ,MAAM,IAAK;EACZ,KAAK;EACJ,MAAM,KAAM;EACZ,MAAM,KAAM;EACZ,MAAM,IAAK;EACZ,KAAK;CACN;AACF;AAED,KAAK,UAAU,QAAQ,KAAK,UAAU;AAEtC,KAAK,UAAU,cAAc,WAAY;CACvC,KAAK,UAAU;CAEf,IAAI,yBAAS,IAAI,YAAY;CAC7B,IAAI,WAAW,IAAI,SAAS;CAC5B,SAAS,UAAU,GAAG,KAAK,GAAG;CAC9B,SAAS,UAAU,GAAG,KAAK,GAAG;CAC9B,SAAS,UAAU,GAAG,KAAK,GAAG;CAC9B,SAAS,UAAU,IAAI,KAAK,GAAG;CAC/B,SAAS,UAAU,IAAI,KAAK,GAAG;AAC/B,QAAO;AACR;AAED,IAAI,mBAAmB;;;;;AAMvB,MAAa,eAAe,CAAC,YAAY;AACvC,KAAI,CAAC,kBAAkB;EACrB,QAAQ,KACN;GACE,CAAC,yFAAyF,CAAC;GAC3F,CAAC,2FAA2F,CAAC;GAC7F,CAAC,yDAAyD,CAAC;GAC3D,EAAE;GACF,CAAC,mCAAmC,CAAC;GACrC,CAAC,CAAC,CAAC;GACH,CAAC,kFAAkF,CAAC;EACrF,EAAC,KAAK,KAAK,CACb;EACD,mBAAmB;CACpB;AACD,QAAO,IAAI,KAAK,MAAM,OAAO,QAAQ,CAAC,QAAQ;AAC/C"}