@intlayer/backend 7.0.8 → 7.0.9-canary.2

package/dist/cjs/node_modules/node-forge/lib/sha256.cjs

@@ -0,0 +1,274 @@
+const require_rolldown_runtime = require('../../../_virtual/rolldown_runtime.cjs');
+const require_forge$1 = require('./forge.cjs');
+const require_util$1 = require('./util.cjs');
+const require_md$1 = require('./md.cjs');
+
+//#region ../../node_modules/node-forge/lib/sha256.js
+var require_sha256 = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/node-forge/lib/sha256.js": ((exports, module) => {
+	/**
+	* Secure Hash Algorithm with 256-bit digest (SHA-256) implementation.
+	*
+	* See FIPS 180-2 for details.
+	*
+	* @author Dave Longley
+	*
+	* Copyright (c) 2010-2015 Digital Bazaar, Inc.
+	*/
+	var forge = require_forge$1.default;
+	require_md$1.default;
+	require_util$1.default;
+	var sha256 = module.exports = forge.sha256 = forge.sha256 || {};
+	forge.md.sha256 = forge.md.algorithms.sha256 = sha256;
+	/**
+	* Creates a SHA-256 message digest object.
+	*
+	* @return a message digest object.
+	*/
+	sha256.create = function() {
+		if (!_initialized) _init();
+		var _state = null;
+		var _input = forge.util.createBuffer();
+		var _w = new Array(64);
+		var md = {
+			algorithm: "sha256",
+			blockLength: 64,
+			digestLength: 32,
+			messageLength: 0,
+			fullMessageLength: null,
+			messageLengthSize: 8
+		};
+		/**
+		* Starts the digest.
+		*
+		* @return this digest object.
+		*/
+		md.start = function() {
+			md.messageLength = 0;
+			md.fullMessageLength = md.messageLength64 = [];
+			var int32s = md.messageLengthSize / 4;
+			for (var i = 0; i < int32s; ++i) md.fullMessageLength.push(0);
+			_input = forge.util.createBuffer();
+			_state = {
+				h0: 1779033703,
+				h1: 3144134277,
+				h2: 1013904242,
+				h3: 2773480762,
+				h4: 1359893119,
+				h5: 2600822924,
+				h6: 528734635,
+				h7: 1541459225
+			};
+			return md;
+		};
+		md.start();
+		/**
+		* Updates the digest with the given message input. The given input can
+		* treated as raw input (no encoding will be applied) or an encoding of
+		* 'utf8' maybe given to encode the input using UTF-8.
+		*
+		* @param msg the message input to update with.
+		* @param encoding the encoding to use (default: 'raw', other: 'utf8').
+		*
+		* @return this digest object.
+		*/
+		md.update = function(msg, encoding) {
+			if (encoding === "utf8") msg = forge.util.encodeUtf8(msg);
+			var len = msg.length;
+			md.messageLength += len;
+			len = [len / 4294967296 >>> 0, len >>> 0];
+			for (var i = md.fullMessageLength.length - 1; i >= 0; --i) {
+				md.fullMessageLength[i] += len[1];
+				len[1] = len[0] + (md.fullMessageLength[i] / 4294967296 >>> 0);
+				md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;
+				len[0] = len[1] / 4294967296 >>> 0;
+			}
+			_input.putBytes(msg);
+			_update(_state, _w, _input);
+			if (_input.read > 2048 || _input.length() === 0) _input.compact();
+			return md;
+		};
+		/**
+		* Produces the digest.
+		*
+		* @return a byte buffer containing the digest value.
+		*/
+		md.digest = function() {
+			var finalBlock = forge.util.createBuffer();
+			finalBlock.putBytes(_input.bytes());
+			var overflow = md.fullMessageLength[md.fullMessageLength.length - 1] + md.messageLengthSize & md.blockLength - 1;
+			finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));
+			var next, carry;
+			var bits = md.fullMessageLength[0] * 8;
+			for (var i = 0; i < md.fullMessageLength.length - 1; ++i) {
+				next = md.fullMessageLength[i + 1] * 8;
+				carry = next / 4294967296 >>> 0;
+				bits += carry;
+				finalBlock.putInt32(bits >>> 0);
+				bits = next >>> 0;
+			}
+			finalBlock.putInt32(bits);
+			var s2 = {
+				h0: _state.h0,
+				h1: _state.h1,
+				h2: _state.h2,
+				h3: _state.h3,
+				h4: _state.h4,
+				h5: _state.h5,
+				h6: _state.h6,
+				h7: _state.h7
+			};
+			_update(s2, _w, finalBlock);
+			var rval = forge.util.createBuffer();
+			rval.putInt32(s2.h0);
+			rval.putInt32(s2.h1);
+			rval.putInt32(s2.h2);
+			rval.putInt32(s2.h3);
+			rval.putInt32(s2.h4);
+			rval.putInt32(s2.h5);
+			rval.putInt32(s2.h6);
+			rval.putInt32(s2.h7);
+			return rval;
+		};
+		return md;
+	};
+	var _padding = null;
+	var _initialized = false;
+	var _k = null;
+	/**
+	* Initializes the constant tables.
+	*/
+	function _init() {
+		_padding = String.fromCharCode(128);
+		_padding += forge.util.fillString(String.fromCharCode(0), 64);
+		_k = [
+			1116352408,
+			1899447441,
+			3049323471,
+			3921009573,
+			961987163,
+			1508970993,
+			2453635748,
+			2870763221,
+			3624381080,
+			310598401,
+			607225278,
+			1426881987,
+			1925078388,
+			2162078206,
+			2614888103,
+			3248222580,
+			3835390401,
+			4022224774,
+			264347078,
+			604807628,
+			770255983,
+			1249150122,
+			1555081692,
+			1996064986,
+			2554220882,
+			2821834349,
+			2952996808,
+			3210313671,
+			3336571891,
+			3584528711,
+			113926993,
+			338241895,
+			666307205,
+			773529912,
+			1294757372,
+			1396182291,
+			1695183700,
+			1986661051,
+			2177026350,
+			2456956037,
+			2730485921,
+			2820302411,
+			3259730800,
+			3345764771,
+			3516065817,
+			3600352804,
+			4094571909,
+			275423344,
+			430227734,
+			506948616,
+			659060556,
+			883997877,
+			958139571,
+			1322822218,
+			1537002063,
+			1747873779,
+			1955562222,
+			2024104815,
+			2227730452,
+			2361852424,
+			2428436474,
+			2756734187,
+			3204031479,
+			3329325298
+		];
+		_initialized = true;
+	}
+	/**
+	* Updates a SHA-256 state with the given byte buffer.
+	*
+	* @param s the SHA-256 state to update.
+	* @param w the array to use to store words.
+	* @param bytes the byte buffer to update with.
+	*/
+	function _update(s, w, bytes) {
+		var t1, t2, s0, s1, ch, maj, i, a, b, c, d, e, f, g, h;
+		var len = bytes.length();
+		while (len >= 64) {
+			for (i = 0; i < 16; ++i) w[i] = bytes.getInt32();
+			for (; i < 64; ++i) {
+				t1 = w[i - 2];
+				t1 = (t1 >>> 17 | t1 << 15) ^ (t1 >>> 19 | t1 << 13) ^ t1 >>> 10;
+				t2 = w[i - 15];
+				t2 = (t2 >>> 7 | t2 << 25) ^ (t2 >>> 18 | t2 << 14) ^ t2 >>> 3;
+				w[i] = t1 + w[i - 7] + t2 + w[i - 16] | 0;
+			}
+			a = s.h0;
+			b = s.h1;
+			c = s.h2;
+			d = s.h3;
+			e = s.h4;
+			f = s.h5;
+			g = s.h6;
+			h = s.h7;
+			for (i = 0; i < 64; ++i) {
+				s1 = (e >>> 6 | e << 26) ^ (e >>> 11 | e << 21) ^ (e >>> 25 | e << 7);
+				ch = g ^ e & (f ^ g);
+				s0 = (a >>> 2 | a << 30) ^ (a >>> 13 | a << 19) ^ (a >>> 22 | a << 10);
+				maj = a & b | c & (a ^ b);
+				t1 = h + s1 + ch + _k[i] + w[i];
+				t2 = s0 + maj;
+				h = g;
+				g = f;
+				f = e;
+				e = d + t1 >>> 0;
+				d = c;
+				c = b;
+				b = a;
+				a = t1 + t2 >>> 0;
+			}
+			s.h0 = s.h0 + a | 0;
+			s.h1 = s.h1 + b | 0;
+			s.h2 = s.h2 + c | 0;
+			s.h3 = s.h3 + d | 0;
+			s.h4 = s.h4 + e | 0;
+			s.h5 = s.h5 + f | 0;
+			s.h6 = s.h6 + g | 0;
+			s.h7 = s.h7 + h | 0;
+			len -= 64;
+		}
+	}
+}) });
+
+//#endregion
+Object.defineProperty(exports, 'default', {
+  enumerable: true,
+  get: function () {
+    return require_sha256();
+  }
+});
+//# sourceMappingURL=sha256.cjs.map

package/dist/cjs/node_modules/node-forge/lib/sha256.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sha256.cjs","names":[],"sources":["../../../../../../../node_modules/node-forge/lib/sha256.js"],"sourcesContent":["/**\n * Secure Hash Algorithm with 256-bit digest (SHA-256) implementation.\n *\n * See FIPS 180-2 for details.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2015 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./md');\nrequire('./util');\n\nvar sha256 = module.exports = forge.sha256 = forge.sha256 || {};\nforge.md.sha256 = forge.md.algorithms.sha256 = sha256;\n\n/**\n * Creates a SHA-256 message digest object.\n *\n * @return a message digest object.\n */\nsha256.create = function() {\n  // do initialization as necessary\n  if(!_initialized) {\n    _init();\n  }\n\n  // SHA-256 state contains eight 32-bit integers\n  var _state = null;\n\n  // input buffer\n  var _input = forge.util.createBuffer();\n\n  // used for word storage\n  var _w = new Array(64);\n\n  // message digest object\n  var md = {\n    algorithm: 'sha256',\n    blockLength: 64,\n    digestLength: 32,\n    // 56-bit length of message so far (does not including padding)\n    messageLength: 0,\n    // true message length\n    fullMessageLength: null,\n    // size of message length in bytes\n    messageLengthSize: 8\n  };\n\n  /**\n   * Starts the digest.\n   *\n   * @return this digest object.\n   */\n  md.start = function() {\n    // up to 56-bit message length for convenience\n    md.messageLength = 0;\n\n    // full message length (set md.messageLength64 for backwards-compatibility)\n    md.fullMessageLength = md.messageLength64 = [];\n    var int32s = md.messageLengthSize / 4;\n    for(var i = 0; i < int32s; ++i) {\n      md.fullMessageLength.push(0);\n    }\n    _input = forge.util.createBuffer();\n    _state = {\n      h0: 0x6A09E667,\n      h1: 0xBB67AE85,\n      h2: 0x3C6EF372,\n      h3: 0xA54FF53A,\n      h4: 0x510E527F,\n      h5: 0x9B05688C,\n      h6: 0x1F83D9AB,\n      h7: 0x5BE0CD19\n    };\n    return md;\n  };\n  // start digest automatically for first time\n  md.start();\n\n  /**\n   * Updates the digest with the given message input. The given input can\n   * treated as raw input (no encoding will be applied) or an encoding of\n   * 'utf8' maybe given to encode the input using UTF-8.\n   *\n   * @param msg the message input to update with.\n   * @param encoding the encoding to use (default: 'raw', other: 'utf8').\n   *\n   * @return this digest object.\n   */\n  md.update = function(msg, encoding) {\n    if(encoding === 'utf8') {\n      msg = forge.util.encodeUtf8(msg);\n    }\n\n    // update message length\n    var len = msg.length;\n    md.messageLength += len;\n    len = [(len / 0x100000000) >>> 0, len >>> 0];\n    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {\n      md.fullMessageLength[i] += len[1];\n      len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);\n      md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;\n      len[0] = ((len[1] / 0x100000000) >>> 0);\n    }\n\n    // add bytes to input buffer\n    _input.putBytes(msg);\n\n    // process bytes\n    _update(_state, _w, _input);\n\n    // compact input buffer every 2K or if empty\n    if(_input.read > 2048 || _input.length() === 0) {\n      _input.compact();\n    }\n\n    return md;\n  };\n\n  /**\n   * Produces the digest.\n   *\n   * @return a byte buffer containing the digest value.\n   */\n  md.digest = function() {\n    /* Note: Here we copy the remaining bytes in the input buffer and\n    add the appropriate SHA-256 padding. Then we do the final update\n    on a copy of the state so that if the user wants to get\n    intermediate digests they can do so. */\n\n    /* Determine the number of bytes that must be added to the message\n    to ensure its length is congruent to 448 mod 512. In other words,\n    the data to be digested must be a multiple of 512 bits (or 128 bytes).\n    This data includes the message, some padding, and the length of the\n    message. Since the length of the message will be encoded as 8 bytes (64\n    bits), that means that the last segment of the data must have 56 bytes\n    (448 bits) of message and padding. Therefore, the length of the message\n    plus the padding must be congruent to 448 mod 512 because\n    512 - 128 = 448.\n\n    In order to fill up the message length it must be filled with\n    padding that begins with 1 bit followed by all 0 bits. Padding\n    must *always* be present, so if the message length is already\n    congruent to 448 mod 512, then 512 padding bits must be added. */\n\n    var finalBlock = forge.util.createBuffer();\n    finalBlock.putBytes(_input.bytes());\n\n    // compute remaining size to be digested (include message length size)\n    var remaining = (\n      md.fullMessageLength[md.fullMessageLength.length - 1] +\n      md.messageLengthSize);\n\n    // add padding for overflow blockSize - overflow\n    // _padding starts with 1 byte with first bit is set (byte value 128), then\n    // there may be up to (blockSize - 1) other pad bytes\n    var overflow = remaining & (md.blockLength - 1);\n    finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));\n\n    // serialize message length in bits in big-endian order; since length\n    // is stored in bytes we multiply by 8 and add carry from next int\n    var next, carry;\n    var bits = md.fullMessageLength[0] * 8;\n    for(var i = 0; i < md.fullMessageLength.length - 1; ++i) {\n      next = md.fullMessageLength[i + 1] * 8;\n      carry = (next / 0x100000000) >>> 0;\n      bits += carry;\n      finalBlock.putInt32(bits >>> 0);\n      bits = next >>> 0;\n    }\n    finalBlock.putInt32(bits);\n\n    var s2 = {\n      h0: _state.h0,\n      h1: _state.h1,\n      h2: _state.h2,\n      h3: _state.h3,\n      h4: _state.h4,\n      h5: _state.h5,\n      h6: _state.h6,\n      h7: _state.h7\n    };\n    _update(s2, _w, finalBlock);\n    var rval = forge.util.createBuffer();\n    rval.putInt32(s2.h0);\n    rval.putInt32(s2.h1);\n    rval.putInt32(s2.h2);\n    rval.putInt32(s2.h3);\n    rval.putInt32(s2.h4);\n    rval.putInt32(s2.h5);\n    rval.putInt32(s2.h6);\n    rval.putInt32(s2.h7);\n    return rval;\n  };\n\n  return md;\n};\n\n// sha-256 padding bytes not initialized yet\nvar _padding = null;\nvar _initialized = false;\n\n// table of constants\nvar _k = null;\n\n/**\n * Initializes the constant tables.\n */\nfunction _init() {\n  // create padding\n  _padding = String.fromCharCode(128);\n  _padding += forge.util.fillString(String.fromCharCode(0x00), 64);\n\n  // create K table for SHA-256\n  _k = [\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,\n    0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n    0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,\n    0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,\n    0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n    0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,\n    0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,\n    0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n    0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2];\n\n  // now initialized\n  _initialized = true;\n}\n\n/**\n * Updates a SHA-256 state with the given byte buffer.\n *\n * @param s the SHA-256 state to update.\n * @param w the array to use to store words.\n * @param bytes the byte buffer to update with.\n */\nfunction _update(s, w, bytes) {\n  // consume 512 bit (64 byte) chunks\n  var t1, t2, s0, s1, ch, maj, i, a, b, c, d, e, f, g, h;\n  var len = bytes.length();\n  while(len >= 64) {\n    // the w array will be populated with sixteen 32-bit big-endian words\n    // and then extended into 64 32-bit words according to SHA-256\n    for(i = 0; i < 16; ++i) {\n      w[i] = bytes.getInt32();\n    }\n    for(; i < 64; ++i) {\n      // XOR word 2 words ago rot right 17, rot right 19, shft right 10\n      t1 = w[i - 2];\n      t1 =\n        ((t1 >>> 17) | (t1 << 15)) ^\n        ((t1 >>> 19) | (t1 << 13)) ^\n        (t1 >>> 10);\n      // XOR word 15 words ago rot right 7, rot right 18, shft right 3\n      t2 = w[i - 15];\n      t2 =\n        ((t2 >>> 7) | (t2 << 25)) ^\n        ((t2 >>> 18) | (t2 << 14)) ^\n        (t2 >>> 3);\n      // sum(t1, word 7 ago, t2, word 16 ago) modulo 2^32\n      w[i] = (t1 + w[i - 7] + t2 + w[i - 16]) | 0;\n    }\n\n    // initialize hash value for this chunk\n    a = s.h0;\n    b = s.h1;\n    c = s.h2;\n    d = s.h3;\n    e = s.h4;\n    f = s.h5;\n    g = s.h6;\n    h = s.h7;\n\n    // round function\n    for(i = 0; i < 64; ++i) {\n      // Sum1(e)\n      s1 =\n        ((e >>> 6) | (e << 26)) ^\n        ((e >>> 11) | (e << 21)) ^\n        ((e >>> 25) | (e << 7));\n      // Ch(e, f, g) (optimized the same way as SHA-1)\n      ch = g ^ (e & (f ^ g));\n      // Sum0(a)\n      s0 =\n        ((a >>> 2) | (a << 30)) ^\n        ((a >>> 13) | (a << 19)) ^\n        ((a >>> 22) | (a << 10));\n      // Maj(a, b, c) (optimized the same way as SHA-1)\n      maj = (a & b) | (c & (a ^ b));\n\n      // main algorithm\n      t1 = h + s1 + ch + _k[i] + w[i];\n      t2 = s0 + maj;\n      h = g;\n      g = f;\n      f = e;\n      // `>>> 0` necessary to avoid iOS/Safari 10 optimization bug\n      // can't truncate with `| 0`\n      e = (d + t1) >>> 0;\n      d = c;\n      c = b;\n      b = a;\n      // `>>> 0` necessary to avoid iOS/Safari 10 optimization bug\n      // can't truncate with `| 0`\n      a = (t1 + t2) >>> 0;\n    }\n\n    // update hash state\n    s.h0 = (s.h0 + a) | 0;\n    s.h1 = (s.h1 + b) | 0;\n    s.h2 = (s.h2 + c) | 0;\n    s.h3 = (s.h3 + d) | 0;\n    s.h4 = (s.h4 + e) | 0;\n    s.h5 = (s.h5 + f) | 0;\n    s.h6 = (s.h6 + g) | 0;\n    s.h7 = (s.h7 + h) | 0;\n    len -= 64;\n  }\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;CASA,IAAI;AACJ;AACA;CAEA,IAAI,SAAS,OAAO,UAAU,MAAM,SAAS,MAAM,UAAU,EAAE;AAC/D,OAAM,GAAG,SAAS,MAAM,GAAG,WAAW,SAAS;;;;;;AAO/C,QAAO,SAAS,WAAW;AAEzB,MAAG,CAAC,aACF,QAAO;EAIT,IAAI,SAAS;EAGb,IAAI,SAAS,MAAM,KAAK,cAAc;EAGtC,IAAI,KAAK,IAAI,MAAM,GAAG;EAGtB,IAAI,KAAK;GACP,WAAW;GACX,aAAa;GACb,cAAc;GAEd,eAAe;GAEf,mBAAmB;GAEnB,mBAAmB;GACpB;;;;;;AAOD,KAAG,QAAQ,WAAW;AAEpB,MAAG,gBAAgB;AAGnB,MAAG,oBAAoB,GAAG,kBAAkB,EAAE;GAC9C,IAAI,SAAS,GAAG,oBAAoB;AACpC,QAAI,IAAI,IAAI,GAAG,IAAI,QAAQ,EAAE,EAC3B,IAAG,kBAAkB,KAAK,EAAE;AAE9B,YAAS,MAAM,KAAK,cAAc;AAClC,YAAS;IACP,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACL;AACD,UAAO;;AAGT,KAAG,OAAO;;;;;;;;;;;AAYV,KAAG,SAAS,SAAS,KAAK,UAAU;AAClC,OAAG,aAAa,OACd,OAAM,MAAM,KAAK,WAAW,IAAI;GAIlC,IAAI,MAAM,IAAI;AACd,MAAG,iBAAiB;AACpB,SAAM,CAAE,MAAM,eAAiB,GAAG,QAAQ,EAAE;AAC5C,QAAI,IAAI,IAAI,GAAG,kBAAkB,SAAS,GAAG,KAAK,GAAG,EAAE,GAAG;AACxD,OAAG,kBAAkB,MAAM,IAAI;AAC/B,QAAI,KAAK,IAAI,MAAO,GAAG,kBAAkB,KAAK,eAAiB;AAC/D,OAAG,kBAAkB,KAAK,GAAG,kBAAkB,OAAO;AACtD,QAAI,KAAO,IAAI,KAAK,eAAiB;;AAIvC,UAAO,SAAS,IAAI;AAGpB,WAAQ,QAAQ,IAAI,OAAO;AAG3B,OAAG,OAAO,OAAO,QAAQ,OAAO,QAAQ,KAAK,EAC3C,QAAO,SAAS;AAGlB,UAAO;;;;;;;AAQT,KAAG,SAAS,WAAW;GAqBrB,IAAI,aAAa,MAAM,KAAK,cAAc;AAC1C,cAAW,SAAS,OAAO,OAAO,CAAC;GAUnC,IAAI,WANF,GAAG,kBAAkB,GAAG,kBAAkB,SAAS,KACnD,GAAG,oBAKuB,GAAG,cAAc;AAC7C,cAAW,SAAS,SAAS,OAAO,GAAG,GAAG,cAAc,SAAS,CAAC;GAIlE,IAAI,MAAM;GACV,IAAI,OAAO,GAAG,kBAAkB,KAAK;AACrC,QAAI,IAAI,IAAI,GAAG,IAAI,GAAG,kBAAkB,SAAS,GAAG,EAAE,GAAG;AACvD,WAAO,GAAG,kBAAkB,IAAI,KAAK;AACrC,YAAS,OAAO,eAAiB;AACjC,YAAQ;AACR,eAAW,SAAS,SAAS,EAAE;AAC/B,WAAO,SAAS;;AAElB,cAAW,SAAS,KAAK;GAEzB,IAAI,KAAK;IACP,IAAI,OAAO;IACX,IAAI,OAAO;IACX,IAAI,OAAO;IACX,IAAI,OAAO;IACX,IAAI,OAAO;IACX,IAAI,OAAO;IACX,IAAI,OAAO;IACX,IAAI,OAAO;IACZ;AACD,WAAQ,IAAI,IAAI,WAAW;GAC3B,IAAI,OAAO,MAAM,KAAK,cAAc;AACpC,QAAK,SAAS,GAAG,GAAG;AACpB,QAAK,SAAS,GAAG,GAAG;AACpB,QAAK,SAAS,GAAG,GAAG;AACpB,QAAK,SAAS,GAAG,GAAG;AACpB,QAAK,SAAS,GAAG,GAAG;AACpB,QAAK,SAAS,GAAG,GAAG;AACpB,QAAK,SAAS,GAAG,GAAG;AACpB,QAAK,SAAS,GAAG,GAAG;AACpB,UAAO;;AAGT,SAAO;;CAIT,IAAI,WAAW;CACf,IAAI,eAAe;CAGnB,IAAI,KAAK;;;;CAKT,SAAS,QAAQ;AAEf,aAAW,OAAO,aAAa,IAAI;AACnC,cAAY,MAAM,KAAK,WAAW,OAAO,aAAa,EAAK,EAAE,GAAG;AAGhE,OAAK;GACH;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GACpC;GAAY;GAAY;GAAY;GAAW;AAGjD,iBAAe;;;;;;;;;CAUjB,SAAS,QAAQ,GAAG,GAAG,OAAO;EAE5B,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;EACrD,IAAI,MAAM,MAAM,QAAQ;AACxB,SAAM,OAAO,IAAI;AAGf,QAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EACnB,GAAE,KAAK,MAAM,UAAU;AAEzB,UAAM,IAAI,IAAI,EAAE,GAAG;AAEjB,SAAK,EAAE,IAAI;AACX,UACI,OAAO,KAAO,MAAM,OACpB,OAAO,KAAO,MAAM,MACrB,OAAO;AAEV,SAAK,EAAE,IAAI;AACX,UACI,OAAO,IAAM,MAAM,OACnB,OAAO,KAAO,MAAM,MACrB,OAAO;AAEV,MAAE,KAAM,KAAK,EAAE,IAAI,KAAK,KAAK,EAAE,IAAI,MAAO;;AAI5C,OAAI,EAAE;AACN,OAAI,EAAE;AACN,OAAI,EAAE;AACN,OAAI,EAAE;AACN,OAAI,EAAE;AACN,OAAI,EAAE;AACN,OAAI,EAAE;AACN,OAAI,EAAE;AAGN,QAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAEtB,UACI,MAAM,IAAM,KAAK,OACjB,MAAM,KAAO,KAAK,OAClB,MAAM,KAAO,KAAK;AAEtB,SAAK,IAAK,KAAK,IAAI;AAEnB,UACI,MAAM,IAAM,KAAK,OACjB,MAAM,KAAO,KAAK,OAClB,MAAM,KAAO,KAAK;AAEtB,UAAO,IAAI,IAAM,KAAK,IAAI;AAG1B,SAAK,IAAI,KAAK,KAAK,GAAG,KAAK,EAAE;AAC7B,SAAK,KAAK;AACV,QAAI;AACJ,QAAI;AACJ,QAAI;AAGJ,QAAK,IAAI,OAAQ;AACjB,QAAI;AACJ,QAAI;AACJ,QAAI;AAGJ,QAAK,KAAK,OAAQ;;AAIpB,KAAE,KAAM,EAAE,KAAK,IAAK;AACpB,KAAE,KAAM,EAAE,KAAK,IAAK;AACpB,KAAE,KAAM,EAAE,KAAK,IAAK;AACpB,KAAE,KAAM,EAAE,KAAK,IAAK;AACpB,KAAE,KAAM,EAAE,KAAK,IAAK;AACpB,KAAE,KAAM,EAAE,KAAK,IAAK;AACpB,KAAE,KAAM,EAAE,KAAK,IAAK;AACpB,KAAE,KAAM,EAAE,KAAK,IAAK;AACpB,UAAO"}